produites dans le
cadre du projet SR2I:
Publications durant l'année 2007
revenir en haut
Publications durant l'année 2006
- "A Distributed Method for Dynamic Resolution of BGP Ocsillations". Ehoud, A. König, J-M. Saad, C. IPDPS'06.
- "An Economic and Algorithmic Model for QoS
Interdomain Network". D. Barth, L. Echabbi, C. Hamlaoui, S, Vial.
revenir en haut
Publications durant l'année 2005
- "Internet Topology Generation for Large Scale BGP
Simulation". J-M. Fourneau, H. Yahiaoui. IPS-MoMe 2005.
- "Génération de Topologies
pour la simulation du Routage Inter-domaine". J-M Fourneau, H.
Yahiaoui. AlgoTel 2005.
- "Stabilizing Inter-domain Routing in the Internet".
Chen, A.K. Datta et S. Tixeuil. Journal of High Speed Networks 2005.
"This paper reports the first self-stabilizing Border Gateway Protocol
(BGP). BGP is the standard inter-domain routing protocol in the
Internet. Self-stabilization is a technique to tolerate arbitrary
transient faults. The routing instability in the Internet can occur due
to errors in configuring the routing data structures, the routing
policies, transient physical and data link problems, software bugs, and
memory corruption. This instability can increase the network latency,
slow down the convergence of the routing data structures, and can also
cause the partitioning of networks. Most of the previous studies
concentrated on routing policies to achieve the convergence of BGP
while the oscillations due to transient faults were ignored. The
purpose of self-stabilizing BGP is to solve the routing instability
problem when this instability results from transient failures. The
self-stabilizing BGP presented here provides a way to detect and
automatically recover from this type of faults. Our protocol is
combined with an existing protocol to make it resilient to policy
- "A Self-stabilizing Link Coloring Algorithm Resilient
Byzantine Faults in Arbitrary Networks". T. Masuzawa and S. Tixeuil.
"Self-stabilizing protocols can tolerate any type and any number of
transient faults. However, in general, self-stabilizing protocols
provide no guarantee about their behavior against permanent faults.
This paper proposes a self-stabilizing link-coloring protocol resilient
to (permanent) Byzantine faults in arbitrary networks. The protocol
assumes the central daemon, and uses 2*Delta-1
colors where Delta
maximum degree in the network. This protocol guarantees that any link (u,v) between
nonfaulty processes u
and v is
assigned a color within 2*Delta+2
rounds and its color
remains unchanged thereafter.Our protocol is Byzantine insensitive in
the sense that the subsystem of correct processes remains operating
properly in spite of unbounded Byzantine faults."
- "Self-stabilization with r-operators revisited". S.
B. Ducourthial et S. Tixeuil. Seventh Symposium on Self-stabilizing
"We present a generic distributed algorithm for solving silents tasks
such as shortest path calculus, depth-first-search tree construction,
best reliable transmitters, in directed networks where communication
may be only unidirectional. Our solution is written for the
asynchronous message passing communication model, and tolerates
multiple kinds of failures (transient and intermittent). First, our
algorithm is self-stabilizing, so that it recovers correct behavior
after finite time starting from an arbitrary global state caused by a
transient fault. Second, it tolerates fair message loss, finite message
duplication, and arbitrary message reordering, during both the
stabilizing phase and the stabilized phase. This second property is
most interesting since, in the context of unidirectional networks,
there exists no self-stabilizing reliable data-link protocol. A formal
proof establishes its correctness for the considered problem, and
subsumes previous proofs for solutions in the simpler reliable shared
memory communication model."
revenir en haut