Method for achieving dynamic multicast spanning tree path adjustment based on OpenFlow

A spanning tree and multicast technology, applied in the field of computer networks, can solve the problems of hard to change transmission paths, poor flexibility, cumbersome request operations, etc., and achieve the effect of optimizing multicast transmission efficiency
CN103346969AInactive Publication Date: 2013-10-09COMP NETWORK INFORMATION CENT CHINESE ACADEMY OF SCI
1 Cites 64 Cited by

Patent Information

Authority / Receiving Office
CN ยท China
Current Assignee / Owner
COMP NETWORK INFORMATION CENT CHINESE ACADEMY OF SCI
Publication Date
2013-10-09
Estimated Expiration
Not applicable ยท inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention provides a method for achieving dynamic multicast spanning tree path adjustment based on OpenFlow. An OpenFlow technology is utilized to solve the problems in a multicast service of a host entering or leaving a multicast set, multicast spanning tree path dynamic adjustment and distributed multicast spanning tree strategies. According to the OpenFlow technology, a traditional packet forwarding process completely controlled by a router or a switch is converted into the process together completely by the OpenFlow switch and the controller, and therefore separation of forwarding logics and specific forwarding operation is achieved.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] technical field

[0002] The patent application of the present invention relates to the field of computer networks, in particular to a method for implementing dynamic multicast spanning tree path adjustment based on OpenFlow.

[0003] Background technique

[0004] In computer network communication, multicast is one of the important services of network transmission. The advantage of multicast transmission is to save network resources, reducing multicast spanning tree cost and optimizing multicast transmission network are important research directions of multicast problems.

[0005] There are various multicast algorithms, mainly static multicast spanning tree algorithms, such as DIjkstra, DDSP, Prim, Krustal, etc.; researches on dynamic multicast spanning tree algorithms are relatively few, such as SBPT, GRD, etc. In an actual network, members of a multicast group can join or leave a multicast group at any time. The spanning tree algorithm will generate different mul...

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