IEEE INFOCOM 2008 - The 27th Conference on Computer Communications最新文献_第10页

Optimal Peer-to-Peer Technique for Massive Content Distribution 海量内容分发的最佳点对点技术

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.39

Xiaoying Zheng, Chunglae Cho, Ye Xia

{"title":"Optimal Peer-to-Peer Technique for Massive Content Distribution","authors":"Xiaoying Zheng, Chunglae Cho, Ye Xia","doi":"10.1109/INFOCOM.2008.39","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.39","url":null,"abstract":"A distinct trend has emerged that the Internet is used to transport data on a more and more massive scale. Capacity shortage in the backbone networks has become a genuine possibility, which will be more serious with fiber-based access. The problem addressed in this paper is how to conduct massive content distribution efficiently in the future network environment where the capacity limitation can equally be at the core or the edge. We propose a novel peer-to-peer technique as a main content transport mechanism to achieve efficient network resource utilization. The technique uses multiple trees for distributing different file pieces, which at the heart is a version of swarming. In this paper, we formulate an optimization problem for determining an optimal set of distribution trees as well as the rate of distribution on each tree under bandwidth limitation at arbitrary places in the network. The optimal solution can be found by a distributed algorithm. The results of the paper not only provide stand-alone solutions to the massive content distribution problem, but should also help the understanding of existing distribution techniques such as BitTorrent or FastReplica.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126675546","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}

引用次数: 28

Modeling Secure Connectivity of Self-Organized Wireless Ad Hoc Networks 自组织无线自组织网络安全连接建模

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.59

Chi Zhang, Yang Song, Yuguang Fang

引用次数: 22

Sensor-Aided Overlay Deployment and Relocation for Vast-Scale Sensor Networks 大规模传感器网络的传感器辅助覆盖部署和重新定位

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.289

Guanqun Yang, Bin Tong, D. Qiao, Wensheng Zhang

{"title":"Sensor-Aided Overlay Deployment and Relocation for Vast-Scale Sensor Networks","authors":"Guanqun Yang, Bin Tong, D. Qiao, Wensheng Zhang","doi":"10.1109/INFOCOM.2008.289","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.289","url":null,"abstract":"The overlay-based network architecture has been recognized as an effective way to deal with the funneling effect in sensor networks, where sensors closer to the sink are usually responsible for relaying more network traffic. Such funneling effect is particularly harmful when the number of sensors in the network is vast. In an overlay-based sensor network, a special type of resource-rich multi-radio mobile wireless devices (we call them syphons) are deployed along with sensors. Syphons form an overlay network and help nearby sensors relay their data to the sink via the overlay network, thus mitigating the funneling effect. In this paper, we study one of the fundamental challenges in overlay-based sensor networks: syphon deployment problem, i.e., how to deploy a limited number of syphons to cover a vast sensing field while maintaining the connectivity and balanced loads among them. We propose a novel sensor-aided overlay deployment and relocation (SODaR) protocolas a possible solution. The key idea is to take advantage of sensors' assistance and to relocate syphons by circling them around the sink in an orderly manner until all syphons are connected. Simulation results show that, with SODaR, syphons are able to self-form and self-maintain a connected tree structure which provides excellent load balancing among syphons with modest message and movement overhead.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125113116","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}

引用次数: 15

A Game-Theoretic Analysis of QoS in Wireless MAC 无线MAC中QoS的博弈论分析

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.254

P. Nuggehalli, M. Sarkar, K. Kulkarni, R. Rao

{"title":"A Game-Theoretic Analysis of QoS in Wireless MAC","authors":"P. Nuggehalli, M. Sarkar, K. Kulkarni, R. Rao","doi":"10.1109/INFOCOM.2008.254","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.254","url":null,"abstract":"Many wireless network standards include quality-of-service (QoS) features at the MAC layer. These features provide nodes transmitting high priority delay sensitive traffic such as voice and video preferential access to the channel over nodes carrying low priority delay tolerant traffic such as file transfer and email. However, such schemes are unfair to low priority users, depriving them of equitable transmission opportunities, and causing throughput starvation for their applications. Such unfairness can provoke rational nodes carrying low priority traffic to falsely declare their traffic as high priority in order to maximize their throughput, thereby defeating the very purpose of QoS differentiation. In this paper, we provide game-theoretic analysis of a slotted Aloha like MAC that resembles the IEEE 802.11e MAC in many essential respects. Our MAC model allows traffic to be classified as either high-priority (HP) or low-priority (LP), and allows for both random access (contention) and polled (contention-free) channel access. We advocate an incentive mechanism to stimulate LP users to be truthful. This incentive mechanism makes use of the contention-free channel access feature of our MAC as an efficient and protocol-compliant mechanism to encourage low priority users to be truthful. We discuss appropriate utility functions for HP and LP traffic and use a fixed point analysis to derive the performance of the system in terms of the fraction of time the system is operated in contention-free mode. We find the condition for which our incentive mechanism results in a truthful Nash equilibrium, i.e., no user has an incentive to unilaterally lie about her traffic type. We then use the Nash bargaining solution (NBS) concept to suggest how an AP can pick an operating point using our incentive mechanism to ensure fairness and Pareto- optimality.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116489380","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}

引用次数: 31

Minimum Cost Data Aggregation with Localized Processing for Statistical Inference 基于本地化处理的最小代价数据聚合统计推断

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.129

Anima Anandkumar, L. Tong, A. Swami, A. Ephremides

引用次数: 22

Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers 异构聚合调度网络的稳定性和延迟界

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.208

G. Rizzo, J. Boudec

{"title":"Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers","authors":"G. Rizzo, J. Boudec","doi":"10.1109/INFOCOM.2008.208","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.208","url":null,"abstract":"Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees are required. For networks of FIFO aggregate schedulers, the main existing sufficient conditions for stability (the possibility to derive bounds to delay and backlog at each node) are of little practical utility, as they are either relative to specific topologies, or based on strong ATM-like assumptions on the network (the so-called \"RIN\" result), or they imply an extremely low node utilization. We use a deterministic approach to this problem. We identify a nonlinear operator on a vector space of finite (but large) dimension, and we derive a first sufficient condition for stability, based on the super-additive closure of this operator. Second, we use different upper bounds of this operator to obtain practical results. We find new sufficient conditions for stability, valid in an heterogeneous environment and without any of the restrictions of existing results. We present a polynomial time algorithm to test our sufficient conditions for stability. We show that with leaky bucket constrained flows the inner bound to the stability region derived with our algorithm is always larger than the one determined by all existing results. We prove that all the main existing results can be derived as special cases of our results. We also present a method to compute delay bounds in practical cases.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"7 4‐5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120859723","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}

引用次数: 10

Location-Dependent Network Performance and Design Strategies for Wireless Mesh Networks 无线网状网络的位置依赖网络性能和设计策略

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.292

Tehuang Liu, W. Liao

引用次数: 1

Opportunistic Waiver of Data Reception for Exploiting Multiuser Diversity in the Uplink of IEEE 802.11 WLAN 利用IEEE 802.11无线局域网上行链路中的多用户分集而放弃数据接收的机会

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.273

Seong-il Hahm, Jongwon Lee, Chong-kwon Kim

引用次数: 2

Connectivity and Latency in Large-Scale Wireless Networks with Unreliable Links 链路不可靠的大规模无线网络中的连通性和延迟

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.11

Z. Kong, E. Yeh

{"title":"Connectivity and Latency in Large-Scale Wireless Networks with Unreliable Links","authors":"Z. Kong, E. Yeh","doi":"10.1109/INFOCOM.2008.11","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.11","url":null,"abstract":"We study connectivity and transmission latency in wireless networks with unreliable links from a percolation-based perspective. We first examine static models, where each link of the network is functional (active) with some probability, independently of all other links, where the probability may depend on the distance between the two nodes. We obtain analytical upper and lower bounds on the critical density for phase transition in this model. We then examine dynamic models, where each link is active or inactive according to a Markov on- off process. We show that a phase transition also exists in such dynamic networks, and the critical density for this model is the same as the one for static networks under some mild conditions. Furthermore, due to the dynamic behavior of links, a delay is incurred for any transmission even when propagation delay is ignored. We study the behavior of this transmission delay and show that the delay scales linearly with the Euclidean distance between the sender and the receiver when the network is in the subcritical phase, and the delay scales sub-linearly with the distance if the network is in the supercritical phase.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129947499","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}

引用次数: 70

On Constructions of Optical Queues with a Limited Number of Recirculations 有限循环数光队列的构造

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.116

Jay Cheng, Cheng-Shang Chang, Tsz-Hsuan Chao, D. Lee, Ching-Ming Lien

{"title":"On Constructions of Optical Queues with a Limited Number of Recirculations","authors":"Jay Cheng, Cheng-Shang Chang, Tsz-Hsuan Chao, D. Lee, Ching-Ming Lien","doi":"10.1109/INFOCOM.2008.116","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.116","url":null,"abstract":"Recently, there has been a lot of attention on the constructions of optical queues by using optical Switches and fiber Delay Lines (SDL). In this paper, we consider the constructions of optical queues with a limited number of recirculations through the fibers in such SDL constructions. Such a limitation on the number of recirculations comes from practical feasibility considerations, such as crosstalk, power loss, amplified spontaneous emission (ASE) from the Erbium doped fiber amplifiers (EDFA), and the pattern effect of the optical switches. We first transform the design of the fiber delays in such SDL constructions to an equivalent integer representation problem. Specifically, given 1 les k les M, we seek for an M-sequence dM 1 = (d1,d2,...,dm) of positive integers to maximize the number of consecutive integers (starting from 0) that can be represented by the C-transform relative to dM 1 such that there are at most k 1-entries in their C-transforms. Then we give a class of greedy constructions so that d1, d2,..., dM are obtained recursively and the maximum number of representable consecutive integers by using d1,d2,...,di is larger than that by using d1,d2,...,di-1 for all i. Furthermore, we obtain an explicit recursive expression for d1, d2,..., dM given by a greedy construction. Finally, we show that an optimal M-sequence (in the sense of achieving the maximum number of representable consecutive integers) can be given by a greedy construction. The solution of such an integer representation problem can be applied to the construction of optical 2-to-l FIFO multiplexers with a limited number of recirculations. We show that the complexity of searching for an optimal construction under our routing policy can be greatly reduced from exponential time to polynomial time by only considering the greedy constructions instead of performing an exhaustive search. Similar results can be obtained for linear compressors and linear decompressors with a limited number of recirculations.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115099334","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}

引用次数: 18