Label space reduction in MPLS networks: how much can a single stacked label do?

Full Text:

Pdf

Pdf

Buy this Article

Buy this Article

Authors:	Fernando Solano	Institute of Telecommunications, Warsaw University of Technology, Warsaw, Poland and Broadband and Distributed Systems Group, University of Girona, Girona, Spain
	Thomas Stidsen	Informatics and Mathematical Modeling Department, Danish Technical University, Lyngby, Denmark
	Ramon Fabregat	Broadband and Distributed Systems Group, University of Girona, Girona, Spain
	Jose Luis Marzo	Broadband and Distributed Systems Group, University of Girona, Girona, Spain

	2008 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 27 · Downloads (cumulative): 235 · Citation Count: 6

Published in:

· Journal

IEEE/ACM Transactions on Networking (TON) archive

Volume 16 Issue 6, December 2008
Pages 1308-1320
IEEE Press Piscataway, NJ, USA
table of contents doi>10.1109/TNET.2007.912382

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms circuit-switching networks design label merging label space reduction label stacking mpls multipoint-to-point path and circuit problems performance routing protocols trees

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Windows Media Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder