Publications associées à Orienté connexion

Challenges in Automatic Optimization of Arithmetic Circuits

Paolo Ienne, Philip Brisk, Ajay Kumar Verma

Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open and largely unsolved problem, especially for arithmetic circuits. In many cases, the outcome of even the most adv ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2009

A Simple Converse of Burnashev's Reliability Function

Bixio Rimoldi, Emre Telatar, Peter Allan Berlin

In a remarkable paper published in 1976, Burna- shev determined the reliability function of variable-length block codes over discrete memoryless channels (DMCs) with feedback. Subsequently, an alternative achievability proof was obtained by Yamamoto and It ...

2009

Local restoration for trees and arborescences

Laura Sanità

Protocols belonging to the Spanning Tree Protocol (STP) route traffic demands on tree topologies that are evaluated through shortest path procedures. In this paper we deal with the problem of assigning costs to the arcs of a network in order to guarantee t ...

Springer Berlin / Heidelberg2009

EZ-Flow: Removing Turbulence in IEEE 802.11 Wireless Mesh Networks without Message Passing

Patrick Thiran, Alaeddine El Fawal, Adel Aziz, David Starobinski

Recent analytical and experimental work demonstrate that IEEE 802.11-based wireless mesh networks are prone to turbulence. Manifestations of such turbulence take the form of large buffer build-up at relay nodes, end-to-end delay fluctuations, and traffic c ...

2009

Loss-resilient window-based congestion control

Pascal Frossard, Christophe De Vleeschouwer

This paper addresses the problem of fair allocation of bandwidth resources on lossy channels in hybrid heterogeneous networks. It discusses more particularly the ability of window-based congestion control to support non-congestion related losses. We invest ...

2008

A Generic Mean Field Convergence Result for Systems of Interacting Objects

Jean-Yves Le Boudec, Jochen Mundinger

We consider a model for interacting objects, where the evolution of each object is given by a finite state Markov chain, whose transition matrix depends on the present and the past of the distribution of states of all objects. This is a general model of wi ...

2007

A Method for Routing Packets Across Multiple Paths in NoCs with In-Order Delivery and Fault-Tolerance Guarantees

Giovanni De Micheli, David Atienza Alonso, Luca Benini, Srinivasan Murali

Networks on Chips (NoCs) are required to tackle the increasing delay and poor scalability issues of bus-based communication architectures. Many of today’s NoC designs are based on single path routing. By utilizing multiple paths for routing, congestion in ...

Hindawi Publications2007

A Predictable Communication Scheme for Embedded Multiprocessor Systems

Paolo Ienne, Mehmet Harmanci, Yusuf Leblebici

Networks-on-Chip are emerging as a widely accepted alternative for the traditional bus architectures. However, their applicability by the system designers is far away from being intuitive due to their lack of predictability. This communication predictabili ...

2006

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.

Orienté connexion

Challenges in Automatic Optimization of Arithmetic Circuits

A Simple Converse of Burnashev's Reliability Function

Local restoration for trees and arborescences

EZ-Flow: Removing Turbulence in IEEE 802.11 Wireless Mesh Networks without Message Passing

Consensus and collision detectors in radio networks

Efficient Object Placement Including Node Selection in a Distributed Virtual Machine

Loss-resilient window-based congestion control

A Generic Mean Field Convergence Result for Systems of Interacting Objects

A Method for Routing Packets Across Multiple Paths in NoCs with In-Order Delivery and Fault-Tolerance Guarantees

A Predictable Communication Scheme for Embedded Multiprocessor Systems

Graph Chatbot

Chattez avec Graph Search

Challenges in Automatic Optimization of Arithmetic Circuits

EZ-Flow: Removing Turbulence in IEEE 802.11 Wireless Mesh Networks without Message Passing

A Simple Converse of Burnashev's Reliability Function

Loss-resilient window-based congestion control

A Predictable Communication Scheme for Embedded Multiprocessor Systems

Efficient Object Placement Including Node Selection in a Distributed Virtual Machine

Local restoration for trees and arborescences

A Generic Mean Field Convergence Result for Systems of Interacting Objects

A Method for Routing Packets Across Multiple Paths in NoCs with In-Order Delivery and Fault-Tolerance Guarantees

Consensus and collision detectors in radio networks