1st Workshop: Routing in Morelia
Instituto de Matematicas, Unidad Morelia
August 19-23, 2002
-
Group Pictures
1
and
2
-
RESEARCH SUMMARY AND SCOPE
Routing performs a collection of inter-dependent and mutually-interacting
procedures that exchange information in order to choose a communication
path between a pair of nodes. Its main requirements involve reliable message
delivery and selection of optimal routes. Complexity of routing algorithms is due
to node-coordination, and link- and node-failures that require redirection of
traffic and/or updating of the forwarding databases maintained at the network
nodes. Performance is affected by the underlying physical network topology
which defines the interconnection architecture of the nodes, thus leading to
tradeoffs among various performance parameters, like shortest path,
node congestion, link latency, throughput, size of forwarding data bases, etc.
Goal of the workshop is to do research on problems of network routing. Topics
of interest are, but are not limited, to
-
Routing in Communication, Interconnection, and Geometric Networks
-
Uni-, Multi-, Geo-, Broadcast, and Point2Point algorithms
-
Algorithmic performance efficiency tradeoffs
-
Modern perspectives and paradigms (ad-hoc, wireless networks)
-
WORKSHOP ORGANIZATION
There are no formal talks except the first morning. Participants will propose
open problems and provide perspectives. Several mexican students will
attend (so they can start familiarizing with this style of work). Total number
of attendees will be about 15-20 including students.
-
LOCAL INFORMATION
-
ORGANIZERS
