Segment routing has recently been proposed in the IETF towards making IP/MPLS networks
service-oriented and efficient. Segment routing involves identifying paths at the source node …

Segment routing has recently been proposed in the IETF toward making IP/MPLS networks
service-oriented while simplifying network operations. Segment routing computes paths at …

The algorithmic small-world phenomenon, empirically established by Milgram in the 60 s [1],
was theoretically explained by Kleinberg in 2000 [2]. However, from today's perspective his …

The BGP routing table continues to grow. Reducing the table size means that memory can
be made available for other in-router processing. Compact routing provides a method for …

The Internet relies on its inter-domain routing system to allow data transfer between any two
endpoints regardless of where they are located. This routing system currently uses a …

Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the
network by routing via landmarks and incurring some path stretch. It uses a pseudo-random …

Sprinkles is a greedy routing protocol with very low average stretch and bounded additive
stretch that is inspired by a compact routing scheme for power law graphs. By replacing the …

The study of the structural characteristics of the Internet topology at the Autonomous System
(AS) level of abstraction is an important and interesting subject that has attracted significant …

The number of addresses on the Internet grows rapidly, and thus there may be a point at
which the state requirements for routing become unwieldy. The intent of this research is …

In this work we look at the structure and implementation of a hierarchical tree based routing
topology based on the physical network topology. The work focuses on providing a single …