2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献_第9页

A primal-dual approach to delay minimizing user association in cellular networks 蜂窝网络中延迟最小化用户关联的原始对偶方法

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447018

J. Wildman, Yusuf Osmanlioglu, S. Weber, A. Shokoufandeh

{"title":"A primal-dual approach to delay minimizing user association in cellular networks","authors":"J. Wildman, Yusuf Osmanlioglu, S. Weber, A. Shokoufandeh","doi":"10.1109/ALLERTON.2015.7447018","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447018","url":null,"abstract":"We study network utility maximization (NUM) within the context of cellular single user association (SUA) policies that map each mobile user (MU) to a single base station (BS) and make use of the generalized α-proportional fairness utility measure across downlink rates. Finding an exact solution to many such centralized user association problem is known to be NP-hard, so we are motivated to consider the integer relaxation of the SUA NUM problem. On this front, we provide separate characterizations of i) the fairness measures under which the SUA NUM problem integrality gap is exactly 1, and ii) the fairness measures yielding non-convex SUA NUM problem formulations. Next, we analyze the fairness measure corresponding to delay minimization and find a more natural linearization of the non-convex minimum delay SUA problem compared to our related previous work. We propose and construct a primal-dual algorithm to approximate the linearized minimum delay SUA problem. Our primal-dual algorithm is shown to achieve smaller performance gaps and runtimes over i) an intuitive baseline rounding algorithm applied to the linearized min delay SUA problem, as well as ii) two greedy heuristics that emphasize associations with minimal MU-BS distances and maximal downlink SINR ratios, respectively.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134458544","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

Distributed load management in anycast-based CDNs 基于任意播播的cdn分布式负载管理

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7446988

Abhishek Sinha, Pradeepkumar Mani, Jie Liu, A. Flavel, D. Maltz

{"title":"Distributed load management in anycast-based CDNs","authors":"Abhishek Sinha, Pradeepkumar Mani, Jie Liu, A. Flavel, D. Maltz","doi":"10.1109/ALLERTON.2015.7446988","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7446988","url":null,"abstract":"Anycast is an internet addressing protocol where multiple hosts share the same IP-address. A popular architecture for modern Content Distribution Networks (CDNs) for geo-replicated HTTP-services consists of multiple layers of proxy nodes for service and co-located DNS-servers for load-balancing on different proxies. Both the proxies and the DNS-servers use anycast addressing, which offers simplicity of design and high availability of service at the cost of partial loss of routing control. Due to the very nature of anycast, load-management actions by a co-located DNS-server also affects loads at nearby proxies in the network. This makes the problem of distributed load management highly challenging. In this paper, we propose an analytical framework to formulate and solve the load-management problem in this context. We consider two distinct algorithms. In the first half of the paper, we pose the load-management problem as a convex optimization problem. Following a dual decomposition technique, we propose a fully-distributed load-management algorithm by introducing FastControl packets. This algorithm utilizes the underlying anycast mechanism itself to enable effective coordination among the nodes, thus obviating the need for any external control channel. In the second half of the paper, we consider an alternative greedy load-management heuristic, currently in production in a major commercial CDN. We study its dynamical characteristics and analytically identify its operational and stability properties. Finally, we critically evaluate both the algorithms and explore their optimality-vs-complexity trade-off using trace-driven simulations.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133158464","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

Delay in cooperative communications: Higher multiplexing gain in Gaussian interference channels with full-duplex transmitters 协作通信中的延迟:全双工发射机高斯干扰信道中更高的多路复用增益

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447185

A. Haghi, Neda Mohammadizadeh, A. Khandani

引用次数: 2

Durable network coded distributed storage 持久的网络编码分布式存储

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447095

Vitaly Abdrashitov, M. Médard

{"title":"Durable network coded distributed storage","authors":"Vitaly Abdrashitov, M. Médard","doi":"10.1109/ALLERTON.2015.7447095","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447095","url":null,"abstract":"In distributed cloud storages fault tolerance is maintained by regenerating the lost coded data from the surviving clouds. Recent studies suggest using maximum distance separable (MDS) network codes in cloud storage systems to allow efficient and reliable recovery after node faults. MDS codes are designed to use a substantial number of repair nodes and rely on centralized management and a static fully connected network between the nodes. However, in highly dynamic environments, like edge caching in communication networks or peer-to-peer networks, availability of the nodes and the communication links is very volatile. In these scenarios MDS codes functionality is limited. In this paper we study a non-MDS network coded approach, which operates in a decentralized manner and requires a small number of repair nodes for node recovery. We investigate long-term behavior and durability of the modeled system in terms of the storage life time, i.e. the number of the cycles of nodes failure and recovery after which the storage no longer have enough data to decode the original source packets. We demonstrate, analytically and numerically, the life time gains over uncoded storage.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124840725","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}

引用次数: 6

Constructions of MDS codes via random Vandermonde and Cauchy matrices over small fields 在小域上通过随机Vandermonde和Cauchy矩阵构造MDS码

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447110

Son Hoang Dau, Wentu Song, A. Sprintson, C. Yuen

引用次数: 4

Systems of quadratic equations: Efficient solution algorithms and conditions for solvability 二次方程系统:有效解算法和可解性条件

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447121

Krishnamurthy Dvijotham

引用次数: 1

On Kelly betting: Some limitations 关于凯利赌博:有些限制

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447000

Chung-Han Hsieh, B. Barmish

引用次数: 20

Bounds between contraction coefficients 收缩系数界限

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447175

A. Makur, Lizhong Zheng

引用次数: 29

On the distribution and mean of received power in stochastic cellular network 随机细胞网络中接收功率的分布和平均值

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447140

Fengming Cao, A. Ganesh, S. Armour, M. Sooriyabandara

引用次数: 0

Cost effective algorithms for spectral bandits 具有成本效益的频谱盗匪算法

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447161

M. Hanawal, Venkatesh Saligrama

引用次数: 4