Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Sort
relevance
views
votes
recent
update
View
thumb
title
34
click to vote
SPAA
2005
ACM
127
views
Distributed And Parallel Com...
»
more
SPAA 2005
»
Oblivious routing on geometric networks
14 years 4 months ago
Download
www.cs.rpi.edu
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »