Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications最新文献

The Index Poisoning Attack in P2P File Sharing Systems P2P文件共享系统中的索引投毒攻击

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.232

Jian Liang, Naoum Naoumov, K. Ross

引用次数: 225

Fault-Tolerant Wireless Access Network Design for Dual-Homed Users 双主用户容错无线接入网设计

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.152

Xiaodong Huang, Jianping Wang, V. Vokkarane, J. Jue

引用次数: 5

Relay Placement for Higher Order Connectivity in Wireless Sensor Networks 无线传感器网络中高阶连接的中继安置

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.273

Abhishek Kashyap, S. Khuller, M. Shayman

{"title":"Relay Placement for Higher Order Connectivity in Wireless Sensor Networks","authors":"Abhishek Kashyap, S. Khuller, M. Shayman","doi":"10.1109/INFOCOM.2006.273","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.273","url":null,"abstract":"Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g, due to failures of some sensors, or loss of battery power). In this paper we consider the problem of adding the smallest number of additional (relay) nodes so that the induced communication graph is 2-connected. The problem is NP -hard. In this paper we develop O(1)-approximation algorithms that find close to optimal solutions in time O((kn)) for achieving k-edge connectivity of n nodes. The worst case approximation guarantee is 10, but the algorithm produces solutions that are far better than this bound suggests. We also consider extensions to higher dimensions, and the scheme that we develop for points in the plane, yields a bound of 2dMST where dMST is the maximum degree of a minimum-degree Minimum Spanning Tree in d dimensions using Euclidean metrics. In addition, our methods extend with the same approximation guarantees to a generalization when the locations of relays are required to avoid certain polygonal regions (obstacles). We also prove that if the sensors are uniformly and identically distributed in a unit square, the expected number of relay nodes required goes to zero as the number of sensors goes to infinity.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132484136","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}

引用次数: 124

Efficiency Centric Communication Model for Wireless Sensor Networks 无线传感器网络的效率中心通信模型

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.193

Qing Cao, T. He, Lei Fang, T. Abdelzaher, J. Stankovic, S. Son

引用次数: 101

A Stochastic Random-Races Algorithm for Routing in MPLS Traffic Engineering MPLS流量工程中一种随机竞争路由算法

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.90

B. Oommen, S. Misra, Ole-Christoffer Granmo

引用次数: 3

RandPeer: Membership Management for QoS Sensitive Peer-to-Peer Applications RandPeer: QoS敏感点对点应用的成员管理

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.209

Jin Liang, K. Nahrstedt

{"title":"RandPeer: Membership Management for QoS Sensitive Peer-to-Peer Applications","authors":"Jin Liang, K. Nahrstedt","doi":"10.1109/INFOCOM.2006.209","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.209","url":null,"abstract":"Many Peer-to-peer (P2P) applications such as media broadcasting and content distribution require a high performance overlay structure in order to deliver satisfying quality of service (QoS). Previous approaches to building such overlays either involve non-scalable solutions such as global information and shared contact point, or rely on gossip style membership dissemination, which lacks QoS awareness. In this paper, we present a distributed membership service called RandPeer, which manages membership information on behalf of P2P applications, and allows peers to locate good neighbors based on their QoS characteristics. Using this service, P2P applications can easily construct their overlays in a scalable and QoS aware fashion. We have implemented RandPeer and experimented in both local and wide area environments. Our results show that (1) RandPeer is scalable and robust to highly dynamic P2P memberships; (2) RandPeer has good lookup performance, both in terms of response time and the randomness of peer selection. The latter improves load balancing and failure resilience of P2P applications; (3) when used to improve the performance of a mesh based P2P overlay, RandPeer achieves 10% improvement in just 2 protocol rounds, which is more than 5 times faster than pure random neighbor selections.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129714834","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}

引用次数: 59

Utility-Optimal Medium Access Control: Reverse and Forward Engineering 效用-最优介质访问控制:逆向和正向工程

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.252

Jang-Won Lee, M. Chiang, A. Calderbank

{"title":"Utility-Optimal Medium Access Control: Reverse and Forward Engineering","authors":"Jang-Won Lee, M. Chiang, A. Calderbank","doi":"10.1109/INFOCOM.2006.252","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.252","url":null,"abstract":"This paper analyzes and designs medium access control (MAC) protocols for wireless ad-hoc networks through the network utility maximization (NUM) framework. We first reverse-engineer the current exponential backoff (EB) type of MAC protocols such as the BEB (binary exponential backoff) in the IEEE 802.11 standard through a non-cooperative game- theoretic model. This MAC protocol is shown to be implicitly maximizing, using a stochastic subgradient, a selfish local utility at each link in the form of expected net reward for successful transmission. While the existence of a Nash equilibrium can be established, neither convergence nor social welfare optimality is guaranteed due to the inadequate feedback mechanism in the EB protocol. This motivates the forward-engineering part of the paper, where a network-wide utility maximization problem is for- mulated, using a collision and persistence probability model and aligning selfish utility with total social welfare. By adjusting the parameters in the utility objective functions of the NUM problem, we can also control the tradeoff between efficiency and fairness of radio resource allocation through a rigorous and systematic design. We develop two distributed algorithms to solve the MAC design NUM problem, which lead to random access protocols that have slightly more message passing overhead than the current EB protocol, but significant potential for efficiency and fairness improvement. We provide readily-verifiable sufficient conditions under which convergence of the proposed algorithms to a global optimality of network utility can be guaranteed, and through numerical examples illustrate the value of the NUM approach to the complexity-performance tradeoff in MAC design.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127143369","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}

引用次数: 43

Achieving Delay Guarantees in Ad Hoc Networks through Dynamic Contention Window Adaptation 通过动态竞争窗口自适应实现Ad Hoc网络的时延保证

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.213

Yaling Yang, R. Kravets

引用次数: 37

Stall and Path Monitoring Issues in SCTP SCTP中的失速和路径监控问题

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.289

J. Noonan, Philip Perry, S. Murphy, John Murphy

引用次数: 16

Alternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications 分布式网络效用最大化的可选分解:框架和应用

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.257

D. Palomar, M. Chiang

{"title":"Alternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications","authors":"D. Palomar, M. Chiang","doi":"10.1109/INFOCOM.2006.257","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.257","url":null,"abstract":"Network utility maximization (NUM) problems pro- vide an important approach to conduct network resource man- agement and to view layering as optimization decomposition. In the existing literature, distributed implementations are typically achieved by the means of the so-called dual decomposition technique. However, the span of decomposition possibilities includes many other elements which thus far have not been fully exploited, such as the use of the primal decomposition technique, the versatile introduction of auxiliary variables, and the potential of multilevel decompositions. This paper presents a systematic framework to exploit the potential of the alternative decomposition structures as a way to obtain different distributed algorithms, each with a different tradeoff among convergence speed, message passing amount and asymmetry, and distributed computation architecture. Many specific applications are consid- ered to illustrate the proposed framework, including resource- constrained and direct-control rate allocation, and rate allocation among QoS classes and with multipath routing. For each of these applications, the associated generalized NUM formulation is first presented, followed by the development of novel alternative decompositions and numerical experiments on the resulting new distributed algorithms.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128726830","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}

引用次数: 47