Sciweavers

EOR
2007
147views more  EOR 2007»
13 years 11 months ago
Routing and wavelength assignment in optical networks using bin packing based algorithms
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...
Nina Skorin-Kapov
JSC
2006
97views more  JSC 2006»
13 years 11 months ago
Improving the DISPGB algorithm using the discriminant ideal
In 1992, V. Weispfenning proved the existence of Comprehensive Gr
Montserrat Manubens, Antonio Montes
JSAC
2006
135views more  JSAC 2006»
13 years 11 months ago
Route-Metric-Based Dynamic Routing and Wavelength Assignment for Multifiber WDM Networks
We present three dynamic routing and wavelength assignment (RWA) algorithms that are intended for multifiber WDM networks without wavelength converters. For networks with a large n...
Jong-Seon Kim, D. C. Lee, H. Sridhar
JSAC
2006
95views more  JSAC 2006»
13 years 11 months ago
Impact of Packet Sampling on Portscan Detection
Abstract-- Packet sampling is commonly deployed in highspeed backbone routers to minimize resources used for network monitoring. It is known that packet sampling distorts traffic s...
Jianning Mai, Ashwin Sridharan, Chen-Nee Chuah, Hu...
JSAC
2006
96views more  JSAC 2006»
13 years 11 months ago
Price-based distributed algorithms for rate-reliability tradeoff in network utility maximization
Abstract--The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission "p...
Jang-Won Lee, Mung Chiang, A. Robert Calderbank
JPDC
2006
134views more  JPDC 2006»
13 years 11 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
JNW
2006
98views more  JNW 2006»
13 years 11 months ago
Efficient Distributed Algorithm for RWA Using Path Protection
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...
Arunita Jaekel, Ying Chen
JNW
2006
145views more  JNW 2006»
13 years 11 months ago
A Comparison of Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
Matthew Leslie, Jim Davies, Todd Huffman
JMLR
2006
120views more  JMLR 2006»
13 years 11 months ago
Kernel-Based Learning of Hierarchical Multilabel Classification Models
We present a kernel-based algorithm for hierarchical text classification where the documents are allowed to belong to more than one category at a time. The classification model is...
Juho Rousu, Craig Saunders, Sándor Szedm&aa...
JMLR
2006
99views more  JMLR 2006»
13 years 11 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...