Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00034
Runa Barik, M. Welzl, A. Elmokashfi, T. Dreibholz, S. Gjessing
DiffServ was designed to implement service provider quality of service (QoS) policies, where ingress and egress routers change the DiffServ Code Point (DSCP) in the IP header. However, nowadays, applications are beginning to directly set the DSCP themselves, in the hope that this will yield a more appropriate service for their respective video, audio and data streams. WebRTC is a prime example of such an application. As a first step towards understanding whether "WebRTC QoS works", we measured, for both IPv4 and IPv6, what happens to DSCP values along Internet paths. Our study is based on end-to-end measurements from 160 IPv4 and 65 IPv6 geographically spread controlled probe clients to 34 IPv4 and 18 IPv6 servers respectively. Clearly, when the DSCP value is changed, the net result may not be what the application desired. We find that this happens often, and conclude with recommendations on how to improve WebRTC and other applications using the DSCP.
{"title":"Can WebRTC QoS Work? A DSCP Measurement Study","authors":"Runa Barik, M. Welzl, A. Elmokashfi, T. Dreibholz, S. Gjessing","doi":"10.1109/ITC30.2018.00034","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00034","url":null,"abstract":"DiffServ was designed to implement service provider quality of service (QoS) policies, where ingress and egress routers change the DiffServ Code Point (DSCP) in the IP header. However, nowadays, applications are beginning to directly set the DSCP themselves, in the hope that this will yield a more appropriate service for their respective video, audio and data streams. WebRTC is a prime example of such an application. As a first step towards understanding whether \"WebRTC QoS works\", we measured, for both IPv4 and IPv6, what happens to DSCP values along Internet paths. Our study is based on end-to-end measurements from 160 IPv4 and 65 IPv6 geographically spread controlled probe clients to 34 IPv4 and 18 IPv6 servers respectively. Clearly, when the DSCP value is changed, the net result may not be what the application desired. We find that this happens often, and conclude with recommendations on how to improve WebRTC and other applications using the DSCP.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125211884","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}
Pub Date : 2018-09-01DOI: 10.1109/itc30.2018.00045
{"title":"[Publisher's information]","authors":"","doi":"10.1109/itc30.2018.00045","DOIUrl":"https://doi.org/10.1109/itc30.2018.00045","url":null,"abstract":"","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126848951","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}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00037
A. Cianfrani, Marco Polverini, Trupti Nalawade
The Ingress Egress Traffic Matrix (IE TM) assessment is a fundamental step of the network management for an ISP network, since it represents the key input parameter used by any Traffic Engineering solution to optimize the resource utilization and to improve the Quality of Service. The actual TM assessment procedures are based on estimation algorithms or measurement based approaches. This paper presents a method to measure the intensity of traffic flows, that overcomes the limits of the classical measurement/estimation based approaches. The idea is to exploit the flexibility of the Segment Routing paradigm to implement controlled routing changes so that to measure the intensity of a subset of network flows. The main contribution of the work is to show the feasibility of the proposed approach by means of a low complexity heuristic, referred to as Path Cost Bases (PaCoB), able to identify the list of routing changes that allow to improve the TM assessment procedure. The heuristic is composed of successive steps, referred to as snapshots: in each snapshot the routing of a set of flows is changed so that to assess their intensities. The performance evaluation show thatPaCoB assesses the intensity of more than 90% of flows. Moreover, when used in conjunction with an estimation algorithm, PaCoB allows to reduce the estimation error by more than 50% performing only 10 snapshots.
{"title":"A Heuristic Approach to Assess the Traffic Matrix of an ISP Exploiting Segment Routing Flexibility","authors":"A. Cianfrani, Marco Polverini, Trupti Nalawade","doi":"10.1109/ITC30.2018.00037","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00037","url":null,"abstract":"The Ingress Egress Traffic Matrix (IE TM) assessment is a fundamental step of the network management for an ISP network, since it represents the key input parameter used by any Traffic Engineering solution to optimize the resource utilization and to improve the Quality of Service. The actual TM assessment procedures are based on estimation algorithms or measurement based approaches. This paper presents a method to measure the intensity of traffic flows, that overcomes the limits of the classical measurement/estimation based approaches. The idea is to exploit the flexibility of the Segment Routing paradigm to implement controlled routing changes so that to measure the intensity of a subset of network flows. The main contribution of the work is to show the feasibility of the proposed approach by means of a low complexity heuristic, referred to as Path Cost Bases (PaCoB), able to identify the list of routing changes that allow to improve the TM assessment procedure. The heuristic is composed of successive steps, referred to as snapshots: in each snapshot the routing of a set of flows is changed so that to assess their intensities. The performance evaluation show thatPaCoB assesses the intensity of more than 90% of flows. Moreover, when used in conjunction with an estimation algorithm, PaCoB allows to reduce the estimation error by more than 50% performing only 10 snapshots.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121928433","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}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00029
Daniela Renga, M. Meo
Due to the staggering increase of mobile traffic, Mobile Network Operators (MNOs) are facing considerable operational cost due to power supply. Renewable Energy (RE) sources to power Base Stations (BSs) represent a promising solution to lower the energy bill, but their intermittent nature may affect the service continuity and the system self-sufficiency. Furthermore, in the new energy market dominated by the Smart Grid, new potentialities arise for MNOs in a Demand Response (DR) framework, since they can dynamically modulate the mobile network energy demand in accordance with SG requests, thus obtaining significant rewards. This work proposes various stochastic models to reliably and accurately characterize the RE production and the operation of a green mobile network, also analyzing the impact of parameter quantization on the model performance. The RE system dimensioning is investigated, trading off cost saving and feasibility constraints, and evaluating the impact of Resource on Demand (RoD) strategies, that allow to achieve more than 40% cost reduction. Finally, by exploiting RoD and WiFi offloading techniques, various energy management policies are designed to enhance the interaction of a green mobile network with the SG in a DR framework, leading to fully erase the energy bill and even gain positive revenues.
{"title":"From Self-Sustainable Green Mobile Networks to Enhanced Interaction with the Smart Grid","authors":"Daniela Renga, M. Meo","doi":"10.1109/ITC30.2018.00029","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00029","url":null,"abstract":"Due to the staggering increase of mobile traffic, Mobile Network Operators (MNOs) are facing considerable operational cost due to power supply. Renewable Energy (RE) sources to power Base Stations (BSs) represent a promising solution to lower the energy bill, but their intermittent nature may affect the service continuity and the system self-sufficiency. Furthermore, in the new energy market dominated by the Smart Grid, new potentialities arise for MNOs in a Demand Response (DR) framework, since they can dynamically modulate the mobile network energy demand in accordance with SG requests, thus obtaining significant rewards. This work proposes various stochastic models to reliably and accurately characterize the RE production and the operation of a green mobile network, also analyzing the impact of parameter quantization on the model performance. The RE system dimensioning is investigated, trading off cost saving and feasibility constraints, and evaluating the impact of Resource on Demand (RoD) strategies, that allow to achieve more than 40% cost reduction. Finally, by exploiting RoD and WiFi offloading techniques, various energy management policies are designed to enhance the interaction of a green mobile network with the SG in a DR framework, leading to fully erase the energy bill and even gain positive revenues.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128296883","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}
Pub Date : 2018-09-01DOI: 10.1109/itc30.2018.10049
J. Boudec, T. Hossfeld, T. Zinner, C. Buratti, P. Heegaard, Matthias Hirth, Yuming Jiang
As early as in mid-1970s, Leonard Kleinrock already highlighted that “We must face the fact that authentic queueing problems seldom satisfy the assumptions made throughout most of the literature available on queueing theory: stationarity is rare, independence occurs only occasionally, and ergodicity is not only unlikely but is also impossible to establish with measurements over a finite time!”. Even though in the past half century, queueing problems and queueing theory have expanded enormously, this fact remains. In addition, modern queueing systems are often required to provide services with guarantees, sometimes even in the worst case. At the same time, Kleinrock also envisioned “an exciting ‘new’ branch of queueing theory. . . that deals with methods for finding approximation or bounding behaviour for queues”. Network calculus is such a ‘new’ theory.
{"title":"Welcome Message from NetCal 2018 Co-Chairs","authors":"J. Boudec, T. Hossfeld, T. Zinner, C. Buratti, P. Heegaard, Matthias Hirth, Yuming Jiang","doi":"10.1109/itc30.2018.10049","DOIUrl":"https://doi.org/10.1109/itc30.2018.10049","url":null,"abstract":"As early as in mid-1970s, Leonard Kleinrock already highlighted that “We must face the fact that authentic queueing problems seldom satisfy the assumptions made throughout most of the literature available on queueing theory: stationarity is rare, independence occurs only occasionally, and ergodicity is not only unlikely but is also impossible to establish with measurements over a finite time!”. Even though in the past half century, queueing problems and queueing theory have expanded enormously, this fact remains. In addition, modern queueing systems are often required to provide services with guarantees, sometimes even in the worst case. At the same time, Kleinrock also envisioned “an exciting ‘new’ branch of queueing theory. . . that deals with methods for finding approximation or bounding behaviour for queues”. Network calculus is such a ‘new’ theory.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128266594","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}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.10061
A. Bouillard, Céline Comte, Élie de Panafieu, F. Mathieu
Stochastic network calculus is a tool for computing error bounds on the performance of queueing systems. However, deriving accurate bounds for networks consisting of several queues or subject to non-independent traffic inputs is challenging. In this paper, we investigate the relevance of the tools from analytic combinatorics, especially the kernel method, to tackle this problem. Applying the kernel method allows us to compute the generating functions of the queue state distributions in the stationary regime of the network. As a consequence, error bounds with an arbitrary precision can be computed. In this preliminary work, we focus on simple examples which are representative of the difficulties that the kernel method allows us to overcome.
{"title":"Of Kernels and Queues: When Network Calculus Meets Analytic Combinatorics","authors":"A. Bouillard, Céline Comte, Élie de Panafieu, F. Mathieu","doi":"10.1109/ITC30.2018.10061","DOIUrl":"https://doi.org/10.1109/ITC30.2018.10061","url":null,"abstract":"Stochastic network calculus is a tool for computing error bounds on the performance of queueing systems. However, deriving accurate bounds for networks consisting of several queues or subject to non-independent traffic inputs is challenging. In this paper, we investigate the relevance of the tools from analytic combinatorics, especially the kernel method, to tackle this problem. Applying the kernel method allows us to compute the generating functions of the queue state distributions in the stationary regime of the network. As a consequence, error bounds with an arbitrary precision can be computed. In this preliminary work, we focus on simple examples which are representative of the difficulties that the kernel method allows us to overcome.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133553888","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}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00030
A. Masucci, P. Olivier, A. Simonian
We address the performance of a system where D2D communications add up to standard cellular traffic in future 5G networks. D2D resources are taken from the Uplink spectrum and, in this framework, two scheduling schemes are envisaged: the first one consists in two independent schedulers working on separate subsets of the Uplink channel, respectively dedicated to Uplink cellular communications and to D2D communications; the second one is a joint scheduler making use of the whole Uplink channel. In both schemes, all communications are scheduled, which in particular avoids the intra-cell interference issue. We propose multi-class Processor Sharing queueing models which account for realistic cellular radio conditions and provide traffic performance in terms of the average throughput for the different classes of flows. From the considered numerical scenarios, we conclude that the joint Uplink scheduling scheme provides better performance and allows D2D users to make an efficient use of their higher potential capacity, due to the device proximity. The corresponding throughput is also shown to be significantly higher than that perceived without any dedicated D2D link.
{"title":"Performance Evaluation of Scheduling Schemes for D2D Communications","authors":"A. Masucci, P. Olivier, A. Simonian","doi":"10.1109/ITC30.2018.00030","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00030","url":null,"abstract":"We address the performance of a system where D2D communications add up to standard cellular traffic in future 5G networks. D2D resources are taken from the Uplink spectrum and, in this framework, two scheduling schemes are envisaged: the first one consists in two independent schedulers working on separate subsets of the Uplink channel, respectively dedicated to Uplink cellular communications and to D2D communications; the second one is a joint scheduler making use of the whole Uplink channel. In both schemes, all communications are scheduled, which in particular avoids the intra-cell interference issue. We propose multi-class Processor Sharing queueing models which account for realistic cellular radio conditions and provide traffic performance in terms of the average throughput for the different classes of flows. From the considered numerical scenarios, we conclude that the joint Uplink scheduling scheme provides better performance and allows D2D users to make an efficient use of their higher potential capacity, due to the device proximity. The corresponding throughput is also shown to be significantly higher than that perceived without any dedicated D2D link.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"01 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130775858","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：