— We consider the path-determination problem in Internet core routers that distribute flows across alternate paths leading to the same destination. We assume that the remainder ...
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Throughput, power consumption, signal integrity, pin count and routing complexity are all increasingly important interconnect issues that the system designer must deal with. Recen...
— We present a new analytical technique, based on the inclusion–exclusion principle from combinatorics, for the analysis of all-optical networks with no wavelength conversion a...
Resiliency to link failures in optical networks is becoming increasingly important due to the increasing data rate in the fiber. Path protection schemes attempt to guarantee a bac...