Micro SIDs: a solution for Efficient Representation of Segment IDs in SRv6 Networks

Autor: Andrea Mayer, Angelo Tulumello, Paolo Lungaroni, Francoid Clad, Stefano Salsano, Marco Bonola, Darren Dukes, Carmine Scarpina, Pablo Camarillo, Ahmed Abdelsalam, Clarence Filsfils
Rok vydání: 2020
Předmět:
FOS: Computer and information sciences
Routing protocol
Settore ING-INF/03
Computer Networks and Communications
Computer science
ComputerApplications_COMPUTERSINOTHERSYSTEMS
network architecture
02 engineering and technology
Loose Source Routing
Topology
Computer Science - Networking and Internet Architecture
Virtual private networks
IPv6 packet
Routing protocols
0202 electrical engineering
electronic engineering
information engineering

Forwarding plane
Electrical and Electronic Engineering
Routing
Networking and Internet Architecture (cs.NI)
IPv6 address
Network packet
business.industry
IP routing protocols
ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS
Segment routing
Byte
020206 networking & telecommunications
Interoperability
IPv6
Programming
020201 artificial intelligence & image processing
business
Computer network
Zdroj: CNSM
Popis: The Segment Routing (SR) architecture is based on loose source routing. A list of instructions, called segments can be added to the packet headers, to influence the forwarding and the processing of the packets in an SR enabled network. In SRv6 (Segment Routing over IPv6 data plane) the segments are represented with IPv6 addresses, which are 16 bytes long. There are some SRv6 service scenarios that may require to carry a large number of segments in the IPv6 packet headers. This can be inefficient due to the overheads of the segment list, or can even cause processing issues in the crossed nodes due to the very large header to be processed. In this paper we present the Micro SID solution for the efficient representation of segment identifiers. With this solution, the length of the segment list can be drastically reduced.
Comment: Extended version (v1) of submitted paper - October 2020
Databáze: OpenAIRE