JCO
2006
13 years 4 months ago
2006
JCO
2006
13 years 4 months ago
2006
JCO
2006
13 years 4 months ago
2006
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...
JCO
2006
13 years 4 months ago
2006
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 ...
JCO
2006
13 years 4 months ago
2006
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....
JCO
2006
13 years 4 months ago
2006
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...
JCO
2006
13 years 4 months ago
2006
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
JCO
2006
13 years 4 months ago
2006
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...
JCO
2006
13 years 4 months ago
2006
JCO
2006
13 years 4 months ago
2006
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 ...