Sciweavers

14548 search results - page 2479 / 2910
» The Optimal Path-Matching Problem
Sort
View
OSN
2008
88views more  OSN 2008»
15 years 6 months ago
Grade-of-service differentiated static resource allocation schemes in WDM networks
This paper presents a study on the Grade-of-Service (GoS) differentiation of static resource allocation in lightpath routed WDM networks, where lightpath requests between node pai...
James Yiming Zhang, Jing Wu, Gregor von Bochmann, ...
MST
2006
136views more  MST 2006»
15 years 6 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
SIGMETRICS
2008
ACM
140views Hardware» more  SIGMETRICS 2008»
15 years 6 months ago
Scalable VPN routing via relaying
Enterprise customers are increasingly adopting MPLS (Multiprotocol Label Switching) VPN (Virtual Private Network) service that offers direct any-to-any reachability among the cust...
Changhoon Kim, Alexandre Gerber, Carsten Lund, Dan...
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
15 years 6 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...
BMCBI
2005
158views more  BMCBI 2005»
15 years 6 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
« Prev « First page 2479 / 2910 Last » Next »