Concept
Black hole (networking)
Related publications (8)
Using location observations to observe routing for choice models
Michel Bierlaire, Jingmin Chen, Jeffrey Newman
Map matching algorithms try to map a series of location observations to an underlying network, to generate a single hypothesized true location or route. For some applications, including route choice modeling, such map matching is not required, and may intr ...
2010Optimal Filtering of Source Address Prefixes: Models and Algorithms
How can we protect the network infrastructure from malicious traffic, such as scanning, malicious code propagation, and distributed denial-of-service (DDoS) attacks? One mechanism for blocking malicious traffic is filtering: access control lists (ACLs) can ...
2009Achievable Flows on Orthogonal Information Networks
We examine routing over two classes of orthogonal information networks. The first is a relay network with orthogonal inputs. The nodes in this network do not broadcast, but communicate to the different nodes via independent inputs. There is multiple access ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008Distributed routing algorithms for sensor networks
Recent advances in wireless communications and computing technology are enabling the emergence of low-cost devices that incorporate sensing, processing, and communication functionalities. A large number of these devices are deployed in the field to create ...
EPFL2006A Min-Plus System Theory for Constrained Traffic Regulation and Dynamic Service Guarantees
Jean-Yves Le Boudec, Patrick Thiran
By extending the system theory under the (min,+)-algebra to the time varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic service guarantees. For a constrained traffic regulation problem with maximum to ...
1999Distributed Core Multicast (DCM): a routing protocol for many groups with few receivers
Jean-Yves Le Boudec, Ljubica Blazevic
We present a multicast routing protocol called Distributed Core Multicast (DCM). It is intended for use within a large single Internet domain network with a very large number of multicast groups with a small number of receivers. Such a case occurs, for exa ...
1999Distributed Core Multicast (DCM): a multicast routing protocol for many groups with few receivers
Jean-Yves Le Boudec, Ljubica Blazevic
We present a multicast routing protocol called Distributed Core Multicast (DCM). It is intended for use within a large single Internet domain network with a very large number of multicast groups with a small number of receivers. Such a case occurs, for exa ...
1999