DIMACS Workshop on Architecture and Algorithmic Aspects of Communication Networks
Sunday, January 26 - Tuesday, January 28, 1997
DIMACS Center, CoRE Building, Rutgers University
- Organizers:
- Israel Cidon, Technion, cidon@tera.technion.ac.il
- Serge Plotkin, Stanford, plotkin@cs.stanford.edu
- Eva Tardos, Cornell, eva@cs.cornell.edu
Presented under the auspices of the Special Year on Networks.
Announcement
The size of the future networks, combined with the need for bandwidth
reservation and QoS guarantees poses numerous challenging problems. These
problems are exacerbated by the convergence of the data, telephone and video
services that have to be supported in the same framework. In parallel, the
recent advances in theoretical computer science and discrete mathematics bring
us closer to being able to address many of these issues. Unfortunately, these
advances did not have a significant impact on practical networks, mostly
because of a lack of continuous dialog between the research communities. We
believe that a significant portion of the research done in the theory of
computer science community can be brought to bear on the development of future
networks. Examples of areas that can potentially have a substantial impact
include online algorithms, combinatorial optimization, and approximation
algorithms. At the same time a better understanding of networking problems
may direct the theoretical computer science community to address new
problems, that will have direct impact on the development of networks.
The aim of the workshop is to bring together and allow the exchange
of research ideas and interests between experts in the different communities.
Both theoretical and applied issues are of interest. The identification of
open problems areas and the mapping of theoretical results for problems in
practical networking is of particular interest. Primary areas of focus
include, but are not limited to:
- Switching: Packet scheduling and QoS guarantees,
switching architecture.
- Routing: Link state algorithms,
Dynamic online routing of Virtual Circuits,
Generation and maintenance of routing tables,
Rerouting due to bandwidth fragmentation.
Service restoration after link failure.
- Network topology design.
- Multicast: Membership management,
multicast routing,
QoS in multicast,
Policing.
- Admission Control
- Fairness.
Confirmed Speakers Include:
- Baruch Awerbuch, John Hopkins University
- Christian Diot, INRIA
- Ori Gerstel, IBM
- Dave Goodman, Rutgers
- Albert Greenberg, AT&T
- Mike Hluchyj, Summa Four, Inc.
- Aurel Lazar, Columbia
- Tom Leighton, MIT
- Marc Karol, Lucent
- S. Keshav, Cornell University
- Milena Mihail, Bellcore
- Debasis Mitra, Lucent
- Larry Roberts, Connectware Inc. an ATM Company
- Raphi Rom, Sun Microsystems
- Henning Schulzerinn, Columbia University
- Moshe Sidi, Technion
- Eli Upfal, IBM
Workshop Registration:
Due to limited space you must be registered to attend the workshop.
Please make sure to register early by filling out the registration form
and sending it to pravato@dimacs.rutgers.edu.
For more information:
Further information about the workshop can be obatined from
the organizers. General workshop information including
local arrangements, travel, lodging and registration can be found at
http://dimacs.rutgers.edu/archive/Workshops or by contacting Pat Pravato at
(732) 445-5929 or pravato@dimacs.rutgers.edu.
This Workshop is part of DIMACS Special Year on Networks. Information about
the Special Year on Networks can be found at http://dimacs.rutgers.edu/SpecialYears/1996_1997 or
by contacting the center.
Next: Call for Participation
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on November 2, 1998.