Publication

Comment on ¨A Deterministic Approach to the End-to-end Analysis of Packet Flows in Connection Oriented Networks¨

Related publications (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Method of detecting anomalous behaviour in a computer network

Boi Faltings, Pedro Bados

Method of detecting anomalous behaviour in a computer network comprising the steps of - monitoring network traffic flowing in a computer network system, - authenticating users to which network packets of the network traffic are associated, - extracting par ...

2005

Processing along the way: forwarding vs. coding

Christina Fragouli

We consider a source that transmits to a receiver by routing the information packets over a communication network and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that the processing capabilities of t ...

2004

Measurement and Analysis of Single-Hop Delay on an IP Backbone Network

Patrick Thiran

We measure and analyze the single-hop packet delay through operational routers in the Sprint Internet protocol (IP) backbone network. After presenting our delay measurements through a single router for OC-3 and OC-12 link speeds, we propose a methodology t ...

2003

A novel forwarding paradigm for position-based routing (with implicit addressing)

Jörg Widmer

Existing position-based unicast routing algorithms which forward packets in the geographic direction of the destination require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is ...

2003

End-to-end Congestion Control for Flows with Variable Packet Size

Jean-Yves Le Boudec, Jörg Widmer, Catherine Boutremans

Current TCP-friendly congestion control mechanisms such as those used in TFRC adjust the packet rate in order to adapt to network conditions and obtain a throughput not exceeding that of a TCP connection operating under the same conditions. In an environme ...

2002

Comment on ¨ A Deterministic Approach to the End-to-End Analysis of Packet Flows in Connection Oriented Networks¨

Jean-Yves Le Boudec

For original paper see Chlamtac et al. (IEEE/ACM Trans. Networking, vol.6, no.4, p.422-31, 1998 August). We prove that the buffer bound in the above paper, can be improved by using a modification of the proofs in the original paper together with so-called ...

2000

Comment on 'A Deterministic Approach to the End-to-end Analysis of Packet Flows in Connection Oriented Networks'

Jean-Yves Le Boudec

We prove that the buffer bound in [CFZF98] can be improved, by using an extension of the so-called network calculus bounds. We also show that the delay bound in [CFZF98] is simply the sum of worst case queuing delays at all nodes along the path of a connec ...

1999

Scalable Resource Reservation for the Internet

For some time now, the design of architectures for providing dependable Quality of Service (QoS) on multimedia networks has been a busy topic in academia and industry. In this work we look at practical aspects of Quality of Service, and in particular at re ...

1999

Scalable resource reservation for the Internet

EPFL1999

Circuit Emulation over IP Networks

Jean-Pierre Hubaux

The best-effort service offered by the Internet is not suitable for a large variety of multimedia applications, which require strict guarantees on losses and end-to-end delay. We design functionalities and mechanisms for RTP in order to provide a transport ...

1999