Share Email Print
cover

Proceedings Paper

An interface-based anycast routing table summary establishing algorithm
Author(s): Lijuan Si
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Anycast use the same address pool with unicast, but its routing table is difficult to converge for anycast servers’ dispersive location, and this leads to low efficiency of packet forwarding. This paper proposes an algorithm which can decrease the anycast routing table entries count by converge them based on interfaces. Analyses and experiment shows this algorithm performance is improved in packet forwarding. And this algorithm is routing loop-free as discussed in this paper. But it has limitation in network topology that must be applied in point-to-point network but not point-to-multipoint.

Paper Details

Date Published: 13 March 2013
PDF: 8 pages
Proc. SPIE 8784, Fifth International Conference on Machine Vision (ICMV 2012): Algorithms, Pattern Recognition, and Basic Technologies, 87840U (13 March 2013); doi: 10.1117/12.2013921
Show Author Affiliations
Lijuan Si, Baoding Electric Power Vocational and Technical College (China)


Published in SPIE Proceedings Vol. 8784:
Fifth International Conference on Machine Vision (ICMV 2012): Algorithms, Pattern Recognition, and Basic Technologies
Yulin Wang; Liansheng Tan; Jianhong Zhou, Editor(s)

© SPIE. Terms of Use
Back to Top