Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Computing alternate multicast trees with maximum latency guarantee
The University of Texas at Dallas.
The University of Texas at Dallas.
The University of Texas at Dallas.
The University of Texas at Dallas.
Show others and affiliations
2010 (English)In: 2010 International Conference on High Performance Switching and Routing, HPSR 2010, 2010, 82-87 p.Conference paper, Published paper (Refereed)
Abstract [en]

The growing demand for online media content delivery and multi-player gaming is expected to increase the amount of multicast service requests in both public and private networks. Careful traffic engineering of multicast service requests is becoming increasingly essential, as establishing the lowest cost tree, e.g., shortest path tree, in the network for every individual multicast request does not always ensure a global optimization. In this paper, the authors investigate the use of alternate tree routing, according to which multiple sub-optimal tree candidates are computed for each multicast request. When performing global routing optimization, each request is then assigned one of the tree candidates, in a way that yields the desired result, e.g., to minimize the number of (active) links that are required in the network to bear the entire set of requests. A key component of the investigated approach is the timely construction of the set of alternate trees for every given root and destination set. An algorithm is proposed to compute multiple sub-optimal tree candidates with a guaranteed upper bound on the maximum end-to-end transmission latency. The algorithm builds on the widely used K shortest path algorithm, generalizing the technique of computing K candidate shortest paths to obtain a number of candidate sub-optimal trees with desirable properties. Simulation experiments obtained for a multi-protocol label switching (MPLS) traffic engineering network are discussed to investigate the effectiveness, performance, and scalability of the proposed algorithm.

Place, publisher, year, edition, pages
2010. 82-87 p.
Keyword [en]
K shortest path algorithm;alternate multicast tree routing;end to end transmission latency;global routing optimization;maximum latency guarantee;multiple suboptimal tree;multiprotocol label switching traffic engineering network;multicast communication;multiprotocol label switching;optimisation;telecommunication computing;telecommunication network routing;telecommunication traffic;trees (mathematics);
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-78982DOI: 10.1109/HPSR.2010.5580283Scopus ID: 2-s2.0-78149236579ISBN: 978-142446971-0 (print)OAI: oai:DiVA.org:kth-78982DiVA: diva2:493643
Conference
2010 International Conference on High Performance Switching and Routing, HPSR 2010. Richardson, TX. 13 June 2010 - 16 June 2010
Note

QC 20150706

Available from: 2012-02-08 Created: 2012-02-08 Last updated: 2015-07-06Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Monti, Paolo

Search in DiVA

By author/editor
Monti, Paolo
By organisation
Photonics (Closed 20120101)
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 21 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf