16 search results - page 1 / 4 » Light graphs with small routing cost |
NETWORKS
2002
13 years 4 months ago
2002
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—We present a novel cost-effective multicast capable optical cross connect (MC-OXC) node architecture which improves efficiency of optical power by constraining splitting to only...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
– Efficient data retrieval in a peer-to-peer system like Freenet is a challenging problem. In this paper we study the impact of cache replacement policy on the performance of Fre...