Sciweavers

1616 search results - page 245 / 324
» networks 2002
Sort
View
WWW
2002
ACM
14 years 10 months ago
Flash crowds and denial of service attacks: characterization and implications for CDNs and web sites
The paper studies two types of events that often overload Web sites to a point when their services are degraded or disrupted entirely - flash events (FEs) and denial of service at...
Jaeyeon Jung, Balachander Krishnamurthy, Michael R...
VLSID
2002
IEEE
128views VLSI» more  VLSID 2002»
14 years 10 months ago
System-Level Point-to-Point Communication Synthesis using Floorplanning Information
: In this paper, we present a point-to-point (P2P) communication synthesis methodology for SystemOn-Chip (SOC) design. We consider real-time systems where IP selection, mapping and...
Jingcao Hu, Yangdong Deng, Radu Marculescu
INFOCOM
2002
IEEE
14 years 3 months ago
A Quantitative Assured Forwarding Service
— The Assured Forwarding (AF) service of the IETF DiffServ architecture provides a qualitative service differentiation between classes of traffic, in the sense that a low-priori...
Nicolas Christin, Jörg Liebeherr, Tarek F. Ab...
JAL
2002
71views more  JAL 2002»
13 years 9 months ago
A primal-dual schema based approximation algorithm for the element connectivity problem
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 10 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...