Sciweavers

18 search results - page 3 / 4
» Hardness of routing with congestion in directed graphs
Sort
View
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
13 years 9 months ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling
TKDE
2008
134views more  TKDE 2008»
13 years 5 months ago
Contraflow Transportation Network Reconfiguration for Evacuation Route Planning
Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) ...
Sangho Kim, Shashi Shekhar, Manki Min
ANCS
2010
ACM
13 years 3 months ago
Axon: a flexible substrate for source-routed ethernet
This paper introduces the Axon, an Ethernet-compatible device for creating large-scale datacenter networks. Axons are inexpensive, practical devices that are demonstrated using pr...
Jeffrey Shafer, Brent Stephens, Michael Foss, Scot...
IMC
2003
ACM
13 years 10 months ago
On inferring and characterizing internet routing policies
Border Gateway Protocol allows Autonomous Systems (ASs) to apply diverse routing policies for selecting routes and for propagating reachability information to other ASs. Although ...
Feng Wang, Lixin Gao
SIGMETRICS
2005
ACM
100views Hardware» more  SIGMETRICS 2005»
13 years 11 months ago
On AS-level path inference
The ability to discover the AS-level path between two end-points is valuable for network diagnosis, performance optimization, and reliability enhancement. Virtually all existing t...
Zhuoqing Morley Mao, Lili Qiu, Jia Wang, Yin Zhang