Sciweavers

13214 search results - page 380 / 2643
» Pseudorandomness for network algorithms
Sort
View
AINA
2009
IEEE
16 years 1 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
INFOCOM
2009
IEEE
16 years 1 months ago
Tuning Skype's Redundancy Control Algorithm for User Satisfaction
—Determining how to transport delay-sensitive voice data has long been a problem in multimedia networking. The difficulty arises because voice and best-effort data are different...
Te-Yuan Huang, Kuan-Ta Chen, Polly Huang
ICC
2007
IEEE
16 years 1 months ago
IPACT with Smallest Available Report First: A New DBA Algorithm for EPON
—Dynamic Bandwidth allocation in Ethernet Passive Optical Networks (EPONs) has been an area of intense research in recent years. Most of the proposed solutions offer clever metho...
Swapnil Bhatia, Radim Bartos
VTC
2007
IEEE
132views Communications» more  VTC 2007»
16 years 1 months ago
TCP Compatible Greediness Control Algorithm for Wireless Multimedia Streaming
— This paper proposes a TCP compatible greediness control mechanism that tunes the greediness of the multimedia streaming process based on client priority, in order to make more ...
Edward Casey, Gabriel-Miro Muntean
LADC
2005
Springer
16 years 10 days ago
Quantitative Evaluation of Distributed Algorithms Using the Neko Framework: The NekoStat Extension
In this paper we present NekoStat, an extension of the Neko tool. Neko is a Java framework and a communication platform that permits rapid prototyping of distributed applications; ...
Lorenzo Falai, Andrea Bondavalli, Felicita Di Gian...