Results 1  10
of
11
Distributed algorithms for secure multipath routing in attackresistant networks,” Dept
 Comput. Sci
, 2007
"... Abstract—To proactively defend against intruders from readily jeopardizing singlepath data sessions, we propose a distributed secure multipath solution to route data across multiple paths so that intruders require much more resources to mount successful attacks. Our work exhibits several importan ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
(Show Context)
Abstract—To proactively defend against intruders from readily jeopardizing singlepath data sessions, we propose a distributed secure multipath solution to route data across multiple paths so that intruders require much more resources to mount successful attacks. Our work exhibits several important properties that include: 1) routing decisions are made locally by network nodes without the centralized information of the entire network topology; 2) routing decisions minimize throughput loss under a singlelink attack with respect to different session models; and 3) routing decisions address multiple link attacks via lexicographic optimization. We devise two algorithms termed the BoundControl algorithm and the LexControl algorithm, both of which provide provably optimal solutions. Experiments show that the BoundControl algorithm is more effective to prevent the worstcase singlelink attack when compared to the singlepath approach, and that the LexControl algorithm further enhances the BoundControl algorithm by countering severe singlelink attacks and various types of multilink attacks. Moreover, the LexControl algorithm offers prominent protection after only a few execution rounds, implying that we can sacrifice minimal routing protection for significantly improved algorithm performance. Finally, we examine the applicability of our proposed algorithms in a specialized defensive network architecture called the attackresistant network and analyze how the algorithms address resiliency and security in different network settings. Index Terms—Attackresistant networks, maximumflow problems, multipath routing, optimization, preflowpush, resilience, security.
Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks
 Inf. Eng. Dept., Chinese Univ. of Hong Kong, Tech. Rep
, 2005
"... Abstract—An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data aggregation and routing. We adopt a model to integrate data aggregation with the underlying routing scheme and ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
(Show Context)
Abstract—An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data aggregation and routing. We adopt a model to integrate data aggregation with the underlying routing scheme and present a smoothing approximation function for the optimization problem. The necessary and sufficient conditions for achieving the optimality are derived and a distributed gradient algorithm is designed accordingly. We show that the proposed scheme can significantly reduce the data traffic and improve the network lifetime. The distributed algorithm can converge to the optimal value efficiently under all network configurations. Index Terms—Data aggregation, maximum lifetime routing, network lifetime, smoothing methods, wireless sensor networks. I.
Lexicographically Optimal Balanced Networks
 IEEE/ACM Transactions on Networking
, 2001
"... We consider the problem of allocating bandwidth between two endpoints of a backbone network so that no parts of the network are unnecessarily loaded. We formulate the problem as lexicographic optimization, and develop algorithms for its solution. The solution consists of a) identifying a cut in the ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
We consider the problem of allocating bandwidth between two endpoints of a backbone network so that no parts of the network are unnecessarily loaded. We formulate the problem as lexicographic optimization, and develop algorithms for its solution. The solution consists of a) identifying a cut in the network where the optimal load can be determined on all the links of the cut, and b) considering the same problem in each of the subnetworks to which the cut is dividing the original network.
New DistanceDirected Algorithms for Maximum Flow and Parametric Maximum Flow Problems
, 1987
"... ..."
Distancedirected augmenting path algorithms for maximum flow and parametric maximum flow problems
 Naval Research Logistics
, 1991
"... Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distancedirected algorithms have been suggested that do not construct layered networks but instead ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distancedirected algorithms have been suggested that do not construct layered networks but instead maintain a distance label with each node. The distance label of a node is a lower bound on the length of the shortest augmenting path from the node to the sink. In this article we develop two distancedirected augmenting path algorithms for the maximum flow problem. Both the algorithms run in O(n 2 m) time on networks with n nodes and m arcs. We also point out the relationship between the distance labels and layered networks. Using a scaling technique, we improve the complexity of our distancedirected algorithms to O(nm log U), where U denotes the largest arc capacity. We also consider applications of these algorithms to unit capacity maximum flow problems and a class of parametric maximum flow problems. t i
On Load Balancing in Multicomputer/Distributed Systems Equipped with Circuit or CutThrough Switching Capability
 IEEE Transactions on Computers
, 2000
"... For multicomputer or distributed systems that use circuit switching, wormhole routing, or virtual cutthrough, 2 the communication overhead and the message delivery time depend largely upon link contention rather than upon the distance between the source and the destination. That is, a larger comm ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
For multicomputer or distributed systems that use circuit switching, wormhole routing, or virtual cutthrough, 2 the communication overhead and the message delivery time depend largely upon link contention rather than upon the distance between the source and the destination. That is, a larger communication overhead or a longer delivery delay occurs to a message when it traverses a route with heavier traffic than one with a longer distance and lesser traffic. This characteristic greatly affects the selection of routes for interprocessor communication and/or load balancing. We consider the load balancing problem in these types of systems. Our objective is to find the maximum load imbalance that can be eliminated without violating the (traffic) capacity constraint while keeping the maximum link contention as low as possible. We investigate the load balancing problem under various conditions. First, we consider the case in which the excess load on each overloaded node is divisible. We de...
1 Distributed Algorithms for Secure Multipath Routing in AttackResistant Networks
"... Abstract — To proactively defend against intruders from readily jeopardizing singlepath data sessions, we propose a distributed secure multipath solution to route data across multiple paths so that intruders require much more resources to mount successful attacks. Our work exhibits several importan ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract — To proactively defend against intruders from readily jeopardizing singlepath data sessions, we propose a distributed secure multipath solution to route data across multiple paths so that intruders require much more resources to mount successful attacks. Our work exhibits several important properties that include: (1) routing decisions are made locally by network nodes without the centralized information of the entire network topology, (2) routing decisions minimize throughput loss under a singlelink attack with respect to different session models, and (3) routing decisions address multiple link attacks via lexicographic optimization. We devise two algorithms termed the BoundControl algorithm and the LexControl algorithm, both of which provide provably optimal solutions. Experiments show that the BoundControl algorithm is more effective to prevent the worstcase singlelink attack when compared to the singlepath approach, and that the LexControl algorithm further enhances the BoundControl algorithm by countering severe singlelink attacks and various types of multilink attacks. Moreover, the LexControl algorithm offers prominent protection after only a few execution rounds, implying that we can sacrifice minimal routing protection for significantly improved algorithm performance. Finally, we examine the applicability of our proposed algorithms in a specialized defensive network architecture called the attackresistant network and analyze how the algorithms address resiliency and security in different network settings. Index Terms — Resilience, security, multipath routing, optimization, maximumflow problems, preflowpush, attackresistant networks. I.
Two Stage Interval Time Minimizing Transportation Problem
"... Transportation Problem, where total availability of a homogeneous product at various sources is known to lie in a specified interval, is studied in the present paper. In the first stage, the sources ship all of their onhand material to the demand points, while a secondstage delivery covers the dem ..."
Abstract
 Add to MetaCart
Transportation Problem, where total availability of a homogeneous product at various sources is known to lie in a specified interval, is studied in the present paper. In the first stage, the sources ship all of their onhand material to the demand points, while a secondstage delivery covers the demand that is not fulfilled in the first shipment. In each stage, the objective is to minimize the shipment time, and the overall goal is to find a solution that minimizes the sum of the first and secondstage shipment times. A polynomial time algorithm is proposed to solve the problem to optimality, where at various steps of the algorithm lexicographic optimal solutions of restricted versions of a related standard time minimizing transportation problem are examined and finally the global optimal solution is determined.