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

Non-Metric Coordinates for Predicting Network Proximity 预测网络接近度的非度量坐标

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

P. Key, L. Massoulié, Dan-Cristian Tomozei

{"title":"Non-Metric Coordinates for Predicting Network Proximity","authors":"P. Key, L. Massoulié, Dan-Cristian Tomozei","doi":"10.1109/INFOCOM.2008.247","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.247","url":null,"abstract":"We consider the problem of determining the \"closest\", or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metric, or more specifically Euclidean coordinates to infer network proximity. This is problematic, given that network distances such as latency are known to violate the triangle inequality. This leads us to consider non-metric coordinate systems. We perform an empirical comparison between the \"min-plus\" non-metric coordinates and two metric coordinates, namely L-infinity and Euclidean. We observe that, when sufficiently many dimensions are used, min-plus outperforms metric coordinates for predicting Internet latencies. We also consider the prediction of \"widest path capacity\" between nodes. In this framework, we propose a generalization of min-plus coordinates. These results apply when node coordinates consist in measured network proximity to a random subset of landmark nodes. We perform empirical validation of these results on widest path bandwidth between PlanetLab nodes. We conclude that appropriate non-metric coordinates such as generalized min-plus systems are better suited than metric systems for representing the underlying structure of Internet distances, measured either via latencies or bandwidth.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"13 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":"126465739","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

Is Random Network Coding Helpful in WiMAX? 随机网络编码在WiMAX中有用吗?

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

Jin Jin, Baochun Li, Taegon Kong

{"title":"Is Random Network Coding Helpful in WiMAX?","authors":"Jin Jin, Baochun Li, Taegon Kong","doi":"10.1109/INFOCOM.2008.283","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.283","url":null,"abstract":"The IEEE 802.16 standard, or WiMAX, has emerged to facilitate high-bandwidth wireless access in real- world metropolitan areas, commonly referred to as 4G. In WiMAX, hybrid automatic repeat request (HARQ) is adopted to transmit data packets reliably. However, it sacrifices resilience in time varying channels, and it may under-utilize the wireless medium in the cases of multi-path and multi-hop transmissions. On the other hand, random network coding has been shown to be effective towards improving throughput in multi-hop wireless networks, when deployed above the physical and MAC layers. It would be encouraging to observe that network coding is also helpful at the MAC layer in practice, especially within the emerging WiMAX standard. Is random network coding beneficial in WiMAX at the MAC layer? In this paper, we seek to answer this question by evaluating network coding in three cases: single-hop transmissions, handovers, and multi-hop transmissions. We show that random network coding has indeed offered important advantages as compared to traditional HARQ. Our observations may lead to the use of random network coding at the MAC layer in practical WiMAX systems.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"6 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":"127950003","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}

引用次数: 73

Design Guidelines for Routing Metrics in Multihop Wireless Networks 多跳无线网络中路由度量的设计指南

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

Yaling Yang, Jun Wang

引用次数: 174

Maximal Recovery Network Coding under Topology Constraint 拓扑约束下的最大恢复网络编码

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

K. Misra, Shirish S. Karande, H. Radha

{"title":"Maximal Recovery Network Coding under Topology Constraint","authors":"K. Misra, Shirish S. Karande, H. Radha","doi":"10.1109/INFOCOM.2008.282","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.282","url":null,"abstract":"Recent advances have shown that channel codes can be mapped onto networks to realize efficient Network Coding (NC); this has led to the emergence of Code-on-Network-Graphs (CNG). Traditional CNG approaches (e.g Decentralized Erasure Codes) focus on a generating a sequence of encoded symbols from a given input source (of size K), such that the original symbols can be recovered from any subset of the encoded symbols of size equal to or slightly larger than K. However in all cases the number of source symbols recovered falls rapidly if the number of encoded symbols received falls below K. In this paper we determine the CNG code-ensembles (under statistical toplogy constraint) which result in maximal recovery of WSN source data (for different erasure-rates), thereby minimizing the deterioration in data recovery. We also perform fixed point stability analysis on the underlying LDPC code ensemble. We then propose a distributed algorithm for generating a sequence of encoded symbols adhering to the designed code ensemble. Optimal solutions for a sensor network with 1000 nodes is determined using the Differential Evolution algorithm, and the solution sensitivity to variance in number of sensor nodes and node-interconnectivity is evaluated.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"2 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":"134186578","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}

引用次数: 4

A New Channel Assignment Mechanism for Rural Wireless Mesh Networks 农村无线网状网络信道分配新机制

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

P. Dutta, S. Jaiswal, Debmalya Panigrahi, R. Rastogi

{"title":"A New Channel Assignment Mechanism for Rural Wireless Mesh Networks","authors":"P. Dutta, S. Jaiswal, Debmalya Panigrahi, R. Rastogi","doi":"10.1109/INFOCOM.2008.294","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.294","url":null,"abstract":"In this paper we present a new channel allocation scheme for IEEE 802.11 based mesh networks with point-to- point links, designed for rural areas. Our channel allocation scheme allows continuous full-duplex data transfer on every link in the network. Moreover, we do not require any synchronization across the links as the channel assignment prevents cross link interference. Our approach is simple. We consider any link in the network as made up of two directed edges. To each directed edge at a node, we assign a non-interfering IEEE 802.11 channel so that the set of channels assigned to the outgoing edges is disjoint from channels assigned to the incoming edges. Evaluation of this scheme in a testbed demonstrate throughput gains of between 50 - 100%, and significantly less end-to-end delays, over existing link scheduling/channel allocation protocols (such as 2P [11]) designed for point-to-point mesh networks. Formally speaking, this channel allocation scheme is equivalent to an edge-coloring problem, that we call the directed edge coloring (DEC) problem. We establish a relationship between this coloring problem and the classical vertex coloring problem, and thus, show that this problem is NP-hard. More precisely, we give an algorithm that, given k vertex coloring of a graph can directed edge color it using xi(k) colors, where xi(k) is the smallest integer n such that (lfloorn/2rfloor/n ) ges k.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"104 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":"134203265","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}

引用次数: 44

A backup route aware routing protocol - fast recovery from transient routing failures 备份路由感知路由协议-从瞬态路由故障快速恢复

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

Feng Wang, Lixin Gao

引用次数: 21

Dynamic Bandwidth Request-Allocation Algorithm for Real-Time Services in IEEE 802.16 Broadband Wireless Access Networks IEEE 802.16宽带无线接入网实时业务的动态带宽请求分配算法

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

Eun-Chan Park, Hwangnam Kim, Jae-Young Kim, H. Kim

{"title":"Dynamic Bandwidth Request-Allocation Algorithm for Real-Time Services in IEEE 802.16 Broadband Wireless Access Networks","authors":"Eun-Chan Park, Hwangnam Kim, Jae-Young Kim, H. Kim","doi":"10.1109/INFOCOM.2008.137","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.137","url":null,"abstract":"The emerging broadband wireless access (BWA) technology based on IEEE 802.16 is one of the most promising solutions to provide ubiquitous wireless access to the broadband service at low cost. This paper proposes an efficient uplink bandwidth request-allocation algorithm for variable-rate realtime services in IEEE 802.16 BWA networks. In order to minimize bandwidth wastage without degrading quality of service (QoS), we introduce a notion of target delay and propose dual feedback architecture. The proposed algorithm calculates the amount of bandwidth request such that the delay is regulated around the desired level to minimize delay violation and delay jitter for real-time services. Also, it can maximize utilization of wireless channel by making use of dual feedback, where the bandwidth request is adjusted based on the information about the backlogged amount of traffic in the queue and the rate mismatch between packet arrival and service rates. Due to the dual feedback architecture, the proposed scheme responds quickly to the variation of traffic load and is robust to the change of network condition. We analyze the stability of the proposed algorithm from a control-theoretic viewpoint and derive a simple design guideline based on the analysis. By implementing the algorithm in OPNET simulator, we evaluate its performance in terms of queue regulation, optimal bandwidth allocation, delay controllability, and robustness to traffic characteristics.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"55 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":"129365830","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}

引用次数: 34

Spot Pricing of Secondary Spectrum Usage in Wireless Cellular Networks 无线蜂窝网络中二次频谱使用的现货定价

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

H. Mutlu, M. Alanyali, D. Starobinski

{"title":"Spot Pricing of Secondary Spectrum Usage in Wireless Cellular Networks","authors":"H. Mutlu, M. Alanyali, D. Starobinski","doi":"10.1109/INFOCOM.2008.118","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.118","url":null,"abstract":"Recent deregulation initiatives enable cellular providers to sell excess spectrum for secondary usage. In this paper, we investigate the problem of optimal spot pricing of spectrum by a provider in the presence of both non-elastic primary users, with long-term commitments, and opportunistic, elastic secondary users. We first show that optimal pricing can be formulated as an infinite horizon average reward problem and solved using stochastic dynamic programming. Next, we investigate the design of efficient single pricing policies. We provide numerical and analytical evidences that static pricing policies do not perform well in such settings (in sharp contrast to settings where all the users are elastic). On the other hand, we prove that deterministic threshold pricing achieves optimal profit amongst all single-price policies and performs close to global optimal pricing. We characterize the profit regions of static and threshold pricing, as a function of the arrival rate of primary users. Under certain reasonable assumptions on the demand function, we show that the profit region of threshold pricing can be far larger than that of static pricing. Moreover, we also show that these profit regions critically depend on the support of the demand function rather than specific form of it. We prove that the profit function of threshold pricing is unimodal in price and determine a restricted interval in which the optimal threshold lies. These two properties enable very efficient computation of the optimal threshold policy that is far faster than that of the global optimal policy.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"9 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":"126568890","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

Accurate and Efficient Traffic Monitoring Using Adaptive Non-Linear Sampling Method 基于自适应非线性采样方法的交通监控

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

Chengchen Hu, Sheng Wang, J. Tian, B. Liu, Y. Cheng, Yan Chen

{"title":"Accurate and Efficient Traffic Monitoring Using Adaptive Non-Linear Sampling Method","authors":"Chengchen Hu, Sheng Wang, J. Tian, B. Liu, Y. Cheng, Yan Chen","doi":"10.1109/INFOCOM.2008.14","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.14","url":null,"abstract":"Sampling technology has been widely deployed in measurement systems to control memory consumption and processing overhead. However, most of the existing sampling methods suffer from large estimation errors in analyzing small-size flows. To address the problem, we propose a novel adaptive non-linear sampling (ANLS) method for passive measurement. Instead of statically configuring the sampling rate, ANLS dynamically adjusts the sampling rate for a flow depending on the number of packets having been counted. We provide the generic principles guiding the selection of sampling function for sampling rate adjustment. Moreover, we derive the unbiased flow size estimation, the bound of the relative error, and the bound of required counter size for ANLS. The performance of ANLS is thoroughly studied through theoretic analysis and experiments under synthetic/real network data traces, with comparison to several related sampling methods. The results demonstrate that the proposed ANLS can significantly improve the estimation accuracy, particularly for small-size flows, while maintain a memory and processing overhead comparable to existing methods.","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":"131657199","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}

引用次数: 55

A Unifying Perspective on the Capacity of Wireless Ad Hoc Networks 无线自组织网络容量的统一观点

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

Zheng Wang, H. Sadjadpour, J. Garcia-Luna-Aceves

{"title":"A Unifying Perspective on the Capacity of Wireless Ad Hoc Networks","authors":"Zheng Wang, H. Sadjadpour, J. Garcia-Luna-Aceves","doi":"10.1109/INFOCOM.2008.51","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.51","url":null,"abstract":"We present the first unified modeling framework for the computation of the throughput capacity of random wireless ad hoc networks in which information is disseminated by means of unicast routing, multicast routing, broadcasting, or different forms of anycasting. We introduce (n,m, k)-casting as a generalization of all forms of one-to-one, one-to-many and many-to-many information dissemination in wireless networks. In this context, n, m, and k denote the total number of nodes in the network, the number of destinations for each communication group, and the actual number of communication-group members that receive information (i.e., k lesm), respectively. We compute upper and lower bounds for the (n, m, k)- cast throughput capacity in random wireless networks. When m = k = ominus(1), the resulting capacity equals the well-known capacity result for multi-pair unicasting by Gupta and Kumar. We demonstrate that ominus(1/radic(mnlogn)) bits per second constitutes a tight bound for the capacity of multicasting (i.e., m = k < n) when m les ominus (n/(log n)). We show that the multicast capacity of a wireless network equals its capacity for multi-pair unicasting when the number of destinations per multicast source is not a function of n. We also show that the multicast capacity of a random wireless ad hoc network is ominus (1/n), which is the broadcast capacity of the network, when m ges ominus(n/ log n). Furthermore, we show that ominus (radicm/(kradic(n log n))),ominus(1/(k log n)) and ominus(1/n) bits per second constitutes a tight bound for the throughput capacity of multicasting (i.e., k < m < n) when ominus(1) les m les ominus (n/ log n), k les ominus(n / log n) les m les n and ominus (n/ log n) les k les m les n respectively.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"5 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":"115386728","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}

引用次数: 85