Sciweavers

540 search results - page 82 / 108
» Competitive Routing over Time
Sort
View
DSN
2008
IEEE
14 years 4 months ago
Improving dependability of network configuration through policy classification
As a network evolves over time, multiple operators modify its configuration, without fully considering what has previously been done. Similar policies are defined more than once, ...
Sihyung Lee, Tina Wong, Hyong S. Kim
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 10 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
JNW
2008
173views more  JNW 2008»
13 years 10 months ago
Dominating Set Theory based Semantic Overlay Networks for Efficient and Resilient Content Distribution
Recently overlay networks have emerged as an efficient and flexible method for content distribution. An overlay network is a network running on top of another network, usually the ...
J. Amutharaj, S. Radhakrishnan
IMC
2009
ACM
14 years 4 months ago
Triangle inequality variations in the internet
Triangle inequality violations (TIVs) are important for latency sensitive distributed applications. On one hand, they can expose opportunities to improve network routing by findi...
Cristian Lumezanu, Randolph Baden, Neil Spring, Bo...
DATE
2002
IEEE
144views Hardware» more  DATE 2002»
14 years 3 months ago
Design Automation for Deepsubmicron: Present and Future
Advancing technology drives design technology and thus design automation EDA. How to model interconnect, how to handle degradation of signal integrity and increasing power densi...
Ralph H. J. M. Otten, Raul Camposano, Patrick Groe...