A Minimum Delay Anycast Routing Protocol
碩士 === 國立中山大學 === 電機工程學系研究所 === 91 === Anycast is a new communication service defined in IPv6 (Internet Protocol Version 6) [6]. An anycast message is the one that should be delivered to the ''nearest'' member in a group of designated recipients. The ‘nearest’ is not always the ‘...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/29337467275586812372 |
| Summary: | 碩士 === 國立中山大學 === 電機工程學系研究所 === 91 === Anycast is a new communication service defined in IPv6 (Internet Protocol Version 6) [6]. An anycast message is the one that should be delivered to the ''nearest'' member in a group of designated recipients. The ‘nearest’ is not always the ‘best’ member. In this paper, we propose a routing protocol for anycast message. It is composed of two subprotocols: the routing table establishment subprotocol and the packet forwarding subprotocol. In the routing table establishment subprotocol, we propose a mininum delay path method (MDP). We get a minimum delay path from router to destination by MDP. In the packet forwarding protocol, we propose a minimum delay and load balancing method (MDLB). We dispatch traffic load to a server with minimum delay and light load by MDLB. The performance has demonstrated the benefits of MDP and MDLB in reducing end-to-end delay and increasing throughput of network.
|
|---|