Browse the ITC publications of previous conferences below or visit our grouppage at bibsonomy.org
2016
Hoßfeld, Tobias
# ITC 28 Report
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{hossfeld2016report,
title = { # ITC 28 Report },
year = { 2016 },
address = { Würzburg, Germany },
author = { Hoßfeld, Tobias },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept }
}
Hoßfeld, Tobias and Mark, Brian and Chan, Gary and Timm-Giel, Andreas
# ITC28 Proceedings
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{hossfeld2016itc28,
title = { # ITC28 Proceedings },
year = { 2016 },
address = { Würzburg, Germany },
author = { Hoßfeld, Tobias and Mark, Brian and Chan, Gary and Timm-Giel, Andreas },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept }
}
Hoßfeld, Tobias and Mark, Brian and Chan, Gary and Timm-Giel, Andreas
# Prefaces to the ITC28
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Download]
[BibSonomy]
@inproceedings{hossfeld2016prefaces,
title = { # Prefaces to the ITC28 },
year = { 2016 },
address = { Würzburg, Germany },
author = { Hoßfeld, Tobias and Mark, Brian and Chan, Gary and Timm-Giel, Andreas },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept }
}
Kleinrouweler, Jan Willem and Cabrero, Sergio and van der Mei, Rob and Cesar, Pablo
A Markov Model for Evaluating Resource Sharing Policies for DASH
Assisting Network Elements
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Kleinrouweler2016,
title = { A Markov Model for Evaluating Resource Sharing Policies for DASH
Assisting Network Elements },
year = { 2016 },
address = { Würzburg, Germany },
author = { Kleinrouweler, Jan Willem and Cabrero, Sergio and van der Mei, Rob and Cesar, Pablo },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: In this paper, we present a model for evaluating bandwidth sharing
policies, that can be applied to networks that handle both video streaming
traffic, as well as other traffic. Video streaming is a demanding network
application. In crowded networks, resources need to be properly divided in
order not to diminish the streaming experience. However, in network
deployments with a large number of users, the streaming performance cannot
be obtained straightforwardly from a sharing policy. Therefore, we propose
a Markov model that is compatible with Dynamic Adaptive Streaming over HTTP
(DASH), the major technology for video streaming over the Internet. If DASH
is combined with in-network resource management, its performance can be
significantly improved. Nevertheless, resource sharing policies need to be
configured. This requires evaluating of many different configurations. Real
deployments or network simulations demand many system resources and time.
In contrast, our model can quickly evaluate many configurations, and for
each configuration output the expected video bitrate and number of changes
in video bitrate. These two parameters play an important role in the
Quality of Experience of the viewer. In this paper, we demonstrate how our
model can be used to analyze and optimize resource sharing policies. As
such, our model is a useful tool for network administrators and allows them
to better provision and configure their networks.
Gouvas, Panagiotis and Vassilakis, Constantinos and Fotopoulou, Eleni and Zafeiropoulos, Anastasios
A Novel Reconfigurable-by-Design Highly Distributed Applications
Development Paradigm Over Programmable Infrastructure
In Programmability for Cloud Networks and Applications 2016 (PROCON 2016). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Gouvas2016,
title = { A Novel Reconfigurable-by-Design Highly Distributed Applications
Development Paradigm Over Programmable Infrastructure },
year = { 2016 },
address = { Würzburg, Germany },
author = { Gouvas, Panagiotis and Vassilakis, Constantinos and Fotopoulou, Eleni and Zafeiropoulos, Anastasios },
booktitle = { Programmability for Cloud Networks and Applications 2016 (PROCON 2016) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Given the inability of Highly-Distributed-Application-Developers to foresee
the changes as well as the heterogeneity on the underlying infrastructure,
it is considerable crucial the design and development of novel software
paradigms that facilitate application developers to take advantage of the
emerging programmability of the underlying infrastructure and therefore
develop Reconfigurable-by-Design applications. In parallel, it is crucial
to design solutions that are scalable, support high performance, are
resilient-to-failure and take into account the conditions of their runtime
environment. Towards this direction, the ARCADIA project aims to design and
validate a Novel Reconfigurable-By-Design Highly Distributed Applications
(HDAs) Development Paradigm over Programmable Infrastructure. The proposed
framework relies on the development of an extensible Context Model which
will be used by developers to produce annotated source-code and generate
HDAs as service chains of application tiers and network functions
containing meaningful semantics. A Smart Controller responsible for
on-boarding the HDAs will undertake the tasks of translating annotations to
optimal infrastructural configuration. Such a controller will enforce an
optimal configuration to the registered programmable resources and will
pro-actively adjust the configuration plan based on the Infrastructural
State and the Application State to meet objectives and apply policies.
Driving a HDA through its entire lifetime proves highly beneficial for all
stakeholders since the synergy of the introduced applications
reconfigurability and the underlying infrastructure's programmability
facilitates the development of new fine-grained strategies able to fulfill
new and complex requirements.
Marotta, Antonio and Kassler, Andreas J.
A Power Efficient and Robust Virtual Network Functions Placement Problem
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Marotta2016,
title = { A Power Efficient and Robust Virtual Network Functions Placement Problem },
year = { 2016 },
address = { Würzburg, Germany },
author = { Marotta, Antonio and Kassler, Andreas J. },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Reducing the CAPEX and OPEX is a major concern for Telecom Operators (TOs):
to this extent, Network Function Virtualization (NFV) has been considered a
key aspect to virtualize network functions and push them to the NFV
Infrastructure. Virtual Network Functions (VNFs) can be deployed as a set
of components running on several cooperating Virtual Machines (VMs) inside
modern data centers. As a consequence, it becomes crucial for network
operators to minimize the power consumption of their NFV infrastructure, by
using the minimum set of physical servers and networking equipment subject
to the constraints that VNFs impose on the infrastructure in terms of
compute, memory, disk and network resources requirements. In this work, we
present a joint resources and flow routing assignment problem for VNFs
placement, with the objective of minimizing both the power consumption of
the servers and switches needed to deploy the overall virtualized
infrastructure and routing graph. In contrast to many existing works
assuming perfect knowledge on input parameters, such as traffic demands
between the VNFs, which is difficult to predict, we propose a novel
mathematical model based on the Robust Optimisation (RO) theory to deal
with uncertainty on data. Our numerical evaluation applies focuses on a
specific use-case, that is the deployment of a set of VNFs, typical of a
virtualized Evolved Packet Core (vEPC), namely the core for next generation
mobile networks. We demonstrate that with our model, a vEPC operator can
trade-off between two important aspects: the power consumption minimization
on one side, and the protection from severe deviations of the input
parameters, such as traffic demands and compute resources needed by the
individual VNFI components.
Neglia, Giovanni and Carra, Damiano and Feng, Mingdong and Janardhan, Vaishnav and Michiardi, Pietro and Tsigkari, Dimitra
Access-time Aware Cache Algorithms
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Neglia2016,
title = { Access-time Aware Cache Algorithms },
year = { 2016 },
address = { Würzburg, Germany },
author = { Neglia, Giovanni and Carra, Damiano and Feng, Mingdong and Janardhan, Vaishnav and Michiardi, Pietro and Tsigkari, Dimitra },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Most of the caching algorithms are oblivious to requests' timescale, but
caching systems are capacity constrained and in practical cases the hit
rate may be limited by the cache's impossibility to serve requests fast
enough. In particular the hard-disk access time can be the key factor
capping cache performances.
In this paper, we present a new cache replacement policy that takes
advantage
of a hierarchical caching architecture, and in particular of access-time
difference between memory and disk.
Our policy is optimal when requests follow the independent reference
model,
and significantly reduces the hard-disk load, as shown also by our
realistic,
trace-driven evaluation.
Faraci, Giuseppe and Lombardo, Alfio and Schembra, Giovanni
An Analytical Model to Design Processor Sharing for SDN/NFV Nodes
In Programmability for Cloud Networks and Applications 2016 (PROCON 2016). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Faraci2016,
title = { An Analytical Model to Design Processor Sharing for SDN/NFV Nodes },
year = { 2016 },
address = { Würzburg, Germany },
author = { Faraci, Giuseppe and Lombardo, Alfio and Schembra, Giovanni },
booktitle = { Programmability for Cloud Networks and Applications 2016 (PROCON 2016) },
month = { Sept },
misc = { days = 12 }
}
Abstract: The introduction of the two new paradigms Software Defined Networks (SDN)
and Network Functions Virtualization (NFV) in the Internet is
revolutionizing its design and management, creating many new challenging
problems regarding resource allocation and orchestration. Little attention
has been paid up to now to the "intranode" resource allocation. In this
context, this paper introduces an analytical model of an SDN/NFV node that
implements NARR, a processor sharing strategy proposed by the same authors
to reduce delays by assigning a larger processor slice to the flows that
will leave the node through a less loaded output network interface card
(NIC). Numerical results analytically demonstrates the gain achieved by
applying NARR, and give important insights for future work.
Tran, Manh Nam and Huynh, Nguyen Van and Le, Dai and Thanh, Nguyen Huu
An Energy-Aware Embedding Algorithm for Virtual Data Centers
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Tran2016a,
title = { An Energy-Aware Embedding Algorithm for Virtual Data Centers },
year = { 2016 },
address = { Würzburg, Germany },
author = { Tran, Manh Nam and Huynh, Nguyen Van and Le, Dai and Thanh, Nguyen Huu },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Green data center is becoming more recognized as a likely key trend in the
future of Information and Communications Technologies. It attracts growing
interest among many scientists today due to many of its possessed benefits,
such as increasing energy saving levels, cost reductions, as well as
decreasing carbon emissions. In a data center, Server Virtualization and
Live Migration technologies facilitate efficient load balancing and
reduction in power consumption of servers. Although using these
technologies has many benefits, they do not, however, take
energy-efficiency of the network devices such as routers, switches into
consideration. In this paper, we construct an energy-efficient data center
by combining server consolidation and idle logic approach of the data
center network.
Chemodanov, Dmitrii and Calyam, Prasad
Application-Aware Infrastructure Clustering for Cloud Service Placement
to Enhance User QoE
In QCMan 2016 (QCMan 2016). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Chemodanov2016,
title = { Application-Aware Infrastructure Clustering for Cloud Service Placement
to Enhance User QoE },
year = { 2016 },
address = { Würzburg, Germany },
author = { Chemodanov, Dmitrii and Calyam, Prasad },
booktitle = { QCMan 2016 (QCMan 2016) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Cloud services placement can be suboptimal in certain cases due to
inefficient network design, which in turn impacts user Quality of
Experience (QoE). Consequently, Application Service Providers (ASPs) need
to manage cloud network infrastructures with efficient designs that fully
satisfy Service Level Objectives (SLOs) of their data/video-intensive
applications of users. To proactively avoid this problem, a straightforward
solution used by ASPs is to have many replicas of their services by renting
more resources from Infrastructure Providers (InPs) which can lead to an
expensive service delivery proposition. In this paper, we present a novel
possibilistic C-Means (PCM) approach to enhance user QoE in cloud service
placement by clustering network infrastructure with awareness of user SLO
satisfaction amidst network path constraints. Our evaluation results
obtained using numerical simulations as well as in a real-world cloud
testbed with actual users prove that our multi-constrained path aware PCM
approach outperforms existing solutions. Specifically, we show how our
proposed infrastructure clustering with the PCM approach allows ASPs to
rent less resources from InPs that reduces user cost, while still
delivering satisfactory user QoE.
Gast, Nicolas and Houdt, Benny Van
Asymptotically Exact TTL-Approximations of the Cache Replacement
Algorithms LRU(m) and h-LRU
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Gast2016,
title = { Asymptotically Exact TTL-Approximations of the Cache Replacement
Algorithms LRU(m) and h-LRU },
year = { 2016 },
address = { Würzburg, Germany },
author = { Gast, Nicolas and Houdt, Benny Van },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Computer system and network performance can be significantly
improved by caching frequently used information. When the cache size
is limited, the cache replacement algorithm has an important impact
on the effectiveness of caching. In this paper we introduce
time-to-live (TTL) approximations to determine the cache hit
probability of two classes of cache replacement algorithms: the
recently introduced h-LRU and LRU(m). These approximations
only require the requests to be generated according to a general
Markovian arrival process (MAP). This includes phase-type renewal
processes and the IRM model as special cases.
We provide both numerical and theoretical support for the claim that
the proposed TTL approximations are asymptotically exact. In
particular, we show that the transient hit probability converges to
the solution of a set of ODEs (under the IRM model), where the fixed
point of the set of ODEs corresponds to the TTL approximation. We
further show, by using synthetic and trace-based workloads, that
h-LRU and LRU(m) perform alike, while the latter requires less work
when a hit/miss occurs. We also show that, as opposed to LRU, h-LRU
and LRU(m) are sensitive to the correlation between consecutive
inter-request times.
Seufert, Michael and Lange, Stanislav and Meixner, Markus
Automated Decision Making Methods for the Multi-objective Optimization Task
of Cloud Service Placement
In Programmability for Cloud Networks and Applications 2016 (PROCON 2016). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Seufert2016,
title = { Automated Decision Making Methods for the Multi-objective Optimization Task
of Cloud Service Placement },
year = { 2016 },
address = { Würzburg, Germany },
author = { Seufert, Michael and Lange, Stanislav and Meixner, Markus },
booktitle = { Programmability for Cloud Networks and Applications 2016 (PROCON 2016) },
month = { Sept },
misc = { days = 12 }
}
Abstract: The network functions virtualization (NFV) paradigm provides advantages
with respect to aspects like flexibility, costs, and scalability of
networks. However, management and orchestration of the resulting networks
also introduce new challenges. The placement of services and virtualized
network functions (VNFs) is a multi-objective optimization task that
confronts operators with a multitude of possible solutions that are
incomparable among each other. The goal of this work is to investigate
mechanisms that enable automated decision making between such multi
dimensional solutions. To this end, we investigate techniques from the
domain of multi attribute decision making that aggregate the performance of
placements to a single numeric score. A comparison between resulting
rankings of placements shows that many techniques produce similar results.
Hence, placements that achieve good rankings according to many approaches
might be viable candidates in the context of automated decision making.
Mukhopadhyay, Arpan and Mazumdar, Ravi R and Roy, Rahul
Binary Opinion Dynamics with Biased Agents and Agents with Different
Degrees of Stubbornness
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Mukhopadhyay2016,
title = { Binary Opinion Dynamics with Biased Agents and Agents with Different
Degrees of Stubbornness },
year = { 2016 },
address = { Würzburg, Germany },
author = { Mukhopadhyay, Arpan and Mazumdar, Ravi R and Roy, Rahul },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: In this paper, we investigate the impact of random interactions
between agents in a social network on the diffusion of opinions
in the network.
Opinion of each agent is assumed to be
a binary variable taking values in the set 0, 1.
Each agent is assumed to be able to interact with any other agent
in the network.
This models scenarios where
every agent in the network has to choose from two available options
and the size of the neighborhood of each agent is an increasing
function of the total number agents in the network.
It is assumed that each agent updates its opinion at random instants upon
interacting
with other randomly sampled agents.
We consider two simple rules of interaction: (1) the voter rule
in which the updating agent simply copies the opinion
of another randomly sampled agent;
(2) the majority rule, in which
the updating agent samples multiple agents
and adopts the majority opinion among
the sampled agents and the agent itself.
Under each rule, we consider
two different scenarios which have note been
considered in the literature thus far: (1) where the agents
are `biased' towards one of the opinions,
(2) where different agents have different degrees of stubbornness.
We show that the presence of biased agents
reduces the consensus time for the voter rule exponentially
as compared to the case where the agents are unbiased.
For the majority rule model with biased agents
we show that the network reaches consensus on a particular opinion
with high probability only when the initial fraction of agents
having that opinion is above a certain threshold.
For the majority rule model with stubborn agents
we observe metastability where the network
switches back and forth between stable states spending long
intervals in each state.
Moldovan, Christian and Metzger, Florian
Bridging the Gap Between QoE and User Engagement in HTTP Video
Streaming
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Moldovan2016,
title = { Bridging the Gap Between QoE and User Engagement in HTTP Video
Streaming },
year = { 2016 },
address = { Würzburg, Germany },
author = { Moldovan, Christian and Metzger, Florian },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: On video streaming platforms, users expect a high QoE. In contrast, service
and content providers aim at high User Engagement, most notably because
their revenue is usually dependent on it. In order to satisfy users, it is
critical to know how QoE is related to the User Engagement. However, no
model for this relation exists yet. Current approaches to managing QoE are
usually based on traffic analysis. However, in the future Internet this
will become more difficult since the encryption of Internet traffic
progresses.
In this paper, we present an approach to bringing QoE and User Engagement
together with video streaming as the use case. We do this by fitting
existing measurement data of User Engagement to obtain a model.
Furthermore, we extend the existing queuing model for QoE and investigate
the correlation between QoE and User Engagement in a simulation. Hereby, we
model different scenarios where we quantify network bandwidth and video
requirements.
Our results show that there is a strong correlation between QoE and User
Engagement. Additionally, we observe that simple buffer policies that do
not rely on buffer information can still perform well. These revelations
open the way for new approaches to QoE Management in the future Internet.
Beifuß, Alexander and Runge, Torsten M. and Raumer, Daniel and Emmerich, Paul and Wolfinger, Bernd E. and Carle, Georg
Building a Low Latency Linux Software Router
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Beifus2016,
title = { Building a Low Latency Linux Software Router },
year = { 2016 },
address = { Würzburg, Germany },
author = { Beifuß, Alexander and Runge, Torsten M. and Raumer, Daniel and Emmerich, Paul and Wolfinger, Bernd E. and Carle, Georg },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Packet processing (e.g. routing, switching, firewall functionality) with
commodity hardware is a cost-efficient and flexible alternative to
specialized networking hardware. On commodity hardware the CPU typically
becomes the bottleneck in packet processing. However, in well-known QoS
mechanisms (e.g. DiffServ, IntServ), the outgoing link is assumed to be the
bottleneck. This limitation is unfavorable, in particular for
latency-sensitive applications (e.g. VoIP, video conferencing, online
gaming). Thus, we propose and implement a QoS concept for a Linux software
router to prioritize latency-sensitive traffic at the incoming network
interface. Our testbed measurements show that our prototype implementation
improves the packet processing w.r.t the latency of latency-sensitive
traffic even under high traffic loads.
Morichetta, Andrea and Bocchi, Enrico and Metwalley, Hassan and Mellia, Marco
CLUE: Clustering for Mining Web URLs
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Morichetta2016,
title = { CLUE: Clustering for Mining Web URLs },
year = { 2016 },
address = { Würzburg, Germany },
author = { Morichetta, Andrea and Bocchi, Enrico and Metwalley, Hassan and Mellia, Marco },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: The Internet has witnessed the proliferation of applications and services
that rely on HTTP as application protocol. Users play games, read emails,
watch videos, chat and access web pages using their PC, which in turn
downloads tens or hundreds of URLs to fetch all objects that are needed to
display the requested content. As a results, billions of URLs are observed
in the network.
When monitoring the traffic, thus, it is becoming more and more important
to have methodologies that allow one to dig into this data, and extract
useful information. In this paper, we present CLUE, Clustering for URL
Exploration, a methodology that leverage clustering algorithms, i.e.,
classic unsupervised approaches developed in the data mining field, to
extract knowledge from passive observation of URLs carried by the network.
This is a challenging problem, given the unstructured format of URLs,
which, being strings, call for specialized approaches. Inspired by
text-mining algorithms, we face this problem by introducing a concept of
URL-distance, and using it to extract URL clusters using the classic DBSCAN
algorithm.
Experiments on actual datasets show encouraging results: well-separated and
consistent clusters emerge and allow us to identify, e.g., malicious
traffic, file hosting services, and third- party tracking services. In a
nutshell, our clustering algorithm offers the means to get insights on the
data carried by the network, with possible applications in the security, or
privacy protection fields.
Nguyen, Dinh and Sugiyama, Kohei and Tagami, Atsushi
Cache the Queues: Caching and Forwarding in ICN From a Congestion Control
Perspective
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Nguyen2016,
title = { Cache the Queues: Caching and Forwarding in ICN From a Congestion Control
Perspective },
year = { 2016 },
address = { Würzburg, Germany },
author = { Nguyen, Dinh and Sugiyama, Kohei and Tagami, Atsushi },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Caching and multipath forwarding are essential ingredients of the
Information-Centric Networking (ICN) architecture resulting from ubiquitous
content storage and content-based node-by-node forwarding nature of ICN,
much is yet to see how they jointly act towards improving user's quality of
experience. To this end, we formulate in this paper a unified problem of
caching and multipath forwarding as a network optimization problem to
maximize user satisfaction which is expressed by their utility function.
The formulation allows us to see caching and multipath forwarding in ICN
from a congestion control perspective and to reinforce the advantage of a
class of congestion-aware caching where in-network caches are used to
absorb network congestion and to enhance user's satisfaction. In that
context, multipath forwarding plays the role of directing content delivery
to less congested paths where network capacity is abundant or where
requested content has been stored by in-network caches. We evaluate such a
congestion control-based, coupled caching and multipath forwarding approach
in simulations. The result confirms the advantage of our approach compared
with existing ones.
Borchert, Kathrin and Hirth, Matthias and Zinner, Thomas and Mocanu, Decebal Constantin
Correlating QoE and Technical Parameters of an SAP System in an
Enterprise Environment
In QCMan 2016 (QCMan 2016). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Borchert2016,
title = { Correlating QoE and Technical Parameters of an SAP System in an
Enterprise Environment },
year = { 2016 },
address = { Würzburg, Germany },
author = { Borchert, Kathrin and Hirth, Matthias and Zinner, Thomas and Mocanu, Decebal Constantin },
booktitle = { QCMan 2016 (QCMan 2016) },
month = { Sept },
misc = { days = 12 }
}
Abstract: The impact of waiting times in interactive and web-based services on the
Quality of Experience (QoE) has attracted high interest. Most studies aim
at understanding the QoE impact of waiting times in specific laboratories
or in the user's domestic environment. Enterprise and working environments
have been largely ignored. This mostly stems from two factors: i) the high
complexity of enterprise systems hindering the exact monitoring of relevant
application response times on user granularity and ii) disturbances of the
day-to-day business by user studies resulting in less productive
employees.
This paper approaches these challenges by combining non-intrusive
application monitoring of response times and subjective user ratings on the
perceived application performance. The correlation between objective
measurements and subjective ratings is evaluated using different machine
learning approaches. The results imply a high correlation for specific
users, but do not allow to deviate a generic model.
Schmidt, Mark and Finze, Robert and Menth, Michael
Demo: Integrating Distributed High-Performance Zones in the BelWue
ISP Network and University Campuses Using OpenFlow
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Schmidt2016,
title = { Demo: Integrating Distributed High-Performance Zones in the BelWue
ISP Network and University Campuses Using OpenFlow },
year = { 2016 },
address = { Würzburg, Germany },
author = { Schmidt, Mark and Finze, Robert and Menth, Michael },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: The Internet service provider (ISP) BelWue interconnects higher education
and research institutions in Baden-Wuerttemberg (Germany). Its 10 Gb/s
backbone has been extended with an additional optical 100 Gb/s high-speed
network between the universities called NeIF. In addition special
high-performance zones (HPZ) have been setup at the these locations. This
paper presents a concept for the integration of the HPZs into the
university campuses and the BelWue network with the help of OpenFlow-based
SDN and BGP. The demo features a testbed implementing this concept for
three university locations. We show, how different HPZs can communicate
directly through the the NeIF and how the legacy BelWue network is used for
communication to the campuses.
Bronzino, Francesco and Raychaudhuri, Dipankar and Seskar, Ivan
Demonstrating Context-Aware Services in the MobilityFirst Future
Internet Architecture
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Bronzino2016,
title = { Demonstrating Context-Aware Services in the MobilityFirst Future
Internet Architecture },
year = { 2016 },
address = { Würzburg, Germany },
author = { Bronzino, Francesco and Raychaudhuri, Dipankar and Seskar, Ivan },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: As the amount of mobile devices populating the Internet keeps growing at
tremendous pace, context-aware services have gained a lot of traction
thanks to the wide set of potential use cases they can be applied to.
Environmental sensing applications, emergency services and location-aware
messaging are just a few examples of applications that are expected to
increase in popularity in the next few years.
The MobilityFirst future Internet architecture, a clean-slate Internet
architecture design, provides the necessary abstractions for creating and
managing context-aware services. Starting from these abstractions we design
a context services framework, which is based on a set of three fundamental
mechanisms: an easy way to specify context based on human understandable
techniques, i.e. use of names; an architecture supported management
mechanism that allows both to conveniently deploy the service and
efficiently provide management capabilities; and a native delivery system
that reduces the tax on the network components and on the overhead cost of
deploying such applications.
In this paper, we present an emergency alert system for vehicles assisting
first responders that exploits users location awareness to support quick
and reliable alert messages for interested vehicles. By deploying a demo of
the system on a nationwide testbed, we aim to provide better understanding
of the dynamics involved in our designed framework.
Gebert, Steffen and Zinner, Thomas and Gray, Nicholas and Durner, Raphael and Lorenz, Claas and Lange, Stanislav
Demonstrating a Personalized Secure-By-Default Bring Your Own Device
Solution Based on Software Defined Networking
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Gebert2016,
title = { Demonstrating a Personalized Secure-By-Default Bring Your Own Device
Solution Based on Software Defined Networking },
year = { 2016 },
address = { Würzburg, Germany },
author = { Gebert, Steffen and Zinner, Thomas and Gray, Nicholas and Durner, Raphael and Lorenz, Claas and Lange, Stanislav },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Network virtualization is one classical use-case for Software Defined
Networks (SDN). By programmatically instantiating virtual networks, traffic
from one or more devices can be separated or connectivity can be
established as needed. S-BYOD, which is presented in this demonstration,
applies the SDN concept to Bring Your Own Device (BYOD) scenarios and
offers personalized virtual networks that are set up and extended on
demand. This is done once the user authenticates, activates access to
additional applications, or as soon as applications scale out and involve
more servers. The described proof-of-concept implementation explores, to
what degree an agent-less BYOD solution, based only on SDN, can lower the
attack surface by explicit user opt-ins for particular services. Further,
an assessment of the number of required rules within the flow tables of
switches completes this work.
Danielis, Peter and Kouyoumdjieva, Sylvia T. and Karlsson, Gunnar
DiVote: A Distributed Voting Protocol for Mobile Device-to-Device
Communication
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Danielis2016,
title = { DiVote: A Distributed Voting Protocol for Mobile Device-to-Device
Communication },
year = { 2016 },
address = { Würzburg, Germany },
author = { Danielis, Peter and Kouyoumdjieva, Sylvia T. and Karlsson, Gunnar },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Distributed aggregation algorithms have traditionally been applied to
environments with no or rather low rates of node churn.
The proliferation of mobile devices in recent years introduces high
mobility and node churn to these environments, thus imposing a new
dimension on the problem of distributed aggregation in terms of scalability
and convergence speed.
To address this, we present DiVote, a distributed voting protocol for
mobile device-to-device communication. We investigate a particular use
case, in which pedestrians equipped with mobile phones roam around in an
urban area and participate in a distributed yes/no poll, which has both
spatial and temporal relevance to the community. Each node casts a vote and
collects votes from other participants in the system whenever in
communication range; votes are immediately integrated into a local
estimate. The objective of DiVote is to produce a precise mapping of the
local estimate to the anticipated global voting result while preserving
node privacy. Since mobile devices may have limited resources allocated for
mobile sensing activities, DiVote utilizes D-GAP compression. We evaluate
the proposed protocol via extensive trace-driven simulations of realistic
pedestrian behavior, and demonstrate that it scales well with the number of
nodes in the system. Furthermore, in densely populated areas the local
estimate of participants does not deviate by more than 2.5 % from the
global result. Finally, in certain scenarios the achievable compression
rate of DiVote is at least 19 % for realistic vote distributions.
Tran, Phuong Nga and Saito, Hiroshi
Disaster Avoidance Control Against Tsunami
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Tran2016,
title = { Disaster Avoidance Control Against Tsunami },
year = { 2016 },
address = { Würzburg, Germany },
author = { Tran, Phuong Nga and Saito, Hiroshi },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: We investigated challenges in network disaster management
against tsunamis. A tsunami is a natural disaster of
which the arrival time and devastating effect can be predicted.
Based on this prediction, network operators can carry out
different disaster management actions to avoid or reduce the
damaging effect of tsunami on the network. We developed
and evaluated heuristic algorithms to efficiently migrate service
(virtual) networks away from a disaster affected area to minimize
traffic loss when a tsunami arrives. The problem was first
formulated as an integer linear programming problem, which
can be solved using optimization solvers for small/medium-sized
networks. For large networks, our heuristic algorithms ensure
a good solution within a reasonable time. Extensive simulations
were carried out to evaluate the performance of our proposed
algorithms. On the basis of the tsunami predicted information
and network status, network operators can select a suitable
algorithm for their disaster management action.
Pacifici, Valentino and Jošilo, Slađana and Dán, György
Distributed Algorithms for Content Caching in Mobile Backhaul Networks
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Pacifici2016,
title = { Distributed Algorithms for Content Caching in Mobile Backhaul Networks },
year = { 2016 },
address = { Würzburg, Germany },
author = { Pacifici, Valentino and Jošilo, Slađana and Dán, György },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: The growing popularity of mobile multimedia content and the increase of
wireless access bitrates are straining backhaul capacity in mobile
networks. A cost-effective solution to reduce the strain, enabled by
emerging all-IP 4G and 5G mobile backhaul architectures, could be
in-network caching of popular content during times of peak demand. In this
paper we formulate the problem of content caching in a mobile backhaul as a
binary integer programming problem, and we propose a 2-approximation
algorithm for the problem. The 2-approximation requires full information
about the network topology and the link costs, as well as about the content
demands at the different caches, we thus propose two distributed algorithms
that are based on local information on the content demands. We show that
the distributed algorithms terminate in a finite number of steps, and we
provide analytical results on their approximation ratios. We use
simulations to evaluate the proposed algorithms in terms of the achieved
approximation ratio and computational complexity on realistic mobile
backhaul topologies.
Araldo, Andrea and Dán, György and Rossi, Dario
Dynamic Cache Partitioning for Encrypted Content Delivery
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Araldo2016,
title = { Dynamic Cache Partitioning for Encrypted Content Delivery },
year = { 2016 },
address = { Würzburg, Germany },
author = { Araldo, Andrea and Dán, György and Rossi, Dario },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: In-network caching is an appealing solution to cope with the increasing
bandwidth demand of video, audio and data transfer over the Internet.
Nonetheless, an increasing share of content delivery services adopt
encryption through HTTPS, which is not compatible with traditional
ISP-managed approaches like transparent and proxy caching. This raises the
need for solutions involving both Internet Service Providers (ISP) and
Content Providers (CP): by design, the solution should preserve
business-critical CP information (e.g., content popularity, user
preferences) on the one hand, while allowing for a deeper integration of
caches in the ISP architecture (e.g., in 5G femto-cells) on the other hand.
In this paper we address this issue by considering a content-oblivious
ISP-operated cache. The ISP allocates the cache storage to various content
providers so as to maximize the bandwidth savings provided by the cache:
the main novelty lies in the fact that, to protect business-critical
information, ISPs only need to measure the aggregated miss rates of the
individual CPs. We propose a cache allocation algorithm based on a
perturbed stochastic subgradient method, and prove that the algorithm
converges to the allocation that maximizes the overall cache hit rate. We
use extensive simulations to validate the algorithm and to assess its
convergence rate under stationary and non-stationary content popularities.
Our results (i) testify the feasibility of content-oblivious caches and
(ii) show that the proposed algorithm can achieve within 15% from the
global optimum in our evaluation.
Maswood, Mirza Mohd Shahriar and Develder, Chris and Madeira, Edmundo and Medhi, Deep
Dynamic Virtual Network Traffic Engineering with Energy Efficiency in
Multi-Location Data Center Networks
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Maswood2016,
title = { Dynamic Virtual Network Traffic Engineering with Energy Efficiency in
Multi-Location Data Center Networks },
year = { 2016 },
address = { Würzburg, Germany },
author = { Maswood, Mirza Mohd Shahriar and Develder, Chris and Madeira, Edmundo and Medhi, Deep },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: For cloud enterprise customers that require services on demand, data
centers must
allocate and partition data center resources in a dynamic fashion. We
consider the problem in which a request from an enterprise customer is
mapped to a virtual network (VN) that is allocated requiring both bandwidth
and compute resources by connecting it from an entry point of the
datacenter to one or more servers, should this data center be selected from
multiple geographically distributed data centers.
We present a dynamic traffic engineering framework, for which we develop
an optimization model based on mixed-integer linear programming (MIP)
formulation
that a data center operator can use is at each review point to optimally
assign VN customers.
Through a series of studies, we then present results on how different VN
customers are treated in terms of request acceptance when each VN class
have different resource requirement. We found that a VN class with low
resource requirement has a low blocking even in heavy traffic , while the
VN class with high resource requirement faces high service denial. On the
other hand, cost for the VN with the highest resource requirement is not
always the highest in the heavy traffic because of very high service denial
faced by this VN class.
Obadia, Mathis and Rougier, Jean-Louis and Iannone, Luigi and Bouet, Mathieu and Conan, Vania
Elastic Network Service Provisioning with VNF Auctioning
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Obadia2016,
title = { Elastic Network Service Provisioning with VNF Auctioning },
year = { 2016 },
address = { Würzburg, Germany },
author = { Obadia, Mathis and Rougier, Jean-Louis and Iannone, Luigi and Bouet, Mathieu and Conan, Vania },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Network Function Virtualization (NFV) is an emerging approach that has
received attention from both academia and industry as a way to improve
flexibility, efficiency, and manageability of networks.
NFV enables new ways to operate networks and to provide composite network
services, opening the path toward new business models.
As in cloud computing with the Infrastructure as a Service model, clients
will be offered the capability to provision and instantiate Virtual Network
Functions (VNF) on the NFV infrastructure of the network operators.
In this paper, we consider the case where leftover VNF capacities are
offered for bid. This approach is particularly interesting for clients to
punctually provision resources to absorb peak or unpredictable demands and
for operators to increase their revenues.
We propose a game theoretic approach and make use of Multi-Unit
Combinatorial Auctions to select the winning clients and the price they
pay.
Such a formulation allows clients to express their VNF requests according
to their specific objectives.
We solve this problem with a greedy heuristic and prove that this
approximation of economic efficiency is the closest attainable in
polynomial time and provides a payment system that motivates bidders to
submit their true valuations.
Simulation results show that the proposed heuristic achieves a market
valuation close to the optimal (less than 10 % deviation) and guarantees
that an important part of this valuation is paid as revenue to the
operator.
Moldovan, Christian and Hoßfeld, Tobias
Impact of Variances on the QoE in Video Streaming
In QCMan 2016 (QCMan 2016). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Moldovan2016a,
title = { Impact of Variances on the QoE in Video Streaming },
year = { 2016 },
address = { Würzburg, Germany },
author = { Moldovan, Christian and Hoßfeld, Tobias },
booktitle = { QCMan 2016 (QCMan 2016) },
month = { Sept },
misc = { days = 12 }
}
Abstract: In the current Internet video streaming is dominating fixed and mobile
consumer traffic. However, wireless and mobile networks may lack bandwidth
or suffer from severe bandwidth fluctuations. The question arises: What is
the impact of bandwidth fluctuations on the Quality of Service (QoS) and
the user perceived quality? The key contribution of this paper is the
analysis of QoS in terms of application-level parameters (stalling duration
and frequency) for reliable video-on-demand streaming. The QoS is mapped to
Quality of Experience (QoE) based on an existing QoS-QoE model for HTTP
streaming. Different network conditions, in particular average and
variances of network bandwidths, and video bit rates are taken into account
in the analysis. We approach this problem by modeling the video player as a
queueing system and evaluate the transient phase of the non-stationary
system by means of discrete-event simulations. The results of our study
show that the characteristics of the network have a high impact on the QoS
and a surprisingly low impact on the QoE under certain conditions.
Hohlfeld, Oliver and Fiedler, Hannes and Pujol, Enric and Guse, Dennis
Insensitivity to Network Delay: Minecraft Gaming Experience of Casual
Gamers
In QCMan 2016 (QCMan 2016). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Hohlfeld2016,
title = { Insensitivity to Network Delay: Minecraft Gaming Experience of Casual
Gamers },
year = { 2016 },
address = { Würzburg, Germany },
author = { Hohlfeld, Oliver and Fiedler, Hannes and Pujol, Enric and Guse, Dennis },
booktitle = { QCMan 2016 (QCMan 2016) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Assessing the impact of network delay on gaming quality has been subject to
many studies involving different genres ranging from fast-paced
first-person shooters to strategy games. This paper assesses the impact of
network latency on the Quality of Experience (QoE) of casual gamers with
Minecraft. It is based on a user study involving 12 casual gamers with no
prior Minecraft experience. The QoE is assessed using the Game Experience
Questionnaire (GEQ) and dedicated questions for the overall perceived
quality and experienced interruptions. The main finding is that casual
Minecraft players are rather insensitive to network delay of up to 1 sec.
Thomas, Charles and Kline, Jeff and Barford, Paul
IntegraTag: a Framework for High-Fidelity Web Client Measurement
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Thomas2016,
title = { IntegraTag: a Framework for High-Fidelity Web Client Measurement },
year = { 2016 },
address = { Würzburg, Germany },
author = { Thomas, Charles and Kline, Jeff and Barford, Paul },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Collecting information from web clients without explicit input from users
is important in a variety of contexts including content customization,
experience personalization, accounting and online advertising. A standard
approach for gathering web client telemetry is through deployment of
Javascript instrumentation that is placed either directly on web pages or
through third-party "tags" that are referenced in web pages. In this
paper we present a design study of web client measurement methods. The
objective of our work is to enhance understanding of best practices in web
client measurement toward the goal of developing future tags that are
reliable, robust and efficient. We begin by conducting a detailed
examination of Javascript instrumentation collected from five well known
third party services. Our analysis shows that these code-bases have diverse
capabilities and return a broad range of client characteristics. Next, we
describe a web client measurement framework and an implementation that we
call IntegraTag, which enables us to examine details of performance,
accuracy and reliability through live deployments. We use IntegraTag to
conduct case studies of tag behavior on a single website which resulted in
over 500K page-loads, and on a publisher network which resulted in over
150M page-loads. We report on the wide range of client characteristics
returned by IntegraTag, as well as it's performance and robustness.
Moety, Farah and Bouhtou, Mustapha and En-Najjary, Taoufik and Nasri, Ridha
Joint Optimization of User Association and User Satisfaction in
Heterogeneous Cellular Networks
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Moety2016,
title = { Joint Optimization of User Association and User Satisfaction in
Heterogeneous Cellular Networks },
year = { 2016 },
address = { Würzburg, Germany },
author = { Moety, Farah and Bouhtou, Mustapha and En-Najjary, Taoufik and Nasri, Ridha },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: In this paper, we address the joint problem of user association and
resource allocation in wireless heterogeneous networks. Therefore, we
formulate an optimization approach considering two objectives, namely,
maximizing the number of served User Equipments (UEs) and maximizing the
sum of the UE utilities. Precisely, the aim is to associate UEs with the
optimal Radio Access Technology (RAT) and to allocate to these UEs the
optimal Resource Units (RUs) based on their requested services and
contracts. Our problem is challenging because it is mixed integer
non-linear optimization. To tackle this difficulty, we provide a Mixed
Integer Linear Programming (MILP) re-formulation of the problem that makes
it computationally tractable. Various preferences for user association and
resource allocation are conducted by tuning: on the one hand, the weights
associated with different services and contracts; on the other hand, the
weights associated with the considered two objectives. The optimal solution
of the MILP problem is computed for a realistic network scenario and
compared with legacy solution. Extensive simulation results show that the
proposed optimization approach improves the overall network performance
while considering the UE requested service and contract: it outperforms
legacy solutions in terms of user satisfaction. Moreover, it provides an
efficient distribution of UEs on the different RATs.
Lee, Ying Loong and Wang, Li-Chun and Chuah, Teong Chee and Loo, Jonathan
Joint Resource Allocation and User Association for Heterogeneous Cloud
Radio Access Networks
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Lee2016,
title = { Joint Resource Allocation and User Association for Heterogeneous Cloud
Radio Access Networks },
year = { 2016 },
address = { Würzburg, Germany },
author = { Lee, Ying Loong and Wang, Li-Chun and Chuah, Teong Chee and Loo, Jonathan },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Cloud radio access networks (C-RANs) have been regarded as a promising
architecture for energy-efficient fifth generation systems. In this paper,
a new joint remote radio head (RRH) activation, user-RRH pairing and
resource allocation strategy is proposed for heterogeneous C-RANs
(H-CRANs). We first formulate an optimization problem to maximize the
energy efficiency of H-CRANs. Then, a low-complexity suboptimal solution is
developed. Our proposed mechanism consists of three key procedures: 1) RRH
activation is performed based on greedy RRH selection; 2) user-RRH pairing
is performed based on the channel quality; 3) the resource allocation
problem is solved by dual decomposition. Simulation results show that the
proposed strategy can improve energy efficiency significantly.
Hemmings, Matthew and Ingalls, Daniel and Krahn, Robert and McGeer, Rick and Ricart, Glenn and Röder, Marko and Stege, Ulrike
LiveTalk: A Framework for Collaborative Browser-Based
Replicated-Computation Applications
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Hemmings2016,
title = { LiveTalk: A Framework for Collaborative Browser-Based
Replicated-Computation Applications },
year = { 2016 },
address = { Würzburg, Germany },
author = { Hemmings, Matthew and Ingalls, Daniel and Krahn, Robert and McGeer, Rick and Ricart, Glenn and Röder, Marko and Stege, Ulrike },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: In this paper we describe LiveTalk, a framework for Collaborative
Browser-based Replicated-Computation applications. LiveTalk permits
multiple users separated across the wide area to interact with separate
copies of a single application, sharing a single virtual workspace, using
very little network bandwidth. LiveTalk features an integrated
browser-based programming environment with native graphics and live
evaluation, an integrated, pluggable web server, and a simple messaging
service that serves to coordinate activity on shared application sessions,
and provides for multiple mutually-isolated sessions. The first use case
for LiveTalk is collaborative big-data visualizations running on
thin-client devices such as cellular phones, tablets, and netbooks. These
applications form part of a new class of application where the distributed
cloud is leveraged to provide low latency, high-bandwidth access to
geographically disparate users while maintaining the feel of immediacy
associated with local computation. The primary motivation of this work is
to permit low latency collaborative applications to be built quickly and
easily, while requiring no setup for use by the end-user.
Hyytiä, Esa and Righter, Rhonda and Virtamo, Jorma
Meeting Soft Deadlines in Single- And Multi-Server Systems
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Hyytiae2016,
title = { Meeting Soft Deadlines in Single- And Multi-Server Systems },
year = { 2016 },
address = { Würzburg, Germany },
author = { Hyytiä, Esa and Righter, Rhonda and Virtamo, Jorma },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: We consider single- and multi-server systems, where jobs have a maximum
waiting time (deadline) defined, e.g., by a service level agreement. A
fixed cost is a cost associated with deadline violations and the task is to
minimize the long-run cumulative costs. Job sizes (service durations) are
observed upon arrival, and current queue backlogs are known. For a single
FCFS server, the optimization task is to find the optimal admission policy
that may reject a job upon arrival if admitting it would cause in future
one or more deadlines to be violated (in expectation). For parallel FCFS
servers, the policy must (i) either accept or reject a job upon arrival,
and if accepted, (ii) assign it to one of the servers. We derive efficient
deadline-aware policies in the MDP framework. For a single server, we
obtain the optimal admission policy. For dispatching to parallel servers,
we develop efficient heuristic admission and dispatching policies, whose
performances are evaluated by means of numerical examples. Additionally, we
give some exact closed-form results for heavy-traffic limits.
Lundrigan, Philip and Khaledi, Mojgan and Kano, Makito and Subramanyam, Naveen and Kasera, Sneha Kumar
Mobile Live Video Upstreaming
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Lundrigan2016,
title = { Mobile Live Video Upstreaming },
year = { 2016 },
address = { Würzburg, Germany },
author = { Lundrigan, Philip and Khaledi, Mojgan and Kano, Makito and Subramanyam, Naveen and Kasera, Sneha Kumar },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: We design and build a system we call mobiLivUp, that utilizes nearby
smartphones to improve live wide-area video upstreaming. In mobiLivUp, to
distribute the video to nearby devices, the video streaming device creates
a small wireless network using Wi-Fi Direct. Other devices then connect to
this network. Parts of the video stream are sent to these connected
devices, which then upload their parts to a location in the wide-area
network using their cellular connections. We develop algorithms and methods
to effectively distribute video data to nearby nodes and for incentivizing
cooperation from these nodes. We test our system through trace-driven
simulation and implementation in various settings. Our experiments show
that, in general, mobiLivUp increases the aggregate video throughput,
depending on the number of nodes forwarding data and their data rates.
Tortelli, Michele and Rossi, Dario and Leonardi, Emilio
ModelGraft: Accurate, Scalable, and Flexible Performance Evaluation of
General Cache Networks
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Tortelli2016,
title = { ModelGraft: Accurate, Scalable, and Flexible Performance Evaluation of
General Cache Networks },
year = { 2016 },
address = { Würzburg, Germany },
author = { Tortelli, Michele and Rossi, Dario and Leonardi, Emilio },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Large scale deployments of general cache networks, such as Content Delivery
Networks or Information Centric Networking architectures, arise new
challenges regarding their performance evaluation for network planning. On
the one hand, analytical models can hardly represent all the detailed
interaction of complex replacement, replication, and routing policies on
arbitrary topologies. On the other hand, the sheer size of network and
content catalogs makes event-driven simulation techniques inherently
non-scalable. We propose a new technique for the performance evaluation of
large scale caching systems that intelligently integrates elements of
stochastic analysis within a MonteCarlo simulative approach, that we
colloquially refer to as ModelGraft. Our approach (i) leverages the
intuition that complex scenarios can be mapped to a simpler equivalent
scenario that builds upon Time-To-Live (TTL) caches; it (ii) significantly
downscales the scenario to lower computation and memory complexity, while,
at the same time, preserving its properties to limit accuracy loss;
finally, it (iii) is simple to use and robust, as it autonomously converges
to a consistent state through a feedback-loop control system, regardless of
the initial state. Performance evaluation shows that, with respect to
classic event-driven simulation, ModelGraft gains over two orders of
magnitude in both CPU time and memory complexity, while limiting accuracy
loss below 2%. In addition, we show that ModelGraft extends performance
evaluation well beyond the boundaries of classic approaches, by enabling
study of Internet scale scenarios with content catalogs comprising hundreds
of billions objects.
Najjar, Amro and Serpaggi, Xavier and Gravier, Christophe and Boissier, Olivier
Multi-agent Systems for Personalized QoE-Management
In QCMan 2016 (QCMan 2016). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Najjar2016,
title = { Multi-agent Systems for Personalized QoE-Management },
year = { 2016 },
address = { Würzburg, Germany },
author = { Najjar, Amro and Serpaggi, Xavier and Gravier, Christophe and Boissier, Olivier },
booktitle = { QCMan 2016 (QCMan 2016) },
month = { Sept },
misc = { days = 12 }
}
Abstract: User satisfaction is becoming a key factor to secure the success of any
online service. Quality of Experience is a subjective measure of the
service quality as perceived by the user. QoE has been introduced to bridge
the gap between the purely technical characteristics of QoS and user
satisfaction. Recent research on QoE has shown that QoE is highly personal
and influenced by multiple interrelated factors including the user
expectations, her cultural background and preferences.
However, most existing QoE management solutions overlook the personal
aspect of QoE and ignore inter-user differences despite the promise of
adopting a user-centric approach. In this paper, we propose multi-agent
technology as means to achieve personalized QoE-management. In particular,
we propose a multi-agent architecture called EMan where each end-user is
embodied by an autonomous agent that represents her personal preferences
and expectations and seeks to maximize her QoE. To evaluate our approach,
we use Repast, a multi-agent simulation platform. The preliminary results
show that the personalized multi-agent model offers a better subjective QoE
to users than centralized models that ignore inter-user differences.
Pries, Rastin and Morper, Hans-Jochen and Galambosi, Nandor and Jarschel, Michael
Network as a Service - A Demo on 5G Network Slicing
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Pries2016,
title = { Network as a Service - A Demo on 5G Network Slicing },
year = { 2016 },
address = { Würzburg, Germany },
author = { Pries, Rastin and Morper, Hans-Jochen and Galambosi, Nandor and Jarschel, Michael },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Network slicing allows to offer an individual programmable network
architecture, which suits the requirements of various use cases, subscriber
types and apps. Within a slice, the functional elements can be instantiated
according to the specific service offering, e.g., health, automotive,
logistics, energy, and public safety. All these services have different
demands on the network such as ultra-low latency, massive IoT, or dense
broadband. A "one-size-fits-all" solution as we have it today, covering
all different use cases and services to every device everywhere in the
network, is obviously not an option. A far more beneficial solution can be
provided if different deployments and architectural flavors can be setup
for each use case or service group, respectively and all these different
network implementation can be run in parallel.
Within this demo, we present 5G network slicing using the example of a
health insurance provider offering individual services for the customers
with the help of a network slice.
Alameddine, Hyame and Ayoubi, Sara and Assi, Chadi
Offering Resilient and Bandwidth Guaranteed Services in Multi-Tenant
Cloud Networks:Harnessing the Sharing Opportunities
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Alameddine2016,
title = { Offering Resilient and Bandwidth Guaranteed Services in Multi-Tenant
Cloud Networks:Harnessing the Sharing Opportunities },
year = { 2016 },
address = { Würzburg, Germany },
author = { Alameddine, Hyame and Ayoubi, Sara and Assi, Chadi },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: The sharing of computing and networking resources in the cloud is
challenged by several obstacles, such as providing bandwidth guarantees for
a predictable performance of the hosted applications, as well as
maintaining their availability upon any failure. Therefore, the wide scale
adoption of this emerging computing paradigm is highly dependent on
overcoming these challenges. In fact, the lack of bandwidth guarantees
extends the completion time for jobs, thus increasing cloud clients
expenses, who pay based on their use. In addition, outages in cloud data
centers may result in severe revenue losses for both cloud operators and
their clients alike.
Now, to mitigate these challenges, cloud operators should be empowered with
a strategic protection plan able to guarantee resilient and predictable
performance for applications. Such a plan consists of provisioning
additional backup resources (e.g. virtual machines, bandwidth) while
ensuring efficient network bandwidth utilization. In this work, we exploit
several bandwidth sharing opportunities in multi-tenant cloud networks
while offering resilient and bandwidth guaranteed services. In contrast to
previous works which target cloud clients satisfaction, we focus on
optimizing network bandwidth utilization in order to increase the cloud
operators' revenues while maintaining such bandwidth allocation transparent
to the clients. Through several motivational examples, we highlight the
sharing opportunities and show that they are able to increase cloud
operators revenue while providing up to 50% of bandwidth gain in the
network.
Moualla, Ghada and Turletti, Thierry and Bouet, Mathieu and Saucez, Damien
On the Necessity of Accounting for Resiliency in SFC
In Programmability for Cloud Networks and Applications 2016 (PROCON 2016). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Moualla2016,
title = { On the Necessity of Accounting for Resiliency in SFC },
year = { 2016 },
address = { Würzburg, Germany },
author = { Moualla, Ghada and Turletti, Thierry and Bouet, Mathieu and Saucez, Damien },
booktitle = { Programmability for Cloud Networks and Applications 2016 (PROCON 2016) },
month = { Sept },
misc = { days = 12 }
}
Abstract: When deploying network service function chains the focus is usually given
on
metrics such as the cost, the latency, or the energy and it is assumed that
the
underlying cloud infrastructure provides of resiliency mechanisms to
handle
with the disruptions occurring in the physical infrastructure. In this
position
paper, we advocate that while usual performance metrics are essential to
decide
on the deployment of network service function chains, the notion of
resiliency
should not be neglected as the choice of virtual-to-physical placement may
dramatically improve the ability of the service chains to handle with
failures
of the infrastructure without requiring complex resiliency mechanisms.
Bruschi, Roberto and Lago, Paolo and Lombardo, Chiara and Mangialardi, Sergio
OpenVolcano: An Open-Source Software Platform for Fog Computing
In Programmability for Cloud Networks and Applications 2016 (PROCON 2016). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Bruschi2016,
title = { OpenVolcano: An Open-Source Software Platform for Fog Computing },
year = { 2016 },
address = { Würzburg, Germany },
author = { Bruschi, Roberto and Lago, Paolo and Lombardo, Chiara and Mangialardi, Sergio },
booktitle = { Programmability for Cloud Networks and Applications 2016 (PROCON 2016) },
month = { Sept },
misc = { days = 12 }
}
Abstract: In order to overcome the cloud service performance limits, the INPUT
Project aims to go beyond the typical IaaS-based service models by moving
computing and storage capabilities from the datacenters to the edge
network, and consequently moving cloud services closer to the end users.
This approach, which is compatible with the concept of Fog Computing, will
exploit Network Functions Virtualization (NFV) and Software Defined
Networking (SDN) to support personal cloud services in a more scalable and
sustainable way and with innovative added-value capabilities. This paper
presents OpenVolcano, the open- source software platform under development
in the INPUT Project, which will realize the fog computing paradigm by
exploiting in-network programmability capabilities for off-loading,
virtualization and monitoring.
Guerra, Ryan E and Anand, Narendra and Shepard, Clayton and Knightly, Edward W.
Opportunistic Channel Estimation for Implicit 802.11af MU-MIMO
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Guerra2016,
title = { Opportunistic Channel Estimation for Implicit 802.11af MU-MIMO },
year = { 2016 },
address = { Würzburg, Germany },
author = { Guerra, Ryan E and Anand, Narendra and Shepard, Clayton and Knightly, Edward W. },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Multi-User MIMO (MU-MIMO) linear channel coding can greatly increase
wireless system capacity when Stations (STAs) have fewer antennas than the
Access Point (AP), but it comes at the cost of significant Channel State
Information (CSI) estimation overhead. Previous work has suggested that
802.11af MU-MIMO systems might benefit from long channel coherence time,
extending the useful duration of CSI. In this paper, we propose and analyze
an opportunistic channel sounding policy that avoids sounding overhead in
wireless channels by gathering implicit CSI opportunistically. This policy
not only avoids CSI overhead, but also has the potential to enable
efficient interoperability of multi-user APs with legacy single-stream
STAs. To investigate the performance of this new policy, we implement a new
mobile channel sounding framework on a custom 802.11af Software-Defined
Radio (SDR) system designed for UHF-band experimentation and evaluate
channel sounding performance in indoor and outdoor environments under
various mobility modes. Additional protocol analysis shows that in UHF
channels with sufficient channel coherence time, an opportunistic channel
sounding policy offers significant protocol optimization while improving
the scalability of next-generation MU-MIMO systems.
Shariat, Ali and Tizghadam, Ali and Leon-Garcia, Alberto
Optimizing Time to Exhaustion in Service Providers Using
Information-Centric Networking
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Shariat2016,
title = { Optimizing Time to Exhaustion in Service Providers Using
Information-Centric Networking },
year = { 2016 },
address = { Würzburg, Germany },
author = { Shariat, Ali and Tizghadam, Ali and Leon-Garcia, Alberto },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Exponential traffic growth due to the increasing popularity of Over-The-Top
Video services has put service providers under much pressure. By promoting
in-network caching, Information-Centric Networking (ICN) is a promising
paradigm to answer current challenges in the service provider's domain.
This paper reports on a cache placement strategy for service providers to
delay the onset of congestion (time-to-exhaustion) to the extent possible
in order to optimize their capital expenditure for their limited capacity
planning budget. We show that even a limited deployment of ICN provides a
substantial increase in the time-to-exhaustion of the network and a
decrease in the number of links with high utilization.
Schwarzkopf, Fabian and Veith, Sebastian and Menth, Michael
Performance Analysis of CoDel and PIE for Saturated TCP Sources
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Schwarzkopf2016,
title = { Performance Analysis of CoDel and PIE for Saturated TCP Sources },
year = { 2016 },
address = { Würzburg, Germany },
author = { Schwarzkopf, Fabian and Veith, Sebastian and Menth, Michael },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: In the recent years, the bufferbloat phenomenon was observed which is
mainly due to oversized unmanaged buffers in the Internet. This triggered a
new discussion of active queue management (AQM) algorithms in the IETF.
"Controlled Delay" (CoDel) and "Proportional Integral controller
Enhanced" (PIE) are considered as an alternative to "Random Early
Detection" (RED). Their intention is both to take advantage of large
buffers for occasional bursts and to limit queueing delays most of the
time. Moreover, they are able to cope with varying bandwidth. In this
paper, we study the performance of CoDel, PIE, and CoDel-ACT, which is an
effective modification of CoDel that leads to better performance than CoDel
in our studies. We experiment with saturated TCP sources and a
fixed-bandwidth bottleneck link and focus on the delay-limiting phase of
the algorithms. We investigate the impact of configuration parameters and
traffic load on link utilization and queueing delay. We study the timely
evolution of queuing delays and drop patterns, and point out significant
differences among the algorithms. In particular, we show that CoDel's drop
behavior changes over time and may lead to underutilization.
Hasslinger, Gerhard and Ntougias, Kostas and Hasslinger, Frank and Hohlfeld, Oliver
Performance Evaluation for New Web Caching Strategies Combining LRU with
Score Based Object Selection
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Hasslinger2016,
title = { Performance Evaluation for New Web Caching Strategies Combining LRU with
Score Based Object Selection },
year = { 2016 },
address = { Würzburg, Germany },
author = { Hasslinger, Gerhard and Ntougias, Kostas and Hasslinger, Frank and Hohlfeld, Oliver },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: The topic of Internet content caching regained relevance over the last
years due to extending data center infrastructures in CDNs, clouds and ISP
networks to meet capacity and delay demands of multimedia services. In this
study, we evaluate the performance of web caching strategies in terms of
the achievable hit rate for realistic scenarios of large user populations.
We focus on a class of score gated least recently used (SG-LRU) strategies
which combine the simple update effort of the usual LRU policy with the
flexibility to keep most important content in the cache according to a
predefined score function. Caching efficiency is evaluated via simulations
assuming Zipf request pattern, which has been confirmed manifold on popular
web platforms for video streaming and other types of content. For the
standard independent request model (IRM), we analyze the possible hit rate
gain of other web caching strategies over pure LRU within the complete
relevant range of three basic system parameters. The results confirm that
absolute hit rate gains of 10%-20% over LRU being observed in some case
studies for alternative caching strategies are not optimistic but a
realistic estimation in general. Finally, we compare IRM evaluations with
results for varying request pattern over time based on Wikipedia
statistics, which recently have been made available for daily top-1000 page
requests. Simulations are extended to show the impact of varying object
popularity on the caching efficiency and to optimize the caching strategy
with regard to increasing popularity dynamics.
Gebert, Steffen and Zinner, Thomas and Lange, Stanislav and Schwartz, Christian and Tran-Gia, Phuoc
Performance Modeling of Softwarized Network Functions Using Discrete-Time
Analysis
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Gebert2016a,
title = { Performance Modeling of Softwarized Network Functions Using Discrete-Time
Analysis },
year = { 2016 },
address = { Würzburg, Germany },
author = { Gebert, Steffen and Zinner, Thomas and Lange, Stanislav and Schwartz, Christian and Tran-Gia, Phuoc },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: The softwarization of networks promises cost savings and better scalability
of network functions by moving functionality from specialized devices into
commercial-off-the-shelf hardware. Generalized computing hardware offers
many degrees for adjustment and tuning, which can affect performance and
resource utilization. One of these adjustments are the interrupt mitigation
techniques implemented by modern network interface cards and operating
systems. By this, an administrator can optimize either lower latencies or
lower CPU overhead for processing of network traffic. In this work, an
analytical model allowing the computation of relevant performance metrics
like the packet processing time and the packet loss for generic virtualized
network functions running on commodity hardware is introduced. The
applicability of the model is shown by comparing its outcome with
measurements conducted in a local testbed. Based on this model, impact
factors like the average packet interarrival time, the interarrival time
distribution, and the duration of the interrupt aggregation interval are
studied.
Sankararaman, Abishek and woo Cho, Jeong and Baccelli, Francois
Performance-Oriented Association in Large Cellular Networks with
Technology Diversity
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Sankararaman2016,
title = { Performance-Oriented Association in Large Cellular Networks with
Technology Diversity },
year = { 2016 },
address = { Würzburg, Germany },
author = { Sankararaman, Abishek and woo Cho, Jeong and Baccelli, Francois },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: The development of mobile virtual network operators, where multiple
wireless technologies (e.g. 3G and 4G) or operators with non-overlapping
bandwidths are pooled and shared is expected to provide enhanced service
with broader coverage, without incurring additional infrastructure cost.
However, their emergence poses an unsolved question on how to harness such
a technology and bandwidth diversity. This paper addresses one of the
simplest questions in this class, namely, the issue of associating each
mobile to one of those bandwidths. Intriguingly, this association issue is
intrinsically distinct from those in traditional networks. We first propose
a generic stochastic geometry model lending itself to analyzing a wide
class of association policies exploiting various information on the network
topology, e.g. received pilot powers and fading values. This model firstly
paves the way for tailoring and designing an optimal association scheme to
maximize any performance metric of interest (such as the probability of
coverage) subject to the information known about the network. In this class
of optimal association, we prove a result that the performance improves as
the information known about the network increases. Secondly, this model is
used to quantify the performance of any arbitrary association policy and
not just the optimal association policy. We propose a simple policy called
the Max-Ratio which is not-parametric, i.e. it dispenses with the
statistical knowledge of base station deployments commonly used in
stochastic geometry models. We also prove that this simple policy is
optimal in a certain limiting regime of the wireless environment. Our
analytical results are combined with simulations to compare these policies
with basic schemes, which provide insights into (i) a practical compromise
between performance gain and cost of estimating information and; (ii) the
selection of association schemes under environments with different
propagation models, i.e. path-loss exponents.
Bavier, Andy and McGeer, Rick and Ricart, Glenn
PlanetIgnite: A Self-Assembling, Lightweight,
Infrastructure-as-a-Service Edge Cloud
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Bavier2016,
title = { PlanetIgnite: A Self-Assembling, Lightweight,
Infrastructure-as-a-Service Edge Cloud },
year = { 2016 },
address = { Würzburg, Germany },
author = { Bavier, Andy and McGeer, Rick and Ricart, Glenn },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: PlanetIgnite is a general-purpose, Infrastructure-as-a-Service,
self-assembling, lightweight edge cloud on virtualized infrastructure with
support for single-pane-of-glass distributed application configuration and
deployment. This is an entirely new concept. PlanetLab, GENI, and SAVI are
general-purpose IaaS edge clouds, but require top-down installation and
dedicated hardware resources at each site and do not offer
single-pane-of-glass application deployment. Seattle is a lightweight
self-assembling edge cloud that offers single-pane-of-class configuration
and control, but developers are restricted to using a subset of Python.
PlanetIgnite is a Containers-as-a-Service Edge Cloud which offers Docker
Containers as a Service to each PlanetIgnite user. A PlanetIgnite node is
an off-the-shelf Ubuntu 14.04 Virtual machine with Docker installed,
meaning it can be installed on any edge node where a VM with a routable v4
address is available. Adding a PlanetIgnite node to the infrastructure is
simple: a site wishing to host a PlanetIgnite node simply downloads the
image; on boot, the new PlanetIgnite node registers with the PlanetIgnite
portal, which runs a series of acceptance tests. Once complete, the image
is registered and the node is added to the set of PlanetIgnite sites.
Bauer, Robert and Zitterbart, Martina
Port Based Capacity Extensions (PBCEs): Improving SDNs Flow Table
Scalability
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Bauer2016,
title = { Port Based Capacity Extensions (PBCEs): Improving SDNs Flow Table
Scalability },
year = { 2016 },
address = { Würzburg, Germany },
author = { Bauer, Robert and Zitterbart, Martina },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Software-defined networks (SDNs) come with great promises regarding
flexible operation of networks. A key component within SDN-switches is the
flow table which holds the rules that determine how data streams are
handled. The flow table, however, is a scarce resource with a rather
limited rule capacity. To soften this well-known hassle, PBCE (Port Based
Capacity Extension) provides the possibility to delegate flows to a
so-called extension switch (e.g., neighboring switch) in order to utilize
flow table resources of this switch. Delegation is performed without
breaking control plane transparency, i.e., without interfering with
established SDN applications. To do so, PBCE uses flow rule aggregation
based on ingress ports and a small set of predefined rules at the initial
switch that are needed to redirect incoming flows to a dynamically chosen
output port. In this paper, we present the PBCE delegation architecture for
OpenFlow-based SDNs along with a basic mechanism for flow table capacity
outsourcing. A prototypical implementation and first promising performance
results demonstrate the feasibility of the approach. Within this paper, we
focus on flow table scalability, the concept of PBCEs can, however, be
applied to other delegation scenarios.
Zhang, Sai Qian and Zhang, Qi and Tizghadam, Ali and Park, Byungchul and Bannazadeh, Hadi and Leon-Garcia, Alberto and Boutaba, Raouf
Sector: TCAM Space Aware Routing on SDN
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Zhang2016,
title = { Sector: TCAM Space Aware Routing on SDN },
year = { 2016 },
address = { Würzburg, Germany },
author = { Zhang, Sai Qian and Zhang, Qi and Tizghadam, Ali and Park, Byungchul and Bannazadeh, Hadi and Leon-Garcia, Alberto and Boutaba, Raouf },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: In Software Defined Networking (SDN), a central controller can achieve
fine-grained control over individual flows by installing appropriate
forwarding rules in switches and routers. This allows the network to
realize a wide variety of functionalities and objectives. But at the same
time, these flexibility and versatility come at the expense of (1) a huge
burden on the limited Ternary Content Addressable Memory (TCAM) space, and
(2) limited scalability due to the large number of forwarding rules that
are required in the network. To address these limitations, we present
Sector, a switch memory-aware routing scheme that reduces the number of
entries in the switches, and at the same time guarantees the load balancing
on link resources utilization. We consider both the static and dynamic
versions and propose solution algorithms. Experiments show our algorithms
can reduce the TCAM space usage and network control traffic by 20% to 80%
on different network topologies.
Großmann, Marcel and Eiermann, Andreas
Security of Distributed Container Based Service Clustering with Hypriot
Cluster Lab
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Grosmann2016,
title = { Security of Distributed Container Based Service Clustering with Hypriot
Cluster Lab },
year = { 2016 },
address = { Würzburg, Germany },
author = { Großmann, Marcel and Eiermann, Andreas },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Modern service providers use virtualization for a feasible scalability of
their applications.
Their approaches mainly exploit virtual machines to stem the quality of
service requirements, especially redundancy, reliability and security.
Accordingly, provided services are hosted in data centers, which are able
to fulfill the needs.
The standards of entry burden small enterprises to establish their own
distributed service delivery cloud.
Hence, we already developed an energy-efficient solution, called Hypriot
Cluster Lab (HCL).
It adapts Docker technologies in a way that it runs on ARM powered single
board computers.
Forthwith, we demonstrate how it works with redundancy and replication
betwixt several hosts on different locations via wide area networks.
Accordingly, we use a mesh network based on virtual private LANs to
communicate encrypted over the Internet between the distributed hosts.
In our demonstration we present a fault tolerant, reliable and secure
extension to interconnect several independent host with HCL to achieve the
QoS-requirements.
Keywords: Container Virtualization; Cluster Computing; Distributed
Computing; Mesh Networking; Privacy; Reliability; Redundancy; QoS;
Shaik, Muhammed Zubair Basha and Puschmann, Andre and Mitschele-Thiel, Andreas
Self-Optimization of Software Defined Radios Through Evolutionary
Algorithms
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Shaik2016,
title = { Self-Optimization of Software Defined Radios Through Evolutionary
Algorithms },
year = { 2016 },
address = { Würzburg, Germany },
author = { Shaik, Muhammed Zubair Basha and Puschmann, Andre and Mitschele-Thiel, Andreas },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: This paper presents a framework for building software-defined radios that
are able to self-optimize their parameters using evolutionary algorithms.
The framework has been implemented using the DEAP library for Python, which
is based on the Genetic Algorithms (GAs). The paper discusses the overall
system architecture and presents a system prototype that has been employed
to optimize radio transmission parameters in an unknown radio environment
in order to maximize the achievable throughput. Although GAs have been used
before for optimizing the radio parameters of Software Defined Radios
(SDRs), they have been limited to the number of parameters given as an
input to the GA. The proposed algorithm is much more generic and
comprehensive to utilize the advantages of genetic algorithms, by providing
the flexibility to include any of the parameters of the configuration of
the SDR, which needs to be optimized through the GA. Moreover, the entire
project is based on open-source solutions. The current prototype targets
Iris-based SDRs. However, as the entire software employs standard
components for interfacing the SDR, it can easily be ported to GNU Radio or
other SDR frameworks. We will also present preliminary results that have
been obtained through over-the-air experiments in which we optimized
different power parameters, modulation, coding schemes, etc., in an unknown
radio environment.
Ciucu, Florin and Poloczek, Felix and Schmitt, Jens
Stochastic Upper and Lower Bounds for General Markov Fluids
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Ciucu2016,
title = { Stochastic Upper and Lower Bounds for General Markov Fluids },
year = { 2016 },
address = { Würzburg, Germany },
author = { Ciucu, Florin and Poloczek, Felix and Schmitt, Jens },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Promising perspectives of a hypothetical `Tactile Internet', or `Internet
at the speed of light', whereby network latencies become imperceptible to
users, have (again) triggered a broad interest to understand and mitigate
Internet latencies. In this paper we revisit the queueing analysis of the
versatile Markov Fluid traffic model, which was mainly investigated in the
1980-90s, yet
with questionable accuracy. We derive upper bounds on the tail distribution
of the queue size, which improve state-of-the-art results by an exponential
factor $O(ąppa^n)$, where $0<\p̨pa<1$ and $n$ is the number of
multiplexed sources; additionally, we provide the first lower bounds. The
underlying results are quite general in that they can be easily adapted to
derive the delay distribution for SP, FIFO, and EDF scheduling. Our overall
results rely on a powerful martingale methodology which was recently shown
to be remarkably accurate.
Ravaioli, Riccardo and Urvoy-Keller, Guillaume and Barakat, Chadi
Testing for Traffic Differentiation with ChkDiff: The Downstream Case
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Ravaioli2016,
title = { Testing for Traffic Differentiation with ChkDiff: The Downstream Case },
year = { 2016 },
address = { Würzburg, Germany },
author = { Ravaioli, Riccardo and Urvoy-Keller, Guillaume and Barakat, Chadi },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: In the past decade it has been found that many Internet operators offer
worse service to selected user traffic by applying various differentiation
techniques. If from a legal point of view many countries have discussed and
approved laws in favour of Internet neutrality, confirmation with measuring
tools for even an experienced user remains hard in practice. In this paper
we extend and complete our tool ChkDiff, previously presented for the
upstream case, by checking for shaping also on the user's downstream
traffic. After attempting to localize shapers at the access ISP on upstream
traffic, we replay downstream traffic from a measurement server and analyze
per-flow one-way delays and losses, while taking into account the
possibility of multiple paths between the two endpoints. As opposed to
other proposals in the literature, our methodology does not depend on any
specific Internet application a user might want to test and it is robust to
evolving differentiation techniques at the IP layer. We provide here a
detailed description of the downstream tool and a validation in the wild
for wired, wireless and 3G connections.
Schwarzmann, Susanna and Zinner, Thomas and Dobrijevic, Ognjen
Towards a Framework for Comparing Application-Network Interaction
Mechanisms
In QCMan 2016 (QCMan 2016). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Schwarzmann2016,
title = { Towards a Framework for Comparing Application-Network Interaction
Mechanisms },
year = { 2016 },
address = { Würzburg, Germany },
author = { Schwarzmann, Susanna and Zinner, Thomas and Dobrijevic, Ognjen },
booktitle = { QCMan 2016 (QCMan 2016) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Multimedia services, such as HTTP adaptive streaming (HAS) and audio
conferencing, hold a dominant share in Internet traffic and are critical to
end-user quality of experience (QoE). Since a distributed,
application-level adaptation to the available network resources may not
result in an optimal and fair QoE among heterogeneous clients, there is the
need for a coordinated application-network interaction (App-Net), which
includes exchange of monitoring and control information between the
involved entities. Numerous App-Net approaches have been proposed, but
typically for very specific use cases. A systematic comparison of such
solutions, which would identify their pros and cons, as well as potential
application scenarios, is missing. Our paper addresses this gap by
providing an overview of QoE-centric App-Net mechanisms and deducing an
abstract interaction model. In order to evaluate a trade-off between QoE
gains and the messaging overhead, we use the latter model to compare two
App-Net mechanisms for HAS against a baseline HAS implementation.
Karsten, Martin and Berger, Daniel S and Schmitt, Jens
Traffic-Driven Implicit Buffer Management - Delay Differentiation Without
Traffic Contracts
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Karsten2016,
title = { Traffic-Driven Implicit Buffer Management - Delay Differentiation Without
Traffic Contracts },
year = { 2016 },
address = { Würzburg, Germany },
author = { Karsten, Martin and Berger, Daniel S and Schmitt, Jens },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Different network applications have different service preferences regarding
packet delay and buffering. Delay management requires scheduling support at
routers, which traditionally also requires some form of traffic
specification and admission control. In contrast, this paper studies the
problem of guaranteeing queueing delay bounds for multiple service classes
without traffic contracts and without affecting the throughput rate for
each class. A solution to this problem is given by decoupling throughput
and delay management via traffic-driven implicit buffer management. Using
this concept, the Delay Segment FIFO (DSF) packet scheduler guarantees
differentiated delay targets in the presence of unregulated throughput
rates. This decoupling represents a modular approach and DSF embodies a
small and self-contained feature set. Furthermore, DSF's service model
satisfies even a strict interpretation of network neutrality, while
effectively guaranteeing delay targets for multiple service classes. DSF's
design and service characteristics are analyzed mathematically and
validated through simulations.
Moldovan, Christian and Sieber, Christian and Heegaard, Poul E. and Hoßfeld, Tobias and Kellerer, Wolfgang
YouTube Can Do Better: Getting the Most Out of Video Adaptation
In QCMan 2016 (QCMan 2016). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Moldovan2016b,
title = { YouTube Can Do Better: Getting the Most Out of Video Adaptation },
year = { 2016 },
address = { Würzburg, Germany },
author = { Moldovan, Christian and Sieber, Christian and Heegaard, Poul E. and Hoßfeld, Tobias and Kellerer, Wolfgang },
booktitle = { QCMan 2016 (QCMan 2016) },
month = { Sept },
misc = { days = 12 }
}
Abstract: In this paper, we look at YouTube's algorithm for the adaptation of the
video resolution, and analyze how much more mileage can be gotten out of
it. In previous work, we analyzed the efficiency of YouTube's adaptation
strategy by using isotonic regression that has the disadvantage of not
eliminate stalling events. As a next step, we apply use an optimization
problem to provide the optimal result in any given scenario while avoiding
stalling events. This paper provides an outlook on the potential that is
left for improving YouTube's adaptation mechanism that is essential to
managing the QoE in video streaming.
Gebert, Steffen and Geissler, Stefan and Zinner, Thomas and Nguyen-Ngoc, Anh and Lange, Stanislav and Tran-Gia, Phuoc
ZOOM: Lightweight SDN-based Elephant Detection
In Programmability for Cloud Networks and Applications 2016 (PROCON 2016). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Gebert2016b,
title = { ZOOM: Lightweight SDN-based Elephant Detection },
year = { 2016 },
address = { Würzburg, Germany },
author = { Gebert, Steffen and Geissler, Stefan and Zinner, Thomas and Nguyen-Ngoc, Anh and Lange, Stanislav and Tran-Gia, Phuoc },
booktitle = { Programmability for Cloud Networks and Applications 2016 (PROCON 2016) },
month = { Sept },
misc = { days = 12 }
}
Abstract: Software Defined Networking (SDN) offers a holistic view of the network
through a centralized control plane. Consequently, routing decisions can be
made based on global knowledge about the network topology as well as its
current state. As long living flows are suitable candidates for rerouting,
their detection is crucial for efficient flow based traffic management.
This work proposes the ZOOM algorithm for elephant detection in SDN
networks. To this end, ZOOM follows a very lightweight approach that only
uses packet counters implemented by OpenFlow switches and thus does not
require any additional hardware. By exploiting this feature of OpenFlow
switches, ZOOM allows lightweight and cost-effective elephant detection.
Stockmayer, Andreas and Schmidt, Mark and Menth, Michael
jLISP: An Open, Modular and Extensible Java-Based LISP Implementation
In 28th International Teletraffic Congress (ITC 28). Würzburg, Germany 2016
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{Stockmayer2016,
title = { jLISP: An Open, Modular and Extensible Java-Based LISP Implementation },
year = { 2016 },
address = { Würzburg, Germany },
author = { Stockmayer, Andreas and Schmidt, Mark and Menth, Michael },
booktitle = { 28th International Teletraffic Congress (ITC 28) },
month = { Sept },
misc = { days = 12 }
}
Abstract: LISP is a standardized overlay protocol implementing the locator/identifier
split for the Internet. Multiple extensions exist, e.g., for NAT traversal,
traffic engineering, etc. Existing LISP implementations are mostly
platform-specific, hard to extend or they are closed source. In this work
we present a Java-based implementation for LISP which is open-source,
modular, and features a plugin mechanism that enables simple integration of
new functionality. It provides behavior for LISP nodes, infrastructure
nodes, and various extensions, it is easily portable, can be run on various
operating systems and platforms, in particular on Android smartphones. The
demo illustrates LISP-based communication including the extensions
mentioned above. In addition, the extensibility is demonstrated by a plugin
for a statistics application.
