Configuring networks with content filtering nodes with applications to network security

Proceedings - IEEE INFOCOM

Volumn 4, Issue , 2005, Pages 2395-2404

  Kodialam, Murali ^a   Lakshman, T V ^a   Sengupta, Sudipta ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Computer Virus; Content Filtering; Network Containment; Network Security; Worms

Indexed keywords

CONTENT FILTERING; NETWORK CONTAINMENT; NETWORK SECURITY; WORM PROPAGATION;

APPROXIMATION THEORY; COMPUTER VIRUSES; COMPUTER WORMS; OPTIMIZATION; PACKET NETWORKS; PROBLEM SOLVING; SECURITY OF DATA; TELECOMMUNICATION TRAFFIC;

COMPUTER NETWORKS;

EID: 25644441776     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2005.1498525     Document Type: Conference Paper

References (8)

1. D. Moore, C. Shannon, G. M. Voelker, and S. Savage, "Internet Quarantine: Requirements for Containing Self-Propagating Code", IEEE Infocom 2003, March 2003.
2. S. Choi, J. Turner, and T. Wolf, "Configuring Sessions in Programmable Networks", IEEE Infocom 2001, April 2001.
3. S. Choi and J. Turner, "Configuring Sessions in Programmable Networks with Capacity Constraints", IEEE ICC 2003, May 2003.
4. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, February 1993.
5. N. Garg and J. Konemann, "Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems", 39th Annual Symposium on Foundations of Computer Science (FOCS), 1998.
6. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company. New York, 1979.
7. D. S. Hochbaum, ed., Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, 1997.
8. J. Y. Yen, "Finding the K Shortest Loopless Paths in a Network", Management Science, vol. 17, no. 11, July 1971.