581 search results - page 69 / 117 » Approximation algorithms for constructing wavelength routing... |
INFOCOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— The need to monitor real time network services has prompted service providers to use new measurement technologies, such as service-specific probes. Service-specific probes ar...
113
click to vote
CCCG
2008
15 years 2 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
167
click to vote
OL
2011
14 years 8 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
108
Voted
TCAD
2008
15 years 1 months ago
2008
Abstract--Advances in very large-scale integration technology make clock skew more susceptible to process variations. Notwithstanding efficient exact zero-skew algorithms, clock sk...
124
click to vote
NETGAMES
2003
ACM
15 years 6 months ago
2003
ACM
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...