Sciweavers

118 search results - page 2 / 24
» Detection of Multiple Bottleneck Bandwidth
Sort
View
SIGCOMM
2004
ACM
13 years 10 months ago
Locating internet bottlenecks: algorithms, measurements, and implications
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...
Ningning Hu, Erran L. Li, Zhuoqing Morley Mao, Pet...
INFOCOM
1999
IEEE
13 years 9 months ago
Bandwidth Allocation Policies for Unicast and Multicast Flows
Abstract--Using multicast delivery to multiple receivers reduces the aggregate bandwidth required from the network compared to using unicast delivery to each receiver. However mult...
Arnaud Legout, Jörg Nonnenmacher, Ernst Biers...
FPL
2003
Springer
164views Hardware» more  FPL 2003»
13 years 10 months ago
Fast, Large-Scale String Match for a 10Gbps FPGA-Based Network Intrusion Detection System
Intrusion Detection Systems such as Snort scan incoming packets for evidence of security threats. The most computation-intensive part of these systems is a text search against hund...
Ioannis Sourdis, Dionisios N. Pnevmatikatos
INFOCOM
2002
IEEE
13 years 9 months ago
Probabilistic Packet Scheduling: Achieving Proportional Share Bandwidth Allocation for TCP Flows
— This paper describes and evaluates a probabilistic packet scheduling (PPS) algorithm for providing different levels of service to TCP flows. With our approach, each router deï...
Ming Zhang, Randolph Y. Wang, Larry L. Peterson, A...
CCR
2006
112views more  CCR 2006»
13 years 4 months ago
The probe gap model can underestimate the available bandwidth of multihop paths
The Probe Gap Model (PGM) was proposed as a lightweight and fast available bandwidth estimation method. Measurement tools such as Delphi and Spruce are based on PGM. Compared to e...
Li Lao, Constantine Dovrolis, M. Y. Sanadidi