A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
In this paper, we propose a new family of interconnection networks, called cyclic networks (CNs), in which an intercluster connection is defined on a set of nodes whose addresses...
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
VRML 2.0 allows a content creator to dynamically control state changes in a virtual reality world by defining routes of events over VRML 2.0 nodes. In the conceptual execution mod...