Sciweavers

671 search results - page 119 / 135
» Context-specific Route Directions
Sort
View
NETWORKS
2006
13 years 7 months ago
The multiroute maximum flow problem revisited
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
Donglei Du, R. Chandrasekaran
TON
2008
125views more  TON 2008»
13 years 7 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
CONCURRENCY
1998
130views more  CONCURRENCY 1998»
13 years 7 months ago
JPVM: network parallel computing in Java
The JPVM library is a software system for explicit message-passing based distributed memory MIMD parallel programming in Java. The library supports an interface similar to the C a...
Adam Ferrari
TON
1998
112views more  TON 1998»
13 years 7 months ago
IP switching - ATM under IP
IP traffic on the Internet and private enterprise networks has been growing exponentially for some time. This growth is beginning to stress the traditional, processor based design...
Peter Newman, Greg Minshall, Thomas L. Lyon
OTM
2010
Springer
13 years 6 months ago
A Metamodel for Master Data
Abstract. The term ‘Master Data’ brings up different interpretations and connotations, especially with vendors espousing the “single version of the truth”. Is there a singl...
Baba Piprani, Suneil Dham