Algorithms for Radio Networks with Dynamic Topology.

Abstract : The objective of this project was the development of advanced algorithms and protocols that efficiently use network resources to provide optical or nearly optimal performance in future communication networks with highly dynamic topologies and subject to frequent link failures. As reflected by this report, we have achieved our objective and have significantly advanced the state of the art in this area. The research topics of the papers summarized include the following: efficient distributed algorithms for computing shortest pairs of disjoint paths; minimum-expected-delay alternate routing algorithms for highly dynamic unreliable networks; algorithms for loop-free routing; multipoint communication by hierarchically encoded data; efficient algorithms for extracting the maximum information from event-driven topology updates; methods for the neural network solution of link scheduling and other difficult problems arising in communication networks; and methods for robust routing in networks subject to sophisticated attacks.

[1]  D.A. Beyer,et al.  Tabu learning: a neural network search method for solving nonconvex optimization problems , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.

[2]  Baruch Awerbuch,et al.  A New Distributed Depth-First-Search Algorithm , 1985, Inf. Process. Lett..

[3]  Paul E. McKenney,et al.  Packet recovery in high-speed networks using coding and buffer management , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[4]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[5]  Mischa Schwartz,et al.  Telecommunication networks , 1987 .

[6]  Shay Kutten,et al.  Broadcast in fast networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[7]  Jonathan S. Turner,et al.  Design of a broadcast packet switching network , 1988, IEEE Trans. Commun..

[8]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[9]  C. Edward Chow,et al.  On multicast path finding algorithms , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[10]  Donald M. Topkis,et al.  A k shortest path algorithm for adaptive routing in communications networks , 1988, IEEE Trans. Commun..

[11]  R. G. Ogier,et al.  Neural network solution to the link scheduling problem using convex relaxation , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[12]  Ming-Syan Chen,et al.  Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping , 1987, IEEE Transactions on Computers.

[13]  Mischa Schwartz,et al.  Telecommunication networks: protocols, modeling and analysis , 1986 .

[14]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[15]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[16]  Mohammed Ghanbari,et al.  Two-layer coding of video signals for VBR networks , 1989, IEEE J. Sel. Areas Commun..

[17]  Vladislav Rutenburg.  Efficient distributed algorithms for computing shortest pairs of maximally disjoint paths in communication networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[18]  Hans-Werner Braun,et al.  Models of policy based routing , 1989, RFC.

[19]  Jeffrey M. Jaffe,et al.  Point-To-Multipoint Communication Over Broadcast Links , 1984, IEEE Trans. Commun..

[20]  Deborah Estrin.  Policy Requirements for Inter-Administrative Domain Routing , 1991, Comput. Networks ISDN Syst..

[21]  Nachum Shacham,et al.  A distributed algorithm for finding shortest pairs of disjoint paths , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[22]  Vladislav Rutenburg,et al.  Minimum-expected-delay alternate routing , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[23]  Nachum Shacham,et al.  Multipoint communication by hierarchically encoded data , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[24]  Gunnar Karlsson,et al.  Packet video and its integration into the network architecture , 1989, IEEE J. Sel. Areas Commun..

[25]  D. Towsley,et al.  Resequencing delay and buffer occupancy in selective repeat ARQ with multiple receivers , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[26]  Alon Itai,et al.  The Multi-Tree Approach to Reliability in Distributed Networks , 1984, Inf. Comput..

[27]  David D. Clark,et al.  Policy routing in Internet protocols , 1989, RFC.

[28]  Eric Nussbaum,et al.  Communication network needs and technologies-a place for photonic switching? , 1988, IEEE J. Sel. Areas Commun..

[29]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[30]  Adrian Segall,et al.  A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..

[31]  J. W. Suurballe.  Disjoint paths in a network , 1974, Networks.

[32]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[33]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[34]  J. J. Garcia-Luna-Aceves,et al.  Dynamics of distributed shortest-path routing algorithms , 1991, SIGCOMM '91.

[35]  D. Werra,et al.  Tabu search: a tutorial and an application to neural networks , 1989 .

[36]  Baruch Awerbuch.  Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization , 1985, Networks.

[37]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[38]  H. Szu,et al.  Fast TSP algorithm based on binary neuron output and analog neuron input using the zero-diagonal interconnect matrix and necessary and sufficient constraints of the permutation matrix , 1988, IEEE 1988 International Conference on Neural Networks.

[39]  Vladislav Rutenburg,et al.  Fair charging policies and minimum-expected-cost routing in internets with packet loss , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.