Sciweavers

15 search results - page 1 / 3
» Routing in a cyclic mobispace
Sort
View
MOBIHOC
2008
ACM
14 years 8 months ago
Routing in a cyclic mobispace
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...
Cong Liu, Jie Wu
IPPS
1997
IEEE
14 years 23 days ago
Cyclic Networks: A Family of Versatile Fixed-Degree Interconnection Architectures
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...
Chi-Hsiang Yeh, Behrooz Parhami
IPPS
1996
IEEE
14 years 22 days ago
Generic Methodologies for Deadlock-Free Routing
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
Hyunmin Park, Dharma P. Agrawal
VRML
1998
ACM
14 years 24 days ago
Event Processing for Complicated Routes in VRML 2.0
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...
Masaaki Taniguchi