2014 IEEE 13th International Symposium on Network Computing and Applications最新文献_第3页

Congestion-Aware Adaptive Routing in 2D-Mesh Multicores 二维网格多核中的拥塞感知自适应路由

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.13

D. Avresky, Fabien Chaix, M. Nicolaidis

引用次数: 1

Self-Control Cloud Services 自控云服务

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.48

T. Aubonnet, N. Simoni

引用次数: 13

VANets: An Exploratory Evaluation in Vehicular Ad Hoc Network for Urban Environment 城市环境中车载自组织网络的探索性评价

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.12

Claudio Correa, J. Ueyama, R. Meneguette, L. Villas

引用次数: 17

Resource Management in Cloud Federation Using XMPP 使用XMPP的云联盟资源管理

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.15

M. Fazio, A. Celesti, M. Villari, A. Puliafito

引用次数: 1

Green Proxy-Based Approaches for BitTorrent 基于绿色代理的BitTorrent方法

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.29

Sena Cebeci, Öznur Özkasap, G. Anastasi

引用次数: 0

An Evolutionary Game Theoretic Approach for Configuring Cloud-Integrated Body Sensor Networks 一种配置云集成身体传感器网络的进化博弈论方法

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.47

Y. Ren, J. Suzuki, Dung H. Phan, Shingo Omura, Ryuichi Hosoya

引用次数: 4

Based-Agent Distributed Architecture to Manage the Dynamic Multi-hop Ridesharing System 基于agent的分布式体系结构管理动态多跳拼车系统

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.22

S. B. Cheikh, S. Hammadi, C. Tahon

{"title":"Based-Agent Distributed Architecture to Manage the Dynamic Multi-hop Ridesharing System","authors":"S. B. Cheikh, S. Hammadi, C. Tahon","doi":"10.1109/NCA.2014.22","DOIUrl":"https://doi.org/10.1109/NCA.2014.22","url":null,"abstract":"A diverse range of architectures and concepts has been suggested by academic researchers within the theme of ridesharing. Most of these studies have tried to join together two main elements: the need for mobility and the resources used to achieve this action. Based on empty seats in the private cars, rideshare systems allow a substantial number of people to share car rides. If a request can be matched with only one offer, then the problem is called single hop ride matching. It is called multihop ride matching, if a request can be matched with several offers at different times. In this paper, we focus on the Multi-Hop Ride matching Problem (MHRP) which offers more flexible than other forms of ridesharing and proposes more choices for the rider. As a transportation service, the MHRP is generally geographically distributed in dynamic changing environments. With this in mind, and aiming at setting up a distributed architecture through which an optimizing decentralized process should be performed, we propose a distributed software architecture based on communicating agents with different behaviors. The reason for the growing success of agents behaviors technology especially in performing complex tasks and operating with each other to achieve a desired global goal.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123708104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Does Mobility Matter? An Evaluation Methodology for Opportunistic Apps 流动性重要吗?机会主义应用的评估方法

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.8

Jesus Friginal, M. Killijian, R. Pasqua, Matthieu Roy, Gilles Trédan

引用次数: 1

A Probabilistic Greedy Algorithm with Forced Assignment and Compression for Fast Frequency Assignment in Cellular Network 基于强制分配和压缩的概率贪婪算法在蜂窝网络中的快速频率分配

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.36

Subhankar Ghosal, Sasthi C. Ghosh

{"title":"A Probabilistic Greedy Algorithm with Forced Assignment and Compression for Fast Frequency Assignment in Cellular Network","authors":"Subhankar Ghosal, Sasthi C. Ghosh","doi":"10.1109/NCA.2014.36","DOIUrl":"https://doi.org/10.1109/NCA.2014.36","url":null,"abstract":"This paper presents a probabilistic greedy algorithm for solving the channel assignment problem (CAP) in cellular networks. We took each call as a vertex of a complete edge weighed graph, termed as CAP graph, where an edge weight represents the minimum frequency separation needed between the calls represented by the terminal vertices of that edge. Our objective is to assign non-negative integers representing colors or frequencies to the vertices of the CAP graph such that the required span (maximum frequency - minimum frequency) is minimized while satisfying the frequency separation constraints represented by the edge weights. We begin with a probabilistic ordering of the vertices and apply frequency exhaustive strategy to color them. During the coloring, when color of a vertex exceeds the maximum color of previously allocated vertices, we apply a forced assignment phase to reduce the so far obtained span. Finally we propose an iterative compression phase to further reduce the span obtained from applying the frequency exhaustive strategy with forced assignment phase. The proposed polynomial time algorithm is then applied over the well-known benchmark instances and the obtained spans are measured. The obtained results show that the proposed algorithm performs better that the existing assignment strategies with respect to deviation from optimality and computation time. The time taken by our algorithm is less than 1.77 seconds (HP Z400 Workstation) even for the most difficult benchmark instances and thus is very much suitable where fast channel assignment is of primary importance while a marginal deviation from optimality may be tolerated.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126782440","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

A Deadline Aware DTN Approach Based on Epidemic Routing 基于流行病路由的限期感知DTN方法

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.11

Chung-Jae Lee, Ki-Il Kim

引用次数: 9