Unlock instant, AI-driven research and patent intelligence for your innovation.

Method and apparatus for minimum label bandwidth guaranteed path for segment routing

Active Publication Date: 2019-07-09
NOKIA OF AMERICA CORP +2
View PDF23 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

This approach ensures that the resulting path has the minimum number of hops and does not overlap in the physical topology, providing a bandwidth-guaranteed and efficient routing solution by eliminating links with less than the minimum required capacity.

Problems solved by technology

However, applying the same approach to a segment graph does not result in finding the shortest path having a bandwidth guaranteed.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and apparatus for minimum label bandwidth guaranteed path for segment routing
  • Method and apparatus for minimum label bandwidth guaranteed path for segment routing
  • Method and apparatus for minimum label bandwidth guaranteed path for segment routing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0019]A brief summary of various embodiments is presented below. Embodiments address the need to find the minimum hop path in the segment graph traversing the smallest number of links in the physical topology to ensure that the path that is outputted is not overlapping (i.e. each link in the physical topology is traversed only once).

[0020]In order to overcome these and other shortcomings of the prior art and in light of the present need to create minimum hop path in the segment graph traversing the smallest number of links in the physical topology, a brief summary of various exemplary embodiments is presented. Some simplifications and omissions may be made in the following summary, which is intended to highlight and introduce some aspects of the various exemplary embodiments, but not to limit the scope of the invention.

[0021]Detailed descriptions of a preferred exemplary embodiment adequate to allow those of ordinary skill in the art to make and use the inventive concepts will follo...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

Various embodiments relate to a non-transitory computer readable medium and method thereof for finding a minimum hop path in a segment graph traversing the least number of links in a physical topology, the method including receiving a connection request for a connection between a source node and a destination node, computing the segment graph, the segment graph having a plurality of links, computing a bandwidth for each of the plurality of links in the segment graph, computing the number of links for a shortest path (“N(q)”) for each of the plurality of links, eliminating each of the plurality of link with a bandwidth less than the minimum bandwidth and selecting the shortest path in the physical topology between the plurality of links.

Description

TECHNICAL FIELD[0001]This disclosure relates generally to segment routing, and more specifically, but not exclusively, to using shortest path fragments to transfer packets from a source node to a destination node and to instantiate a bandwidth guaranteed path.BACKGROUND[0002]The goal of segment routing is to create flexible connection routing in IP / MPLS networks by building on features of existing network protocols. The concept of segment routing is to use a sequence of segments to compose the desired end-to-end connection path.[0003]The path between the end points of each segment is determined by a conventional routing protocol like Open Shortest Path First (“OSPF”).[0004]The segment labels are carried in the packet header and so a per-flow state is maintained only at the ingress node. A segment label is similar to a Multiprotocol Label Switching (“MPLS”) label and traditional operations such as: push, pop, swap actions can be applied to it by the routers on the segment path.[0005]...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(United States)
IPC IPC(8): H04L12/749H04L12/723H04L12/733H04L12/729H04L12/721H04L12/741H04L45/125H04L45/741H04L45/122H04L45/50H04L45/74
CPCH04L45/125H04L45/20H04L45/745H04L45/50H04L45/34
Inventor HAO, FANGKODIALAM, MURALILAKSHMAN, T. V.REZAAIFAR, EHSAN
Owner NOKIA OF AMERICA CORP