2010 Proceedings IEEE INFOCOM最新文献_第7页

Multi-Channel Assignment in Wireless Sensor Networks: A Game Theoretic Approach 无线传感器网络中的多信道分配:一种博弈论方法

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5461935

Qing Yu, Jiming Chen, Yanfei Fan, Xuemin Shen, Youxian Sun

引用次数: 117

PeopleRank: Social Opportunistic Forwarding PeopleRank:社会机会主义转发

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462261

Abderrahmen Mtibaa, M. May, C. Diot, M. Ammar

引用次数: 316

The Capacity of Heterogeneous Wireless Networks 异构无线网络的容量

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462072

Pan Li, Yuguang Fang

{"title":"The Capacity of Heterogeneous Wireless Networks","authors":"Pan Li, Yuguang Fang","doi":"10.1109/INFCOM.2010.5462072","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462072","url":null,"abstract":"Although capacity has been extensively studied in wireless networks, most of the results are for homogeneous wireless networks where all nodes are assumed identical. In this paper, we investigate the capacity of heterogeneous wireless networks with general network settings. Specifically, we consider a dense network with n normal nodes and m = n^b (0 < b < 1) more powerful helping nodes in a rectangular area with width b(n) and length 1/b(n), where b(n) = n^w and -1/2 < w ≤ 0. We assume there are n flows in the network. All the n normal nodes are sources while only randomly chosen n^d (0 < d < 1) normal nodes are destinations. We further assume the n normal nodes are uniformly and independently distributed, while the m helping nodes are either regularly placed or uniformly and independently distributed, resulting in two different kinds of networks called Regular Heterogeneous Wireless Networks and Random Heterogeneous Wireless Networks, respectively. In this paper, we attempt to find out what a heterogeneous wireless network with general network settings can do by deriving a lower bound on the capacity. We also explore the conditions under which heterogeneous wireless networks can provide throughput higher than traditional homogeneous wireless networks.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125190505","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}

引用次数: 49

Improving QoS in BitTorrent-like VoD Systems 改进类似bittorrent的VoD系统的QoS

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462029

Yan Yang, Alix L. H. Chow, L. Golubchik, Danielle Bragg

{"title":"Improving QoS in BitTorrent-like VoD Systems","authors":"Yan Yang, Alix L. H. Chow, L. Golubchik, Danielle Bragg","doi":"10.1109/INFCOM.2010.5462029","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462029","url":null,"abstract":"In recent years a number of research efforts have focused on effective use of P2P-based systems in providing large scale video streaming services. In particular, live streaming and Video-on-Demand (VoD) systems have attracted much interest. While previous efforts mainly focused on the common challenges faced by both types of applications, there are still a number of fundamental open questions in designing P2P-based VoD systems, which is the focus of our effort. Specifically, in this paper, we consider a BitTorrent-like VoD system and focus on the following questions: (1) how the lack of load balance, which typically exists in a P2P- based VoD system, affects the performance and what steps can be taken to remedy that, and (2) is a FCFS approach to serving requests at a peer sufficient or whether a Deadline-Aware Scheduling (DAS) approach can lead to performance improvements. Given the deadline considerations that exist in VoD systems, we also investigate approaches to avoiding unnecessary queueing time. For each of these questions, we first illustrate deficiencies of current approaches in adequately meeting streaming quality of service requirements. Motivated by this, we propose several practical schemes aimed at addressing these questions. To illustrate the benefits of our approach, we present an extensive simulation-based performance study.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"38 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114026710","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}

引用次数: 87

Asymmetry-Aware Real-Time Distributed Joint Resource Allocation in IEEE 802.22 WRANs IEEE 802.22 WRANs中不对称感知的实时分布式联合资源分配

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462171

Hyoil Kim, K. Shin

{"title":"Asymmetry-Aware Real-Time Distributed Joint Resource Allocation in IEEE 802.22 WRANs","authors":"Hyoil Kim, K. Shin","doi":"10.1109/INFCOM.2010.5462171","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462171","url":null,"abstract":"In IEEE 802.22 Wireless Regional Area Networks (WRANs), each Base Station (BS) solves a complex resource allocation problem of simultaneously determining the channel to reuse, power for adaptive coverage, and Consumer Premise Equipments (CPEs) to associate with, while maximizing the total downstream capacity of CPEs. Although joint power and channel allocation is a classical problem, resource allocation in WRANs faces two unique challenges that has not yet been addressed: (1) the presence of small-scale incumbents such as wireless microphones (WMs), and (2) asymmetric interference patterns between BSs using omnidirectional antennas and CPEs using directional antennas. In this paper, we capture this asymmetry in upstream/downstream communications to propose an accurate and realistic WRAN-WM coexistence model that increases spatial reuse of TV spectrum while protecting small-scale incumbents. Based on the proposed model, we formulate the resource allocation problem as a mixed-integer nonlinear programming (MINLP) which is NP-hard. To solve the problem in real-time, we propose a suboptimal algorithm based on the Genetic Algorithm (GA), and extend the basic GA algorithm to a fully-distributed GA algorithm (dGA) that distributes computational cost over the network and achieves scalability via local cooperation between neighboring BSs. Using extensive simulation, the proposed dGA is shown to perform as good as 99.4- 99.8% of the optimal solution, while reducing the computational cost significantly.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"61 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131879449","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}

引用次数: 23

Topology Discovery for Virtual Local Area Networks 虚拟局域网拓扑发现

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462267

Hassan Gobjuka

{"title":"Topology Discovery for Virtual Local Area Networks","authors":"Hassan Gobjuka","doi":"10.1109/INFCOM.2010.5462267","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462267","url":null,"abstract":"In this paper we investigate the problem of finding the physical layer topology of large, heterogeneous networks that comprises multiple VLANs and may include uncooperative network nodes. We prove that finding a layer-2 network topology for a given incomplete input is an NP-hard problem even when the network comprises only two VLANs and the network contains one loop and deciding whether a given input defines a unique VLANs topology is a co-NP-hard problem. We design several heuristic algorithms to find VLANs topology. Our first algorithm is designed for geographically wide-spread networks that may contain uncooperative devices. For such networks the algorithm discovers the topology for each VLAN then merges them to infer the network topology in O(n^3) time, where $n$ is the number of internal network nodes. Our second algorithm is designed for smaller, active networks where each device in the network provides access to their MIB and few AFT entries are missing. For such networks, the algorithm finds the unique topology of VLANs in O(n^3) time. We have implemented both the algorithms described in this paper and conducted extensive experiments on multiple networks. Our experiments demonstrate that our approach is quite practical and discovers the accurate VLANs topology of large and heterogeneous networks whose input may not necessarily be complete. To the best of our knowledge, this is the first paper investigating topology discovery for VLANs.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133078183","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}

引用次数: 8

Rate Adaptation Games in Wireless LANs: Nash Equilibrium and Price of Anarchy 无线局域网中的速率自适应博弈:纳什均衡和无政府状态的价格

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462028

B. Radunovic, P. Chaporkar, A. Proutière

{"title":"Rate Adaptation Games in Wireless LANs: Nash Equilibrium and Price of Anarchy","authors":"B. Radunovic, P. Chaporkar, A. Proutière","doi":"10.1109/INFCOM.2010.5462028","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462028","url":null,"abstract":"In Wireless LANs, users may adapt their transmission rates depending on the radio conditions of their links so as to maximize their throughput. Recently, there has been a significant research effort in developing distributed rate adaptation schemes. Unlike previous works that mainly focus on channel tracking, this paper characterizes the optimal reaction of a rate adaptation protocol to the contention information received from the MAC. We formulate this problem analytically. We study both competitive and cooperative user behaviors. In the case of competition, users selfishly adapt their rates so as to maximize their own throughput, whereas in the case of cooperation they adapt their rates so as to maximize the overall system throughput. We show that the Nash Equilibrium reached in the case of competition is inefficient (i.e. the price of anarchy goes to infinity as the number of users increases), and provide insightful properties of the socially optimal rate adaptation schemes. We find that recently proposed collision-aware rate adaptation algorithms decrease the price of anarchy. We also propose a novel collision-aware rate adaptation algorithm that further reduces the price of anarchy.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116725996","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}

引用次数: 17

Path Stitching: Internet-Wide Path and Delay Estimation from Existing Measurements 路径拼接:基于现有测量的全互联网路径和延迟估计

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462243

D. K. Lee, K. Jang, Changhyun Lee, G. Iannaccone, S. Moon

引用次数: 10

Survivable Distributed Storage with Progressive Decoding 具有渐进式解码的可生存分布式存储

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462198

Y. Han, Soji Omiwade, Rong Zheng

引用次数: 5

BGP Skeleton - An Alternative to iBGP Route Reflection BGP骨架——iBGP路由反射的替代方案

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462223

Bakr Sarakbi, S. Maag

{"title":"BGP Skeleton - An Alternative to iBGP Route Reflection","authors":"Bakr Sarakbi, S. Maag","doi":"10.1109/INFCOM.2010.5462223","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462223","url":null,"abstract":"The Internet is a composition of ASes (Autonomous Systems), BGP (Border Gateway Protocol) is the routing protocol that is responsible of exchanging routes between these ASes. It operates in two modes: External BGP (eBGP) and Internal BGP (iBGP). EBGP exchanges routing information between ASes, while iBGP propagates that information within the AS. BGP Full Mesh Solution (FMS) is based on that all the ASBRs (Autonomous System Border Routers) should be fully meshed and each internal node should have an iBGP session with all of them. This was because an iBGP node does not have the ability to reflect routes. BGP route reflection was widely employed as an alternative to full mesh to reduce the needed number of iBGP sessions and, in turn, increase the scalability inside the AS. Under particular configuration, it introduces persistent route oscillation, forwarding loops, and non-optimal egress nodes. Skeleton is an alternative to route reflection that overcomes these routing anomalies. Skeleton is a subgraph of the physical graph with the same set of nodes, its edges are the iBGP sessions between the nodes. All Skeleton nodes have the ability of reflecting routes. Skeleton eliminates the use of clusters and establishes iBGP sessions only between single hop neighbors. We prove that it holds the sufficient correctness conditions as well as its robustness against MED induced oscillations. We evaluate it on five real world topologies and find that the number of iBGP sessions has a linear relationship with the number of ASBRs, where in FMS this relationship is quadratic.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123600631","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