Sciweavers

618 search results - page 46 / 124
» Short cycle connectivity
Sort
View
IWIA
2003
IEEE
15 years 3 months ago
Designing a Framework for Active Worm Detection on Global Networks
Past active Internet worms have caused widespread damage. Knowing the connection characteristics of such a worm very early in its proliferation cycle might provide first responde...
Vincent Berk, George Bakos, Robert Morris
IPL
2008
68views more  IPL 2008»
14 years 9 months ago
The hub number of a graph
A hub set in a graph G is a set U V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) hc(G) c(G) h(G) + 1, ...
Tracy Grauman, Stephen G. Hartke, Adam Jobson, Bil...
ICC
2008
IEEE
15 years 4 months ago
On the Investigation of Path Preference in End-to-End Network Measurements
— Overlay applications have used various tools to measure path properties in order to construct efficient overlay networks. Typical examples include delay measurement, connectiv...
Xing Jin, Qiuyan Xia, Shueng-Han Gary Chan
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
15 years 4 months ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu
CRYPTO
2006
Springer
111views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
Moni Naor, Gil Segev, Adam Smith