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

Fast and Distributed Computation of Schedules in Wireless Networks 无线网络调度的快速分布式计算

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

S. Deb, Karan Mangla, K. Naidu

{"title":"Fast and Distributed Computation of Schedules in Wireless Networks","authors":"S. Deb, Karan Mangla, K. Naidu","doi":"10.1109/INFOCOM.2008.167","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.167","url":null,"abstract":"In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former has been proved to be throughput optimal and has superior delay properties, and the latter schedules as many links, with packets to transmit, as possible. However, it is challenging to design algorithms for computing these schedules that (i) are distributed, (i.e., only local message exchanges between neighboring nodes are permitted) (ii) have low running times (iii) exchanges a small number of messages. In this paper, we develop algorithms that satisfy these properties and also provide good approximations to MWM and MSM schedules. We also note that constant approximation to MWM leads to improved delay properties. We refer to a round as a length of time over which every node in the network can make at most one message-transmission attempt. We propose distributed algorithms for computing (i) 1/2 - epsi e approximation to MWM schedule in O(log(1/epsi) log2 n) rounds, and (ii) 2/3 - epsi approximation to MSM schedule in O((1/epsi) log2 n) rounds, where n is the network size. Simulation results with a popular model for wireless ad-hoc networks demonstrate that (i) our algorithms perform within 85% - 95% of the optimal in many scenarios, and (ii) the time-complexity of the algorithms can be reduced considerably in practice. The number of message transmissions for both our algorithms scale as O(n log2 n). In summary, ours is the first work to (i) provide half (two-third) approximate distribute algorithms for computing MWM (MSM) schedule with logarithmic time- complexity and quasi-linear message exchanges (ii) demonstrate that the algorithms are close to optimal for realistic topologies.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"14 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":"129573671","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}

引用次数: 3

Balanced Relay Allocation on Heterogeneous Unstructured Overlays 异构非结构化覆盖的均衡中继分配

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

H. Nguyen, Daniel R. Figueiredo, M. Grossglauser, Patrick Thiran

{"title":"Balanced Relay Allocation on Heterogeneous Unstructured Overlays","authors":"H. Nguyen, Daniel R. Figueiredo, M. Grossglauser, Patrick Thiran","doi":"10.1109/INFOCOM.2008.34","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.34","url":null,"abstract":"Due to the increased usage of NAT boxes and firewalls, it has become harder for applications to establish direct connections seamlessly among two end-hosts. A recently adopted proposal to mitigate this problem is to use relay nodes, end-hosts that act as intermediary points to bridge connections. Efficiently selecting a relay node is not a trivial problem, specially in a large-scale unstructured overlay system where end-hosts are heterogeneous. In such environment, heterogeneity among the relay nodes comes from the inherent differences in their capacities and from the way overlay networks are constructed. Despite this fact, good relay selection algorithms should effectively balance the aggregate load across the set of relay nodes. In this paper, we address this problem using algorithms based on the two random choices method. We first prove that the classic load-based algorithm can effectively balance the load even when relays are heterogeneous, and that its performance depends directly on relay heterogeneity. Second, we propose an utilization-based random choice algorithm to distribute load in order to balance relay utilization. Numerical evaluations through simulations illustrate the effectiveness of this algorithm, indicating that it might also yield provable performance (which we conjecture). Finally, we support our theoretical findings through simulations of various large-scale scenarios, with realistic relay heterogeneity.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"29 3 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":"129713102","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}

引用次数: 13

Computational Analysis and Efficient Algorithms for Micro and Macro OFDMA Scheduling OFDMA宏、微观调度的计算分析与高效算法

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

R. Cohen, L. Katzir

引用次数: 38

An Efficient Identity-Based Batch Verification Scheme for Vehicular Sensor Networks 一种高效的基于身份的车载传感器网络批量验证方案

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

Chenxi Zhang, R. Lu, Xiaodong Lin, P. Ho, Xuemin Shen

{"title":"An Efficient Identity-Based Batch Verification Scheme for Vehicular Sensor Networks","authors":"Chenxi Zhang, R. Lu, Xiaodong Lin, P. Ho, Xuemin Shen","doi":"10.1109/INFOCOM.2008.58","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.58","url":null,"abstract":"With the adoption of state-of-the-art telecommunication technologies for sensing and collecting traffic related information, Vehicular Sensor Networks (VSNs) have emerged as a new application scenario that is envisioned to revolutionize the human driving experiences and traffic flow control systems. To avoid any possible malicious attack and resource abuse, employing a digital signature scheme is widely recognized as the most effective approach for VSNs to achieve authentication, integrity, and validity. However, when the number of signatures received by a Roadside Unit (RSU) becomes large, a scalability problem emerges immediately, where the RSU could be difficult to sequentially verify each received signature within 300 ms interval according to the current Dedicated Short Range Communications (DSRC) broadcast protocol. In this paper, we introduce an efficient batch signature verification scheme for communications between vehicles and RSUs (or termed vehicle- to-Infrastructure (V2I) communications), in which an RSU can verify multiple received signatures at the same time such that the total verification time can be dramatically reduced. We demonstrate that the proposed scheme can achieve conditional privacy preservation that is essential in VSNs, where each message launched by a vehicle is mapped to a distinct pseudo identity, while a trust authority can always retrieve the real identity of a vehicle from any pseudo identity. With the proposed scheme, since identity-based cryptography is employed in generating private keys for pseudo identities, certificates are not needed and thus transmission overhead can be significantly reduced.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"78 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":"129445267","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}

引用次数: 614

Analysis of Price Competition in a Slotted Resource Allocation Game 狭缝资源配置博弈中的价格竞争分析

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

P. Maillé, B. Tuffin

{"title":"Analysis of Price Competition in a Slotted Resource Allocation Game","authors":"P. Maillé, B. Tuffin","doi":"10.1109/INFOCOM.2008.141","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.141","url":null,"abstract":"Pricing telecommunication networks has become a highly regarded topic during the last decade, in order to cope with congestion by controlling demand, or to yield proper incentives for a fair sharing of resources. On the other hand, another important factor has to be brought in: there is a rise of competition between service providers in telecommunication networks such as for instance the Internet, and the impact of this competition has to be carefully analyzed. The present paper pertains to this recent stream of works. We consider a slotted resource allocation game with several providers, each of them having a fixed capacity during each time slot, and a fixed access price. Each provider serves its demand up to its capacity, demand in excess being dropped. Total user demand is therefore split among providers according to Wardrop's principle, depending on price and loss probability. Using the characterization of the resulting equilibrium, we prove, under mild conditions, the existence and uniqueness of a Nash equilibrium in the pricing game between providers. We also show that, remarkably, this equilibrium actually corresponds to the socially optimal situation obtained when both users and providers cooperate to maximize the sum of all utilities, this even if providers have the opportunity to artificially reduce their capacity.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"52 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":"130281133","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}

引用次数: 53

Making Large Scale Deployment of RCP Practical for Real Networks 实现RCP在真实网络中的大规模部署

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

Chia-Hui Tai, Jiang Zhu, Nandita Dukkipati

{"title":"Making Large Scale Deployment of RCP Practical for Real Networks","authors":"Chia-Hui Tai, Jiang Zhu, Nandita Dukkipati","doi":"10.1109/INFOCOM.2008.285","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.285","url":null,"abstract":"We recently proposed the rate control protocol (RCP) as a way to minimize download times (or flow-completion times). Simulations suggest that if RCP were widely deployed, downloads would frequently finish an order of magnitude faster than with TCP. This is because RCP involves explicit feedback from the routers along the path, allowing a sender to pick a fast starting rate, and adapt quickly to network conditions. RCP is particularly appealing because it can be shown to be stable under broad operating conditions, and its performance is independent of the flow-size distribution and the RTT. Although it requires changes to the routers, the changes are small: The routers keep no per-flow state or per-flow queues, and the per-packet processing is minimal. However, the bar is high for a new congestion control mechanism - introducing a new scheme requires enormous change, and the argument needs to be compelling. And so, to enable incremental deployment of RCP, we have built and tested an open and public implementation of RCP, and proposed solutions for deployments that require no fork-lift network upgrades. In this paper we describe our end-host and router implementation of RCP in Linux, and solutions to how RCP can coexist in a network carrying predominantly non-RCP traffic, and coordinate with routers that don't implement RCP. We hope that these solutions will take us closer to having an impact in real networks, not just for RCP but also for many other explicit congestion control protocols proposed in literature.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"1 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":"130555845","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}

引用次数: 64

Spatial-Temporal Characteristics of Internet Malicious Sources 网络恶意源的时空特征

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

Zesheng Chen, C. Ji, P. Barford

引用次数: 66

Continuous Network Coding in Wireless Relay Networks 无线中继网络中的连续网络编码

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

Wei Pu, Chong Luo, Shipeng Li, Chang Wen Chen

{"title":"Continuous Network Coding in Wireless Relay Networks","authors":"Wei Pu, Chong Luo, Shipeng Li, Chang Wen Chen","doi":"10.1109/INFOCOM.2008.212","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.212","url":null,"abstract":"Network coding has recently been applied to wireless networks and has achieved some initial success. Researches in wireless network coding have been mostly focusing on utilizing the broadcast nature of the wireless networks. In this paper, we propose a novel network coding framework for wireless relay networks that also takes into consideration the fading and error prone nature of the wireless networks. First, we extend the traditional network coding in lossless networks which operates on 0-1 bits, to a new framework which defines network coding on the posterior probability of each bit. This new framework allows an imperfect decode-recode process at a relay node and avoids possible error propagation when a hard decision is made at the relay node. It implicitly integrates decode-and-forward and estimate-and-forward strategies for wireless network coding to address the technical issues of channel fading and transmission errors. The proposed approach is validated through both theoretical analysis and extensive simulations. Both analysis and simulation confirm that this new framework is able to achieve significant gain over traditional network coding. This new framework also enables the introduction of adaptive scheme into network coding. We demonstrate a basic adaptation scheme and present some preliminary experimental results. The proposed adaptive scheme will lay down an essential foundation in this emerging field of wireless network coding in order to address issues related to link heterogeneity.","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":"121252548","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}

引用次数: 29

Towards Collaborative User-Level Overlay Fault Diagnosis 面向协同用户级叠加故障诊断的研究

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

Yongning Tang, E. Al-Shaer

引用次数: 9

An Optimization Framework for Opportunistic Multipath Routing in Wireless Mesh Networks 无线网状网络中机会多径路由的优化框架

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

B. Radunovic, C. Gkantsidis, P. Key, P. Rodriguez

引用次数: 80