Sciweavers

719 search results - page 72 / 144
» Sizing router buffers
Sort
View
CN
2004
110views more  CN 2004»
15 years 13 days ago
TCP and UDP performance for Internet over optical packet-switched networks
A strong candidate for the future Internet core is optical packet-switched (OPS) network. In this paper, we study the impact of mechanisms as employed in OPS networks on the perfo...
Jingyi He, S.-H. Gary Chan
PAM
2009
Springer
15 years 7 months ago
Revisiting Route Caching: The World Should Be Flat
Internet routers’ forwarding tables (FIBs), which must be stored in expensive fast memory for high-speed packet forwarding, are growing quickly in size due to increased multihomi...
Changhoon Kim, Matthew Caesar, Alexandre Gerber, J...
SIGCOMM
2005
ACM
15 years 6 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...
91
Voted
ICMCS
2006
IEEE
120views Multimedia» more  ICMCS 2006»
15 years 6 months ago
Modeling and Performance Analysis of Initial Connection in IEEE 802.16 PMP Networks
In this paper, we propose an accurate analytical model to analyze the performance of initial ranging requests in IEEE 802.16 networks. Two metrics, connection probability and aver...
Lidong Lin, Bo Han, Weijia Jia
76
Voted
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
16 years 10 days ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...