Resource Trading Agents for Adaptive Active Network Applications

in MOBILE AGENTS FOR TELECOMMUNICATION APPLICATIONS (2002)

Building Bidirectional Multicast Trees Using Autonomous Reflectors

Poster (2001, October)

We show an active application to build bidirectional multicast trees, based on the dynamic deployment of agents on top of an active network infrastructure, and interconnected by unicast. Such trees are ... [more ▼]

We show an active application to build bidirectional multicast trees, based on the dynamic deployment of agents on top of an active network infrastructure, and interconnected by unicast. Such trees are used to build a repair service that seeks to maintain application-level connectivity in the presence of network-level multicast failures. Reflector trees are built on demand in a decentralized way, using three elementary agent operations: clone, migrate, and merge. They terminate automatically when no longer needed. In this paper we show how agents make decisions on which set of operations to use in order to produce a low cost tree configuration, taking node and link resources into account. [less ▲]

An Active Layered Multicast Adaptation Protocol

in Lecture Notes in Computer Science (2000, October 16), 1942

We describe an active application in the field of multicast congestion control for real-time traffic. Our Active Layered Multicast Adaptation Protocol is a layered multicast congestion control scheme ... [more ▼]

We describe an active application in the field of multicast congestion control for real-time traffic. Our Active Layered Multicast Adaptation Protocol is a layered multicast congestion control scheme built on top of an Active Network infrastructure. It benefits from router support in order to obtain information about resources available and to perform the adaptation tasks at the places where shortage of resources occur. It supports heterogeneous receivers through the combination of layered multicast transmission with selective filtering and pruning of layers within the active nodes. Market-based resource management ideas are applied to achieve a resource utilisation level that represents an equilibrium between the user goals and the node operator goals. Our simulation results show that the protocol is feasible and provides adequate reactions to short term and persistent congestion, while keeping the amount of state and processing in the active nodes limited. [less ▲]

An agent-inspired active network resource trading model applied to congestion control

in Lecture Notes in Computer Science (2000, September), 1931

In order to accommodate fluctuations in network conditions, adaptive applications need to obtain information about resource availability, Using active networks, new models for adaptive applications can be ... [more ▼]

In order to accommodate fluctuations in network conditions, adaptive applications need to obtain information about resource availability, Using active networks, new models for adaptive applications can be envisaged, which can benefit from the possibility to send mobile code to the network nodes. We describe a model for trading resources inside an active net-work node, based on the interaction between capsules as reactive user agents, and resource manager agents which reside in the network nodes. We apply the model to the case of a many-to-one audio application with congestion control, which trades off link resources against memory when there is congestion at the outgoing interface towards the destination. Our simulation results indicate that the application makes effective use of the available resources, and it also allows resources to be shared according to user preferences. [less ▲]

Cycle-based TCP-Friendly Algorithm

in Proceedings of IEEE Globecom'99 (1999, December)

Several TCP-Friendly algorithms have been recently proposed to support multimedia applications. These algorithms try to mimic the congestion control behavior of TCP. However, the oscillatory (bursty ... [more ▼]

Several TCP-Friendly algorithms have been recently proposed to support multimedia applications. These algorithms try to mimic the congestion control behavior of TCP. However, the oscillatory (bursty) nature of TCP traffic is widely known to be unsuitable for most typical real-time applications. Adopting such behavior would result in annoying QoS oscillations for the users of such real-time applications. In the present paper we describe a new TCP-Friendly algorithm based on the TCP cycle estimation. We show through simulations that the proposed algorithm is able to smooth the oscillations while keeping fairness towards TCP. [less ▲]