{"title":"Network Path Capacity Comparison without Accurate Packet Time Information","authors":"Ertong Zhang, Lisong Xu","doi":"10.1109/ICNP.2014.32","DOIUrl":"https://doi.org/10.1109/ICNP.2014.32","url":null,"abstract":"A fundamental problem of current bandwidth estimation methods is that they require accurate packet time information. However, it is hard to accurately measure packet time information in an increasing number of network environments, such as widely deployed high speed networks, and emerging cloud computing networks. Motivated by the observation that many applications only need the relative bandwidth information of different paths instead of the actual bandwidth information of a single path, we propose sequence-based bandwidth comparison. Specifically, this paper proposes a capacity comparison method, called Path Comp, which can relatively compare the capacities of the paths from two senders to the same receiver. Path Comp mainly uses the arrival sequence information of packets, and does not require any accurate packet time information. Our test bed, campus network, and EC2 experiments show that Path Comp can not only determine which path is faster but also accurately determine how much faster in a variety of network environments.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123894799","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}
{"title":"Challenges with Transition and User Accounting in Next Generation Networks","authors":"M. Grégr, M. Svéda","doi":"10.1109/ICNP.2014.79","DOIUrl":"https://doi.org/10.1109/ICNP.2014.79","url":null,"abstract":"Future networks may change the way how network administrators monitor and account their users. History shows that usually a completely new design (clean slate) is used to propose a new network architecture - e.g. Network Control Protocol to TCP/IP, IPv4 to IPv6 or IP to Recursive Inter Network Architecture. The incompatibility between these architectures changes the user accounting process as network administrators have to use different information to identify a user. The paper presents a methodology how it is possible to gather all necessary information needed for smooth transition between two incompatible architectures. The transition from IPv4 and IPv6 is used as a use case, but it should be able to use the same process with any new networking architecture.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114133757","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}
Haiyang Wang, R. Shea, Xiaoqiang Ma, Feng Wang, Jiangchuan Liu
{"title":"On Design and Performance of Cloud-Based Distributed Interactive Applications","authors":"Haiyang Wang, R. Shea, Xiaoqiang Ma, Feng Wang, Jiangchuan Liu","doi":"10.1109/ICNP.2014.25","DOIUrl":"https://doi.org/10.1109/ICNP.2014.25","url":null,"abstract":"Distributed interactive applications (DIAs) such as online gaming have attracted a vast number of users over the Internet. It is however known that the deployment of DIA systems comes with peculiar hardware/software requirements on the users' consoles. Recently, such industrial pioneers as Gaikai, Onlive and Ciinow have offered a new based distributed interactive applications generation of cloud (CDIAs), which shift the necessary computing loads to cloud platforms and largely relieve the pressure on individual user consoles. In this paper, we take a first step towards understanding the CDIA framework and highlight its design challenges. Our measurement reveals the inside structure as well as the operations of real CDIA systems and identifies the critical role of the cloud proxies. While this design makes effective use of cloud resources to mitigate the clients' workloads, it can also significantly increase the interaction latency among clients if not carefully handled. Besides the extra network latency due to the involvement of cloud proxies, we find that the computation-intensive tasks (e.g., Game rendering) and bandwidth-intensive tasks (e.g., Streaming the game screen to the clients) together create a severe bottleneck in CDIA. Our experiment indicates that when the cloud proxies are virtual machines (VMs) in the cloud, the computation-intensive and bandwidth-intensive tasks will seriously interfere with each other if not handled carefully. We accordingly capture this feature in our model and present an interference-aware solution. This approach not only smartly allocates the workloads but also dynamically assigns the capacities across VMs.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114206491","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}
{"title":"Constrained Maximum Flow in Stochastic Networks","authors":"F. Kuipers, Song Yang, S. Trajanovski, A. Orda","doi":"10.1109/ICNP.2014.63","DOIUrl":"https://doi.org/10.1109/ICNP.2014.63","url":null,"abstract":"Solving network flow problems is a fundamental component of traffic engineering and many communications applications, such as content delivery or multi-processor scheduling. While a rich body of work has addressed network flow problems in \"deterministic networks\" finding flows in \"stochastic networks\" where performance metrics like bandwidth and delay are uncertain and solely known by a probability distribution based on historical data, has received less attention. The work on stochastic networks has predominantly been directed to developing single-path routing algorithms, instead of addressing multi-path routing or flow problems. In this paper, we study constrained maximum flow problems in stochastic networks, where the delay and bandwidth of links are assumed to follow a log-concave probability distribution, which is the case for many distributions that could represent bandwidth and delay. We formulate the maximum-flow problem in such stochastic networks as a convex optimization problem, with a polynomial (in the input) number of variables. When an additional delay constraint is imposed, we show that the problem becomes NP-hard and we propose an approximation algorithm based on convex optimization. Furthermore, we develop a fast heuristic algorithm that, with a tuning parameter, is able to balance accuracy and speed. In a simulation-based evaluation of our algorithms in terms of success ratio, flow values, and running time, our heuristic is shown to give good results in a short running time.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126179609","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}
Qing Wang, Ke Xu, Ryan Izard, Benton Kribbs, Joseph Porter, Kuang-Ching Wang, Aditya Prakash, P. Ramanathan
{"title":"GENI Cinema: An SDN-Assisted Scalable Live Video Streaming Service","authors":"Qing Wang, Ke Xu, Ryan Izard, Benton Kribbs, Joseph Porter, Kuang-Ching Wang, Aditya Prakash, P. Ramanathan","doi":"10.1109/ICNP.2014.84","DOIUrl":"https://doi.org/10.1109/ICNP.2014.84","url":null,"abstract":"This paper introduces GENI Cinema (GC), a system that provides a scalable live video streaming service based on dynamic traffic steering with software defined networking (SDN) and demand driven instantiation of video relay servers in NSF GENI's distributed cloud environments. While the service can be used to relay a multitude of video content, its initial objective is to support live video streaming of educational content such as lectures and seminars among university campuses. Users on any campus would bootstrap video upload or download via a public Web portal and, for scalability, have the video delivered seamlessly across the network over one or multiple paths selected and dynamically controlled by GC. The architecture aims to provide a framework for addressing several well-known limitations of video streaming in today's Internet, where little control is available for controlling forwarding paths of on demand live video streams. GC utilizes GENI's distributed cloud servers to host on-demand video servers/relays and its Open Flow SDN to achieve seamless video upload/download and optimization of forwarding paths in the network core. This paper presents the architecture and an early prototype of the basic GC framework, together with some initial performance measurement results.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126467420","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}
{"title":"IP45: Architecture, Design, and Implementation","authors":"Tomas Podermanski, M. Svéda","doi":"10.1109/ICNP.2014.76","DOIUrl":"https://doi.org/10.1109/ICNP.2014.76","url":null,"abstract":"This dissertation outline discusses an experimental network architecture and protocol design. The aim of the work is to prove that a network architecture which follows some key principles can bring interesting build-in features. As a proof of concept, a model of architecture was designed into protocol specification which extends existing protocols. One of the interesting feature is that such protocol can regain End-to-End addressing in the NAT based architecture without laborious transition to a new protocol.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131184520","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}
{"title":"Data Plane Programmability in SDN","authors":"H. Farhadi, HyunYong Lee, A. Nakao","doi":"10.1109/ICNP.2014.93","DOIUrl":"https://doi.org/10.1109/ICNP.2014.93","url":null,"abstract":"Software-Defined Networking (SDN) research, from the beginning, focuses more on the development and programmability of the control plane. In this paper, first we posit that we need data plane focused research in addition to control plane for SDN. Then, we review data plane related contributions in SDN to indicate there is a gap that need to be considered from the community. Next, we review some existing technologies that can be used to realize a software-centric SDN data plane compared with the current hardware-centric proposals. Finally, we discuss challenges and directions for the community as the future steps in SDN data plane development.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132912755","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}
{"title":"SensCrypt: A Secure Protocol for Managing Low Power Fitness Trackers","authors":"Mahmudur Rahman, Bogdan Carbunar, Umut Topkara","doi":"10.1109/ICNP.2014.38","DOIUrl":"https://doi.org/10.1109/ICNP.2014.38","url":null,"abstract":"The increasing interest in personal telemetry has induced a popularity surge for wearable personal fitness trackers. Such trackers automatically collect sensor data about the user throughout the day, and integrate it into social network accounts. Solution providers have to strike a balance between many constraints, leading to a design process that often puts security in the back seat. Case in point, we reverse engineered and identified security vulnerabilities in Fit bit Ultra and Gammon Forerunner 610, two popular and representative fitness tracker products. We introduce Fit Bite and GarMax, tools to launch efficient attacks against Fit bit and Garmin. We devise SensCrypt, a protocol for secure data storage and communication, for use by makers of affordable and lightweight personal trackers. SensCrypt thwarts not only the attacks we introduced, but also defends against powerful JTAG Read attacks. We have built Sens.io, an Arduino Uno based tracker platform, of similar capabilities but at a fraction of the cost of current solutions. On Sens.io, SensCrypt imposes a negligible write overhead and significantly reduces the end-to-end sync overhead of Fit bit and Garmin.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129456341","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}
Junghyun Jun, Long Cheng, Liang He, Yu Gu, Ting Zhu
{"title":"Exploiting Sender-Based Link Correlation in Wireless Sensor Networks","authors":"Junghyun Jun, Long Cheng, Liang He, Yu Gu, Ting Zhu","doi":"10.1109/ICNP.2014.67","DOIUrl":"https://doi.org/10.1109/ICNP.2014.67","url":null,"abstract":"Link correlation in wireless sensor networks has recently attracted a considerable amount of attention in the research community. Various pioneer works have empirically demonstrated the existence of link correlations and designed novel network protocols to exploit such link correlations. While all existing works focus on the correlated receptions at multiple receivers from a single sender, in this work we empirically demonstrate another type of link correlation, called sender-based link correlation. For sender-based link correlation, we observe wireless links from multiple senders to a single receiver are also correlated. Based on this observation, we design a two-tiered data forwarding scheme for improving the energy efficiency of unicast in the network. At the micro-level, individual nodes reduce their transmission energy consumption by temporarily switching to a new forwarder or suppressing the current transmission with the knowledge of link correlations. At the macro-level, we schedule the ordering of transmission times among neigh boring nodes so that the gains from all link correlation information in the network is maximized. Through trace-driven emulations and large scale simulations, we demonstrate that our design reduces data retransmissions by an average of 12% when compared with already highly energy efficient ETX-based protocols.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130114848","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}
{"title":"Composing Heterogeneous SDN Controllers with Flowbricks","authors":"A. Dixit, Kirill Kogan, P. Eugster","doi":"10.1109/ICNP.2014.50","DOIUrl":"https://doi.org/10.1109/ICNP.2014.50","url":null,"abstract":"The software-defined networking (SDN) paradigm allows network operators to conveniently deploy network services through a centralized controller. Recent interest in SDNs has fueled the implementation of a variety of network services on controllers written in different languages and supported by different organizations. Given the large number of network services and their increasing complexity, no single controller can provide all network services. Even if a controller provides all the desired services, it is unlikely to have the best-in-class implementation of all those services. To address this problem, we propose a framework for composing a control plane using controllers from different vendors. The framework applies services implemented on heterogeneous controllers to the same network traffic. Allowing network operators to deploy services implemented on heterogeneous controllers prevents vendor lock-in at the control plane. Furthermore, network operators can quickly deploy a new service by integrating a controller (possibly supplied by a different vendor) into the framework. Our framework is designed to operate in a way that is transparent to the controllers and does not require additional standardization.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115092800","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}