Sciweavers

1147 search results - page 169 / 230
» LinkedDataLens: linked data as a network of networks
Sort
View
NOCS
2007
IEEE
15 years 4 months ago
QNoC Asynchronous Router with Dynamic Virtual Channel Allocation
An asynchronous router for QNoC (Quality-of service NoC) is presented. It combines multiple service levels (SL) with multiple equal-priority virtual channels (VC) within each leve...
Rostislav (Reuven) Dobkin, Ran Ginosar, Israel Cid...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
14 years 12 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
75
Voted
NSDI
2004
14 years 11 months ago
Structure Management for Scalable Overlay Service Construction
This paper explores the model of providing a common overlay structure management layer to assist the construction of large-scale wide-area Internet services. To this end, we propo...
Kai Shen
CN
2007
154views more  CN 2007»
14 years 10 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
TON
2008
125views more  TON 2008»
14 years 10 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni