JPDC Special Issue (December 2000)
Routing in Computer and Communication Networks
Co-Guest-Editors: Stephan Olariu and Jie Wu
The efficiency of message routing is critical to the performance of computer
and communication networks. The routing process involves moving data between
the various hosts of a given network. When such a process involves more
than one source and/or one destination, it is commonly referred to as
a collective communication process.
The complexity of routing is further complicated by host mobility in wireless networks (cellular and/or ad-hoc). It is clear that the conventional routing algorithms are not suitable in networks whose topology is dynamic, especially when real-time traffic has to be supported.
The main goal of the special issue is to provide a forum for recent results on routing protocols in computer and communication networks. Our main goal is to offer both researchers and practitioners working in this area an opportunity to express and discuss their views on the current trends, challenges, and state-of-art solutions to the design of efficient routing protocols.
Topics to be covered in the special issue include but are not limited to:
Impact of topology
on routing
Deadlock, livelock,
and starvation-free routing
Reliable routing
(point-to-point and multicasting)
Designing high-performance
routers/switches/buses
Communication
subsystems
Hardware support
for routing
Support for collective
communication
Routing in the
Interne
Routing in mobile
networks (cellular and ad-hoc wireless networks)
Intra-cluster
and in-cluster routing of LANs
Performance evaluation
and benchmarking
Randomized routing
protocols