DIMACS Workshop on Robust Communication Networks: Interconnection and Survivability

November 18 - 20, 1998
DIMACS Center, CoRE Building, Rutgers University, Piscataway, NJ

Principal Organizers:

• Nathaniel Dean, Rice University, nated@caam.rice.edu
• Frank Hsu, Fordham University, hsu@murray.fordham.edu
• R. Ravi, GSIA, Carnegie Mellon University, ravi@cmu.edu

Workshop Program:

Wednesday, November 18, 1998

8:30 - 8:50    Registration

8:50 - 9:00    Welcome
	       Fred Roberts, DIMACS Director

9:00 - 10:00   Layering and survivability in the next generation network
               infrastructure
               Bharat Doshi, Bell Labs, Lucent Technology, Murray Hill, NJ

10:00 - 10:30  Break

10:30 - 11:00  An approximation algorithm for minimum-cost network design
               David Peleg, Weizmann Inst, Israel

11:00 - 11:30  Complexity and approximability of network improvement problems
               Madhav Marathe, Los Alamos National laboratory, New Mexico

11:30 - 12:00  Designing networks for large scale distributed system
               Yasushi Inoguchi*, M. Shikida, Y. Tan, and T. Matsuzawa,
               JAIST,Kanazawa, Japan

12:00 -1:40    Lunch

1:40 - 2:10    TBA
	       David Williamson, IBM Thomas J. Watson Center, Yorktown
	       Heights, NY 
             
2:10 - 2:40    Design of fault-tolerant on-board networks in satellites (I)
               Jean-Claude Bermond*, CNRS and Uni. of Nice-Sophia Antipolis, France
               D. Toth, Hungarian Academy of Sciences, Budapest, Hungary

2:40 - 3:10    Design of fault-tolerant on-board networks in satellites (II)
               Jean-Claude Bermond, CNRS and Uni. of Nice-Sophia Antipolis, France
               D. Toth*, Hungarian Academy of Sciences, Budapest, Hungary

3:10 - 3:40    Break

3:40 - 4:10    On wirelength estimations for row-based placement
               Alex Zelikovsky, UCLA , Los Angeles, CA

4:10 - 4:40    Real-world metrics and constraints for quality in 
               the "New Public Networks"
               Greg Shannon, Ascend Communications, Ohio

4:40 - 5:10    How to swap a failing edge of a single source shortest paths 
               tree Enrico Nardelli and Guido Proietti*, Univ. of L'Aquila, 
               Italy Peter Widmayer, ETH, Zurich, Switzerland

6:00 -         Reception and Dinner


Thursday, November 19, 19988

9:00 - 10:00   Solving large capacitated network design problems
               D. Bienstock, Bellcore , Morristown, New Jersey

10:00 - 10:30  Break

10:30 - 11:00  Design of efficient ring covers for existing communication 
               networks
               I. Hal Sudborough, Univ. of Texas at Dallas

11:00 - 11:30  Fault-tolerant routing in domain-based mobile IP
               Chu-sing Yang, National Sun Yat-Sen Univ, Taiwan

11:30 - 12:00  Reliable communications in generalized fat trees
               Sajal Das, Univ of North Texas

12:00 - 1:40   Lunch

1:40 - 2:10    On the fault tolerance of array-based parallel computers
               Ramesh K. Sitaraman, UMass Amherst

2:10 - 2:40    Constructing short containers in networks from Abelian groups
               Shuhong Gao, Clemson Univ, South Carolina

2:40 - 3:10    Some new parameters related to the fault-tolerance of
               interconnection networks
               Daniela Ferrero, Univ Politecnica de Catalunya, 
               Barcelona, Spain

3:10 - 3:40    Break

3:40 - 4:10    A factor 2 aproximation algorithm for generalized steiner
               network problem
               Kamal Jain, Georgia Tech, Atlanta, Georgia

4:10 - 4:40    A uniform framework for approximating weighted connectivity
               problems
               Samir Khuller, Univ of Maryland, College Park, MD

4:40 - 5:10    Constructing optical networks using combinatorial designs
	       Si-Qing Zheng, University of Texas at Dallas


Friday, November 20, 1998

9:00 - 9:30    Tree-based broadcasting in tree-networks
               Johanne Cohen and Pierre Fraigniaud*, LRI,Uni. 
               Paris-Sud, France

9:30 - 10:00   Nonblocking and almost nonblocking multicast switching networks
               Yuanyuan Yang, Univ of Vermont, Burlington, Vermont

10:00 - 10:30  Optimal placement of repair servers for reliable multicast
               Lixin Gao, Smith College, Northampton, MA

10:30 - 11:00  Break

11:00 - 12:00  Designing optimal survivable networks
               Tom Magnanti, MIT, Cambridge, MA

12:00 - 1:40   Lunch

1:40 - 2:10    Rounding algorithms for a geometric embedding of minimum 
	       multiway cut
               Mikkel Thorup, AT&T Research,Florham Park, NJ 

2:10 - 2:40    Different restoration models for survivable networks design
               Roland Wessaely, ZIB, Berlin, Germany

2:40 - 3:10    Survivability and the OSPF routing protocol
               Andreas Bley, ZIB, Berlin, Germany

3:10 - 3:40    Break

3:40 - 4:10    Robust interprocessor communication schemes
               for very high-performance computing
               Sotirios G. Ziavras, New Jersey Inst of Tech

4:10 - 4:40    Design patterns for concurrent computing on communication 
               networks
               Jung-Sing Jwo*, Tunghai University, Taiwan
               Tai-Ching Tuan, SAIC, McLean, Virginia

4:40 - 5:10    Synthesis of optimal multidimensional circulant networks: 
               heuristic and genetic approaches
               Emilia A. Monakhova, Russian Academy of Science, Russia

Previous: Participation

Next: Registration

Workshop Index

DIMACS Homepage