Sciweavers

6245 search results - page 1147 / 1249
» A Case for Aggregate Networks
Sort
View
DAM
2006
132views more  DAM 2006»
15 years 4 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
IJPP
2008
74views more  IJPP 2008»
15 years 4 months ago
Bandwidth Efficient All-to-All Broadcast on Switched Clusters
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, an...
Ahmad Faraj, Pitch Patarasuk, Xin Yuan
CN
2007
77views more  CN 2007»
15 years 4 months ago
Secure many-to-one symbol transmission for implementation on smart cards
Multicast communication is arguably the most promising paradigm to enable mass Internet transmission of live events, or any other content sent on the network from a single source ...
Francesc Sebé, Alexandre Viejo, Josep Domin...
IJHPCA
2006
109views more  IJHPCA 2006»
15 years 4 months ago
A Resource Leasing Policy for on-Demand Computing
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...
Darin England, Jon B. Weissman
JACM
2008
90views more  JACM 2008»
15 years 4 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
« Prev « First page 1147 / 1249 Last » Next »