Journal ArticleDOI
A survey of envelope processes and their applications in quality of service provisioning
Shiwen Mao,Shivendra S. Panwar +1 more
TLDR
A survey on arrival EPs and service curves is provided to provide a comprehensive survey of existing work, which can yield useful insights, and help the development of new QoS metrics, mechanisms, and architectures for emerging network environments.Abstract:
Provisioning of quality of service (QoS) guarantees has become an increasingly important and challenging topic in the design of the current and the next-generation Internet. The class of envelope processes (EPs) is one of the key elements for many QoS provisioning mechanisms. An arrival EP A(τ) (or a service curve) bounds the cumulative traffic of a flow (or the cumulative service a flow receives) over any interval of length τ. Such bounds can be deterministic or probabilistic, and can be used for provisioning of deterministic or statistical service guarantees. In this article we provide a survey on arrival EPs and service curves. We provide an overview of various EPs proposed in the literature during the last 15 years and discuss their applications and performance in QoS provisioning. We aim to provide a big picture of the existing work. There is considerable research effort addressing QoS issues in resource-constrained access networks (such as wireless networks) and in the new multiprotocol label switching (MPLS) and peer-to-peer (P2P) networking paradigms. We aim to provide a comprehensive survey of existing work, which can yield useful insights, and help the development of new QoS metrics, mechanisms, and architectures for emerging network environments.read more
Citations
More filters
Journal ArticleDOI
Survey of deterministic and stochastic service curve models in the network calculus
TL;DR: In this paper, the authors survey the state-of-the-art of the deterministic and the recent probabilistic network calculus and discuss the use of service curves, its use in the network calculus, and the relation to systems theory under the min-plus algebra.
Deterministic and stochastic service curve models in the network calculus
TL;DR: The state-of-the-art of the deterministic and the recent probabilistic network calculus is surveyed and stochastic service curve models allow utilizing the statistical multiplexing gain in a network calculus framework that features end-to-end network analysis by convolution of service curves.
Journal ArticleDOI
A Guide to the Stochastic Network Calculus
Markus Fidler,Amr Rizk +1 more
TL;DR: An intuitive approach to the stochastic network calculus is contributed, where the method uses moment generating functions, known from the theory of effective bandwidths, to characterize traffic arrivals and network service.
Journal ArticleDOI
Emotion Communication System
TL;DR: A pillow robot speech emotion communication system is designed, where the pillow robot acts as a medium for user emotion mapping and the real-time performance of the whole communication process in the scene of a long distance communication between a mother-child users’ pair is analyzed.
Proceedings ArticleDOI
Perspectives on network calculus: no free lunch, but still good value
Florin Ciucu,Jens B. Schmitt +1 more
TL;DR: It is demonstrated that the statistical multiplexing gain scales as Ω(√N), as long as some small violations of system performance constraints are tolerable, which demonstrates that the network calculus can capture actual system behavior tightly when applied carefully.
References
More filters
An Architecture for Differentiated Service
TL;DR: An architecture for implementing scalable service differentiation in the Internet achieves scalability by aggregating traffic classification state which is conveyed by means of IP-layer packet marking using the DS field [DSFIELD].
Journal ArticleDOI
On the self-similar nature of Ethernet traffic (extended version)
TL;DR: It is demonstrated that Ethernet LAN traffic is statistically self-similar, that none of the commonly used traffic models is able to capture this fractal-like behavior, and that such behavior has serious implications for the design, control, and analysis of high-speed, cell-based networks.
Journal ArticleDOI
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
Abhay Parekh,Robert G. Gallager +1 more
TL;DR: Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments.
Journal ArticleDOI
Wide area traffic: the failure of Poisson modeling
Vern Paxson,Sally Floyd +1 more
TL;DR: It is found that user-initiated TCP session arrivals, such as remote-login and file-transfer, are well-modeled as Poisson processes with fixed hourly rates, but that other connection arrivals deviate considerably from Poisson.