Browse the ITC publications of previous conferences below or visit our grouppage at bibsonomy.org
2018
Liebeherr, Jörg
A Fluid-Flow Interpretation of SCED Scheduling
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Liebeherr18ITC30,
title = { A Fluid-Flow Interpretation of SCED Scheduling },
year = { 2018 },
address = { Vienna, Austria },
author = { Liebeherr, Jörg },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: We show that a fluid-flow interpretation of Service Curve Earliest Deadline First (SCED) scheduling simplifies deadline derivations for this scheduler. By exploiting the recently reported isomorphism between min-plus and max-plus network calculus and expressing deadlines in a max-plus algebra deadline computations no longer require pseudo-inverse computations. SCED deadlines are provided for general convex or concave piecewise linear service curves.
Burchard, Almut and Liebeherr, Jörg
A General Per-Flow Service Curve for GPS
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Burchard18ITC30,
title = { A General Per-Flow Service Curve for GPS },
year = { 2018 },
address = { Vienna, Austria },
author = { Burchard, Almut and Liebeherr, Jörg },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Generalized Processor Sharing (GPS), which provides the theoretical underpinnings for fair packet scheduling algorithms, has been studied extensively. However, a tight formulation of the available service of a flow only exists for traffic that is regulated by affine arrival envelopes and constant-rate links. In this paper, we show that the universal service curve by Parekh and Gallager can be extended to concave arrival envelopes and links with time-variable capacity. We also dispense with the previously existing assumption of a stable system.
Cianfrani, Antonio and Polverini, Marco and Nalawade, Trupti
A Heuristic Approach to Assess the Traffic Matrix of an ISP Exploiting Segment Routing Flexibility
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Cianfrani18ITC30,
title = { A Heuristic Approach to Assess the Traffic Matrix of an ISP Exploiting Segment Routing Flexibility },
year = { 2018 },
address = { Vienna, Austria },
author = { Cianfrani, Antonio and Polverini, Marco and Nalawade, Trupti },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: The Ingress Egress Traffic Matrix (IE TM) assessment is a fundamental step of the network management for an ISP network, since the TM represents the key input parameter used by any Traffic Engineering solutions able to optimize the resource utilization and to improve the Quality of Service. The actual TM assessment procedure 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 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 shows that PaCoB 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% with 10 snapshots.
Enguehard, Marcel and Carofiglio, Giovanna and Rossi, Dario
A Popularity-Based Approach for Effective Cloud Offload in Fog Deployments
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Enguehard18ITC30,
title = { A Popularity-Based Approach for Effective Cloud Offload in Fog Deployments },
year = { 2018 },
address = { Vienna, Austria },
author = { Enguehard, Marcel and Carofiglio, Giovanna and Rossi, Dario },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Recent research has put forward the concept of Fog computing, a deported intelligence for IoT networks. Fog clusters are meant to complement current cloud deployments, providing compute and storage resources directly in the access network - which is particularly useful for low-latency applications. However, Fog deployments are expected to be less elastic than cloud platforms, since elasticity in Cloud platforms comes from the scale of the data-centers. Thus, a Fog node dimensioned for the average traffic load of a given application will be unable to handle sudden bursts of traffic. In this paper, we explore such a use-case, where a Fog-based latency-sensitive application must offload some of its processing to the Cloud. We build an analytical queueing model for deriving the statistical response time of a Fog deployment under different request Load Balancing (LB) strategies, contrasting a naive, an ideal (LFU-LB, assuming a priori knowledge of the request popularity) and a practical (LRU-LB, based on online learning of the popularity with an LRU filter) scheme. Using our model, and confirming the results through simulation, we show that the LRU-LB achieves close-to- ideal performance, with high savings on Cloud offload cost with respect to a request-oblivious strategy in the explored scenarios.
Schmidt, Mark and Stockmayer, Andreas and Heimgaertner, Florian and Menth, Michael
A Semi-Virtualized Testbed Cluster with a Centralized Server for Networking Education
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Schmidt18ITC30,
title = { A Semi-Virtualized Testbed Cluster with a Centralized Server for Networking Education },
year = { 2018 },
address = { Vienna, Austria },
author = { Schmidt, Mark and Stockmayer, Andreas and Heimgaertner, Florian and Menth, Michael },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Hands-on computer networking labs are essential in many computer science curricula. They are conducted either on physical testbeds consisting of PCs, routers, switches, cables, etc., or on fully virtualized testbeds. The latter consist of only virtual machines (VM) that can be interconnected via software configuration. Fully virtualized testbeds require less resources (hardware, space, energy) than physical testbeds but students miss important hands-on experience with networking equipment. In this work, we present a semi-virtualized testbed: students are given physical access to networking interfaces of VMs via patch panels so that they can interconnect them through cables. Similarly to virtualized testbeds, the semi-virtualized testbed requires only little hardware and maintenance effort while preserving the hands-on experience of physical testbeds. We present a Python-based orchestration platform for several virtual student workspaces on a single physical server. Each virtual student workspace contains several VMs acting as clients, servers, and routers that can be configured by students. It is made available to a physical workspace on a 19-inch cabinet consisting of a thin client and patch panels allowing students to physically interconnect their VMs with cables.
Hohlfeld, Oliver and Reelfs, Helge and Rüth, Jan and Schmidt, Florian and Zimmermann, Torsten and Hiller, Jens and Wehrle, Klaus
Application-Agnostic Offloading of Datagram Processing
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Hohlfeld18ITC30,
title = { Application-Agnostic Offloading of Datagram Processing },
year = { 2018 },
address = { Vienna, Austria },
author = { Hohlfeld, Oliver and Reelfs, Helge and Rüth, Jan and Schmidt, Florian and Zimmermann, Torsten and Hiller, Jens and Wehrle, Klaus },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: As network speed increases, servers struggle to serve all requests directed at them. This challenge is rooted in a partitioned data path where the split between the kernel space networking stack and user space applications induces overheads. To address this challenge, we propose Santa, a architecture to optimize the data path by enabling server applications to (partially) offload packet processing to a generic rule processor. We exemplify Santa by showing how it can drastically accelerate kernel-based UDP packet processingâ\text\euro''a currently neglected domain. Our evaluation focuses on accelerating DNS server for which we find a performance increase by a factor of 5.5.
ITC30
Areas - Program Committee
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{ITC3018ITC30g,
title = { Areas - Program Committee },
year = { 2018 },
address = { Vienna, Austria },
author = { ITC30 },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Jiang, Zhiyuan and Krishnamachari, Bhaskar and Zhou, Sheng and Niu, Zhisheng
Can Decentralized Status Update Achieve Universally Near-Optimal Age-of-Information in Wireless Multiaccess Channels?
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Jiang18ITC30,
title = { Can Decentralized Status Update Achieve Universally Near-Optimal Age-of-Information in Wireless Multiaccess Channels? },
year = { 2018 },
address = { Vienna, Austria },
author = { Jiang, Zhiyuan and Krishnamachari, Bhaskar and Zhou, Sheng and Niu, Zhisheng },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: In an Internet-of-Things system where status data are collected from sensors and actuators for time-critical applications, the freshness of data is vital and can be quantified by the recently proposed age-of-information (AoI) metric. In this paper, we first consider a general scenario where multiple terminals share a common channel to transmit or receive randomly generated status packets. The optimal scheduling problem to minimize AoI is formulated as a restless multi-armed bandit problem. To solve the problem efficiently, we derive the Whittle's index in closed-form and establish the indexability thereof. Compared with existing work, we extend the index policy for AoI optimization to incorporate stochastic packet arrivals and optimal packet management (buffering the latest packet), and consequently a more challenging two-dimensional states system. Inspired by the index policy which has near-optimal performance but is centralized by nature, a decentralized status update scheme, i.e., the index-prioritized random access policy (IPRA), is further proposed, achieving universally near-optimal AoI performance and outperforming state-of-the-arts in the literature.
Barik, Runa and Welzl, Michael and Elmokashfi, Ahmed Mustafa and Dreibholz, Thomas and Gjessing, Stein
Can WebRTC QoS Work? A DSCP Measurement Study
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Barik18ITC30,
title = { Can WebRTC QoS Work? A DSCP Measurement Study },
year = { 2018 },
address = { Vienna, Austria },
author = { Barik, Runa and Welzl, Michael and Elmokashfi, Ahmed Mustafa and Dreibholz, Thomas and Gjessing, Stein },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
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.\dq
Vega, Maria Torres and Liotta, Antonio
Cognitive Real-Time QoE Management in Video Streaming Services
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Vega18ITC30,
title = { Cognitive Real-Time QoE Management in Video Streaming Services },
year = { 2018 },
address = { Vienna, Austria },
author = { Vega, Maria Torres and Liotta, Antonio },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Satisfying the needs of users of online video streaming services requires not only managing the network Quality of Service (QoS), but also to address the user's Quality of Experience (QoE) expectations. In fact, while QoS factors reflect the status of individual networks they do not comprehensively capture the end-to-end features affecting the quality delivered to the user. In this situation, QoE management is the better option. However, currently used QoE management models are subjective to human interaction and have stringent requirements in terms of time and complexity. Thus, they fail to achieve successful performance in terms of real-timeliness, accuracy, scalability and adaptability. This dissertation work investigates new methods to bring QoE management to the level required by the real-time management of services. In this paper we highlight our main contributions. First, with the aim to perform a combined network-service assessment, we have designed an experimental methodology able to map network QoS onto service QoE. Our methodology is meant to provide service and network providers with the means to pinpoint the working boundaries of their video-sets and to predict the effect of network policies on perception. Second, we have designed and developed a generic machine learning framework that allows deriving accurate predictive No Reference (NR) assessment metrics, based on simplistic NR QoE methods, that are functionally and computationally viable for real-time QoE evaluation. The tools, methods and conclusions derived from this dissertation conform a solid contribution to QoE management of video streaming services, opening new venues for further research and investigation.
ITC30
Committees
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{ITC3018ITC30d,
title = { Committees },
year = { 2018 },
address = { Vienna, Austria },
author = { ITC30 },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Geissler, Stefan and Lange, Stanislav and Wamser, Florian and Hoßfeld, Tobias
Deriving YouTube Playout Phases from Encrypted Packet Level Traffic
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Geissler18ITC30,
title = { Deriving YouTube Playout Phases from Encrypted Packet Level Traffic },
year = { 2018 },
address = { Vienna, Austria },
author = { Geissler, Stefan and Lange, Stanislav and Wamser, Florian and Hoßfeld, Tobias },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: From the point of view of telecommunication providers, video streaming is one of the most demanding applications in today's Internet. Over 73% of the total global network traffic has been attributed to video streaming applications in 2017. In this work, we provide a first step towards a better understanding of the packet level behavior of video streaming traffic to enable more efficient traffic engineering in the future. We perform a measurement study with the popular video streaming platform YouTube and show that the different playout phases of a video streaming session can not only be observed by evaluating application layer metrics, but also from raw and encrypted packet level traces.
Jain, Ish Kumar and Kumar, Rajeev and Panwar, Shivendra
Driven by Capacity or Blockage? A Millimeter Wave Blockage Analysis
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Jain18ITC30,
title = { Driven by Capacity or Blockage? A Millimeter Wave Blockage Analysis },
year = { 2018 },
address = { Vienna, Austria },
author = { Jain, Ish Kumar and Kumar, Rajeev and Panwar, Shivendra },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Millimeter wave (mmWave) communication systems can provide high data rates, but the system performance may degrade significantly due to mobile blockers and the user's own body. A high frequency of interruptions and long duration of blockage may degrade the quality of experience. Macrodiversity of base stations (BSs) has been considered a promising solution where the user equipment (UE) can handover to other available BSs, if the current serving BS gets blocked. However, an analytical model to evaluate the system performance of dynamic blockage events in this setting is largely unknown. In this paper, we consider an open park-like scenario and obtain closed-form expressions for the blockage probability, the expected frequency and duration of blockage events using stochastic geometry. Our results indicate that the minimum density of BS that is required to satisfy the Quality of Service (QoS) requirements of AR/VR and other Ultra Reliable Low Latency Communication (URLLC) applications is largely driven by blockage events rather than capacity requirements. As an alternative to increasing BS density, placing the BS at a greater height reduces the likelihood of blockage. We present a closed-form expression for the BS density-height trade-off that can be used for network planning.
Heyse, Joris and Vega, Maria Torres and Wauters, Tim and De Backere, Femke and De Turck, Filip
Effects of Adaptive Streaming Optimizations on the Perception of 360° Virtual Reality Video
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Heyse18ITC30,
title = { Effects of Adaptive Streaming Optimizations on the Perception of 360° Virtual Reality Video },
year = { 2018 },
address = { Vienna, Austria },
author = { Heyse, Joris and Vega, Maria Torres and Wauters, Tim and De Backere, Femke and De Turck, Filip },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: As the demand of Virtual Reality (VR) video streaming to mobile devices increases, novel optimization transport techniques need to be designed to cope with these ultra-high-bandwidth video services. One approach currently attracting attention is the application of adaptive tile-based streaming solutions to the VR video arena. The VR videos are encoded at different quality levels, temporally divided into segments and spatially split into tiles. During the streaming, each of these tiles can be transmitted independently according to its location within the frame (i.e., within or outside of the user's field of view). These methods open a new venue for bandwidth and latency optimization for the streaming of VR videos. However, the effect of the different adaptive streaming optimizations on the end-user perception is still an open research topic. In this demo, we present a VR video platform to experience the working principles of adaptive tile-based VR video streaming services. Through different tiling approaches, bandwidth conditions and viewport algorithms, it allows the users to explore the effects that each optimization has on the perception of the service. In addition, the platform provides real-time bandwidth savings and objective Quality of Experience (QoE) measurements to provide a quantitative analysis of the optimizations effects. This demo aims to provide a common playground for researchers to benchmark, and evaluate the performance of their optimization solutions.
Giuliano, Fabrizio and Tinnirello, Ilenia and Garlisi, Domenico
Enabling a Win-Win Coexistence Mechanism for WiFi and LTE in Unlicensed Bands
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Giuliano18ITC30,
title = { Enabling a Win-Win Coexistence Mechanism for WiFi and LTE in Unlicensed Bands },
year = { 2018 },
address = { Vienna, Austria },
author = { Giuliano, Fabrizio and Tinnirello, Ilenia and Garlisi, Domenico },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: The problem of WiFi and LTE coexistence has been significantly debated in the last years, with the emergence of LTE extensions enabling the utilization of unlicensed spectrum for carrier aggregation. Since the two technologies employ completely different access protocols and frame transmission times, supporting coexistence with minimal modifications on existing protocols is not an easy task. Current solutions are often based on LTE unilateral adaptations, being LTE in unlicensed bands still under definition. In this paper, we demonstrate that it is possible to avoid a subordinated role for WiFi nodes, by simply equipping WiFi nodes with a sensing mechanism based on adaptive tunings of the ambient noise thresholds (as indeed considered by several commercial cards). Under this assumption, we propose a winwin coexistence mechanism between the two technologies, that does not require modifications on legacy WiFi access operations. We model the interactions between the two technologies in terms of a game and demonstrate the feasibility of the approach in simulation and in real experiments.
Akin, Sami
Energy Management in Wireless Communications with Energy Storage Imperfections
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Akin18ITC30,
title = { Energy Management in Wireless Communications with Energy Storage Imperfections },
year = { 2018 },
address = { Vienna, Austria },
author = { Akin, Sami },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: In recent years, energy harvesting has taken a considerable attention in wireless communication research. Nonetheless, the stochastic nature of renewable energy sources has become one of the research problems, and energy storage has been proposed as a solution to deal with it. Initially, researchers regarded a perfect battery model without energy losses during storage because of its simplicity and compatibility in wireless communication analysis. However, a battery model that reflects practical concerns should include energy losses. In this paper, we consider an energy harvesting wireless communication model with a battery that has energy losses during charging and discharging. We consider energy underflows (i.e., the energy level falls below a certain threshold in a battery) as the energy management concern, and characterize the energy underflow probability and provide a simple exponential formulation by employing the large deviation principle and queueing theory. Specifically, we benefit from the similarity between the battery and data buffer models. We further coin the available space decay rate at a battery as a parameter to indicate the energy consumption performance. We further outline an approach to set the energy demand policy to meet the energy management requirements that rule the energy underflow probability as a constraint. We finally substantiate our analytical findings with numerical demonstrations, and compare the transmission performance levels of a transmission system with a battery that has energy losses and a transmission system that consumes the energy as soon as it is harvested.
Hyytiä, Esa and Righter, Rhonda
Evaluating Rare Events in Mission Critical Dispatching Systems
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Hyytia18ITC30,
title = { Evaluating Rare Events in Mission Critical Dispatching Systems },
year = { 2018 },
address = { Vienna, Austria },
author = { Hyytiä, Esa and Righter, Rhonda },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Dispatching systems, where jobs are routed to servers immediately upon arrival, appear frequently in parallel computing systems. With a dynamic dispatching policy, the system is generally analytically intractable and performance evaluation is carried out by means of Monte Carlo simulations. A typical performance metric is the mean response time that is often easy to estimate. In contrast, we consider systems where events generating costs are extremely rare. In our reference system, jobs have deadlines for waiting time. When deadlines are loose when compared to the system's load, novel rare event simulation techniques must be applied. We consider both conditioning and importance sampling to this end. The proposed techniques are demonstrated in numerical examples, where we discover interesting performance relationships between the classical dispatching policies; Random split (RND), Round-robin (RR), Join-the-shortest-queue (JSQ) and Least-work-left (LWL).
Metzger, Florian and Heger, Roman
Exploring the Transmission Behaviour of Overwatch: The Source of Lag
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Metzger18ITC30,
title = { Exploring the Transmission Behaviour of Overwatch: The Source of Lag },
year = { 2018 },
address = { Vienna, Austria },
author = { Metzger, Florian and Heger, Roman },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: This paper explores the full chain of lag contribution factors in a specific online multiplayer game, namely Overwatch: From creating input events over the network and back to displaying the results on the local screen. Together result in the dreaded end-to-end lag. which has a direct impact on the subjective quality one experiences when playing video games. In its investigation, this paper reveals surprising effects in the game's networking behavior that are omitted when colloquially talking about, e.g. a 60 Hz update rate, but must be considered nonetheless. These insights, gained from examining network traces of Overwatch matches that were played on a realistic, resource constrained PC, can then be used to refine end-to-end lag simulation models and reach a better understanding of all responsible components.
Renga, Daniela and Meo, Michela
From Self-Sustainable Green Mobile Networks to Enhanced Interaction with the Smart Grid
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Renga18ITC30,
title = { From Self-Sustainable Green Mobile Networks to Enhanced Interaction with the Smart Grid },
year = { 2018 },
address = { Vienna, Austria },
author = { Renga, Daniela and Meo, Michela },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
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.\dq
ITC30
IEEE~Computer Society Technical &~Conference Activities Board
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{ITC3018ITC30k,
title = { IEEE~Computer Society Technical &~Conference Activities Board },
year = { 2018 },
address = { Vienna, Austria },
author = { ITC30 },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Hurtig, Per and Haile, Habtegebreil and Grinnemo, Karl-Johan and Brunstrom, Anna and Narbona, Eneko Atxutegi and Liberal, Fidel and Arvidsson, \aAke
Impact of TCP BBR on CUBIC Traffic: A Mixed Workload Evaluation
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Hurtig18ITC30,
title = { Impact of TCP BBR on CUBIC Traffic: A Mixed Workload Evaluation },
year = { 2018 },
address = { Vienna, Austria },
author = { Hurtig, Per and Haile, Habtegebreil and Grinnemo, Karl-Johan and Brunstrom, Anna and Narbona, Eneko Atxutegi and Liberal, Fidel and Arvidsson, \aAke },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: A recently proposed congestion control algorithm(CCA) called BBR (Bottleneck Bandwidth and Round-trip propagation time) has shown a lot of promise in avoiding the bufferbloat and low-buffer inefficiency problems that have plagued loss-based CCAs. Nevertheless deployment of a new alternative algorithm requires a thorough evaluation of the effect of the proposed alternative on established transport protocols like TCP CUBIC. Furthermore, evaluations that consider the heterogeneity of Internet traffic sizes would provide a useful insight into the deployability of an algorithm that introduces sweeping changes across multiple algorithm components. Yet most evaluations of BBR's impact and competitive fairness have focused on the steady-state performance of large flows. This work expands on previous studies of BBR by evaluating BBR's impact when the traffic consists of flows of different sizes. Our experiments show that under certain circumstances BBR's startup phase can result in a significant reduction of the throughput of competing large CUBIC flows and the utilization of the bottleneck link. In addition the steady-state operation of BBR can have negative impact on the performance of bursty flows using loss-based CCAs over bottlenecks with buffer sizes as high as two times the bandwidth-delay product.
Kleinrouweler, Jan Willem and Meixner, Britta and Bosman, Joost and van den Berg, Hans and van der Mei, Rob and Cesar, Pablo
Improving Mobile Video Quality Through Predictive Channel Quality Based Buffering
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Kleinrouweler18ITC30,
title = { Improving Mobile Video Quality Through Predictive Channel Quality Based Buffering },
year = { 2018 },
address = { Vienna, Austria },
author = { Kleinrouweler, Jan Willem and Meixner, Britta and Bosman, Joost and van den Berg, Hans and van der Mei, Rob and Cesar, Pablo },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Frequent variations in throughput make mobile networks a challenging environment for video streaming. Current video players deal with those variations by matching video quality to network throughput. However, this adaptation strategy results in frequent changes of video resolution and bitrate, which negatively impacts the users' streaming experience. Alternatively, keeping the video quality constant would improve the experience, but puts additional demand on the network. Downloading high quality content when channel quality is low requires additional resources, because data transfer efficiency is linked to channel quality. In this paper, we present a predictive Channel Quality based Buffering Strategy (CQBS) that lets the video buffer grow when channel quality is good, and relies on this buffer when channel quality decreases. Our strategy is the outcome of a Markov Decision Process. The underlying Markov chain is conditioned on 377 real-world LTE channel quality traces that we have collected using an Android mobile application. With our strategy, mobile network providers can deliver constant quality video streams, without sacrificing additional network resources.
Nikolaus, Paul and Henningsen, Sebastian and Beck, Michael and Schmitt, Jens
Integrating Fractional Brownian Motion Arrivals into the Statistical Network Calculus
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Nikolaus18ITC30,
title = { Integrating Fractional Brownian Motion Arrivals into the Statistical Network Calculus },
year = { 2018 },
address = { Vienna, Austria },
author = { Nikolaus, Paul and Henningsen, Sebastian and Beck, Michael and Schmitt, Jens },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Stochastic network calculus (SNC) is a versatile framework to derive probabilistic performance bounds. Recently, it was proposed in [1] to replace the typical a priori assumptions on arrival processes with measurement observations and to incorporate the corresponding statistical uncertainty into calculation of the bounds. This so-called statistical network calculus (StatNC) opens the door for many applications with limited traffic information. However, the important traffic class of self-similar processes such as fractional Brownian Motion (fBm) was left open in [1], thus, e.g., depriving the usage of the StatNC for Internet traffic. In this work, we close this gap by integrating fBm arrivals into the StatNC. To this end, we analyze the impact imposed by the uncertainty on the backlog bound and show in numerical evaluations that the additional inaccuracy is only of moderate size.
Morichetta, Andrea and Mellia, Marco
LENTA: Longitudinal Exploration for Network Traffic Analysis
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Morichetta18ITC30,
title = { LENTA: Longitudinal Exploration for Network Traffic Analysis },
year = { 2018 },
address = { Vienna, Austria },
author = { Morichetta, Andrea and Mellia, Marco },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: In this work, we present LENTA (Longitudinal Exploration for Network Traffic Analysis), a system that allows the network analyst to easily identify traffic generated by services and applications running on the web, being them benign or possibly malicious. First, LENTA simplifies analysts job by letting them observe few hundreds of clusters instead of the original hundred thousands of single URLs. Second, it implements a self-learning methodology, where a semi-supervised approach lets the system grow its knowledge, which is used in turn to automatically associate traffic to previously observed services and identify new traffic generated by possibly suspicious applications. This lets the analyst easily observe changes in the traffic, like the birth of new services, or unexpected activities. We follow a data driven approach, running LENTA on real data. Traffic is analyzed in batches of 24-hour worth of traffic. We show that LENTA allows the analyst to easily understand which services are running on its network, highlights malicious traffic and changes over time, greatly simplifying the view and understanding of the traffic.
Mohammadpour, Ehsan and Stai, Eleni and Mohiuddin, Maaz and Le Boudec, Jean-Yves
Latency and Backlog Bounds in Time-Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Mohammadpour18ITC30,
title = { Latency and Backlog Bounds in Time-Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping },
year = { 2018 },
address = { Vienna, Austria },
author = { Mohammadpour, Ehsan and Stai, Eleni and Mohiuddin, Maaz and Le Boudec, Jean-Yves },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: We compute bounds on end-to-end worst-case latency and on nodal backlog size for a per-class deterministic network that implements Credit Based Shaper (CBS) and Asynchronous Traffic Shaping (ATS), as proposed by the Time-Sensitive Networking (TSN) standardization group. ATS is an implementation of the Interleaved Regulator, which reshapes traffic in the network before admitting it into a CBS buffer, thus avoiding burstiness cascades. Due to the interleaved regulator, traffic is reshaped at every switch, which allows for the computation of explicit delay and backlog bounds. Furthermore, we obtain a novel, tight per-flow bound for the response time of CBS, when the input is regulated, which is smaller than existing network calculus bounds. We also compute a per-flow bound on the response time of the interleaved regulator. Based on all the above results, we compute bounds on the per-class backlogs. Then, we use the newly computed delay bounds along with recent results on interleaved regulators from literature to derive tight end-to-end latency bounds and show that these are less than the sums of per-switch delay bounds.
Kar, Sounak and Rizk, Amr and Fidler, Markus
Multi-interface Communication: Interface Selection Under Statistical Performance Constraints
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Kar18ITC30,
title = { Multi-interface Communication: Interface Selection Under Statistical Performance Constraints },
year = { 2018 },
address = { Vienna, Austria },
author = { Kar, Sounak and Rizk, Amr and Fidler, Markus },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Recent advancement of multipath communications has unravelled a new dimension of research that focuses on balanced and efficient utilization of available alternatives. Dynamic strategies in this context leverage the most updated information to outperform comparable static versions and have been under the spotlight of late. In this work, we propose such an adaptive strategy which seeks to improve the worst-case performance of a multipath communication system by looking at waiting time bounds of respective subsystems. We compare the performance of this algorithm with round-robin and join-the-shortest-queue strategies numerically and highlight the environments where our strategy tends to be superior.
Guillemin, Fabrice and Mazumdar, Ravi R. and Rosenberg, Catherine and Ying, Yu
Network Calculus for Mean Delay Analysis Through a Network
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Guillemin18ITC30,
title = { Network Calculus for Mean Delay Analysis Through a Network },
year = { 2018 },
address = { Vienna, Austria },
author = { Guillemin, Fabrice and Mazumdar, Ravi R. and Rosenberg, Catherine and Ying, Yu },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: In this paper, a framework is developed to estimate the mean delay performance of \$($\backslash$pi, $\backslash$rho,$\backslash$sigma)\$ regulated flows in networks with acyclic routing. We first show that the mean delay performance can be bounded by \textiton-off type processes with exponentially distributed \textitoff periods. We then obtain per-flow bounds on the mean delay. We show that when there is no peak rate constraint, the Pollaczek-Khinchine formula for \$M/G/1\$ queues provides a tight bound thus establishing the Better-than-Poisson property for such flows. We then consider flows inside a network and show that they can be characterized by a stochastic burstiness parameter and show how the aggregate performance can be bounded from the asymptotic Better-than-Poisson property of regulated flows.
Pappas, Nikolaos and Dimitriou, Ioannis and Chen, Zheng
Network-Level Cooperation in Random Access IoT Networks with Aggregators
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Pappas18ITC30,
title = { Network-Level Cooperation in Random Access IoT Networks with Aggregators },
year = { 2018 },
address = { Vienna, Austria },
author = { Pappas, Nikolaos and Dimitriou, Ioannis and Chen, Zheng },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: In this work, we consider a random access IoT wireless network assisted by two aggregators. The nodes and the aggregators are transmitting in a random access manner under slotted time, the aggregators use network-level cooperation. We assume that all the nodes are sharing the same wireless channel to transmit their data to a common destination. The aggregators with out-of-band full duplex capability, are equipped with queues to store data packets that are transmitted by the network nodes and relaying them to the destination node. We characterize the throughput performance of the IoT network. In addition, we obtain the stability conditions for the queues at the aggregators and the average delay of the packets.
Bouillard, Anne and Comte, Céline and de Panafieu, Élie and Mathieu, Fabien
Of Kernels and Queues: When Network Calculus Meets Analytic Combinatorics
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Bouillard18ITC30,
title = { Of Kernels and Queues: When Network Calculus Meets Analytic Combinatorics },
year = { 2018 },
address = { Vienna, Austria },
author = { Bouillard, Anne and Comte, Céline and de Panafieu, Élie and Mathieu, Fabien },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
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.
Vasantam, Thirupathaiah and Mazumdar, Ravi R.
On Occupancy Based Randomized Routing Schemes in Large Systems of Shared Servers
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Vasantam18ITC30,
title = { On Occupancy Based Randomized Routing Schemes in Large Systems of Shared Servers },
year = { 2018 },
address = { Vienna, Austria },
author = { Vasantam, Thirupathaiah and Mazumdar, Ravi R. },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Recently there has been a great interest in randomized load balancing schemes for large systems of parallel servers. Various policies such as SQ(d) (shortest queue amongst d randomly sampled), threshold policies, JIQ (join the idle queue) etc have been studied via a mean-field approach. All these policies are special cases of occupancy based routing decisions. In this paper we present a unified mean-field approach that holds for any routing scheme that only depends on the server occupancy in a system with a large numbers of of processor sharing servers as an archetype of shared resource systems. The mean-field equations we obtain hold for general job length distributions unlike most recent works that assume exponentially distributed job lengths. We then show that the probability measure of occupancy defined on the set of non-negative integers \$\mathcalZ_+\$ obtained from a fixed-point of the mean-field also satisfies the stationary mean-field equations under the assumption that the job lengths are exponential with the same average length. If the mean-field under exponential case has unique fixed-point, then the fixed point is \em insensitive to the job length distribution. The approach is via a measure-valued Markov process approach.
Jin, Youngmi and Hayashi, Michiaki and Tagami, Atsushi
Online Algorithms for Cost-Effective Cloud Selection with Multiple Demands
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Jin18ITC30,
title = { Online Algorithms for Cost-Effective Cloud Selection with Multiple Demands },
year = { 2018 },
address = { Vienna, Austria },
author = { Jin, Youngmi and Hayashi, Michiaki and Tagami, Atsushi },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Cloud computing provides high flexibility for users by offering diverse cloud instances with various leasing periods and prices. Depending on the amount and duration of workload, a user can flexibly choose proper cloud instances to meet her demands. An intrinsic challenge facing the user is which classes of clouds and how many of them to purchase in order to meet her unpredictable demands at minimum cost. We consider an online problem deciding cost-effectively cloud classes and amount of clouds to meet dynamic multiple demands among many cloud classes when no future information of demands is available. We propose two online algorithms achieving O(M) and O(log M + log dmax) competitive ratios where M is the number of available cloud classes and dmax is the maximum demand of a given demand sequence.
Reyes, Ronald Romero and Bauschert, Thomas
Online Resource Allocation in Dynamic Optical Networks
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Reyes18ITC30,
title = { Online Resource Allocation in Dynamic Optical Networks },
year = { 2018 },
address = { Vienna, Austria },
author = { Reyes, Ronald Romero and Bauschert, Thomas },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: This paper presents a synopsis of ongoing research in the field of resource allocation in dynamic optical networks. This type of networks are envisioned to serve connections with random arrival and holding times and with fast connection setup requirements. Based on this, we model resource allocation as a mechanism that includes network control functions for routing and spectrum assignment (RSA), connection admission control (CAC) and grade of service (GoS) control. The goal is to efficiently assign spectrum resources to connections so as to attain optimum performance. For that, the network is modelled as a stochastic loss system subject to spectrum continuity and contiguity constraints. The theory of Markov decision processes (MDP) is then applied to formulate an algorithm that performs fast, adaptive and state-dependent RSA, CAC and GoS control. The proposed algorithm can easily be integrated with existing protocols for fast connection setup. Moreover, we discuss the cost efficiency of selected network implementations which are based on basic, colorless and colorless and directionless optical nodes.
Moldovan, Christian and Skorin-Kapov, Lea and Heegaard, Poul E. and Hoßfeld, Tobias
Optimal Fairness and Quality in Video Streaming with Multiple Users
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Moldovan18ITC30,
title = { Optimal Fairness and Quality in Video Streaming with Multiple Users },
year = { 2018 },
address = { Vienna, Austria },
author = { Moldovan, Christian and Skorin-Kapov, Lea and Heegaard, Poul E. and Hoßfeld, Tobias },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: With the majority of video distribution services relying on the HTTP adaptive streaming paradigm, a great deal of research is geared towards developing algorithms and solutions for improving user perceived quality while making efficient use of available resources. Our goal is to provide the means for benchmarking such solutions in the context of multiple users accessing Video on Demand content while sharing a bottleneck link. For that purpose, we propose a quadratic problem formulation to compute the theoretical optimum in terms of adaptation strategies and corresponding segment downloads across multiple users under given bandwidth constraints. By aiming to maximize both service quality and fairness, we quantify and compare the impact of different fairness objectives (bandwidth fairness, pattern fairness, and session fairness) on resulting quality and achieved QoE fairness. Based on conducted simulations and parameter studies, our results demonstrate the benefits of optimizing for session fairness as compared to other approaches.
Lange, Stanislav
Optimization of Controller Placement and Information Flow in Softwarized Networks
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Lange18ITC30,
title = { Optimization of Controller Placement and Information Flow in Softwarized Networks },
year = { 2018 },
address = { Vienna, Austria },
author = { Lange, Stanislav },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: The Software Defined Networking (SDN) paradigm offers network operators numerous improvements in terms of flexibility, scalability, as well as cost efficiency and vendor independence. However, in order to maximize the benefit from these features, several new challenges in areas such as management and orchestration need to be addressed. The dissertation that is summarized in this paper makes contributions towards three key topics from these areas. Firstly, we design, implement, and evaluate two multi-objective heuristics for the SDN controller placement problem. Secondly, we develop and apply mechanisms for automated decision making based on the Pareto frontiers that are returned by the multi-objective optimizers. Finally, we investigate and quantify the performance benefits for the SDN control plane that can be achieved by integrating information from external entities such as Network Management Systems (NMSs) into the control loop. Our evaluation results demonstrate the impact of optimizing various parameters of softwarized networks at different levels and are used to derive guidelines for an efficient operation.
Noronha, Vivian and Riegel, Maximilian and Lang, Ekkehard and Bauschert, Thomas
Performance Evaluation of Container Based Virtualization on Embedded Microprocessors
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Noronha18ITC30,
title = { Performance Evaluation of Container Based Virtualization on Embedded Microprocessors },
year = { 2018 },
address = { Vienna, Austria },
author = { Noronha, Vivian and Riegel, Maximilian and Lang, Ekkehard and Bauschert, Thomas },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Container based virtualization is widely used in cloud computing. Applying such virtualization to IoT devices with much smaller footprint promises considerable benefits. This paper presents the results of a performance evaluation of system container virtualization like LXC provisioned on small MIPS or ARM based embedded microprocessors that can be used in edge or fog of an IoT ecosystem. The measurement results using different benchmark tools show that the overhead introduced has only negligible effects on the overall performance of the embedded microprocessors.
Masucci, Antonia Maria and Olivier, Philippe and Simonian, Alain
Performance Evaluation of Scheduling Schemes for D2D Communications
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Masucci18ITC30,
title = { Performance Evaluation of Scheduling Schemes for D2D Communications },
year = { 2018 },
address = { Vienna, Austria },
author = { Masucci, Antonia Maria and Olivier, Philippe and Simonian, Alain },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
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.
Dinh-Xuan, Lam and Seufert, Michael and Wamser, Florian and Zafeiropoulos, Anastasios and Vassilakis, Constantinos and Zafeiropoulos, Anastasios
Performance Evaluation of Service Functions Chain Placement Algorithms in Edge Cloud
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{DinhXuan18ITC30,
title = { Performance Evaluation of Service Functions Chain Placement Algorithms in Edge Cloud },
year = { 2018 },
address = { Vienna, Austria },
author = { Dinh-Xuan, Lam and Seufert, Michael and Wamser, Florian and Zafeiropoulos, Anastasios and Vassilakis, Constantinos and Zafeiropoulos, Anastasios },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: The emergence of Network Function Virtualization (NFV) paradigm has become a potential solution dealing with the rapid growth of the global Internet traffic in the last decades. There, network appliances are transformed into Virtual Network Functions (VNF) running on standard server. This promises to significantly reduce overall cost and energy consumption. Additionally, hardware-based network function chain is replaced by a chain of the VNFs, called Service Function Chain (SFC). The expected benefit of SFC is the reduction in the complexity when deploying heterogeneous network services. However, the considerable drawback of SFC is the distribution of the VNFs over different hosts. An inefficient placement of VNFs can induce a high latency within the chain and wasted server resources.In this work we propose four placement algorithms that aim to efficiently place the SFC in servers with regard to minimizing service response time and resource utilization. Herein heuristic approaches are evaluated against optimal solutions for the placement problems which are formulated by using Integer Linear Programming. We evaluate and compare these placement strategies in a simulator. Our result shows that the optimized solutions produce lowest service response time and least server utilization in all types of simulated SFCs. On the other hand the heuristic algorithms are also able to come close to the optimum by simple placing rules.\dq
Scholz, Dominik and Raumer, Daniel and Emmerich, Paul and Kurtz, Alexander and Lesiak, Krzysztof and Carle, Georg
Performance Implications of Packet Filtering with Linux eBPF
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Scholz18ITC30,
title = { Performance Implications of Packet Filtering with Linux eBPF },
year = { 2018 },
address = { Vienna, Austria },
author = { Scholz, Dominik and Raumer, Daniel and Emmerich, Paul and Kurtz, Alexander and Lesiak, Krzysztof and Carle, Georg },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Firewall capabilities of operating systems are traditionally provided by inflexible filter routines or hooks in the kernel. These require privileged access to be configured and are not easily extensible for custom low-level actions. Since Linux 3.0, the Berkeley Packet Filter (BPF) allows user-written extensions in the kernel processing path. The successor, extended BPF (eBPF), improves flexibility and is realized via a virtual machine featuring both a just-in-time (JIT) compiler and an interpreter running in the kernel. It executes custom eBPF programs supplied by the user, effectively moving kernel functionality into user space.We present two case studies on the usage of Linux eBPF. First we analyze the performance of the eXpress Data Path (XDP). XDP uses eBPF to process ingress traffic before the allocation of kernel data structures which comes along with performance benefits. In the second case study eBPF is used to install application-specific packet filtering configurations acting on the socket level. Our case studies focus on performance aspects and discuss benefits and drawbacks.\dq
ITC30
Proceedings (Front Page)
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{ITC3018ITC30q,
title = { Proceedings (Front Page) },
year = { 2018 },
address = { Vienna, Austria },
author = { ITC30 },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
ITC30
Proceedings NetCal2018(Front Page)
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{ITC3018ITC30r,
title = { Proceedings NetCal2018(Front Page) },
year = { 2018 },
address = { Vienna, Austria },
author = { ITC30 },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
ITC30
Program
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{ITC3018ITC30c,
title = { Program },
year = { 2018 },
address = { Vienna, Austria },
author = { ITC30 },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
ITC30
Program (NetCal2018)
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{ITC3018ITC30e,
title = { Program (NetCal2018) },
year = { 2018 },
address = { Vienna, Austria },
author = { ITC30 },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Li, Zhenmin and Fan, Renshi and Gaoming, Du and Cao, Yifan and Lu, Zhonghai and Minglun, Gao
RB-OLITS: A Worst-Case Reorder Buffer Size Reduction Method for 3D-NoC Based on Ohm’s Law-Like Traffic Splitting
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Li18ITC30,
title = { RB-OLITS: A Worst-Case Reorder Buffer Size Reduction Method for 3D-NoC Based on Ohm's Law-Like Traffic Splitting },
year = { 2018 },
address = { Vienna, Austria },
author = { Li, Zhenmin and Fan, Renshi and Gaoming, Du and Cao, Yifan and Lu, Zhonghai and Minglun, Gao },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Higher link bandwidth provided by three-dimensional Network-on-Chip (3D-NoC) relies on multi-path routing and traffic splitting, which inevitably leads to out-of-order packet delivery problem when facing unbalanced traffic congestion. Therefore, a reordering mechanism, often requiring reorder buffers, is necessary to guarantee in-order delivery of packets. The reorder buffers are expensive in terms of both resource and power consumption, hence it is of great significance to reduce the reorder buffer size in the worst case. In this paper, we propose a improved Ohm's Law-like traffic splitting method, named RB-OLITS, for reducing the worst-case reorder buffer size. The traffic splitting configuration is obtained according to the parallel resistance theory. Experimental results show that RB-OLITS has reduced the worst-case reorder buffer size by 19.09% in average compared with OLITS. Meanwhile, the worst-case delay bound is not degraded by using RB-OLITS, as the worst-case delay bound of the same target flow is slightly improved by 1.59% in average.
ITC30
Sponsors/Conference Support
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{ITC3018ITC30h,
title = { Sponsors/Conference Support },
year = { 2018 },
address = { Vienna, Austria },
author = { ITC30 },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Akselrod, Mark and Fidler, Markus
Statistical Delay Bounds for Automatic Repeat Request Protocols with Pipelining
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Akselrod18ITC30,
title = { Statistical Delay Bounds for Automatic Repeat Request Protocols with Pipelining },
year = { 2018 },
address = { Vienna, Austria },
author = { Akselrod, Mark and Fidler, Markus },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: The recent trend towards low-latency wireless communication requires a notion of non-ergodic capacity that deals with delays. Significant research in areas, such as effective capacity, delay-constrained capacity, and stochastic service curves, has contributed such results for relevant physical layer aspects, like fading processes, interference, and multiple antenna systems. Less attention has been paid to actual implementations of link layer automatic repeat request protocols. Instead, error-free transmission using instantaneous channel state information, simple stop-and-wait protocols, or instantaneous feedback are frequently assumed. In this work, we investigate protocols with pipelining that deal with packet errors under non-negligible round-trip-times. We define a stochastic service curve model of a general class of automatic repeat request protocols with pipelining and derive statistical waiting time and sojourn time bounds. We discover two regimes: under low to moderate load retransmissions cause the largest part of the sojourn time, whereas under high load the waiting time dominates the sojourn time. Generally, with increasing round-trip-time the basic cases of stop-and-wait protocols or instantaneous feedback neglect relevant effects and provide less accurate estimates.
Akselrod, Mark and Fidler, Markus and Lübben, Ralf
Stochastic Guarantees for Rate-Adaptive Streaming
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Akselrod18ITC30b,
title = { Stochastic Guarantees for Rate-Adaptive Streaming },
year = { 2018 },
address = { Vienna, Austria },
author = { Akselrod, Mark and Fidler, Markus and Lübben, Ralf },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: A major challenge in mobile video streaming applications is the variability of the wireless channel. Techniques like Apple's HLS and MPEG-DASH typically offer the video in chunks where each chunk is made available with different levels of quality and bitrate. Adaptive clients use estimates of the past network conditions to select the bitrate of the next chunk accordingly. Frequently, this selection is based on the average performance and does not consider the variability of the channel. In this work, we present a method for bitrate adaptation that uses the distribution of the past throughput to provide statistical performance guarantees obtained by the stochastic network calculus. We show how to select the bitrate so that a certain, small probability of buffer underflow is not exceeded. The results are derived for the general case of an arbitrary throughput distribution. Numerical results are included for the example of a Gaussian distribution. Additionally, we present simulation results that show the relevant performance metrics like average bitrate and buffer level of a system that adjusts it's bitrate as suggested by our method. Generally, the method presented in this paper can achieve a bitrate that is close to the average available throughput with little variability of the playback rate while ensuring a defined probability of buffer underflow.
Mocanu, Decebal Constantin
Synopsis of the PhD Thesis - Network Computations in Artificial Intelligence
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Mocanu18ITC30,
title = { Synopsis of the PhD Thesis - Network Computations in Artificial Intelligence },
year = { 2018 },
address = { Vienna, Austria },
author = { Mocanu, Decebal Constantin },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Traditionally science is done using the reductionism paradigm. Artificial intelligence does not make an exception and it follows the same strategy. At the same time, network science tries to study complex systems as a whole. This synopsis presents my PhD thesis which takes an alternative approach to the reductionism strategy, with the aim to advance both fields, advocating that major breakthroughs can be made when these two are combined. The thesis illustrates this bidirectional relation by: (1) proposing a new method which uses artificial intelligence to improve network science algorithms (i.e. a new centrality metric which computes fully decentralized the nodes and links importance, on the polylogarithmic scale with respect to the number of nodes in the network); and (2) proposing two methods which take inspiration from network science to improve artificial intelligence algorithms (e.g. quadratic acceleration in terms of memory requirements and computational speed of artificial neural network fully connected layers during both, training and inference).
ITC30
Table of Contents
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{ITC3018ITC30m,
title = { Table of Contents },
year = { 2018 },
address = { Vienna, Austria },
author = { ITC30 },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
ITC30
Table of Contents (NetCal2018)
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{ITC3018ITC30n,
title = { Table of Contents (NetCal2018) },
year = { 2018 },
address = { Vienna, Austria },
author = { ITC30 },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Geyer, Fabien and Carle, Georg
The Case for a Network Calculus Heuristic: Using Insights from Data for Tighter Bounds
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Geyer18ITC30,
title = { The Case for a Network Calculus Heuristic: Using Insights from Data for Tighter Bounds },
year = { 2018 },
address = { Vienna, Austria },
author = { Geyer, Fabien and Carle, Georg },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: Deterministic network calculus offers a framework for providing guaranteed bounds on end-to-end delay and buffer usage in computer networks. Various network analysis methods have been proposed in order to reduce the impact of burstiness or multiplexing and provide tight performance bounds. Yet, the choice of which analysis method to use given a network to analyze is not straightforward as it has been showed in the literature that corner cases exist leading to poor tightness. We propose in this paper to take a new look at this question using insights from data and confirm that there is no clear winner when deciding which method to use. Based on those first results, we make the case for a network calculus heuristic in order to predict the bounds produced by a given network analysis method. Our main contribution is a heuristic based on graph-based deep learning, which is able to directly process networks of servers and flows. Via a numerical evaluation, we show that our proposed heuristic is able to accurately predict which analysis method will produce the tightest delay bound. We also demonstrate that the computational cost of our heuristic makes it of practical use, with average runtimes one or two order of magnitude faster than traditional analysis methods.
Zhao, Peiyue and Dán, György
Time Constrained Service-Aware Migration of Virtualized Services for Mobile Edge Computing
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Zhao18ITC30,
title = { Time Constrained Service-Aware Migration of Virtualized Services for Mobile Edge Computing },
year = { 2018 },
address = { Vienna, Austria },
author = { Zhao, Peiyue and Dán, György },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: We consider the migration of virtualized services (VSs) in Mobile Edge Computing (MEC), so as to facilitate server maintenance, load balancing under mobility, improved energy efficiency and resource utilization, and incident response. We consider a set of VSs that has to be migrated from a source placement to a target placement, while maintaining service continuity as much as possible. We formulate the VS migration problem as an integer programming problem, and analyze its complexity. We propose an efficient iterative algorithm for computing when and in what order the VSs shall be migrated among the MEC nodes. We evaluate the proposed solution in terms of total service value, efficiency, and scalability. Extensive simulations show that our algorithm is computationally effective, and performs close to optimal.
Durairajan, Ramakrishnan and Mani, Sathiya Kumaran and Barford, Paul and Nowak, Robert and Sommers, Joel
TimeWeaver: Opportunistic One Way Delay Measurement Via NTP
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Durairajan18ITC30,
title = { TimeWeaver: Opportunistic One Way Delay Measurement Via NTP },
year = { 2018 },
address = { Vienna, Austria },
author = { Durairajan, Ramakrishnan and Mani, Sathiya Kumaran and Barford, Paul and Nowak, Robert and Sommers, Joel },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: One-way delay (OWD) between end hosts has important implications for Internet applications, protocols, and measurement-based analyses. We describe a new approach for identifying OWDs via passive measurement of Network Time Protocol (NTP) traffic. NTP traffic offers the opportunity to measure OWDs accurately and continuously from hosts throughout the Internet. Based on detailed examination of NTP implementations and in-situ behavior, we develop an analysis tool that we call TimeWeaver, which enables assessment of precision and accuracy of OWD measurements from NTP. We apply TimeWeaver to a ∼1TB corpus of NTP traffic collected from 19 servers located in the US and report on the characteristics of hosts and their associated OWDs, which we classify in a precision/accuracy hierarchy. To demonstrate the utility of these measurements, we apply iterative hard-threshold singular value decomposition to estimate OWDs between arbitrary hosts from the highest tier in the hierarchy. We show that this approach results in highly accurate estimates of OWDs, with average error rates on the order of less than 2%.
ITC30
Volume~Editors
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{ITC3018ITC30o,
title = { Volume~Editors },
year = { 2018 },
address = { Vienna, Austria },
author = { ITC30 },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
ITC30
Welcome Message from Technical Program Chairs
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{ITC3018ITC30i,
title = { Welcome Message from Technical Program Chairs },
year = { 2018 },
address = { Vienna, Austria },
author = { ITC30 },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
ITC30
Welcome Message from Workshop Chairs
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{ITC3018ITC30j,
title = { Welcome Message from Workshop Chairs },
year = { 2018 },
address = { Vienna, Austria },
author = { ITC30 },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Schwind, Anika and Seufert, Michael
WhatsAnalyzer: A Tool for Collecting and Analyzing WhatsApp Mobile Messaging Communication Data
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Schwind18ITC30,
title = { WhatsAnalyzer: A Tool for Collecting and Analyzing WhatsApp Mobile Messaging Communication Data },
year = { 2018 },
address = { Vienna, Austria },
author = { Schwind, Anika and Seufert, Michael },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: WhatsAnalyzer is a web-based service, which collects and analyzes chat histories of the mobile messaging application WhatsApp. Thereby, it leverages the e-mail export feature of WhatsApp to obtain the chat histories, which cannot be accessed otherwise due to encrypted storage on the mobile device and end-to-end encrypted transmission over the Internet. Thus, the major asset of the service is that real communication data can be collected without the bias introduced by observing or surveying participants. The collected communication data can be analyzed and provides valuable insights into the communication in WhatsApp and the resulting network traffic. To incentivize users to send chat histories, the privacy of users is respected by anonymizing all communication data. Moreover, some analyses of each chat history can be accessed on a web page by the sender of the chats.
Aalto, Samuli and Lassila, Pasi
Whittle Index Approach to Energy-Aware Dispatching
In 30th International Teletraffic Congress (ITC 30). Vienna, Austria 2018
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Aalto18ITC30,
title = { Whittle Index Approach to Energy-Aware Dispatching },
year = { 2018 },
address = { Vienna, Austria },
author = { Aalto, Samuli and Lassila, Pasi },
booktitle = { 30th International Teletraffic Congress (ITC 30) }
}
Abstract: A data center can be modeled as a set of parallel queues, and the dispatcher decides to which queue the arriving jobs are routed. We consider an energy-aware dispatching system in a Markovian setting, where each server upon becoming empty enters a sleep mode to save energy and to activate the server after sleep incurs an additional setup delay cost. We seek to optimize the performance-energy trade-off by applying the so-called Whittle index approach. As our main result, we rigorously prove, under a certain technical assumption, that the problem is indexable, and derive the explicit form of the Whittle index. Our numerical examples demonstrate that the resulting energy-aware Whittle index policy is able to perform very close to the numerically obtained optimal policy.
