Comment on 'A Deterministic Approach to the End-to-end Analysis of Packet Flows in Connection Oriented Networks'
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.
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
Current TCP-friendly congestion control mechanisms 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 environment where the bottleneck res ...
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 ...
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 ...
