Sciweavers

8135 search results - page 269 / 1627
» networks 2008
Sort
View
COMCOM
2004
83views more  COMCOM 2004»
15 years 6 months ago
Breaking network security based on synchronized chaos
Very recently, the use of chaos synchronization as a means of masking information data in a network has been proposed. Although it is claimed that the security breach is not possi...
Gonzalo Álvarez, Shujun Li
NETWORKING
2008
15 years 8 months ago
Cache Placement Optimization in Hierarchical Networks: Analysis and Performance Evaluation
Caching popular content in the Internet has been recognized as one of the effective solution to alleviate network congestion and accelerate user information access. Sharing and coo...
Wenzhong Li, Edward Chan, Yilin Wang, Daoxu Chen, ...
COMCOM
2006
119views more  COMCOM 2006»
15 years 6 months ago
From content distribution networks to content networks - issues and challenges
Due to the technical developments in electronics the amount of digital content is continuously increasing. In order to make digital content respectively multimedia content availab...
Thomas Plagemann, Vera Goebel, Andreas Mauthe, Lau...
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 6 months ago
Approximate Capacity of Gaussian Relay Networks
We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set uppe...
Amir Salman Avestimehr, Suhas N. Diggavi, David N....
NETWORKS
2008
15 years 6 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...