Sciweavers

4962 search results - page 833 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
15 years 6 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
Jochen Könemann, Stefano Leonardi, Guido Sch&...
SPW
2000
Springer
15 years 10 months ago
The Resurrecting Duckling - What Next?
In the context of the security of wireless ad hoc networks, we previously explored the problem of secure transient association between a master and a slave device in the absence of...
Frank Stajano
FOCS
1995
IEEE
15 years 10 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
CORR
2010
Springer
175views Education» more  CORR 2010»
15 years 6 months ago
Detecting Security threats in the Router using Computational Intelligence
Information security is an issue of global concern. As the Internet is delivering great convenience and benefits to the modern society, the rapidly increasing connectivity and acc...
J. Visumathi, K. L. Shunmuganathan
OSN
2008
97views more  OSN 2008»
15 years 6 months ago
Managing Layer 1 VPN services
Control Plane architectures enhance transport networks with distributed signaling and routing mechanisms which allow dynamic connection control. As a result, layer 1 switching net...
Neumar Malheiros, Edmundo Roberto Mauro Madeira, F...