On minimizing end-to-end delay with optimal traffic partitioning

Shiwen Mao, Shivendra Panwar, Y. Thomas Hou

Research output: Contribution to journalArticle

Abstract

Multipath transport provides higher usable bandwidth for a session. It has also been shown to provide load balancing and error resilience for end-to-end multimedia sessions. Two key issues in the use of multiple paths are 1) how to minimize the end-to-end delay, which now includes the delay along the paths and the resequencing delay at the receiver, and 2) how to select paths. This paper presents an analytical framework for the optimal partitioning of real-time multimedia traffic that minimizes the total end-to-end delay. Specifically, it formulates optimal traffic partitioning as a constrained optimization problem using deterministic network calculus and derives its closed-form solution. Compared with previous work, the proposed scheme is simpler to implement and enforce. This analysis also greatly simplifies the solution to the path selection problem as compared to previous efforts. Analytical results show that for a given flow and a set of paths, a minimal subset can be chosen to achieve the minimum end-to-end delay with O(N) time, where N is the number of available paths. The selected path set is optimal in the sense that adding any rejected path to the set will only increase the end-to-end delay.

Original languageEnglish (US)
Pages (from-to)681-690
Number of pages10
JournalIEEE Transactions on Vehicular Technology
Volume55
Issue number2
DOIs
StatePublished - Mar 2006

Fingerprint

End-to-end Delay
Telecommunication traffic
Partitioning
Traffic
Path
Constrained optimization
Resource allocation
Bandwidth
Multimedia
Network Calculus
Error Resilience
Minimise
Multipath
Constrained Optimization Problem
Closed-form Solution
Load Balancing
Simplify
Receiver
Real-time
Subset

Keywords

  • Multimedia communications
  • Multipath transport
  • Network calculus
  • Quality of service (QoS)
  • Real-time

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

On minimizing end-to-end delay with optimal traffic partitioning. / Mao, Shiwen; Panwar, Shivendra; Hou, Y. Thomas.

In: IEEE Transactions on Vehicular Technology, Vol. 55, No. 2, 03.2006, p. 681-690.

Research output: Contribution to journalArticle

@article{d8859f2818214edf8a7a6a639072ded2,
title = "On minimizing end-to-end delay with optimal traffic partitioning",
abstract = "Multipath transport provides higher usable bandwidth for a session. It has also been shown to provide load balancing and error resilience for end-to-end multimedia sessions. Two key issues in the use of multiple paths are 1) how to minimize the end-to-end delay, which now includes the delay along the paths and the resequencing delay at the receiver, and 2) how to select paths. This paper presents an analytical framework for the optimal partitioning of real-time multimedia traffic that minimizes the total end-to-end delay. Specifically, it formulates optimal traffic partitioning as a constrained optimization problem using deterministic network calculus and derives its closed-form solution. Compared with previous work, the proposed scheme is simpler to implement and enforce. This analysis also greatly simplifies the solution to the path selection problem as compared to previous efforts. Analytical results show that for a given flow and a set of paths, a minimal subset can be chosen to achieve the minimum end-to-end delay with O(N) time, where N is the number of available paths. The selected path set is optimal in the sense that adding any rejected path to the set will only increase the end-to-end delay.",
keywords = "Multimedia communications, Multipath transport, Network calculus, Quality of service (QoS), Real-time",
author = "Shiwen Mao and Shivendra Panwar and Hou, {Y. Thomas}",
year = "2006",
month = "3",
doi = "10.1109/TVT.2005.863360",
language = "English (US)",
volume = "55",
pages = "681--690",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - On minimizing end-to-end delay with optimal traffic partitioning

AU - Mao, Shiwen

AU - Panwar, Shivendra

AU - Hou, Y. Thomas

PY - 2006/3

Y1 - 2006/3

N2 - Multipath transport provides higher usable bandwidth for a session. It has also been shown to provide load balancing and error resilience for end-to-end multimedia sessions. Two key issues in the use of multiple paths are 1) how to minimize the end-to-end delay, which now includes the delay along the paths and the resequencing delay at the receiver, and 2) how to select paths. This paper presents an analytical framework for the optimal partitioning of real-time multimedia traffic that minimizes the total end-to-end delay. Specifically, it formulates optimal traffic partitioning as a constrained optimization problem using deterministic network calculus and derives its closed-form solution. Compared with previous work, the proposed scheme is simpler to implement and enforce. This analysis also greatly simplifies the solution to the path selection problem as compared to previous efforts. Analytical results show that for a given flow and a set of paths, a minimal subset can be chosen to achieve the minimum end-to-end delay with O(N) time, where N is the number of available paths. The selected path set is optimal in the sense that adding any rejected path to the set will only increase the end-to-end delay.

AB - Multipath transport provides higher usable bandwidth for a session. It has also been shown to provide load balancing and error resilience for end-to-end multimedia sessions. Two key issues in the use of multiple paths are 1) how to minimize the end-to-end delay, which now includes the delay along the paths and the resequencing delay at the receiver, and 2) how to select paths. This paper presents an analytical framework for the optimal partitioning of real-time multimedia traffic that minimizes the total end-to-end delay. Specifically, it formulates optimal traffic partitioning as a constrained optimization problem using deterministic network calculus and derives its closed-form solution. Compared with previous work, the proposed scheme is simpler to implement and enforce. This analysis also greatly simplifies the solution to the path selection problem as compared to previous efforts. Analytical results show that for a given flow and a set of paths, a minimal subset can be chosen to achieve the minimum end-to-end delay with O(N) time, where N is the number of available paths. The selected path set is optimal in the sense that adding any rejected path to the set will only increase the end-to-end delay.

KW - Multimedia communications

KW - Multipath transport

KW - Network calculus

KW - Quality of service (QoS)

KW - Real-time

UR - http://www.scopus.com/inward/record.url?scp=33645216577&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33645216577&partnerID=8YFLogxK

U2 - 10.1109/TVT.2005.863360

DO - 10.1109/TVT.2005.863360

M3 - Article

VL - 55

SP - 681

EP - 690

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 2

ER -