Title:
|
IBGP SOLUTION BY COMBINING ROUTE REFLECTION AND SHARED TREE BASED MULTICAST |
Author(s):
|
Toshihiko Kato, Yao Koffi Hubert Wilfried, Celimuge Wu, Satoshi Ohzahata |
ISBN:
|
978-989-8533-54-8 |
Editors:
|
Piet Kommers and Guo Chao Peng |
Year:
|
2016 |
Edition:
|
Single |
Keywords:
|
iBGP, Route Reflector, Multicast, Shared Tree, PIM-SM |
Type:
|
Full Paper |
First Page:
|
203 |
Last Page:
|
210 |
Language:
|
English |
Cover:
|
|
Full Contents:
|
click to dowload
|
Paper Abstract:
|
There are many researches focusing on the scalability problem in the external route information dissemination by the internal Border Gateway Protocol (iBGP). The traditional one is a scheme to use the route reflectors, which redistribute the external route to their clients. Although this scheme is used in an actual network management, they still have some problems such that they suffer from wrong paths in case of network failures and that there may occur transient loops at the external route update. In order to resolve those problems, LOUP (Link-Ordered Update Protocol) proposes a multicast based route information dissemination scheme. It constructs a shortest path multicast tree per a border router and delivers UPDATE messages over the tree. LOUP can resolve the above problems but its concept is close to the full mesh structure in iBGP, and so it has another problem that the number of UPDATE messages becomes large. In this paper, we propose a new external route information dissemination scheme which combines the route reflection and the shared tree based multicast. Our scheme named RESTERM (Reflection Enabled Shared Tree External Route Multicast) charges the route reflectors with behaving as the root of trees, and builds shared trees necessary for establishing the best routes for all RESTERM routers. This paper also describes the results of performance evaluation focusing on the number of hops in delivering UPDATA messages and shows that RESTERM provides better performance than the traditional route reflection scheme and LOUP. |
|
|
|
|