TERANET International Workshop

Toward Evolutive Routing Algorithms for scale-free/internet-like NETworks


The Internet is a large, dynamic, heterogeneous collection of interconnected systems that can be used for communication of many different types between any interested parties connected to it. Nowadays, the Internet size and scope render the deployment of new network technologies (in particular, routing) very difficult while experiencing increasing demand in terms of connectivity and capacity. Indeed, there is a growing consensus among the scientific and technical community that the current methodology of “patching” the Internet forwarding and routing protocols will not be able to sustain its continuing growth and cope with it at an acceptable cost and speed. Moreover, a fundamental dimension to take into account is the dynamics of the routing information exchanges between routers, in particular, the routing topology updates that dynamically react to topological structure changes. The Internet routing system architecture is thus facing performance challenges in terms of scalability as well as dynamic properties (convergence, and stability/robustness) that result into major cost concerns for network designers but also protocol designers. Recent works make use of the structural and statistical properties of the Internet topology as well as the stability and convergence properties of the Internet policy in order to specialize the design of a distributed routing scheme known to perform efficiently under dynamic network and policy conditions when these properties are met.

The TERA-NET workshop focuses on current research and related challenges on new routing paradigms for distributed and dynamic routing schemes applicable to the Internet and its evolution. The goal of this workshop is i) to stimulate research in the interdisciplinary area that lies at the intersection of Graph Theory, Distributed Routing Algorithmic and Network Dynamics Modeling, and ii) to provide a forum for active discussions among speakers and participants.