Sciweavers

719 search results - page 32 / 144
» Sizing router buffers
Sort
View
INFOCOM
2012
IEEE
13 years 2 months ago
An effective hop-by-hop Interest shaping mechanism for CCN communications
Abstract—We introduce a rate-based congestion control mechanism for Content-Centric Networking (CCN). It builds on the fact that one Interest retrieves at most one Data packet. C...
Natalya Rozhnova, Serge Fdida
HOTI
2005
IEEE
15 years 6 months ago
Addressing Queuing Bottlenecks at High Speeds
Modern routers and switch fabrics can have hundreds of input and output ports running at up to 10 Gb/s; 40 Gb/s systems are starting to appear. At these rates, the performance of ...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley
TPDS
2002
105views more  TPDS 2002»
15 years 3 days ago
HiPER: A Compact Narrow Channel Router with Hop-by-Hop Error Correction
Multiprocessor architectures demand efficient interprocessor communication to maximize system utilization and performance. To meet future demands, these interconnects must communic...
Phil May, Santithorn Bunchua, D. Scott Wills
DAC
2003
ACM
16 years 1 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li
CORR
2000
Springer
100views Education» more  CORR 2000»
15 years 9 days ago
Algorithms for Analysing Firewall and Router Access Lists
Network firewalls and routers use a rule database to decide which packets will be allowed from one network onto another. By filtering packets the firewalls and routers can improve...
Scott Hazelhurst