We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to ma...
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s...
Daniel Delling, Peter Sanders, Dominik Schultes, D...
Abstract. We propose three routing strategies for the routing and wavelength assignment (RWA) of scheduled and random lightpath demands in a wavelength-switching mesh network witho...
Most virtual channel routers have multiple virtual channels to mitigate the effects of head-of-line blocking. When there are more flows than virtual channels at a link, packets o...
Keun Sup Shim, Myong Hyon Cho, Michel A. Kinsy, Ti...
Wireless Ad Hoc networks are particularly vulnerable due to their fundamental characteristics such as an open medium, dynamic topology, distributed cooperation and constrained capa...