Sciweavers

806 search results - page 32 / 162
» Lower Bounds on Correction Networks
Sort
View
GLOBECOM
2009
IEEE
16 years 27 days ago
Impact of Information on Network Performance - An Information-Theoretic Perspective
Abstract—Available network information is an important factor in determining network performance. In this paper, we study the basic limits on the amount of network information th...
Jun Hong, Victor O. K. Li
SIROCCO
2007
15 years 7 months ago
Labeling Schemes with Queries
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
Amos Korman, Shay Kutten
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
16 years 8 days ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
GLOBECOM
2008
IEEE
16 years 19 days ago
Routing with Probabilistic Delay Guarantees in Wireless Ad-Hoc Networks
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
Matthew Brand, Petar Maymounkov, Andreas F. Molisc...
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
15 years 6 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni