2010 Proceedings IEEE INFOCOM最新文献

A Tractable and Accurate Cross-Layer Model for Multi-Hop MIMO Networks 多跳MIMO网络的一种可处理且精确的跨层模型

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

Jia Liu, Yi Shi, Yiwei Thomas Hou

{"title":"A Tractable and Accurate Cross-Layer Model for Multi-Hop MIMO Networks","authors":"Jia Liu, Yi Shi, Yiwei Thomas Hou","doi":"10.1109/INFCOM.2010.5462061","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462061","url":null,"abstract":"MIMO-based communications have great potential to improve network capacity for multi-hop wireless networks. Although there has been significant progress on MIMO at the physical layer or single-hop communication, advances in the theory of MIMO for multi-hop wireless networks remain limited. This stagnation is mainly due to the lack of an accurate and more important, analytically tractable model that can be used by networking researchers. In this paper, we propose such a model to enable the networking community to carry out cross-layer research for multi-hop MIMO networks. In particular, at the physical layer, we develop a simple model for MIMO channel capacity computation that captures the essence of spatial multiplexing and transmit power limit without involving complex matrix operations and the water-filling algorithm. We show that the approximation gap in this model is negligible. At the link layer, we devise a space-time scheduling scheme called OBIC that significantly advances the existing zero-forcing beamforming (ZFBF) to handle interference in a multi-hop network setting. The proposed OBIC scheme employs simple algebraic computation on matrix dimensions to simplify ZFBF in a multi-hop network. As a result, we can characterize link layer scheduling behavior without entangling with beamforming details. Finally, we apply both the new physical and link layer models in cross-layer performance optimization for a multi-hop MIMO network.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"14 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":"115298944","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}

引用次数: 37

Reliable Adaptive Multipath Provisioning with Bandwidth and Differential Delay Constraints 具有带宽和差分延迟约束的可靠自适应多路径配置

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

Weiyi Zhang, Jian Tang, Chonggang Wang, Shanaka de Soysa

{"title":"Reliable Adaptive Multipath Provisioning with Bandwidth and Differential Delay Constraints","authors":"Weiyi Zhang, Jian Tang, Chonggang Wang, Shanaka de Soysa","doi":"10.1109/INFCOM.2010.5462042","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462042","url":null,"abstract":"Robustness and reliability are critical issues in network management. To provide resiliency against network failures, a popular protection scheme against network failures is the simultaneous routing along multiple disjoint paths. Most previous protection and restoration schemes were designed for all-ornothing protection and thus, an overkill for data traffic. In this work, we study the Reliable Adaptive Multipath Provisioning (RAMP) problem with reliability and differential delay constraints. We aim to route the connections in a manner such that link failure does not shut down the entire stream but allows a continuing flow for a significant portion of the traffic along multiple (not necessary disjoint) paths, allowing the whole network to carry sufficient traffic even when link/node failure occurs. The flexibility enabled by a multipath scheme has the tradeoff of differential delay among the diversely routed paths. This requires increased memory in the destination node in order to buffer the traffic until the data arrives on all the paths. Increased buffer size will raise the network element cost and could cause buffer overflow and data corruption. Therefore, differential delay between the multiple paths should be bounded by containing the delay of a path in a range from dmin to dmax. We first prove that RAMP is a NP-hard problem. Then we present a pseudo-polynomial time solution to solve a special case of RAMP, representing edge delays as integers. Next, a (1 + epsilon)-approximation is proposed to solve the optimization version of the RAMP problem. We also present numerical results confirming the advantage of our scheme over the current state of art.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"4 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":"115468379","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

Distributed Dynamic Speed Scaling 分布式动态速度缩放

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

R. Stanojevic, R. Shorten

{"title":"Distributed Dynamic Speed Scaling","authors":"R. Stanojevic, R. Shorten","doi":"10.1109/INFCOM.2010.5462197","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462197","url":null,"abstract":"In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are major energy consumers. In existing data centers CPUs are responsible for approximately half of the energy consumed by the servers. A promising technique for saving CPU energy consumption is dynamic speed scaling, in which the speed at which the processor is run is adjusted based on demand and performance constraints. In this paper we look at the problem of allocating the demand in the network of processors (each being capable to perform dynamic speed scaling) to minimize the global energy consumption/cost subject to a performance constraint. The nonlinear dependence between the energy consumption and the performance as well as the high variability in the energy prices result in a nontrivial resource allocation. The problem can be abstracted as a fully distributed convex optimization with a linear constraint. On the theoretical side, we propose two low-overhead fully decentralized algorithms for solving the problem of interest and provide closed-form conditions that ensure stability of the algorithms. Then we evaluate the efficacy of the optimal solution using simulations driven by the real-world energy prices. Our findings indicate a possible cost reduction of $10-40%$ compared to power-oblivious $1/N$ load balancing, for a wide range of load factors.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"31 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":"123181235","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}

引用次数: 57

Two Samples are Enough: Opportunistic Flow-level Latency Estimation using NetFlow 两个样本就足够了:使用NetFlow进行机会流级延迟估计

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

Myungjin Lee, N. Duffield, R. Kompella

引用次数: 21

A Self-Organized Mechanism for Thwarting Malicious Access in Ad Hoc Networks 一种阻止Ad Hoc网络中恶意访问的自组织机制

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

N. Fernandes, M. D. D. Moreira, O. Duarte

引用次数: 18

UUSee: Large-Scale Operational On-Demand Streaming with Random Network Coding 大规模操作点播流与随机网络编码

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

Zimu Liu, Chuan Wu, Baochun Li, Shuqiao Zhao

引用次数: 191

SafeQ: Secure and Efficient Query Processing in Sensor Networks 传感器网络中安全高效的查询处理

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

Fei Chen, A. Liu

引用次数: 102

An Interaction-Based Mobility Model for Dynamic Hot Spot Analysis 一种基于交互的动态热点分析移动模型

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

F. Morlot, S. Elayoubi, F. Baccelli

引用次数: 17

Risk-Aware Routing for Optical Transport Networks 光传输网络的风险感知路由

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

Ming Xia, M. Tornatore, C. Martel, B. Mukherjee

{"title":"Risk-Aware Routing for Optical Transport Networks","authors":"Ming Xia, M. Tornatore, C. Martel, B. Mukherjee","doi":"10.1109/INFCOM.2010.5462168","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462168","url":null,"abstract":"A Service Level Agreement (SLA) typically specifies the availability a Service Provider (SP) promises to a customer. In an Optical Transport Network, finding a lightpath for a connection is commonly based on whether the availability of a lightpath availability complies with the connection's SLA-requested availability. Because of the stochastic nature of network failures, the actual availability of a lightpath over a specific time period is subject to uncertainty, and the SLA is usually at risk. We consider the network uncertainty, and study routing to minimize the probability of SLA violation. First, we use a single-link model to study SLA Violation Risk (i.e., the probability of SLA violation) under different settings. We show that SLA Violation Risk may vary by paths and is affected by other factors (e.g., failure rate, connection holding time, etc.), and hence cannot be simply described by path availability. We then formulate the problem of risk-aware routing in mesh networks, in which routing decisions are dictated by SLA Violation Risk. In particular, we focus on devising a scheme capable of computing lightpath(s) that are likely to successfully accommodate a connection's SLA-requested availability. A novel technique is applied to convert links with heterogeneous failure profiles to reference links which capture the main risk features in a relative manner. Based on the \"reference link\" concept, we present a polynomial Risk-Aware Routing scheme using only limited failure information. In addition, we extend our Risk-Aware Routing scheme to incorporate shared path protection (SPP) when protection is needed. We evaluate the performance and demonstrate the effectiveness of our schemes in terms of SLA violation ratio and, more generally, contrast them with the generic availability-aware approaches.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"150 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":"116393646","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

Robust and Scalable Integrated Routing in MANETs Using Context-Aware Ordered Meshes 基于上下文感知有序网格的manet鲁棒可扩展集成路由

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

R. Menchaca-Méndez, J. Garcia-Luna-Aceves

引用次数: 10