2076 search results - page 35 / 416 » Universal Routing in Distributed Networks |
IPPS
1996
IEEE
14 years 26 days ago
1996
IEEE
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— Assume the reliability of a connection is determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrar...
ICCCN
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract—Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such “services” are typically performed on ...
ICUMT
2009
13 years 6 months ago
2009
Structured peer-to-peer systems--also known as key-based routing protocols--offer a base for a broad range of applications. In the past, different topology adaptation mechanisms fo...
ICCAD
1996
IEEE
14 years 26 days ago
1996
IEEE
Many practical routing problems such as BGA, PGA, pin redistribution and test xture routing involve routing with interchangeable pins. These routing problems, especiallypackage la...