RIP-MTI: A New Way to Cope with Routing Loops

April 13-April 18

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ICN.2008.58

Seventh International Conference on N ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Ch. Steigner Articles by H. Dickel Articles by T. Keupen

	ASCII Text	x
	Ch. Steigner, H. Dickel, T. Keupen, "RIP-MTI: A New Way to Cope with Routing Loops," International Conference on Networking, pp. 626-632, Seventh International Conference on Networking (icn 2008), 2008.

	BibTex	x
	@article{ 10.1109/ICN.2008.58, author = {Ch. Steigner and H. Dickel and T. Keupen}, title = {RIP-MTI: A New Way to Cope with Routing Loops}, journal ={International Conference on Networking}, volume = {0}, year = {2008}, isbn = {978-0-7695-3106-9}, pages = {626-632}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICN.2008.58}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - International Conference on Networking TI - RIP-MTI: A New Way to Cope with Routing Loops SN - 978-0-7695-3106-9 SP626 EP632 A1 - Ch. Steigner, A1 - H. Dickel, A1 - T. Keupen, PY - 2008 KW - communication networks KW - internetworking KW - routing algorithms KW - intra-domain routing KW - routing convergence KW - network stability KW - RIP KW - RIP-MTI VL - 0 JA - International Conference on Networking ER -

Ch. Steigner

H. Dickel

T. Keupen

We introduce a new downward compatible routing protocol called Routing Information Protocol with Minimal Topology Information (RIP-MTI) which is based on the simple Routing Information Protocol (RIP). We exploit the distance vector updates more thoroughly than common RIP-protocols, and therefore, need not alter the interactive behavior of the Routing Information Protocol. With this approach, we are able to recognize loops and avoid the well known Counting to Infinity problem of distance vector routing. This new protocol can recognize and reject updates which have made their way along loops by evaluating simple metric-based equations.

Index Terms:

communication networks, internetworking, routing algorithms, intra-domain routing, routing convergence, network stability, RIP, RIP-MTI

Citation:

Ch. Steigner, H. Dickel, T. Keupen, "RIP-MTI: A New Way to Cope with Routing Loops," icn, pp.626-632, Seventh International Conference on Networking (icn 2008), 2008

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.