A dynamic QoS routing mechanism based on Steiner trees for LEO satellite networks
2010
To satisfy the multiple QoS constraints in different services, we divide a QoS routing problem into some multicast routing problem oriented the types of QoS service callings. Every multicasting routing problem is a Steiner tree problem. In this paper, we propose a dynamic QoS routing mechanism (DQ) to support multiple Steiner trees. We also propose a protocol to distinguish between the types of services and make a load balance of the satellite networks. Our simulation results show that our mechanism consume less sources and provide more QoS guarantees than previous routing algorithms. Furthermore, our mechanism has a limited overhead and can support a large number of service callings.
Keywords:
- Link-state routing protocol
- Policy-based routing
- Multipath routing
- Wireless Routing Protocol
- Computer network
- Computer science
- Equal-cost multi-path routing
- Dynamic Source Routing
- Static routing
- Destination-Sequenced Distance Vector routing
- Distributed computing
- Zone Routing Protocol
- Enhanced Interior Gateway Routing Protocol
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
18
References
4
Citations
NaN
KQI