59 search results - page 9 / 12 » A distributional study of the path edge-covering numbers for... |
SPAA
1999
ACM
13 years 11 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
TPDS
2008
13 years 7 months ago
2008
To construct an efficient overlay network, the information of underlay is important. We consider using end-to-end measurement tools such as traceroute to infer the underlay topolog...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
DASFAA
2007
IEEE
14 years 1 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...