Sciweavers

1792 search results - page 10 / 359
» Improved scheduling in rings
Sort
View
INFOCOM
2003
IEEE
14 years 20 days ago
Minimizing Request Blocking in All-Optical Rings
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
NPC
2004
Springer
14 years 22 days ago
Lookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
Xuezheng Liu, Guangwen Yang, Jinfeng Hu, Ming Chen...
INFOCOM
2000
IEEE
13 years 11 months ago
Quantifying the Benefit of Configurability in Circuit-Switched WDM Ring Networks
—In a reconfigurable network, lightpath connections can be dynamically changed to reflect changes in traffic conditions. This paper characterizes the gain in traffic capacity tha...
Brett Schein, Eytan Modiano
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 8 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
COCOA
2010
Springer
13 years 5 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...