• No results found

[PDF] Top 20 Delay-constrained multicast trees

Has 10000 "Delay-constrained multicast trees" found on our website. Below are the top 20 most common "Delay-constrained multicast trees".

Delay-constrained multicast trees

Delay-constrained multicast trees

... corresponding multicast session, a failure if, after all multicast group members attempt to join the tree, the final tree spans less than two group ...no delay constraint violation or because of link ... See full document

23

A distributed algorithm for delay-constrained unicast routing

A distributed algorithm for delay-constrained unicast routing

... end-to-end delay requirements (delay constraints) in connection-oriented ...a delay-constrained LC (DCLC) path ...centralized delay-constrained algorithm to solve the DCLC ...the ... See full document

26

QOS Based Bandwidth Satisfaction for Multicast Network Coding in Manet

QOS Based Bandwidth Satisfaction for Multicast Network Coding in Manet

... routing trees are constructed for the transmission which providing the bandwidth ...proposed multicast routing protocol is designed based on contention-based media access control (MAC) ...bandwidth, ... See full document

5

Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs

Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs

... Throughout this text, we assume packet-based networks—so transmitting one piece of data equals transmitting one packet over an arc. Link transmission time between nodes in the net- work may allow for the transmission of ... See full document

7

Probabilistic constrained multicast beamforming in cognitive relay systems

Probabilistic constrained multicast beamforming in cognitive relay systems

... cooperative multicast are jointly considered, and the multicast beam- forming problem in cognitive relay systems is ...feedback delay, perfect channel state information at the transmitter (CSIT) is ... See full document

15

Exact Algorithm to Solve the Minimum Cost Multi Constrained Multicast Routing Problem

Exact Algorithm to Solve the Minimum Cost Multi Constrained Multicast Routing Problem

... 77 hierarchies are NP-hard problems. Exact algorithms to compute the optimum have not yet been proposed. The algorithms computing heuristic solutions manipulate trees and sets of paths rooted at the source. We ... See full document

23

Cost, delay, and delay variation conscious multicast routing

Cost, delay, and delay variation conscious multicast routing

... a constrained Steiner tree problem in which it is necessary to provide bounded delays between the source and all destinations, as well as bounded variation among these ...The delay and delay ... See full document

17

Shared multicast trees and the center selection problem: A survey

Shared multicast trees and the center selection problem: A survey

... The use of shared multicast trees was first proposed by David Wall [16] in 1981. He investigated the problems of broadcasting and selective broadcasting (multicasting) with emphasis on broadcasting. The ... See full document

8

An Efficient Multicast Routing Protocol Using Angle between Forwarding Nodes in Wireless Mesh Networks

An Efficient Multicast Routing Protocol Using Angle between Forwarding Nodes in Wireless Mesh Networks

... routing trees or creating mesh from sources to reach ...The multicast routing protocols for the Wireless Mesh Networks vary in terms of routing, maintaining state, depends on unicast and other ...of ... See full document

6

An Improved MPH Based Delay constrained Steiner Tree Algorithm

An Improved MPH Based Delay constrained Steiner Tree Algorithm

... initial multicast tree T; finally chooses the end node u which meet the delay constraint and the minimum cost to the tree T and has not yet in the tree T, at the same time chooses the relative path p from ... See full document

6

Scalable reliable multicast with layered recovery and low-overhead network delay estimation

Scalable reliable multicast with layered recovery and low-overhead network delay estimation

... There are tree-structured protocols such as TMTP [4], RMTP [2], and LBRM [8] that solve the implo- sion and repair locality problems by imposing a logical tree structure to the multicast session. Specialized ... See full document

37

A New Delay Constrained Multicast Routing Algorithm Based on Shared Edges

A New Delay Constrained Multicast Routing Algorithm Based on Shared Edges

... Proof: By analysis of ESAMPH and ESAMPH_D, we can find that the space cost of the algorithm is mainly lies on Step 1 and Step 2, the ESAMPH has to store the paths with m n m ∗ + storage locations, while ESAMPH_D just ... See full document

5

An efficient delay-constrained minimum spanning tree heuristic

An efficient delay-constrained minimum spanning tree heuristic

... some delay bound, and at the lowest possible ...broadcast trees for real-time traffic with delay constraints in networks with asymmetric link loads as a delay-constrained minimum ... See full document

16

Particle swarm optimization for the Steiner tree in graph and delay constrained multicast routing problems

Particle swarm optimization for the Steiner tree in graph and delay constrained multicast routing problems

... for multicast routing problems and a number of other problems is the Steiner tree problem (Hwang and Richards, 1992), a well known NP-hard combinatorial optimization problem (Garey and Johnson, ...life ... See full document

20

Multi path Stable QoS Routing for Real time Traffic Applications in MANET

Multi path Stable QoS Routing for Real time Traffic Applications in MANET

... A Route Stability based QoS Routing (RSQR) protocol for Mobile Ad Hoc Networks (MANETs) is proposed by Nityananda Sarma and Sukumar Nandi [14]. Their work is an enhancement of QoS routing with throughput and delay ... See full document

8

Improve performance of security attacks using MANET and delay constrained

Improve performance of security attacks using MANET and delay constrained

... Processing delay and propagation delay which switch in microseconds are much concise than transmission delay, contention delay and queuing delay which switch in ...(E2E) delay ... See full document

8

Solving Nonlinear Constrained Optimization Time Delay Systems with a Direct Transcription Approach.

Solving Nonlinear Constrained Optimization Time Delay Systems with a Direct Transcription Approach.

... Fortunately, by the time my oral preliminary exam came around we were able to develop a regu- larization technique, called the exogenous input control method. The method was created to address the difficulties that SOCX ... See full document

198

Flow-Based Transmission Scheduling in Constrained Delay Tolerant Networks

Flow-Based Transmission Scheduling in Constrained Delay Tolerant Networks

... size, except for MaxProp [6] and RAPID [7]. Both of them are based on limited bandwidth, which are more realistic in real DTNs. In MaxProp and RAPID, packet scheduling mechanisms are employed so that when a con- tact ... See full document

8

Delay Dependent Stability Analysis of Discrete Time Delay Systems with Actuator Saturation

Delay Dependent Stability Analysis of Discrete Time Delay Systems with Actuator Saturation

... time delay systems subjected to input saturation through anti-windup ...The delay range dependent approach is adopted and the corresponding anti-windup compensator gain is obtained via LMIs ...A ... See full document

10

Modelling delay and noise in arbitrarily coupled RC trees

Modelling delay and noise in arbitrarily coupled RC trees

... of delay and noise modeling for very large scale integration (VLSI) circuits has received a vast amount of attention in the ...and delay either use heuristics that are tailored for specific topologies or ... See full document

15

Show all 10000 documents...