Concept

TAP réseau

Publications associées (12)

SPADnet: a fully digital, scalable and networked photonic component for time-of-flight PET applications

Edoardo Charbon, Claudio Bruschini, John Richard Walker, Gabor Nemeth

The SPADnet FP7 European project is aimed at a new generation of fully digital, scalable and networked photonic components to enable large area image sensors, with primary target gamma-ray and coincidence detection in (Time-of-Flight) Positron Emission Tom ...

Spie-Int Soc Optical Engineering2014

Application of Brillouin-Based Continuously Tunable Optical Delay Line to Contention Resolution Between Asynchronous Optical Packets

Luc Thévenaz, Sang Hoon Chin, Andrea Trita

A novel approach for resolution of contentions between asynchronous optical packets, exploiting a self-synchronizing mechanism by means of dynamic all-optical tunable delay line based on stimulated Brillouin scattering in fibers, is reported. Time delay be ...

Ieee-Inst Electrical Electronics Engineers Inc2013

CCNoC: Specializing On-Chip Interconnects for Energy Efficiency in Cache-Coherent Servers

Giovanni De Micheli, Babak Falsafi, Boris Robert Grot, Ciprian Seiculescu, Stavros Volos, Naser Khosro Pour

Manycore chips are emerging as the architecture of choice to provide power efficiency and improve performance, while riding Moore’s Law. In these architectures, on-chip interconnects play a pivotal role in ensuring power and performance scalability. As sup ...

2012

CCNoC: On-Chip Interconnects for Cache-Coherent Manycore Server Chips

Giovanni De Micheli, Babak Falsafi, Ciprian Seiculescu, Stavros Volos, Naser Khosro Pour

Manycore chips are emerging as the architecture of choice to provide power-scalability and improve performance while riding the Moore’s law. On-chip interconnects are increasingly playing a pivotal role in power- and performance- scalability of such microa ...

2011

Decentralized Polling with Respectable Participants

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Maxime Monod

We consider the polling problem in a social network where participants care about their reputation: they do not want their vote to be disclosed nor their misbehaving, if any, to be publicly exposed. Assuming this reputation concern, we show that a simple s ...

2009

Efficient and Robust Secure Aggregation for Sensor Networks

Karl Aberer, Jean-Pierre Hubaux, Panagiotis Papadimitratos, Marcin Poturalski, Parisa Haghani

Wireless Sensor Networks (WSNs) rely on in-network aggregation for efficiency, however, this comes at a price: A single adversary can severely influence the outcome by contributing an arbitrary partial aggregate value. Secure in-network aggregation can det ...

2007

Network Monitoring: it depends on your points of view

Christina Fragouli, Suhas Diggavi

End-to-end active network monitoring infers network characteristics by sending and collecting probe packets from the network edge, while probes traverse the network through multicast trees or a mesh of unicast paths. Most reported methods consider given so ...

2007

Modeling and performance analysis of IP access interface in optical transmission networks with packet switching

The article analyzes the influence of the Internet Protocol (IP) access interface on the packet loss probability and delay times in the optical packet switched network. The network and node model have been proposed, and the structure of the IP access inter ...

2006

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

Delay Bounds in a Network with Aggregate Scheduling

Jean-Yves Le Boudec

A large number of products implementing aggregate buffering and scheduling mechanisms have been developed and deployed, and still more are under development. With the rapid increase in the demand for reliable end-to-end QoS solutions, it becomes increasing ...

2000

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