Sciweavers

265 search results - page 40 / 53
» Faster communication in known topology radio networks
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Limiting path exploration in BGP
— Slow convergence in the Internet can be directly attributed to the “path exploration” phenomenon, inherent in all path vector protocols. The root cause for path exploration...
Jaideep Chandrashekar, Zhenhai Duan, Zhi-Li Zhang,...
INFOCOM
2010
IEEE
13 years 6 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
EDBTW
2006
Springer
13 years 11 months ago
Enhanced Regular Path Queries on Semistructured Databases
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
Dan C. Stefanescu, Alex Thomo
DIALM
2005
ACM
100views Algorithms» more  DIALM 2005»
13 years 9 months ago
On the pitfalls of geographic face routing
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
CLUSTER
1999
IEEE
13 years 7 months ago
Simulative performance analysis of gossip failure detection for scalable distributed systems
Three protocols for gossip-based failure detection services in large-scale heterogeneous clusters are analyzed and compared. The basic gossip protocol provides a means by which fai...
Mark W. Burns, Alan D. George, Bradley A. Wallace