Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Multi-broadcast routing method of supporting multi-QoS constraint

A routing and routing protocol technology, applied in the field of multicast routing that supports multiple QoS constraints, can solve problems such as reduced success rate, reduce generation cost, reduce connection establishment time and signaling control overhead, and reduce connection establishment time. Effect

Inactive Publication Date: 2005-12-21
WUHAN UNIV OF TECH
View PDF0 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The QoSMIC proposed by Faloutsos et al. is an improvement to the YAM protocol. It limits the search of the flooding method to a small range to reduce the cost of broadcast messages, and sets an administrator for each group. After the flood search fails , notify the administrator to perform multicast tree search, and multicast tree search only selects candidate routers on the established tree, which leads to a decrease in the success rate of pathfinding
Shigang Chen and others proposed the QMRP protocol, which does not use the flooding method to find the path, but combines the single-path path and multi-path path to find the path, which effectively guarantees a lower calculation amount and a higher Connection success rate, but QMRP can only meet the requirements of non-additive QoS constraints

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
  • Multi-broadcast routing method of supporting multi-QoS constraint
  • Multi-broadcast routing method of supporting multi-QoS constraint
  • Multi-broadcast routing method of supporting multi-QoS constraint

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] 1. Theoretical basis: The present invention first proposes a network model of a multicast routing protocol (MRPMQoS) that supports multiple QoS constraints under the network simulator NS2.

[0025] As far as multicast routing is concerned, a network can be represented as a weighted graph G=(V, E) where V represents the set of nodes and E represents the set of communication links connecting the nodes. Without loss of generality, there is at most one link between a pair of nodes in this type of network, and the parameters beside the link can be used to describe the current state of the link. Let p(v 0 ,, v 1 ,,...,v k ) represents a path in graph G, where v 0 , representing the source node, v k Represents an end node, E(P) represents the set of edges on the path P, for e∈E(P), there is a path P with:

[0026] Bandwidth (the minimum broadband value of each link): bandwidth(P)=min{b(e)}(1-1)

[0027] Delay: refers to the sum of the delays of each link, which can be ex...

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

The disclosed method is implemented under network simulator NS2. Network model is that feasible route P from source node to destination node satisfies following conditions: delay (P) is less than and equal to D; bandwidth (P) is larger than and equal to B; and delay - jitter (P) is less than and equal to J; where P as route, B as threshold value of bandwidth, D as threshold value of delay, J as threshold of restricting value of delay jitter. Optimal path is realized through condition of cost(T(s, M))í·(min), where T as multicasting tree, M as target node, s as source node. Finally, simulated environment of multicasting route protocol is built.

Description

technical field [0001] The invention relates to a multicast routing method supporting multiple QoS constraints, which belongs to network technology, communication technology and multimedia application technology. Background technique [0002] A multicast routing protocol consists of constructing a routing tree to connect the senders and receivers of all multicast groups. In the source tree-based method, the protocol calculates a spanning tree for each source node in the multicast group; in the shared tree method, all multicast members share a spanning tree to send and receive messages, and multiple sources Nodes sharing a delivery tree may result in non-optimal routing and increase message delay. The goal of the multicast transmission routing algorithm is to form and maintain a distributed tree. In source routing, each route saves the global state of the entire network. On the basis of the global state, the multicast tree is locally calculated at the source node; in distrib...

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 Applications(China)
IPC IPC(8): H04L45/16
Inventor 李腊元李春林许毅
Owner WUHAN UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com