PCN-Based Flow Termination with Multiple Bottleneck Links
F. Lehrieder, and M. Menth. IEEE International Conference on Communications (ICC), Dresden, Germany, (June 2009)
Abstract
From the viewpoint of communication networks
Network Virtualization (NV) extends beyond pure operational
issues and addresses many of the impasses of the current Internet.
The idea of Transport Virtualization (TV) progresses the capabilities
of NV and enables the independence from a specific network
transport resource. The independence is achieved by pooling
multiple transport resources and selecting the best resources
for exclusive or concurrent use. However, the application and
selection of concurrent paths is rather complex and introduces
inevitable packet re-ordering due to different stochastic delay
characteristics on the used paths. Packets arriving at the destination
out-of-order have to be stored in a re-sequencing buffer
before reassembled packets are forwarded to the application.
Therefore we perform an analysis of the fundamental behaviors
and factors for packet re-ordering in concurrent multipath
transmissions. This analysis applies analytical and simulative
techniques which are used to compute the buffer occupancy
probability distribution.
%0 Conference Paper
%1 info3-inproceedings-2009-337
%A Lehrieder, Frank
%A Menth, Michael
%B IEEE International Conference on Communications (ICC)
%C Dresden, Germany
%D 2009
%K myown
%T PCN-Based Flow Termination with Multiple Bottleneck Links
%X From the viewpoint of communication networks
Network Virtualization (NV) extends beyond pure operational
issues and addresses many of the impasses of the current Internet.
The idea of Transport Virtualization (TV) progresses the capabilities
of NV and enables the independence from a specific network
transport resource. The independence is achieved by pooling
multiple transport resources and selecting the best resources
for exclusive or concurrent use. However, the application and
selection of concurrent paths is rather complex and introduces
inevitable packet re-ordering due to different stochastic delay
characteristics on the used paths. Packets arriving at the destination
out-of-order have to be stored in a re-sequencing buffer
before reassembled packets are forwarded to the application.
Therefore we perform an analysis of the fundamental behaviors
and factors for packet re-ordering in concurrent multipath
transmissions. This analysis applies analytical and simulative
techniques which are used to compute the buffer occupancy
probability distribution.
@inproceedings{info3-inproceedings-2009-337,
abstract = {From the viewpoint of communication networks
Network Virtualization (NV) extends beyond pure operational
issues and addresses many of the impasses of the current Internet.
The idea of Transport Virtualization (TV) progresses the capabilities
of NV and enables the independence from a specific network
transport resource. The independence is achieved by pooling
multiple transport resources and selecting the best resources
for exclusive or concurrent use. However, the application and
selection of concurrent paths is rather complex and introduces
inevitable packet re-ordering due to different stochastic delay
characteristics on the used paths. Packets arriving at the destination
out-of-order have to be stored in a re-sequencing buffer
before reassembled packets are forwarded to the application.
Therefore we perform an analysis of the fundamental behaviors
and factors for packet re-ordering in concurrent multipath
transmissions. This analysis applies analytical and simulative
techniques which are used to compute the buffer occupancy
probability distribution.
},
added-at = {2016-03-10T17:36:57.000+0100},
address = {Dresden, Germany},
author = {Lehrieder, Frank and Menth, Michael},
biburl = {https://www.bibsonomy.org/bibtex/2cd6e8d41e1951e728ccec9b0546e5581/uniwue_info3},
booktitle = {IEEE International Conference on Communications (ICC)},
interhash = {3503ea01dede294b5bb54729ba26b85d},
intrahash = {cd6e8d41e1951e728ccec9b0546e5581},
keywords = {myown},
month = {6},
timestamp = {2022-03-14T00:10:30.000+0100},
title = {PCN-Based Flow Termination with Multiple Bottleneck Links},
year = 2009
}