This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
— 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...
Abstract—Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such “services” are typically performed on ...
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...
Many practical routing problems such as BGA, PGA, pin redistribution and test xture routing involve routing with interchangeable pins. These routing problems, especiallypackage la...