{"title":"Engineering elastic traffic in TCP-based networks: Processor sharing and effective service time","authors":"G. Hoekstra, R. Mei, N. Diaz-Feraren","doi":"10.1109/ITC.2013.6662958","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662958","url":null,"abstract":"Today, a wide range of networks exist that provide users with data services using TCP. For performance engineering of such networks there is a need for simple but accurate models to predict the performance under anticipated load conditions. This is a challenging task, because the combined packet-level dynamics of the network-protocol stack are highly complicated. First, we explain how the packet-level dynamics and protocol overhead of the multiple communication layers can be successfully captured by a single parameter, called the effective service time (EST), and give a full parameterization that explicitly expresses the EST in terms of the network parameters. Second, we show how the transfer-time performance can be modeled by a classical M/G/1 Processor Sharing (PS) model, but where the service time is replaced by the EST. Finally, extensive test-lab experimentation shows that the model leads to highly accurate predictions over a wide range of parameter combinations, including light- and heavy-tailed file-size distributions and light-and heavy-load scenarios. The simplicity and accuracy of the model make the results of high practical relevance and useful for performance engineering purposes.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"313 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131112111","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":"Analysis for unfairness of TCP outcast problem in data center networks","authors":"Yang Qin, Yao Shi, Qiwei Sun, Liqun Zhao","doi":"10.1109/ITC.2013.6662965","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662965","url":null,"abstract":"There is a form of unfairness phenomenon found in data center networks,which was identified by P. Prakash. This phenomenon shows that the throughput of a flow with smaller RTT is less than the throughput of a flow with large RTT. This is completely contrary to the classic TCP protocol. P. Prakash gives an explanation based on port blackout theory. However, after careful analysis, we have found another reason for this unusual phenomenon, which may be more important. This is because of an unfair distribution of the flows with different RTT on the physical link and the differences in congestion window size when finishing the current block transmission. In this paper, we develop an analytical model for the goodput in the outcast behavior. Then, we design a window notification based protocol to address this phenomenon. By using the mean value of the congestion window measurement, we unified the congestion window size for flows with different RTT, which improves the goodput of the flows with small RTT. By designing several experiments using the ns-2 simulator, we demonstrate that our explanation of outcast phenomenon is correct. Furthermore, we verify the effectiveness of the proposed algorithms.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"22 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114625098","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":"OSone: A distributed operating system for energy efficient Sensor Network","authors":"B. Pásztor, P. Hui","doi":"10.1109/ITC.2013.6662959","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662959","url":null,"abstract":"In this paper, we take a new approach of thinking about programming Wireless Sensor Networks (WSNs) and introduce OSone, a distributed operating system (OS) for sensor transparency. Our philosophy is to make the network look like an ordinary computer, where each sensor of the network can be thought of one or multiple applications. Such a system allows software developers to abstract away from networking protocols and low-level operating system issues, and develop complex, cooperating systems. In our system, the base station acts as the “kernel” of the OS, while applications run on the sensor nodes. To evaluate the system, we use smart home as our application scenario, where the house adapts to the people living in it - turns on and off the heating and light, warns if the doors are left open, and so on. For such an application, a sensor network is the ideal solution. We show that our system can scale up to a hundred nodes without affecting the responsiveness, it can move 96% of the energy consumption to the central kernel node; and can be about 30% more efficient than a traditional approach.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115693170","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}
F. Guillemin, Bruno Kauffmann, S. Moteau, A. Simonian
{"title":"Experimental analysis of caching efficiency for YouTube traffic in an ISP network","authors":"F. Guillemin, Bruno Kauffmann, S. Moteau, A. Simonian","doi":"10.1109/ITC.2013.6662934","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662934","url":null,"abstract":"In this paper, we report YouTube traffic measurements from Orange IP backbone network connecting residential customers. We exhibit its salient features in relation to the performance of caching. By examining the file popularity distribution, we show that video requests are highly volatile in that a huge number of files are viewed only a few times; these files are therefore not relevant for caching. Nevertheless, there is a subset of files which are massively viewed by end users and are worth caching. On the basis of this experimental observation, we develop a mathematical model for estimating the efficiency of file caching in the presence of noise traffic composed of those files which are rarely requested and thus “pollute” the cache. We then proceed to trace-driven simulations in order to check the qualitative conclusions derived from the theoretical model.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124773091","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}
A. Gaivoronski, Darijus Strasunskas, P. Nesse, S. Svaet
{"title":"Beyond best effort: Choosing connectivity portfolio for cloud brokering platform by risk/profit tradeoff","authors":"A. Gaivoronski, Darijus Strasunskas, P. Nesse, S. Svaet","doi":"10.1109/ITC.2013.6662946","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662946","url":null,"abstract":"We utilize portfolio theory of finance and investment science in order to show how a cloud broker can select a portfolio of connectivities in order to accommodate requirements for cloud services of users, who need better than the best effort Quality of Service (QoS). Following economic theory, we assume that cloud broker makes his decision by choosing appropriate tradeoff between profit and risk. The risk has two sources: uncertain demand and uncertain connectivity quality. Using Internet traffic data we show that it is possible to deliver considerably higher QoS by selection of connectivity portfolios that combine the best effort connectivity of different grades with premium grade connectivity.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127742046","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":"Efficient traffic splitting in parallel TCP-based wireless networks: Modelling and experimental evaluation","authors":"G. Hoekstra, R. Mei, J. Bosman","doi":"10.1109/ITC.2013.6662945","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662945","url":null,"abstract":"The concurrent use of networks provides a powerful means to boost performance in areas covered by multiple networks where only limited bandwidth is available. However, despite its enormous potential for performance improvement only little is known about how to effectively exploit the potential for performance improvement in practical deployments. This raises the need for traffic-splitting-and-reassembly algorithms that are effective, yet simple and easy-to-deploy. Motivated by this, we first propose a simple analytic flow-level model, called the Concurrent Access Network (CAN) model, that optimally splits traffic in the idealized situation where there is full state information at infinitely fine-grained time granularity, leading to zero synchronization delay during the reassembly phase. Next, we present a new splitting algorithm for TCP-based networks that uses a simple score function to make on-the-fly decisions on the routing of individual TCP segments, based on the measured per-connection RTT, transmission-buffer content and throughput. Then, we use the CAN-model as a benchmark to evaluate the effectiveness and practical usefulness of the score-function based algorithm on real TCP networks in a test-lab environment. Extensive lab experimentation demonstrates that this score-function based splitting of TCP traffic is extremely efficient, leads to close-to-optimal response-time performance and is easily deployable.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123784358","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":"Performance approximations for non-real-time traffic in an integrated service system","authors":"Yue-Cai Huang, K. Ko, M. Zukerman","doi":"10.1109/ITC.2013.6662966","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662966","url":null,"abstract":"We consider an integrated service system, where real-time (RT) calls of multiple rate requirements and non-real-time (NRT) calls share the total system capacity. Typically, RT calls are given strict priority over NRT calls, therefore, NRT performance is dependent on the RT process. When RT call arrival processes are not Poisson processes, the effect of the RT traffic burstiness on the NRT performance has not been investigated. In this paper, we investigate the effect and provide a computationally efficient approximation for the NRT performance evaluation in the integrated service system with multi-rate non-Poisson RT traffic. With known first and second moments of the RT call arrival processes, we propose to consider the multi-rate non-Poisson RT traffic streams as an equivalent single-rate Poisson traffic stream. Then we evaluated the NRT performance by converting the original system to a system offered with the equivalent RT traffic and the NRT traffic. Our approximation is validated with extensive numerical examples.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130459764","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":"Modeling the interaction between TCP and rate adaptation at links","authors":"Faheem Khuhawar, M. Mellia, M. Meo","doi":"10.1109/ITC.2013.6662951","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662951","url":null,"abstract":"In this paper, we model and investigate the interaction between the TCP protocol and rate adaptation at intermediate routers. Rate adaptation aims at saving energy by controlling the offered capacity of links and adapting it to the amount of traffic. However, when TCP is used at the transport layer, the control loop of rate adaptation and one of the TCP congestion control mechanism might interact and disturb each other, compromising throughput and Quality of Service (QoS). Our investigation is lead through mathematical modeling consisting in depicting the behavior of TCP and of rate adaption through a set of Delay Differential Equations (DDEs). The model is validated against simulation results and it is shown to be accurate. The results of the sensitivity analysis of the system performance to control parameters show that rate adaptation can be effective but a careful parameter setting is needed to avoid undesired disruptive interaction among controllers at different levels, that impair QoS.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115167834","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":"A performance analysis study of multipath routing in a hybrid network with mobile users","authors":"A. Bejan, R. Gibbens, Yeon-sup Lim, D. Towsley","doi":"10.1109/ITC.2013.6662938","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662938","url":null,"abstract":"Mobile communication platforms of individual agents and ground vehicles, ships and aircrafts of both civil and military services often operate in highly dynamic conditions with constantly changing infrastructure and access to communication resources. Efficient techniques for rapid and yet stable communication of such fleets with their control centres and between cooperating vehicles within the fleet is a challenging but important area of study with the potential to facilitate the analysis and design of efficient and robust communication systems. Multipath extensions of data transmission protocols aim to take advantage of path diversity to achieve efficient and robust bandwidth allocation while maintaining stability. Such multipath resource pooling extensions of routing and congestion control intrinsically implement decentralisation with implicit resource sharing. In this paper, we build on the recent theoretical work on fluid model approximations of multipath TCP and study their application to the scenarios in which a convoy with two communication nodes (representing the convoy's head and tail) establishes channels with a set of radio/WiFi towers and a satellite relaying information to a remote destination; these channels have time-varying capacities which depend on the position and dynamics of the convoy. The paper studies the performance of a multipath TCP controller and demonstrates how path diversity can be implicitly utilised to spread flows across available paths. Furthermore, we study the patterns of sub-flows governed by dynamic control according to the motion of the convoy and investigate the trade-offs between resource utilisation and the speed of response by the sub-flows.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123622585","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":"Modeling ISP tier design","authors":"Wei Dai, S. Jordan","doi":"10.1109/ITC.2013.6662957","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662957","url":null,"abstract":"We model how Internet Service Providers design tier rates, tier prices, and network capacity. Web browsing and video streaming are considered as the two dominant Internet applications. We propose a novel set of utility functions that depend on a user's willingness to pay for each application, the performance of each application, and the time devoted to each application. For a monopoly provider, the demand function for each tier is derived as a function of tier price and performance. We first give conditions for the tier rates, tier prices, and network capacity that maximize Internet Service Provider profit, defined as subscription revenue minus capacity cost. We then show how an Internet Service Provider may simplify tier and capacity design, by allowing their engineering department to set network capacity, their marketing department to set tier prices, and both to jointly set tier rates. Numerical results are presented to illustrate the magnitude of the decrease in profit resulting from such a simplified design.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126168805","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}