Sciweavers

8770 search results - page 393 / 1754
» Named Service Networking
Sort
View
TIT
2011
131views more  TIT 2011»
15 years 1 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
WETICE
2009
IEEE
16 years 1 months ago
Cloud Computing and the Lessons from the Past
— The skyrocketing demand for a new generation of cloud-based consumer and business applications is driving the need for next generation of datacenters that must be massively sca...
Rao Mikkilineni, Vijay Sarathy
DAGSTUHL
2001
15 years 8 months ago
Programmable Networks
In this paper we present a programmable networking model that provides a common framework for understanding the state-of-the-art in programmable networks. A number of projects are...
Andrew T. Campbell, Michael E. Kounavis, John B. V...
ESORICS
2006
Springer
15 years 10 months ago
Finding Peer-to-Peer File-Sharing Using Coarse Network Behaviors
A user who wants to use a service forbidden by their site's usage policy can masquerade their packets in order to evade detection. One masquerade technique sends prohibited tr...
Michael P. Collins, Michael K. Reiter
CDC
2008
IEEE
112views Control Systems» more  CDC 2008»
15 years 8 months ago
Information fusion strategies from distributed filters in packet-drop networks
Abstract-- In this paper we study different distributed estimation schemes for stochastic discrete time linear systems where the communication between the sensors and the estimatio...
Alessandro Chiuso, Luca Schenato