TY  - CHAP
A1  - Schlosser, Daniel
A1  - Jarschel, Michael
A1  - Duelli, Michael
A1  - Hoßfeld, Tobias
A1  - Hoffmann, Klaus
A1  - Hoffmann, Marco
A1  - Morper, Hans Jochen
A1  - Jurca, Dan
A1  - Khan, Ashiq
T1  - A Use Case Driven Approach to Network Virtualization
N2  - In today's Internet, services are very different in their requirements on the underlying transport network. In the future, this diversity will increase and it will be more difficult to accommodate all services in a single network. A possible approach to cope with this diversity within future networks is the introduction of support for running isolated networks for different services on top of a single shared physical substrate. This would also enable easy network management and ensure an economically sound operation. End-customers will readily adopt this approach as it enables new and innovative services without being expensive. In order to arrive at a concept that enables this kind of network, it needs to be designed around and constantly checked against realistic use cases. In this contribution, we present three use cases for future networks. We describe functional blocks of a virtual network architecture, which are necessary to support these use cases within the network. Furthermore, we discuss the interfaces needed between the functional blocks and consider standardization issues that arise in order to achieve a global consistent control and management structure of virtual networks.
KW  - Virtualisierung
KW  - Datenkommunikationsnetz
KW  - Internet
KW  - Rechnernetz
KW  - Anwendungsfall
KW  - Netzvirtualisierung
KW  - Standardisierung
KW  - Use case
KW  - network virtualization
KW  - future Internet architecture
KW  - standardization
Y1  - 2010
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:20-opus-55611
N1  - Accepted at IEEE Kaleidoscope 2010
ER  - 
TY  - RPRT
A1  - Grigorjew, Alexej
A1  - Metzger, Florian
A1  - Hoßfeld, Tobias
A1  - Specht, Johannes
A1  - Götz, Franz-Josef
A1  - Schmitt, Jürgen
A1  - Chen, Feng
T1  - Technical Report on Bridge-Local Guaranteed Latency with Strict Priority Scheduling
N2  - Bridge-local latency computation is often regarded with caution, as historic efforts with the Credit-Based Shaper (CBS) showed that CBS requires network wide information for tight bounds. Recently, new shaping mechanisms and timed gates were applied to achieve such guarantees nonetheless, but they require support for these new mechanisms in the forwarding devices.

This document presents a per-hop latency bound for individual streams in a class-based network that applies the IEEE 802.1Q strict priority transmission selection algorithm. It is based on self-pacing talkers and uses the accumulated latency fields during the reservation process to provide upper bounds with bridge-local information. The presented delay bound is proven mathematically and then evaluated with respect to its accuracy. It indicates the required information that must be provided for admission control, e.g., implemented by a resource reservation protocol such as IEEE 802.1Qdd. Further, it hints at potential improvements regarding new mechanisms and higher accuracy given more information.
KW  - Echtzeit
KW  - Rechnernetz
KW  - Latenz
KW  - Ethernet
KW  - Latency Bound
KW  - Formal analysis
Y1  - 2020
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:20-opus-198310
ER  - 
TY  - RPRT
A1  - Grigorjew, Alexej
A1  - Metzger, Florian
A1  - Hoßfeld, Tobias
A1  - Specht, Johannes
A1  - Götz, Franz-Josef
A1  - Chen, Feng
A1  - Schmitt, Jürgen
T1  - Asynchronous Traffic Shaping with Jitter Control
N2  - Asynchronous Traffic Shaping enabled bounded latency with low complexity for time sensitive networking without the need for time synchronization. However, its main focus is the guaranteed maximum delay. Jitter-sensitive applications may still be forced towards synchronization. This work proposes traffic damping to reduce end-to-end delay jitter. It discusses its application and shows that both the prerequisites and the guaranteed delay of traffic damping and ATS are very similar. Finally, it presents a brief evaluation of delay jitter in an example topology by means of a simulation and worst case estimation.
KW  - Echtzeit
KW  - Rechnernetz
KW  - Latenz
KW  - Ethernet
KW  - TSN
KW  - jitter
KW  - traffic damping
Y1  - 2020
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:20-opus-205824
ER  -