Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Exploiting process lifetime distributions for dynamic load balancing
ACM Transactions on Computer Systems (TOCS)
Fast and scalable layer four switching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Online computation and competitive analysis
Online computation and competitive analysis
Packet classification using tuple space search
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification on multiple fields
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A large scale distributed intrusion detection framework based on attack strategy analysis
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analytic modeling of load balancing policies for tasks with heavy-tailed distributions
Proceedings of the 2nd international workshop on Software and performance
Scalable packet classification
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On randomized online scheduling
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Space Decomposition Techniques for Fast Layer-4 Switching
PfHSN '99 Proceedings of the IFIP TC6 WG6.1 & WG6.4 / IEEE ComSoc TC on on Gigabit Networking Sixth International Workshop on Protocols for High Speed Networks VI
Traffic Engineering with AIMD in MPLS Networks
PIHSN '02 Proceedings of the 7th IFIP/IEEE International Workshop on Protocols for High Speed Networks
Practical Dynamic Load Balancing for Irregular Problems
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
A fully distributed IDS for MANET
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Load balancing of temporary tasks in the lp norm
Theoretical Computer Science - Approximation and online algorithms
An Efficient Method for Optimal Probe Deployment of Distributed IDS
IEICE - Transactions on Information and Systems
Securing MPLS Networks with Multi-path Routing
ITNG '07 Proceedings of the International Conference on Information Technology
Better bounds for online load balancing on unrelated machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed flow detection over multi path sessions
Proceedings of the 4th international conference on Security and privacy in communication netowrks
A modular architecture for distributed IDS in MANET
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Tight bounds for selfish and greedy load balancing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A parameterizable methodology for Internet traffic flow profiling
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
Recently, there has been great interest in performing flow inspection within devices in the network. Frequently, a session passing through the network is routed through several paths either due to network architecture or due to malicious intent. This paper presents a re-routing layer that enables, for the first time, multi-path flow inspection. At any point in time, each session is inspected by a single inspection device using existing single-path flow inspection algorithms. Session packets that arrive at other devices are forwarded to the designated device. Our scheme takes into account the history of packet arrival among all collaborating devices for optimized re-routing. We show that the proposed mechanism is highly efficient in terms of the storage and communication overhead imposed on the network due to packet re-routing. The per-packet computation overhead at the devices is shown to be minimal and in the order of O(1).