Restorable dynamic quality of service routing
| Autor: | T. V. Lakshman, M. Kodialam |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Routing protocol
Dynamic Source Routing Computer Networks and Communications computer.internet_protocol Computer science Equal-cost multi-path routing Distributed computing Routing table Enhanced Interior Gateway Routing Protocol Wireless Routing Protocol Multiprotocol Label Switching Adaptive routing Routing Information Protocol Packet switching Destination-Sequenced Distance Vector routing Electrical and Electronic Engineering Zone Routing Protocol Static routing Adaptive quality of service multi-hop routing business.industry Quality of service ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Policy-based routing Path vector protocol Computer Science Applications Routing domain Link-state routing protocol Multipath routing business computer Computer network |
| Zdroj: | IEEE Communications Magazine. 40:72-81 |
| ISSN: | 0163-6804 |
| DOI: | 10.1109/mcom.2002.1007411 |
| Popis: | The focus of quality-of-service routing has been on the routing of a single path satisfying specified QoS constraints. Upon failure of a node or link on the path, a new path satisfying the constraints has to be established. However, resources needed to satisfy the QoS requirements are not guaranteed to be available at the rerouting instant, so QoS is not guaranteed upon failure. Restorable QoS routing, where active and backup paths must be simultaneously set up, has been previously studied. This is mostly motivated by the incorporation of mechanisms to establish QoS guaranteed paths with failure protection in multiprotocol label switching networks. This article describes some previously developed algorithms for dynamic routing of restorable QoS guaranteed paths. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|