NDLI: Reliable and efficient routing protocol for graph theory based communication topology

Content Provider	IEEE Xplore Digital Library
Author	Dongsoo Kim Noel, E. Tang, K.W.
Copyright Year	2013
Description	Author affiliation: Stony Brook Univ., Stony Brook, NY, USA (Dongsoo Kim; Tang, K.W.) \|\| AT&T Labs., San Ramon, CA, USA (Noel, E.)
Abstract	In this paper, we propose the Aggressive Multi-path Aware (AMA) routing protocol. The AMA routing protocol is designed to demonstrate routing feasibility in the resized Borel Cayley Graphs (BCGs) and Expanded Borel Cayley Graphs (Ex-BCGs) formulated by the Cut-Through Rewiring (CTR) algorithm. The AMA routing protocol focuses on resolving the single shortest path and multi-paths depletion problems of the Vertex-Transitive (VT) and Class-level Vertex-Transitive (CVT) routing protocols when BCGs and Ex-BCGs are resized. The AMA routing protocol updates the routing table to reflect topology changes with a small network overhead. Based on the updated routing table, the AMA routing protocol delivers data with the Multi-path Aware routing and the Random Direction routing schemes. The multi-path aware routing exploits all available multi-paths with prioritized selection from the updated routing table. The random direction routing supplements the multi-path aware routing failure by relaying the packet to randomly selected neighbor. From simulation, we observe that the AMA routing protocol has reliable reachability and efficient average routing path length along the removed node ratios. Furthermore, we identify that the AMA routing protocol achieves almost identical reachabilities independent of the networks generated by different parameters. For extensive evaluation with traffic patterns, we show the potential of the AMA routing protocol for network applications with reasonable reachability, End-to-End delay and dropped packets analysis.
Starting Page	1
Ending Page	10
File Size	2597897
Page Count	10
File Format	PDF
e-ISBN	9781479932146
DOI	10.1109/PCCC.2013.6742774
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-12-06
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Topology Routing Efficiency Borel Cayley Graphs Expanded Borel Cayley Graphs Vertex Transitive (VT) Routing Protocol Class-level Vertex Transitive (CVT) Routing Protocol Communication topology Reliability
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Cubic vertex-transitive non-Cayley graphs of order 8p (2012)

Cayley Graphs and Interconnection Networks (1997)

Vertex‐transitive graphs that are not Cayley graphs. II

Vertex-Transitivity and Routing for Cayley Graphs in GCR Representations (1992)

Compression of Vertex Transitive Graphs

Enumerating Planar Locally Finite Cayley Graphs

A construction of vertex-transitive non-Cayley graphs, Australas (1994)

Colouring Cayley graphs (1988)

A counterexample. Routing conjecture for vertex-transitive graphs (2000).

Reliable and efficient routing protocol for graph theory based communication topology

Similar Documents

Cubic vertex-transitive non-Cayley graphs of order 8p (2012)

Cayley Graphs and Interconnection Networks (1997)

Vertex‐transitive graphs that are not Cayley graphs. II

Vertex-Transitivity and Routing for Cayley Graphs in GCR Representations (1992)

Compression of Vertex Transitive Graphs

Enumerating Planar Locally Finite Cayley Graphs

A construction of vertex-transitive non-Cayley graphs, Australas (1994)

Colouring Cayley graphs (1988)

A counterexample. Routing conjecture for vertex-transitive graphs (2000).

Reliable and efficient routing protocol for graph theory based communication topology