2015 IEEE Conference on Computer Communications (INFOCOM)最新文献

筛选
英文 中文
Congestion-aware single link failure recovery in hybrid SDN networks 混合SDN网络中感知拥塞的单链路故障恢复
2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218482
C. Chu, Kang Xi, Min Luo, H. J. Chao
{"title":"Congestion-aware single link failure recovery in hybrid SDN networks","authors":"C. Chu, Kang Xi, Min Luo, H. J. Chao","doi":"10.1109/INFOCOM.2015.7218482","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218482","url":null,"abstract":"As service providers have started deploying SDN in their networks, traditional IP routers are gradually upgraded to SDN enabled switches. In other words, the network will have traditional IP routers and SDN switches coexisting, and it is called a hybrid SDN network. With such a network, we take advantage of SDN and propose an approach to guarantee traffic reachability in the presence of any single link failure. By redirecting traffic on the failed link to SDN switches through pre-configured IP tunnels, the proposed approach is able to react to the failures very fast. With the help of coordination among SDN switches, we are also able to explore multiple backup paths for the failure recovery. This allows the proposed approach to avoid potential congestion in the post-recovery network by choosing proper backup paths. Simulation results show that our proposed scheme requires only a very few number of SDN switches in the hybrid SDN network to achieve fast recovery and guarantee 100% reachability from any single link failure. It also shows that the proposed approach is able to better load-balance the post-recovery network comparing to IP Fast Reroute and shortest path re-calculation.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"12 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":"128378057","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}
引用次数: 98
Fast optimal nonconcave resource allocation 快速优化非凹资源分配
2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218529
Pan Lai, Rui Fan
{"title":"Fast optimal nonconcave resource allocation","authors":"Pan Lai, Rui Fan","doi":"10.1109/INFOCOM.2015.7218529","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218529","url":null,"abstract":"Efficient use of shared resources is a key problem in a wide range of computer systems, from cloud computing to multicore processors. Optimized allocation of resources among users can result in dramatically improved overall system performance. Resource allocation is in general NP-complete, and past works have mostly focused on studying concave performance curves, applying heuristics to nonconcave curves, or finding optimal solutions using slow dynamic programming methods. These approaches have drawbacks in terms of generality, accuracy and efficiency. In this paper, we observe that realistic performance curves are often not concave, but rather can be broken into a small number of concave or convex segments. We present efficient algorithms for optimal and approximately optimal resource allocation leveraging this idea. We also introduce several algorithmic techniques that may be of independent interest. Our optimal algorithm runs in O(snα(m)m(log m)2) time, and our approximation algorithm finds a 1 - ε optimal allocation for any ε > 0 in O(s/ε α(n/ε)n2 log n/ε log m) time; here, s is the number of segments, n the number of processes, m the amount of shared resource, and α is the inverse Ackermann function that is ≤ 4 in practice. Existing exact and approximation algorithms have O(nm2) and O(n2 m/ε) running times, resp., so our algorithms are much faster in the practical case where n <;<; m. Experiments show that our algorithms are 215 times faster than dynamic programming for finding optimal solutions when m = 1M, and produce solutions with 33% better performance than greedy algorithms.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"78 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":"129345972","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
Minimum-Latency Beaconing Schedule in duty-cycled multihop wireless networks 占空周期多跳无线网络中的最小延迟信标调度
2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218507
Lixin Wang, P. Wan, Kyle Young
{"title":"Minimum-Latency Beaconing Schedule in duty-cycled multihop wireless networks","authors":"Lixin Wang, P. Wan, Kyle Young","doi":"10.1109/INFOCOM.2015.7218507","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218507","url":null,"abstract":"Beaconing is a primitive communication task in which every node locally broadcasts a packet to all of its neighbors within a fixed distance. The problem Minimum Latency Beaconing Schedule (MLBS) seeks a shortest schedule for beaconing subject to the interference constraint. MLBS has been well studied when all the nodes are always awake. However, it is well-known that the networking nodes often switch between the active state and the sleep state to save energy. A node in duty-cycled scenarios may require transmitting multiple times to inform all of its neighbors due to their different active times. Thus, all of the known algorithms for MLBS are not suitable for duty-cycled multihop wireless networks. In this paper, we study MLBS in Duty-Cycled multihop wireless networks (MLBSDC). We first present two constant-approximation algorithms for MLBSDC under the protocol interference model with the approximation bounds independent of the length of a scheduling period. Then, we develop an efficient algorithm for MLBSDC under the physical interference model. To the best of our knowledge, this is the first paper that develops efficient algorithms for MLBSDC under either of these two interference models.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"6 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":"130641130","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}
引用次数: 9
Financial analysis of 4G network deployment 4G网络部署财务分析
2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218540
Yanjiao Chen, Lingjie Duan, Qian Zhang
{"title":"Financial analysis of 4G network deployment","authors":"Yanjiao Chen, Lingjie Duan, Qian Zhang","doi":"10.1109/INFOCOM.2015.7218540","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218540","url":null,"abstract":"Major cellular operators are planning to upgrade to high-speed 4G networks, but due to budget constraints, they have to dynamically plan and deploy the 4G networks through multiple stages of time. By considering one-time deployment cost, daily operational cost and 3G network congestion, this paper studies how an operator financially manages the cash flow and plans the 4G deployment in a finite time horizon to maximize his final-stage profit. The operator provides both the traditional 3G service and the new 4G service, and we show that users will start to use the 4G service only when it reaches a sizable coverage. At each time stage, the operator first decides an additional 4G deployment size, by predicting users' responses in choosing between the 3G and 4G services. We formulate this problem as a dynamic programming problem, and propose an optimal threshold-based 4G deployment policy. We show that the operator will not deploy to a full 4G coverage in an area with low user density or high deployment/operational cost. Perhaps surprisingly, during the 4G deployment process, we show that the 4G subscriber number first increases and then decreases, as the 4G service helps mitigate 3G network congestion and increases its QoS.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"22 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":"131971347","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}
引用次数: 18
Off-path round trip time measurement via TCP/IP side channels 通过TCP/IP侧通道测量离路往返时间
2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218538
Geoffrey Alexander, Jedidiah R. Crandall
{"title":"Off-path round trip time measurement via TCP/IP side channels","authors":"Geoffrey Alexander, Jedidiah R. Crandall","doi":"10.1109/INFOCOM.2015.7218538","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218538","url":null,"abstract":"We present a novel technique for estimating the round trip time network latency between two off-path end hosts. That is, given two arbitrary machines, A and B, on the Internet, our technique measures the round trip time from A to B. We take advantage of information side-channels that are present in the TCP/IP network stack of modern Linux kernels to infer information about off-path routes. Compared to previous tools, ours does not require additional resources, machines, or require additional protocols beyond TCP. The only requirements are that one end host have an open port and be running a modern Linux kernel and that the other end host responds to unsolicited SYN-ACK packets with a RST packet. We evaluate our technique “in the wild” and compare our off-path estimates to on-path measurements. Our experiments show that our technique provides accurate, real-time estimates of off-path network latency. In over 80% of measurements our technique provides off-path round trip time measurements within 20% of the actual round trip time. We also discuss possible causes of errors that impact the accuracy of our measurements.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"14 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":"126653529","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}
引用次数: 22
Optimal secondary user packet size in mobile cognitive radio networks under fading channels 衰落信道下移动认知无线网络中最优次用户包大小
2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218379
Yi Song
{"title":"Optimal secondary user packet size in mobile cognitive radio networks under fading channels","authors":"Yi Song","doi":"10.1109/INFOCOM.2015.7218379","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218379","url":null,"abstract":"The size of a packet has a strong influence on the quality of wireless data communications. In traditional wireless networks, there is an inherent trade-off in determining the packet size. First of all, compared with long packets, short packets are less likely to be affected by the error-prone wireless channels. However, short packets suffer overhead due to headers. In mobile cognitive radio (CR) networks, determining the secondary user (SU) packet size becomes much more complicated and critical. In addition to all the impacts in traditional wireless networks, the primary user (PU) activity and the mobility of SUs and PUs have significant impacts on the SU packet size. Moreover, the channel fading caused by the SU mobility also has an impact on the SU packet size. More importantly, all these impacts on SU packet size constantly vary with time and space, which makes this issue extremely challenging. Without a careful design of the SU packet size, both SU and PU transmissions may suffer severe performance degradation. In this paper, the optimal SU packet size issue in mobile CR networks under fading channels is studied. We mathematically model these impacts and derive the optimal SU packet size. To the best of our knowledge, this is the first work that systematically investigates the optimal SU packet size issue in mobile CR networks.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"57 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":"121039742","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
On optimal diversity in network-coding-based routing in wireless networks 无线网络中基于网络编码的路由中的最优分集
2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218446
Qiao Xiang, Hongwei Zhang, Jianping Wang, G. Xing, Shan Lin, Xue Liu
{"title":"On optimal diversity in network-coding-based routing in wireless networks","authors":"Qiao Xiang, Hongwei Zhang, Jianping Wang, G. Xing, Shan Lin, Xue Liu","doi":"10.1109/INFOCOM.2015.7218446","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218446","url":null,"abstract":"Network coding (NC) based opportunistic routing has been well studied, but the impact of routing diversity on the performance of NC-based routing remains largely unexplored. Towards understanding the importance of routing diversity in NC-based routing, we study the problems of estimating and minimizing the data delivery cost in NC-based routing. In particular, we propose an analytical framework for estimating the total number of packet transmissions for NC-based routing in arbitrary topologies. We design a greedy algorithm that minimizes the total transmission cost of NC-based routing and determines the corresponding forwarder set for each node. We prove the optimality of this algorithm and show that 1) nodes on the shortest path may not always be favored when selecting forwarders for NC-based routing and 2)the minimal cost of NC-based routing is upper-bounded by the cost of shortest path routing. Based on the greedy, optimal algorithm, we design and implement ONCR, a distributed minimal cost NC-based routing protocol. Using the NetEye sensor testbed, we comparatively study the performance of ONCR and existing approaches such as the single path routing protocol CTP and the NC-based opportunistic routing protocols MORE and CodeOR. Results show that ONCR achieves close to 100% delivery reliability while having the lowest delivery cost among all the protocols and 25-28% less than the second best protocol CTP. This low delivery cost also enables ONCR to achieve the highest network goodput, i.e., about two-fold improvement over MORE and CodeOR. Our findings demonstrate the significance of optimizing data forwarding diversity in NC-based routing for data delivery reliability, efficiency, and goodput.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"137 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":"121343174","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}
引用次数: 21
On the performance of successive interference cancellation in D2D-enabled cellular networks 支持d2d的蜂窝网络中连续干扰消除的性能研究
2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218365
Chuan Ma, Weijie Wu, Ying Cui, Xinbing Wang
{"title":"On the performance of successive interference cancellation in D2D-enabled cellular networks","authors":"Chuan Ma, Weijie Wu, Ying Cui, Xinbing Wang","doi":"10.1109/INFOCOM.2015.7218365","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218365","url":null,"abstract":"Device-to-device (D2D) communication underlaying cellular networks is a promising technology to improve network resource utilization. In D2D-enabled cellular networks, the interference among spectrum-sharing links is more severer than that in traditional cellular networks, which motivates the adoption of interference cancellation techniques such as successive interference cancellation (SIC) at the receivers. However, to date, how SIC can affect the performance of D2D-enabled cellular networks is still unknown. In this paper, we present an analytical framework for studying the performance of SIC in large-scale D2D-enabled cellular networks using the tools from stochastic geometry. To facilitate the interference analysis, we propose the approach of stochastic equivalence of the interference, which converts the two-tier interference (interference from both the cellular tier and D2D tier) to an equivalent single-tier interference. Based on the proposed stochastic equivalence models, we derive the general expressions for the successful transmission probabilities of cellular uplinks and D2D links with infinite and finite SIC capabilities respectively. We demonstrate how SIC affects the performance of large-scale D2D-enabled cellular networks by both analytical and numerical results.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"14 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":"131439081","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}
引用次数: 58
TCPRand: Randomizing TCP payload size for TCP fairness in data center networks TCPRand:随机化TCP有效负载大小,以实现数据中心网络中的TCP公平性
2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218550
Soojeon Lee, Myungjin Lee, Dongman Lee, H. Jung, Byoung-Sun Lee
{"title":"TCPRand: Randomizing TCP payload size for TCP fairness in data center networks","authors":"Soojeon Lee, Myungjin Lee, Dongman Lee, H. Jung, Byoung-Sun Lee","doi":"10.1109/INFOCOM.2015.7218550","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218550","url":null,"abstract":"As many-to-one traffic patterns prevail in data center networks, TCP flows often suffer from severe unfairness in sharing bottleneck bandwidth, which is known as the TCP outcast problem. The cause of the TCP outcast problem is the bursty packet losses by a drop-tail queue that triggers TCP timeouts and leads to decreasing the congestion window. This paper proposes TCPRand, a transport layer solution to TCP outcast. The main idea of TCPRand is the randomization of TCP payload size, which breaks synchronized packet arrivals between flows from different input ports. We investigate how TCPRand reduces consecutive packet drops and demonstrate various benefits of TCPRand with extensive experiments and ns-3 simulation. Our evaluation results show that TCPRand guarantees the superior enhancement of TCP fairness with negligible overheads in all of our test cases.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"72 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":"121247209","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
Queuing the trust: Secure backpressure algorithm against insider threats in wireless networks 排队信任:无线网络中对抗内部威胁的安全反压算法
2015 IEEE Conference on Computer Communications (INFOCOM) Pub Date : 2015-08-24 DOI: 10.1109/INFOCOM.2015.7218389
Zhuo Lu, Y. Sagduyu, Jason H. Li
{"title":"Queuing the trust: Secure backpressure algorithm against insider threats in wireless networks","authors":"Zhuo Lu, Y. Sagduyu, Jason H. Li","doi":"10.1109/INFOCOM.2015.7218389","DOIUrl":"https://doi.org/10.1109/INFOCOM.2015.7218389","url":null,"abstract":"The backpressure algorithm is known to provide throughput optimality in routing and scheduling decisions for multi-hop networks with dynamic traffic. The essential assumption in the backpressure algorithm is that all nodes are benign and obey the algorithm rules governing the information exchange and underlying optimization needs. Nonetheless, such an assumption does not always hold in realistic scenarios, especially in the presence of security attacks with intent to disrupt network operations. In this paper, we propose a novel mechanism, called virtual trust queuing, to protect backpressure algorithm based routing and scheduling protocols from various insider threats. Our objective is not to design yet another trust-based routing to heuristically bargain security and performance, but to develop a generic solution with strong guarantees of attack resilience and throughput performance in the backpressure algorithm. To this end, we quantify a node's algorithm-compliance behavior over time and construct a virtual trust queue that maintains deviations from expected algorithm outcomes. We show that by jointly stabilizing the virtual trust queue and the real packet queue, the backpressure algorithm not only achieves resilience, but also sustains the throughput performance under an extensive set of security attacks.","PeriodicalId":342583,"journal":{"name":"2015 IEEE Conference on Computer Communications (INFOCOM)","volume":"56 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":"127703802","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}
引用次数: 9
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信