Christos Kaklamanis
Satish Rao
- 1.F. Annexstein and M. Baumslag. A unified approach to off-line permutation routing on parallel networks. In Symposium on Parallel Algorithms and Architecture, pages 398-406. ACM, 1990. Google Scholar
Digital Library
- 2.D. Krizanc. A note on offiine routing on meshconnected processor arrays. Parallel Processing Letters, 1:65-69, 1991.Google ScholarCross Ref
- 3.M. Kunde. Routing and sorting on mesh connected arrays. In Aegean Workshop on Computing: VLSI algorithms and archztectures. Voi.319 of Lecture Notes in Computer Science, Springer Verlag, NY, pages 423-433, 1988. Google Scholar
- 4.M. Kunde. Balanced routing: Towards the distance bound on grids, in Symposium on Parallel Algorithms and Architecture, pages 260-271, 1991. Google ScholarDigital Library
- 5.T. Leighton. Average case analysis of greedy routing algorithms on arrays. In Symposium on Parallel Algomthms and Architecture, pages 2-10, 1990. Google ScholarDigital Library
- 6.T. Leighton, F. Makedon, and I. Tollis. A 2n-2 step algorithm for routing in an n x n array with constant size queues. In Symposium on Parallel Algorithms and Architecture, pages 328-335, 1989. Google ScholarDigital Library
- 7.S. Rajasekaran and R. Overholt. Constant queue routing on a mesh. In Proc. STACS 91. Vol. ~80 of Lecture Noles in Computer Science, Springer Verlag, NY, pages 444-455, 1991. Google Scholar
- 8.S. Rajasekaran and Th. Tsantilas. Optimal routing algorithms for mesh-connected processor arrays. Algorithmica (to appear), 1991. Preliminary version in Proc. AWOC '88, Lecture Notes in Computer Science, vol. 319, Springer-Verlag (1988), pp. 411-422. Google ScholarDigital Library
- 9.L. G. Valiant. General purpose parallel architectures, in J. van Leeuwen, editor, Handbook of Theorctical Computer Science, pages 943-971. Elsevier Science Publishers, B. V., Amsterdam, The Netherlands, 1990. Google ScholarDigital Library
Index Terms
- Simple path selection for optimal routing on processor arrays
Recommendations
Routing with adaptive path and limited flooding for mobile ad hoc networks
In MANET, each mobile host can freely move around and the network topology is dynamically changing. To send a datagram, a source host broadcasts a route discovery packet to the network. All neighboring nodes receiving this packet will rebroadcast this ...
Opportunistic Routing Protocol Based EPO–BES in MANET for Optimal Path Selection
AbstractDespite its various benefits, the Mobile Ad-hoc Network (MANET) has a number of obstacles due to its mobility, unstable topology, energy efficiency, and other factors. In such an environment, routing protocols are required to transfer packets from ...
On-Demand Multipath Routing Protocol with Preferential Path Selection Probabilities for MANET
AINA '06: Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02We developed an Ad hoc On-demand Multipath Distance Vector protocol with Path Preferential Selection Probabilities (AODVM-PPSP) for a mobile ad hoc network(MANET). This protocol introduces a new method, in which each node deliberately selects one of the ...
Comments