Sciweavers

290 search results - page 2 / 58
» Network as a Computer: Ranking Paths to Find Flows
Sort
View
CSREASAM
2006
15 years 26 days ago
Finding Minimum Optimal Path Securely Using Homomorphic Encryption Schemes in Computer Networks
- 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...
Levent Ertaul, Vaidehi Kedlaya
NETWORKS
2002
14 years 11 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
SOFSEM
2010
Springer
15 years 8 months ago
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. ...
ICC
2007
IEEE
162views Communications» more  ICC 2007»
15 years 3 months ago
LSP and Back Up Path Setup in MPLS Networks Based on Path Criticality Index
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...
Ali Tizghadam, Alberto Leon-Garcia
APNOMS
2007
Springer
15 years 5 months ago
The Primary Path Selection Algorithm for Ubiquitous Multi-homing Environments
The multi-homing technology can provide an extended coverage area via distinct access technologies. Also, it is able to redirect a flow from one interface to another without reinit...
Dae Sun Kim, Choong Seon Hong