Publication

Virtual Trunk Simulation

Publications associées (32)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Optimal smoothing for guaranteed service

Jean-Yves Le Boudec, Olivier Verscheure

We consider the transmission of variable bit rate (VBR) video over a network offering a guaranteed service such as ATM VBR or the guaranteed service of the IETF. The guaranteed service requires that the flow accepted by the network has to be conforming wit ...

2000

Regulation of a Connection Admission Control Algorithm

Jean-Yves Le Boudec, Patrick Thiran

Connection Admission Control (CAC) algorithms are used to decide whether an incoming connection should be accepted or rejected in a node of a network offering reservation based services in order to maintain the guaranteed Quality of Service (QoS) in the ne ...

1999

How (Un)Fair are the ABR Binary Schemes, Actually?

Jean-Yves Le Boudec, Milan Vojnovic

It is well known that a simple binary feedback rate--based congestion avoidance scheme cannot ensure a fairness goal of the Available Bit Rate (ABR) service, namely, max-min fairness. In this paper we show how the rates are distributed for the network cons ...

1999

Designing new network adaptation and ATM adaptation layers for interactive multimedia applications

Multimedia services, audiovisual applications composed of a combination of discrete and continuous data streams, will be a major part of the traffic flowing in the next generation of high speed networks. The cornerstones for multimedia are Asynchronous Tra ...

EPFL1998

Efficient network transmission of virtual human bodies

Daniel Thalmann, Amaury Aubel, Joaquim Esmerado

Integrating virtual human animation in networked virtual environments (NVEs) has the potential to create severe network load issues. In NVEs, users are represented by their virtual embodiments. The articulated structure of these embodiments introduces a ne ...

1998

QoS based Integration of IP and ATM, Resource Renegotiation

Jean-Yves Le Boudec

The dynamic and efficient usage of the resources is one of the fundamental aspects studied in the DIANA project: at first the traffic specification should reflects the real traffic demand, but, at the same time, optimize the resources requested. In applica ...

1998

Virtual Trunk Simulation

One of the activities of the ACTS project EXPERT is to perform trials demonstrating the use of advanced Resource Management and Routing (RM&R) algorithms in ATM networks. The RM&R model chosen for these trials is based on the Virtual Trunk (VT) concept. In ...

1997

SMART: A Many-to-Many Multicast Protocol for ATM

Jean-Yves Le Boudec

We present a protocol for controlling a shared ATM multicast tree supporting many-to-many communication. The protocol supports one or several ATM VCCs of the many-to-many type. The number of VCCs is independent of the number of endpoints. The protocol guar ...

1997

Scalability Enhancements for Connection-Oriented Networks

Jean-Yves Le Boudec

We consider the issue of increasing the number of connections that connection or iented networks, such as ATM, can handle. We describe one step that aims at reducing connection awareness inside the netwo rk. To that end, connections between the same pair o ...

1996

A Path Selection Method in ATM using Pre-Computation

Jean-Yves Le Boudec, Olivier Crochat

An algorithm that pre-computes a list of routes for each node in the network. An alternate route is also computed in case of overload of the primary one. Simulations show that this algorithm provides routes as good as On-Demand ones. ...

1996