Sciweavers

JCO
2006
64views more  JCO 2006»
13 years 11 months ago
Minimum failure explanations for path vector routing changes
Mohit Lad, Daniel Massey, Adam Meyerson, Akash Nan...
JCO
2006
89views more  JCO 2006»
13 years 11 months ago
Construction of d(H)-disjunct matrix for group testing in hypergraphs
Hong Gao, Frank K. Hwang, My T. Thai, Weili Wu, Ta...
JCO
2006
83views more  JCO 2006»
13 years 11 months ago
Separating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
JCO
2006
64views more  JCO 2006»
13 years 11 months ago
Traffic engineering of tunnel-based networks with class specific diversity requirements
Tunnel-based networks such as Multi-protocol Label switching (MPLS) are suitable for providing diversity guarantees to different service classes or customers. Based on the number ...
Shekhar Srivastava, Deep Medhi
JCO
2006
67views more  JCO 2006»
13 years 11 months ago
Resource allocation for restoration of compromised systems
Computer systems are constantly under the threats of being attacked and in many cases these attacks succeed. Today's networked systems are thus built to be intrusion tolerant....
Qunwei Zheng, Sibabrata Ray, Xiaoyan Hong
JCO
2006
66views more  JCO 2006»
13 years 11 months ago
Tree edge decomposition with an application to minimum ultrametric tree approximation
A k-decomposition of a tree is a process in which the tree is recursively partitioned into k edge-disjoint subtrees until each subtree contains only one edge. We investigated the p...
Chia-Mao Huang, Bang Ye Wu, Chang-Biau Yang
JCO
2006
150views more  JCO 2006»
13 years 11 months ago
Efficient algorithms for shared backup allocation in networks with partial information
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
Yigal Bejerano, Joseph Naor, Alexander Sprintson
JCO
2006
126views more  JCO 2006»
13 years 11 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
JCO
2006
72views more  JCO 2006»
13 years 11 months ago
A New delay control method for real-time flows
Weijia Jia, Hanxing Wang, Wanqing Tu, Wei Zhao
JCO
2006
126views more  JCO 2006»
13 years 11 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li