Sciweavers

198 search results - page 10 / 40
» A practical algorithm for constructing oblivious routing sch...
Sort
View
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
15 years 3 months ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang
ICMCS
2010
IEEE
236views Multimedia» more  ICMCS 2010»
15 years 21 days ago
Practical algorithm for minimum delay peer-to-peer media streaming
Though the existence of a minimum delay peer-to-peer media streaming scheme has been shown (under the name of snowball streaming), no actual algorithm has ever been designed so fa...
Jun Luo
CORR
2010
Springer
142views Education» more  CORR 2010»
14 years 8 months ago
Constructions of Optical Queues With a Limited Number of Recirculations--Part I: Greedy Constructions
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
Jay Cheng, Cheng-Shang Chang, Sheng-Hua Yang, Tsz-...
94
Voted
AINA
2006
IEEE
15 years 5 months ago
SENS: A Scalable and Expressive Naming System using CAN Routing Algorithm
Abstract— We design a scalable and expressive naming system called SENS, which can retrieve information of computing and content resources distributed widely on the Internet by e...
Hoaison Nguyen, Toshio Oka, Hiroyuki Morikawa, Tom...
PDCAT
2005
Springer
15 years 5 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu