Sciweavers

364 search results - page 69 / 73
» Shortest-path network interdiction
Sort
View
NCA
2007
IEEE
14 years 2 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
INFOCOM
2009
IEEE
14 years 3 months ago
A Queueing Model Framework of PCE-Based Inter-Area Path Computation
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
Juanjuan Yu, Yue He, Kai Wu, Marco Tacca, Andrea F...
SECON
2007
IEEE
14 years 2 months ago
The Optimum Number of OSPF Areas for MANETs
—Mobile ad hoc networks (MANETs) are a critical technology in filling the gap where the network infrastructure is insufficient or does not exist at all. The dynamic topology of...
Jangeun Jun, Mihail L. Sichitiu, Hector D. Flores,...
INFOCOM
2006
IEEE
14 years 2 months ago
Session Privacy Enhancement by Traffic Dispersion
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
Haim Zlatokrilov, Hanoch Levy
INFOCOM
2002
IEEE
14 years 1 months ago
Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman