TY - GEN
T1 - Reliability-aware IBGP route reflection topology design
AU - Xiao, Li
AU - Wang, Jun
AU - Nahrstedt, K.
N1 - Publisher Copyright:
© 2003 IEEE.
PY - 2003
Y1 - 2003
N2 - In the internal border gateway protocol (IBGP), route reflection is widely used as an alternative to full mesh IBGP sessions inside an AS for scalability reason. However, some important issues, such as the impact of route reflection on the reliability of IBGP and the construction of reliable reflection topology with unreliable routers or links, have not been well investigated. This paper addresses the problem of finding reliable route reflection topologies for IBGP networks, which is of great importance to increase the robustness of IBGP operations. We first present a novel reliability model and two new metrics (IBGP expected lifetime and expected session loss) to evaluate the reliability of reflection topologies, and further to investigate the design problem. After studying the solvability conditions under the router capacity constraints, we prove the NP-hardness of the problem, and then design and implement three heuristic solutions using randomization techniques: heuristic selection, greedy search and simulated annealing. Our extensive computational experiments show that the reliability of IBGP reflection network can be significantly improved by our solutions.
AB - In the internal border gateway protocol (IBGP), route reflection is widely used as an alternative to full mesh IBGP sessions inside an AS for scalability reason. However, some important issues, such as the impact of route reflection on the reliability of IBGP and the construction of reliable reflection topology with unreliable routers or links, have not been well investigated. This paper addresses the problem of finding reliable route reflection topologies for IBGP networks, which is of great importance to increase the robustness of IBGP operations. We first present a novel reliability model and two new metrics (IBGP expected lifetime and expected session loss) to evaluate the reliability of reflection topologies, and further to investigate the design problem. After studying the solvability conditions under the router capacity constraints, we prove the NP-hardness of the problem, and then design and implement three heuristic solutions using randomization techniques: heuristic selection, greedy search and simulated annealing. Our extensive computational experiments show that the reliability of IBGP reflection network can be significantly improved by our solutions.
KW - Computational modeling
KW - Computer network reliability
KW - Computer science
KW - Guidelines
KW - Network topology
KW - Peer to peer computing
KW - Reflection
KW - Robustness
KW - Routing protocols
KW - Scalability
UR - http://www.scopus.com/inward/record.url?scp=84943573153&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84943573153&partnerID=8YFLogxK
U2 - 10.1109/ICNP.2003.1249769
DO - 10.1109/ICNP.2003.1249769
M3 - Conference contribution
AN - SCOPUS:84943573153
T3 - Proceedings - International Conference on Network Protocols, ICNP
SP - 180
EP - 189
BT - Proceedings - 11th IEEE International Conference on Network Protocols, ICNP 2003
PB - IEEE Computer Society
T2 - 11th IEEE International Conference on Network Protocols, ICNP 2003
Y2 - 4 November 2003 through 7 November 2003
ER -