Publication
Self Organized Terminode Routing - Version 2
Related publications (44)
Load Balancing in Data Networks
Load balancing apparatus for a data communications network comprises hash logic for computing a hash function on incoming data packets. A threshold detector is connected to the hash logic for triggering, in response to utilization of the downstream objects ...
2002Malice, Selfishness, and Slander in Mobile Ad-hoc Networks.
Jean-Yves Le Boudec, Sonja Buchegger
In mobile ad-hoc networks nodes need to cooperate to communicate, but there are many reasons for non-cooperation. Saving power or preventing other nodes from obstructing a service are merely selfish reasons for non-cooperation, whereas nodes may also activ ...
2002Self Organized Terminode Routing
Jean-Yves Le Boudec, Ljubica Blazevic
We consider the problem of routing in a wide area mobile ad-hoc network called Terminode Network. Routing in this network is designed with the following objectives. First, it should scale well in terms of the number of nodes and geographical coverage ...
2002The Performance of Measurement-Based Overlay Networks
Sonja Buchegger, Paolo Scotton
The literature contains propositions for the use of overlay networks to supplement the normal IP routing functions with higher-level information in order to improve aspects of network behavior. We consider the use of such an overlay to optimize the end-to- ...
2002Nodes Bearing Grudges: Towards Routing Security, Fairness, and Robustness in Mobile Ad Hoc Networks
Jean-Yves Le Boudec, Sonja Buchegger
Devices in mobile ad hoc networks work as network nodes and relay packets originated by other nodes. Mobile ad hoc networks can work properly only if the participating nodes cooperate in routing and forwarding. For individual nodes it might be advantageous ...
2001Self Organized Terminode Routing Simulation
Jean-Yves Le Boudec, Ljubica Blazevic
In this paper we simulated terminode routing. This routing scheme is designed for wide area networks, where a large part or all the nodes are mobile. Terminode routing is a combination of two protocols called Terminode Local Routing (TLR) and Terminode Rem ...
2001Self Organized Terminode Routing
Jean-Yves Le Boudec, Ljubica Blazevic
We consider the problem of routing in a wide area mobile ad-hoc network called Terminode Network. Routing in such a network is designed with the following objectives. Firstly, it should scale well in terms of the number of nodes and geographical coverage, ...
2000Distributed Core Multicast (DCM): a routing protocol for many small groups with application to mobile IP telephony
Jean-Yves Le Boudec, Ljubica Blazevic
This paper specifies a multicast routing protocol called Distributed Core Multicast (DCM). It is intended for use within a large single Internet domain network with a very large number of small multicast groups. We present how DCM can be used to route pack ...
2000The Asymmetric Best-Effort Service
Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley, Ljubica Blazevic
We present Asymmetric Best-Effort, a novel service to provide a
1999throughput versus delay jitter differentiated service for IP packets. With this service, every best effort packet is marked as either green or blue. Green packets, typically sent by real-t ...The Asymmetric Best-Effort Service
Jean-Yves Le Boudec, Ljubica Blazevic
We present Asymmetric Best-Effort, a novel service to provide a ``throughput versus delay jitter'' differentiated service for IP packets. With this service, every best effort packet is marked as either green or blue. Green packets, typically sent by real-t ...
1999