2015 IEEE Conference on Computer Communications (INFOCOM)最新文献_第3页

SIEVE: Scalable user grouping for large MU-MIMO systems 筛:用于大型MU-MIMO系统的可扩展用户分组

2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218581

Wei-Liang Shen, K. Lin, Ming-Syan Chen, Kun Tan

{"title":"SIEVE: Scalable user grouping for large MU-MIMO systems","authors":"Wei-Liang Shen, K. Lin, Ming-Syan Chen, Kun Tan","doi":"10.1109/INFOCOM.2015.7218581","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218581","url":null,"abstract":"Multi-user multiple input and multiple output (MU-MIMO) is one predominate approach to improve the wireless capacity. However, since the aggregate capacity of MU-MIMO heavily depends on the channel correlations among the mobile users in a beamforming group, unwisely selecting beamforming groups may result in reduced overall capacity, instead of increasing it. How to select users into a beamforming group becomes the bottleneck of realizing the MU-MIMO gain. The fundamental challenge for user selection is the large searching space, and hence there exists a tradeoff between search complexity and achievable capacity. Previous works have proposed several low complexity heuristic algorithms, but they suffer a significant capacity loss. In this paper, we present a novel MU-MIMO MAC, called SIEVE. The core of SIEVE design is its scalable multi-user selection module that provides a knob to control the aggressiveness in searching the best beamforming group. SIEVE maintains a central database to track the channel and the coherence time for each mobile user, and largely avoids unnecessary computing with a progressive update strategy. Our evaluation, via both small-scale testbed experiments and large-scale trace-driven simulations, shows that SIEVE can achieve around 90% of the capacity compared to exhaustive search.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130830152","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}

引用次数: 46

AirShare: Distributed coherent transmission made seamless AirShare:分布式相干传输实现无缝

2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218555

Omid Salehi-Abari, Hariharan Rahul, D. Katabi, M. Pant

{"title":"AirShare: Distributed coherent transmission made seamless","authors":"Omid Salehi-Abari, Hariharan Rahul, D. Katabi, M. Pant","doi":"10.1109/INFOCOM.2015.7218555","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218555","url":null,"abstract":"Distributed coherent transmission is necessary for a variety of high-gain communication protocols such as distributed MIMO and creating codes over the air. Unfortunately, however, distributed coherent transmission is intrinsically difficult because different nodes are driven by independent clocks, which do not have the exact same frequency. This causes the nodes to have frequency offsets relative to each other, and hence their transmissions fail to combine coherently over the air. This paper presents AirShare, a primitive that makes distributed coherent transmission seamless. AirShare transmits a shared clock on the air and feeds it to the wireless nodes as a reference clock, hence eliminating the root cause for incoherent transmissions. The paper addresses the challenges in designing and delivering such a shared clock. It also implements AirShare in a network of USRP software radios, and demonstrates that it achieves tight phase coherence. Further, to illustrate AirShare's versatility, the paper uses it to deliver a coherent-radio abstraction on top of which it demonstrates two cooperative protocols: distributed MIMO, and distributed rate adaptation.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130876672","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}

引用次数: 107

Measurement and modeling of user transitioning among networks 网络间用户迁移的测量和建模

2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218453

Sookhyun Yang, J. Kurose, Simon Heimlicher, A. Venkataramani

{"title":"Measurement and modeling of user transitioning among networks","authors":"Sookhyun Yang, J. Kurose, Simon Heimlicher, A. Venkataramani","doi":"10.1109/INFOCOM.2015.7218453","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218453","url":null,"abstract":"Physical human mobility has played an important role in the design and operation of mobile networks. Physical mobility, however, differs from user identity (name) mobility in both traditional mobility management protocols such as Mobile-IP and in new architectures, such as XIA and MobilityFirst, that support identity mobility and location independence as first class objects. A multi-homed stationary user or a stationary user shifting among multiple devices attached to different networks will persistently keep his/her identity but will change access networks and the IP address to which his/her identity is associated. We perform a measurement study of such user transitioning among networks from a network-level point of view, characterizing the sequence of networks to which a user is attached and discuss insights and implications drawn from these measurements. We characterize network transitioning in terms of network residency time, degree of multi-homing, transition rates and more. We find that users typically spend time attached to a small number of access networks, and that a surprisingly large number of users access two networks contemporaneously. We develop and validate a parsimonious Markov chain model of canonical user transitioning among networks that can be used to provision network services and to analyze mobility protocols.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132271474","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}

引用次数: 7

Cracking network monitoring in DCNs with SDN 破解基于SDN的dcn网络监控

2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218383

Zhiming Hu, Jun Luo

{"title":"Cracking network monitoring in DCNs with SDN","authors":"Zhiming Hu, Jun Luo","doi":"10.1109/INFOCOM.2015.7218383","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218383","url":null,"abstract":"The outputs of network monitoring such as traffic matrix and elephant flow identification are essential inputs to many network operations and system designs in DCNs, but most solutions for network monitoring adopt direct measurements or inference alone, which may suffer from either high network overhead or low precision. Different from those approaches, we combine the direct measurements offered by software defined network (SDN) and inference techniques based on network tomography to derive a hybrid network monitoring scheme in this paper; it can strike a balance between measurement overhead and accuracy. Essentially, we use SDN to make the severely low determined network tomography (TM estimation) problem in DCNs to be a more determined one. Thus many classic network tomography algorithms in ISP networks become feasible for DCNs. By combining SDN with network tomography, we can also identify the elephant flows with high precision while occupying very little network resource. According to our experiment results, the accuracy of estimating the TM is far higher than those inferred by SNMP link counters only and the performance of identifying elephant flows is also very promising.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124201020","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}

引用次数: 46

Efficient broadcast on fragmented spectrum in cognitive radio networks 认知无线电网络中碎片频谱的高效广播

2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218377

Pei Huang, Chin-Jung Liu, Xi Yang, Li Xiao

{"title":"Efficient broadcast on fragmented spectrum in cognitive radio networks","authors":"Pei Huang, Chin-Jung Liu, Xi Yang, Li Xiao","doi":"10.1109/INFOCOM.2015.7218377","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218377","url":null,"abstract":"To improve spectrum utilization, cognitive radio (CR) is introduced to detect and exploit available spectrum resources autonomously. The flexible spectrum use imposes special challenges on broadcast because different CR devices may detect different available spectrum fragments at different locations. The sender and the receivers have to agree on spectrum fragments that will be used for broadcast. There may not exist a common spectrum fragment that is available to all receivers. Most existing work assumes that a device works only in a single channel and thus the sender has to broadcast multiple times in different channels to reach all receivers. The broadcast problem is studied as a channel rendezvous and minimum latency scheduling problem. Recent spectrum-agile designs have enabled a device to utilize partially occupied spectrum. We thus view a wideband channel as an aggregation of multiple narrow channels that can be evaluated independently. A Spectrum Fragment Agile Broadcast (SFAB) scheme is introduced in this paper to support efficient broadcast on fragmented spectrum. It aims at achieving spectrum agreement between the transmitter and the receivers efficiently and maximizing the channel width used for broadcast regardless of the spectrum availability differences at receivers. We validate the effectiveness of SFAB through implementation on the GNU Radio / USRP platform and use ns-2 simulations to evaluate the performance in large deployments.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114610439","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}

引用次数: 8

Absorbing micro-burst traffic by enhancing dynamic threshold policy of data center switches 通过增强数据中心交换机的动态门限策略来吸收微突发流量

2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218374

Danfeng Shan, Wanchun Jiang, Fengyuan Ren

{"title":"Absorbing micro-burst traffic by enhancing dynamic threshold policy of data center switches","authors":"Danfeng Shan, Wanchun Jiang, Fengyuan Ren","doi":"10.1109/INFOCOM.2015.7218374","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218374","url":null,"abstract":"In data center networks, micro-burst is a common traffic pattern and the packet dropping caused by it usually leads to serious performance degradation. Meanwhile, most of the current commodity switches employ on-chip shared memory, and the buffer management policies of them ensure fair sharing of memory among all ports. Among various polices, Dynamic Threshold (DT) is widely used by switch vendors. However, because DT needs to reserve a fraction of switch buffer, there is free buffer space while packets from micro-burst traffic are dropped. In this paper, we theoretically deduce the sufficient conditions for packet dropping caused by micro-burst traffic, and estimate the corresponding free buffer size. The results show that the free buffer size is very large when the number of overloaded ports is small. What's worse, to ensure fair sharing of memory among output ports, packets from micro-burst traffic may be dropped even when the traffic size is much smaller than the buffer size. In light of these results, we propose Enhanced Dynamic Threshold (EDT) policy, which can alleviate packet dropping caused by micro-burst traffic through fully utilizing the switch buffer and temporarily relaxing the fairness constraint. The simulation results show that EDT can absorb more micro-burst traffic than DT.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114695223","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

GEARSHIFT: Guaranteeing availability requirements in SLAs using hybrid fault tolerance GEARSHIFT:使用混合容错保证sla中的可用性需求

2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218514

Andrés J. Gonzalez, B. Helvik, Prakriti Tiwari, D. Becker, O. Wittner

{"title":"GEARSHIFT: Guaranteeing availability requirements in SLAs using hybrid fault tolerance","authors":"Andrés J. Gonzalez, B. Helvik, Prakriti Tiwari, D. Becker, O. Wittner","doi":"10.1109/INFOCOM.2015.7218514","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218514","url":null,"abstract":"The dependability of ICT systems is vital for today's society. However, operational systems are not fault free. Providers and customers have to define clear availability requirements and penalties on the delivered services by using SLAs. Fulfilling the stipulated availability may be expensive. The lack of mechanisms that allow a fine control of the SLA risk may lead to over-dimension the provided resources. Therefore, a relevant question for ICT service providers is: How to guarantee the SLA availability in a cost efficient way? This paper studies how to combine different fault tolerant techniques with different costs and properties, in order to economically fulfill a given SLA requirement. GEARSHIFT is a mechanism that enables ICT providers to set the fault tolerance technique (gear ratio) needed, depending on the current service conditions and requirements. We illustrate how to use the proposed model in a backbone network scenario, using measurements from a production national network. Finally, we show that the total costs of delivering an ICT service follow a simple convex function, which allows an easy selection of the optimal risk by tuning properly the combination of fault tolerant techniques.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116949024","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}

引用次数: 7

Fingerprint-free tracking with dynamic enhanced field division 无指纹跟踪与动态增强的领域划分

2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218671

Q. Zhang, Ziqiao Zhou, W. Xu, Jing Qi, Chenxi Guo, P. Yi, Ting Zhu, Sheng Xiao

引用次数: 21

Energy-efficient heuristics for job assignment in processor-sharing server farms 处理器共享服务器群中工作分配的节能启发式算法

2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218459

Jing-Zhi Fu, Jun Guo, E. Wong, M. Zukerman

{"title":"Energy-efficient heuristics for job assignment in processor-sharing server farms","authors":"Jing-Zhi Fu, Jun Guo, E. Wong, M. Zukerman","doi":"10.1109/INFOCOM.2015.7218459","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218459","url":null,"abstract":"Energy efficiency of server farms is an important design consideration of data centers. One effective approach is to optimize energy consumption by controlling carried load on the networked servers. In this paper, we propose a robust heuristic policy for job assignment in a server farm, aiming to improve the energy efficiency by maximizing the ratio of the long-run average throughput to the expected energy consumption. Our model of the server farm considers parallel processor-sharing queues with finite buffer sizes, heterogeneous server speeds, and an arbitrary energy consumption function. We devise the new energy-efficient (EE) policy in a way that the state distribution of the system depends on the service requirement distribution only through the mean. We show that the state-of-the-art slowest server first (SSF) policy can be obtained as a special case of EE and both policies have the same computational complexity. We provide a rigorous analysis of EE and derive conditions under which EE is guaranteed to outperform SSF in terms of energy efficiency. Extensive numerical results are presented and demonstrate that, in comparison with SSF, EE yields a consistently better system throughput and yet improves the energy efficiency by up to 70%.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122003389","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}

引用次数: 5

Beyond duty cycling: Wake-up radio with selective awakenings for long-lived wireless sensing systems 超越占空比:唤醒无线电与选择性唤醒长寿命的无线传感系统

2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218419

Dora Spenza, M. Magno, S. Basagni, L. Benini, M. Paoli, C. Petrioli

{"title":"Beyond duty cycling: Wake-up radio with selective awakenings for long-lived wireless sensing systems","authors":"Dora Spenza, M. Magno, S. Basagni, L. Benini, M. Paoli, C. Petrioli","doi":"10.1109/INFOCOM.2015.7218419","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218419","url":null,"abstract":"Emerging wake-up radio technologies have the potential to bring the performance of sensing systems and of the Internet of Things to the levels of low latency and very low energy consumption required to enable critical new applications. This paper provides a step towards this goal with a twofold contribution. We first describe the design and prototyping of a wake-up receiver (WRx) and its integration to a wireless sensor node. Our WRx features very low power consumption (<; 1.3μW), high sensitivity (up to -55dBm), fast reactivity (wake-up time of 130μs), and selective addressing, a key enabler of new high performance protocols. We then present ALBA-WUR, a cross-layer solution for data gathering in sensing systems that redesigns a previous leading protocol, ALBA-R, extending it to exploit the features of our WRx. We evaluate the performance of ALBA-WUR via simulations, showing that the use of the WRx produces remarkable energy savings (up to five orders of magnitude), and achieves lifetimes that are decades longer than those obtained by ALBA-R in sensing systems with duty cycling, while keeping latencies at bay.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124664170","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}

引用次数: 136