72 search results - page 12 / 15 » Quantifying path exploration in the internet |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
MOBICOM
2004
ACM
15 years 2 months ago
2004
ACM
Wireless IEEE 802.11 networks in residences, small businesses, and public “hot spots” typically encounter the wireline access link (DSL, cable modem, T1, etc.) as the slowest ...
ICDCS
2008
IEEE
15 years 3 months ago
2008
IEEE
Distributed Denial-of-Service (DDoS) attacks have emerged as a popular means of causing mass targeted service disruptions, often for extended periods of time. The relative ease an...
CN
2007
14 years 9 months ago
2007
A practical and robust inter-domain marking scheme for IP traceback is proposed. We first identify six drawbacks of Probabilistic Packet Marking (PPM), and then contrive a synerg...
73
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...