Publication

A Multi-Path Routing Strategy with Guaranteed In-order Packet Delivery and Fault Tolerance for Networks on Chips

Related publications (45)

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.

A multiple core mode for protocol independent multicast

Francesc Font Torre de Mer

Internet communications have traditionally been based on point-to-point connections. This technique is called unicast and allows one sender and one receiver to communicate. The Internet saw the appearance of multicast protocols in the early 90's. Multicast ...

EPFL2004

Explicit window-based transport control protocols in lossy environments

Pascal Frossard, Christophe De Vleeschouwer

This paper addresses efficient packet loss recovery by retransmission in window-based congestion control protocols. It builds on explicit congestion control mechanisms to decouple the packet loss detection from the congestion feedback signals. Implicit alg ...

2004

End-to-end congestion control for tcp-friendly flows with variable packet size

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

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 ...

2004

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

Some Properties Of Variable Length Packet Shapers

Jean-Yves Le Boudec

The min-plus theory of greedy shapers has been developed after Cruz`s results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket controller. The theory of greedy shapers establishes a number of properties such as th ...

2002

Ruminations on Domain-Based Reliable Broadcast

Fernando Pedone

A distributed system is no longer confined to a single administrative domain. Peer-to-peer applications and business-to-business e-commerce systems, for example, typically span multiple local-area and wide-area networks, raising issues of trust, security, ...

2002

Self 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 ...

2001

Some properties of variable length packet shapers

Jean-Yves Le Boudec

The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket controller. The theory of greedy shapers establishes a number of properties; for examp ...

2000

Method and System for Processing Data Packets

The present invention provides an improved method and a system for processing data packets in a router. The router includes a plurality of input/output ports and more than one packet processing units. The packet processing units derive from a piece of info ...

2000