Sciweavers

74 search results - page 14 / 15
» Maximum Flows on Disjoint Paths
Sort
View
GLOBECOM
2008
IEEE
14 years 2 months ago
Comparison of Routing and Wavelength Assignment Algorithms in WDM Networks
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
Kostas Christodoulopoulos, Konstantinos Manousakis...
ERSA
2010
187views Hardware» more  ERSA 2010»
13 years 5 months ago
An Open Source Circuit Library with Benchmarking Facilities
In this paper, we introduce the open-source PivPav backend tool for reconfigurable computing. Essentially, PivPav provides an interface to a library of digital circuits that are ke...
Mariusz Grad, Christian Plessl
EJWCN
2010
119views more  EJWCN 2010»
13 years 2 months ago
Simulations of the Impact of Controlled Mobility for Routing Protocols
This paper addresses mobility control routing in wireless networks. Given a data flow request between a sourcedestination pair, the problem is to move nodes towards the best placem...
Valeria Loscrì, Enrico Natalizio, Carmelo C...
NCA
2007
IEEE
14 years 1 months ago
Scheduling Bulk File Transfers with Start and End Times
The advancement of optical networking technologies has enabled e-science applications that often require transport of large volumes of scientific data. In support of such data-in...
Kannan Rajah, Sanjay Ranka, Ye Xia
AVI
2004
13 years 9 months ago
A visual tool for tracing users' behavior in Virtual Environments
Although some guidelines (e.g., based on architectural principles) have been proposed for designing Virtual Environments (VEs), several usability problems can be identified only b...
Luca Chittaro, Lucio Ieronutti