{"title":"Performance modelling and analysis of unreliable links with retransmissions using network calculus","authors":"Hao Wang, J. Schmitt, F. Ciucu","doi":"10.1109/ITC.2013.6662955","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662955","url":null,"abstract":"During the last two decades, starting with the seminal work by Cruz, network calculus has evolved as an elegant system theory for the performance analysis of networked systems. It has found numerous usages as, for example, in QoS-enabled networks, wireless sensor networks, switched Ethernets, avionic networks, Systems-on-Chip, or, even to speed-up simulations. One of the basic assumptions in network calculus is that links are reliable and operate loss-free. This, of course, is a major abstraction from the reality of many application scenarios, where links are unreliable and often use retransmission schemes to recover from packet losses. As of today, standard network calculus cannot analyze such links. In this paper, we take the challenge to extend the reach of network calculus to unreliable links which employ retransmission-based loss recovery schemes. Key to this is a stochastic extension of the known data scaling element in network calculus [21], which can capture the loss process of an unreliable link. Based on this, modelling links with retransmissions results in a set of equations which are amenable to a fixed-point solution. This allows to find the arrival constraints of each flow that corresponds to a certain number of retransmissions. Based on the description of each retransmission flow, probabilistic performance bounds can be derived. After providing the necessary theory, we illustrate this novel and important extension of network calculus with the aid of a numerical example.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"5 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":"127553934","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":"IP mining: Extracting knowledge from the dynamics of the Internet addressing space","authors":"P. Casas, P. Fiadino, A. Bär","doi":"10.1109/ITC.2013.6662933","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662933","url":null,"abstract":"Going back to the Internet of one decade ago, HTTP-based content and web services were provided by centralized or barely distributed servers. Single hosts providing exclusive services at fixed IP addresses was the standard approach. Current situation has drastically changed, and the mapping of IPs to different content and services is nowadays extremely dynamic. The adoption of large CDNs by major Internet players, the extended usage of transparent content caching, the explosion of Cloud-based services, and the decoupling between content providers and the hosting infrastructure have created a difficult to manage Internet landscape. Understanding such a complex scenario is paramount for network operators, both to control the traffic on their networks and to improve the quality experienced by their customers, specially when something goes wrong. Using a full week of HTTP traffic traces collected at the mobile broadband network of a major European ISP, this paper studies the associations between web services, the hosting organizations/ASes, and the content servers' IPs. By mining correlations among these, we extract useful insights about the dynamics of the IP addressing space used by the top web services, and the way content providers and hosting organizations deliver their services to the mobile end-users. The extracted knowledge is applied on two specific use-cases, the former on hosting and service delivery characterization, the latter on automatic IP-based HTTP services classification.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"15 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":"129774985","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}
Marcos Ciarrocchi, Aruna Prem Bianzino, M. Mellia, P. Donadio, G. Parladori
{"title":"Energy-aware weight assignment framework for circuit oriented GMPLS networks","authors":"Marcos Ciarrocchi, Aruna Prem Bianzino, M. Mellia, P. Donadio, G. Parladori","doi":"10.1109/ITC.2013.6662961","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662961","url":null,"abstract":"A branch of green networking research is consolidating. It aims at routing traffic with the goal of reducing the network energy consumption. It is usually referred to as Energy-Aware Routing. Previous works in this branch only focused on pure IP networks, e.g., assuming an Open Shortest Path First (OSPF) control plane, and best effort packet forwarding on the data plane. In this work, we consider instead Generalized Multi-Protocol Label Switching (GMPLS) backbone networks, where optical technologies allow to design “circuit switching” network management policies with strict bandwidth reservation policies. We define a simple and generic framework which generates a family of routing algorithms, based on an energy-aware weight assignment. In particular, routing weights are functions of both the energy consumption and the actual load of network devices. Using such weights, a simple minimum-cost routing allows finding the current least expensive circuit, minimising the additional energy cost. Results obtained on realistic case studies show that our weight assignment policy favours a consistent reduction of the network power consumption, without significantly affecting the network performance. Furthermore, the framework allows to trade energy efficiently and network performance, a desirable property at which ISPs are looking for. Simple and robust parameter settings allow reaching a win-win situation, with excellent performance in terms of both energy efficiency and network resource utilization.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"25 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":"132682385","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}
M. A. Arfeen, K. Pawlikowski, D. McNickle, A. Willig
{"title":"The role of the Weibull distribution in Internet traffic modeling","authors":"M. A. Arfeen, K. Pawlikowski, D. McNickle, A. Willig","doi":"10.1109/ITC.2013.6662948","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662948","url":null,"abstract":"This paper highlights the important role played by the two parameter Weibull distribution in Internet traffic modeling. Internet traffic structurally consists of sessions, flows and packets; and traverses through different tiers of service providers during its end-to-end journey. Observation of invariant heavy tails in access traffic patterns of individual users has motivated us to investigate traffic transformation/aggregation as it traverses from access to core network. We found that the flexible nature of the Weibull distribution can capture this transformation at inter-arrival level. We also present and justify our hypothesis that given a suitable scale parameter specific to a certain access media or tier, the Weibull shape parameter can be used to zoom in from session to flow and to the packet level inter-arrivals.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"55 51","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131604034","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":"The aftermath of prefix deaggregation","authors":"Andra Lutu, C. Pelsser, M. Bagnulo, Kenjiro Cho","doi":"10.1109/ITC.2013.6662950","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662950","url":null,"abstract":"Prefix deaggregation is recognized as a steady long-lived phenomenon at the interdomain level, despite its well-known negative effects for the community. The advertisement of more-specific prefixes provides network operators with a fine-grained method to control the interdomain ingress traffic. Moreover, customer networks combining this mechanism with selective advertisements may decrease their monthly transit traffic bill and potentially impact the business of their providers. In this paper, we develop a methodology for Internet Service Providers (ISPs) to monitor new occurrences of prefix deaggregation within their customer base. Moreover, the ISPs can detect on their own when deaggregation may decrease the transit bill of their customer networks. We first examine the ISP's BGP routing data for new cases of prefix deaggregation generated by customers. Then, we check for selective advertisements of the newly generated prefixes using external routing data. We look beyond the incentives for deploying this type of strategy and instead we examine its economic impact. We exemplify the proposed methodology on a complete set of data including routing, traffic, topological and billing information provided by a major Japanese ISP and we discuss the implications of the obtained results.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"12 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":"133137098","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":"Observability and independence in distributed sensing and its application","authors":"H. Saito","doi":"10.1109/ITC.2013.6662931","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662931","url":null,"abstract":"This paper addresses the observability and independence of a system monitored using networked distributed sensors under the assumption that some sensing results are indiscriminable. We theoretically analyze the independence of sensing templates, that is, whether sensing systems are not redundant, and the observability of such systems, that is, whether we can determine the state of a system from the sensing results. Application examples to which the results given in this paper can be applied are: (1) end-to-end network quality monitored by end users in which the route actually used is not known and (2) object detection/non-detection by binary sensors randomly deployed without positioning mechanisms.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"35 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":"134054908","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":"Specificity vs. flexibility: On the embedding cost of a virtual network","authors":"Arne Ludwig, S. Schmid, A. Feldmann","doi":"10.1109/ITC.2013.6662940","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662940","url":null,"abstract":"The virtualization trend in today's Internet decouples services from the constraints of the underlying physical infrastructure. This decoupling facilitates more flexible and efficient resource allocations: the service can be realized at any place in the substrate network which fulfills the service specification requirements.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"248 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":"121879961","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":"On deriving stable backlog bounds by stochastic network calculus","authors":"Yue Wang","doi":"10.1109/ITC.2013.6662954","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662954","url":null,"abstract":"Network calculus is a powerful methodology of characterizing queueing processes and has wide applications. In this work1, we focus on the fundamental problem of “under what condition can we derive stable backlog bounds using the current state of art of stochastic network calculus”. We model an network element (called a “node” here) as a single server with impairment service based on two best-known models in stochastic network calculus (one is first proposed by Cruz and the other is first proposed by Yaron and Sidi). We find that they actually derive equivalent stochastic service curves and backlog bounds. And we prove that stable backlog bounds can be derived by stochastic network calculus as long as the average rate of traffic arrival is less than that of service. This work suggests the effectiveness of stochastic network calculus in theory.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"49 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":"126318924","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":"Effect of degree-preserving, assortative rewiring on OSPF router configuration","authors":"Rogier Noldus, P. Mieghem","doi":"10.1109/ITC.2013.6662963","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662963","url":null,"abstract":"We study the impact of degree-preserving rewiring on the routing table configuration in an OSPF network. Degree-preserving rewiring may be applied to optimize specific network characteristics, such as assortativity. Rewiring has significant impact on IP router tables. This manifests itself through the number of nodes that are affected by the rewiring and the average number of routing table entries that are modified per affected node. Networks with high link density are generally less impacted. Through the use of Software Defined Networks (SDN), a number of rewiring steps can be aggregated, leading to fewer routing table updates in total. For aggregation of 15 - 20 rewiring steps, depending on network class and characteristics, almost all nodes in the network are affected.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"5 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":"130015044","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 of user demand patterns and locality for YouTube traffic","authors":"Å. Arvidsson, Manxing Du, A. Aurelius, M. Kihl","doi":"10.1109/ITC.2013.6662935","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662935","url":null,"abstract":"Video content, of which YouTube is a major part, constitutes a large share of residential Internet traffic. In this paper, we analyse the user demand patterns for YouTube in two metropolitan access networks with more than 1 million requests over three consecutive weeks in the first network and more than 600,000 requests over four consecutive weeks in the second network. In particular we examine the existence of “local interest communities”, i.e. the extent to which users living closer to each other tend to request the same content to a higher degree, and it is found that this applies to (i) the two networks themselves; (ii) regions within these networks (iii) households with regions and (iv) terminals within households. We also find that different types of access devices (PCs and handhelds) tend to form similar interest communities. It is also found that repeats are (i) “self-generating” in the sense that the more times a clip has been played, the higher the probability of playing it again, (ii) “long-lasting” in the sense that repeats can occur even after several days and (iii) “semiregular” in the sense that replays have a noticeable tendency to occur with relatively constant intervals. The implications of these findings are that the benefits from large groups of users in terms of caching gain may be exaggerated, since users are different depending on where they live and what equipment they use, and that high gains can be achieved in relatively small groups or even for individual users thanks to their relatively predictable behaviour.","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":"114115950","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}