• No results found

best partially disjoint paths

A heuristic to generate all best partially disjoint paths in a communications network

A heuristic to generate all best partially disjoint paths in a communications network

... Since the load rises above the target bandwidth the scheme reduces the number of tokens that are available on this link Figure 5 but since there are about 200 flows that are persistent f[r] ...

7

Note on the problem of partially link disjoint paths

Note on the problem of partially link disjoint paths

... One problem is that the algorithm could finally mark nodes before all partly disjoint paths are collected and therefore part of the path is missed. This can be handled by a “step back” to the origin node ...

5

An Empirical Study of Multipath Routing          Protocols in Wireless Sensor Networks

An Empirical Study of Multipath Routing Protocols in Wireless Sensor Networks

... construct partially disjoint ...its best neighboring node towards the source ...its best next-hop neighboring node towards the source ...its best next-hop neighboring ...of ...

5

Quality of Service Routing in Ad hoc Wireless Networks

Quality of Service Routing in Ad hoc Wireless Networks

... dictable performance and adjustable overheads for the NP-complete multi-constrained problem is not avail- able. Moreover all applications do not need the same QoS, hence developing a generalized QoS protocols is again ...

10

Multiple Disjoint Paths Routing Using Implicit Source Routes in Wireless Ad Hoc Networks

Multiple Disjoint Paths Routing Using Implicit Source Routes in Wireless Ad Hoc Networks

... DSR, disjoint paths are constructed by spreading request paths in a ...maximally disjoint paths for load balancing transmissions over the ...

5

Mirror image based disjoint multi paths routing algorithm for maximizing communication efficiency

Mirror image based disjoint multi paths routing algorithm for maximizing communication efficiency

... Two paths are wanted in a five-node CR network, and there are two candidate spec- trum channels which are sensed in two time slots, the detailed SHM is stated above each ...multiple paths which have been ...

14

Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation

Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation

... shortest paths concurrently, or (ii) concurrently update shortest paths, but their convergence can be very slow (possibly ...a partially dynamic algorithm that overcomes most of these ...shortest ...

11

On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs

On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs

... ON A CLASS OF POLYNOMIALS ASSOCIATED WITH THE PATHS IN A GRAPH AND ITS APPLICATION TO MINIMUM NODES DISJOINT PATH COVERINGS OF GRAPHS E.J.. FARRELL Department of Mathematics The Universi[r] ...

12

Comparision of various Wind Turbine Generators

Comparision of various Wind Turbine Generators

... In this paper, we propose a multipath routing protocol, LBMPR with fail-safe multiple path [7], in order to minimize the route break recovery overhead. LBMPR provides most of the intermediate nodes on the primary path ...

10

A Genetic Algorithm for Maximum Edge-disjoint Paths Problem and Its Extension to Routing and Wavelength Assignment Problem.

A Genetic Algorithm for Maximum Edge-disjoint Paths Problem and Its Extension to Routing and Wavelength Assignment Problem.

... Assigning paths to connection requests is one of the basic operations in the modern communication ...assign paths to requests in such a way that no two paths share an edge in ...These paths ...

151

Two Edge-Disjoint Hamiltonian Cycles and Two-Equal Path Partition in Augmented Cubes

Two Edge-Disjoint Hamiltonian Cycles and Two-Equal Path Partition in Augmented Cubes

... edge- disjoint if they do not share any common edge. The edge- disjoint Hamiltonian cycles can provide advantage for algo- rithms that make use of a ring structure ...

5

Best Practices for Advertisement of Multiple Paths in IBGP

Best Practices for Advertisement of Multiple Paths in IBGP

... N paths mode, but this is susceptible to routing ...N paths do not include the best path from each neighbor AS group then route oscillation cannot be ...N paths to peer_n and M paths to ...

25

Best Practices for Advertisement of Multiple Paths in BGP

Best Practices for Advertisement of Multiple Paths in BGP

... the best path ...its best path but because of its Add-Paths (or best-external) configuration it also advertises path (B) to ...learned paths to its IBGP peers, including router ...Add- ...

24

Vol 5, No 1 (2013)

Vol 5, No 1 (2013)

... end-end paths and backup can increase network ...to paths and backup selection phase in these ...multi disjoint paths is addressed as a multi-criteria decision making (MCDM) problem and ...

9

MSDM: Maximally Spatial Disjoint Multipath Routing Protocol for MANET

MSDM: Maximally Spatial Disjoint Multipath Routing Protocol for MANET

... maximally disjoint compared with the primary ...maximally disjoint path, it chooses those paths with the shortest hop ...node- disjoint paths were as stable as link-disjoint ...

7

Node-Disjoint Multipath Routing Based on          AOMDV Protocol for MANETS

Node-Disjoint Multipath Routing Based on AOMDV Protocol for MANETS

... Node Disjoint–Multipath based on the congestion threshold and results will be obtained through various simulations shown via the effectiveness of our suggested methods in terms of End to end delay, Throughput, hop ...

6

Volume 17: Kommunikation in Verteilten Systemen 2009

Volume 17: Kommunikation in Verteilten Systemen 2009

... As long as our assumption holds, a successful attacker needs multiple expensive identities taking part in the decision process and forming a majority there. A minority of malicious nodes can be detected and punished ...

13

Calculating Ramsey numbers by partitioning colored graphs

Calculating Ramsey numbers by partitioning colored graphs

... • It would be interesting to see whether Theorems 1.7 and 1.8 have any applica- tions in the area of partitioning coloured complete graphs. In particular, given that Lemma 1.5 played an important role in the proof of the ...

25

A novel disjoint multipath routing algorithm for heterogeneous wireless 
		sensor network

A novel disjoint multipath routing algorithm for heterogeneous wireless sensor network

... the problem of energy optimization and fault tolerant is addressed by considering heterogeneous network which has two layers. In bottom layer ordinary sensor nodes are present and top layer super nodes are deployed. The ...

6

Multipath Routing Protocol using Cross layer based QoS Metrics for IEEE 802  11e WLAN

Multipath Routing Protocol using Cross layer based QoS Metrics for IEEE 802 11e WLAN

... the paths taken by the routing protocols when at a particular node the MAC protocols are ...multiple paths are discovered by the source in the discovery process, only the route with the shortest possible ...

5

Show all 10000 documents...

Related subjects