Method for shortest path bridging of multicast traffic

A technology of shortest path bridging and shortest path, which is applied in the field of transmission network and can solve problems such as inefficiency

Active Publication Date: 2014-05-28
ALCATEL LUCENT SAS
View PDF3 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Unfortunately, this technique is ineff

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 for shortest path bridging of multicast traffic
  • Method for shortest path bridging of multicast traffic
  • Method for shortest path bridging of multicast traffic

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0013] Various embodiments of the present invention are directed to determining shortest path bridging ( SPB).

[0014] In various embodiments, different paths are allowed to support unicast and multicast traffic. In various embodiments, different cost factors for weights are associated with unicast and multicast paths or path elements. In various embodiments, each communication node (CN) computes once on one or more trees (referred to as "star, group trees" or "*, G trees") to define multicast paths, where according to common agreement The mechanism of computes the *,G-tree such that each of the respective nodes within a population of nodes, a subset of nodes of a population of nodes, a subset of service instances, etc. will converge on the common decision of the specified node(s).

[0015] Within the context of propagating unicast and multicast traffic within an Ethernet-based transport network, the determination of the SPB for unicast and multicast frames is primarily sho...

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

Method for determining shortest path bridging (SPB) of multicast frames within a communications network comprises at each of a plurality of nodes within the network, determining a designated node (DN) according to a commonly agreed mechanism; at each of the plurality of nodes, determining a shortest path between the DN and each of the plurality of nodes; and at each of the plurality of nodes, selecting for inclusion in a respective forwarding tree for multicast only those determined shortest paths from the DN traversing the respective node.

Description

technical field [0001] The present invention relates to the field of transport networks, and more particularly, but not exclusively, to shortest path bridging for providing multicast services in transport networks. Background technique [0002] Shortest Path Bridging (SPB) is an emerging standard that specifies methods to overcome traditional inefficiencies in Ethernet-based networks by using shortest-path-based forwarding for unicast and multicast traffic. For multicast, SPB specifies a mechanism called source / group tree, which requires building a multicast tree for each source node and each equivalence tree algorithm. There are two main issues with this; namely, consumption of computing resources, and consumption of multicast addresses or other data resources such as shortest path Virtual Local Area Network (VLAN) identifiers. In particular, the computational resources consumed at each node correspond to the number of nodes in the network. Furthermore, the multicast forw...

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
IPC IPC(8): H04L12/18H04L12/46H04L12/721H04L45/122H04L45/16
CPCH04L12/18H04L45/12H04L12/4641H04L45/16H04L45/48
Inventor S·萨塔潘P·夸克D·W·菲迪克
Owner ALCATEL LUCENT SAS
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap