121 search results - page 1 / 25 » A routing protocol for finding two node-disjoint paths in co... |
APPT
2007
Springer
13 years 11 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
ICNP
1995
IEEE
13 years 9 months ago
1995
IEEE
INFOCOM
2000
IEEE
13 years 10 months ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
JNW
2008
13 years 5 months ago
2008
Multi-path routing allows building and use of multiple paths for routing between a source-destination pair. This paper investigates the problem of selecting multiple routing paths ...
CSREASAM
2006
13 years 7 months ago
2006
- In this paper we find a secure routing protocol for computer networks, which finds minimum optimum path using homomorphic encryption schemes. We briefly look into the existing ho...