Sciweavers

35 search results - page 7 / 7
» gd 2008
Sort
View
CN
2008
109views more  CN 2008»
15 years 22 hour ago
CoCONet: A collision-free container-based core optical network
Electrical-to-optical domain conversions and vice versa (denoted by O/E/O conversions) for each hop in optical core transport networks impose considerable capital and financial ov...
Amin R. Mazloom, Preetam Ghosh, Kalyan Basu, Sajal...
IANDC
2008
92views more  IANDC 2008»
14 years 12 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
CN
2006
86views more  CN 2006»
14 years 12 months ago
Stochastic analysis of packet-pair probing for network bandwidth estimation
In this paper, we perform a stochastic analysis of the packet-pair technique, which is a widely used method for estimating the network bandwidth in an end-to-end manner. There has...
Kyung-Joon Park, Hyuk Lim, Chong-Ho Choi
DM
2007
97views more  DM 2007»
14 years 12 months ago
L(p, q) labeling of d-dimensional grids
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
Guillaume Fertin, André Raspaud
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
15 years 1 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin