FREE Registration is required
Overview:
The main contribution of this paper is a new algorithm for dynamic routing of bandwidth guaranteed tunnels. The algorithm is a generalization of the "minimum-interference" based algorithm. The routing objective is to satisfy as many potential future requests as possible in an environment where requests arrive one-by-one, and there is no knowledge of future arrivals other than their potential ingress-egress points. An application of these algorithms is for the routing of MPLS bandwidth-guaranteed Label-Switched Paths (LSPs). The presented algorithm performs better than the scheme, and other previously proposed algorithms, on several metrics like the number of rejected demands and successful re-routing of demands upon link failure.
(Is this item miscategorized? Does it need more tags? Let us know.)
| Format: | Size: | 349 KB | |
| Date: | Jan 2009 | ||
| Pages: | 10 |
Top results from MPLS
Top results from Switching
White Papers, Webcasts, and Resources
- Live Webcast: Enhanced Availability in a Virtual Data Center with the Dell PS Series and Microsoft Windows Server 2008 R2 Hyper-V Dell EqualLogicLearn how to use the new features of Microsoft Windows Server 2008 R2 Hyper-V to boost the availability of your virtualized data center.
- Enterprise and Web 2.0 application support in a modern mainframe environment IBMSee how IBM WebSphere Portal software can help you develop a Web presence based on individual needs while unlocking value for customers and employees.
- IBM WebSphere Portal for z/OS taps into System z, Web 2.0: Executive update IBMSee how to lower costs and extract value faster with more responsive, interactive and intuitive business applications from WebSphere Portal Version 6.1.









