A proxy-network based overlay topology resistant to DoS attacks and partitioning

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages

  Frechette, Stephen ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CIRCULANT GRAPH; DOS ATTACKS; PROXY-NETWORK BASED OVERLAY TOPOLOGY;

COMMUNICATION SYSTEMS; GRAPH THEORY; NETWORK PROTOCOLS; TOPOLOGY;

COMPUTER NETWORKS;

EID: 33746271060     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.61     Document Type: Conference Paper

References (29)

1. Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan, "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications," SIGCOMM'01, August 27-31, 2001, San Diego, California, USA.
2. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph and J. D. Kubiatowicz, Tapestry: A Resilient Global-scale Overlay for Service Deployment, IEEE Journal on Selected Areas in Communications, (2003).
3. A. Rowstron and P. Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, In the Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), (2001).
4. David Andersen, Hari Balakrishnan, M. Frans Kaashoek, Robert Morris, "Resilient Overlay Networks," 18th ACM Symposium on Operating System Principles (SOSP), October 2001, Banff, Canada.
5. T.H. Cormen, C.E. Leiserson, R.L. Rivest, "Introduction to Algorithms." McGrawHill, 1991.
6. N. Lynch, Distributed Algorithms, Morgan Kaufmann Pub. Inc., 1996.
7. J. P. Hayes, "A Graph Model for Fault-Tolerant Computing Systems" IEEE Trans. on Computers, Vol. 25, No.9, pp. 875-884, 1976.
8. S. Dutt and J.P. Hayes, "On Desiging and Reconfiguring k-Fault Tolerant Tree Architectures" IEEE Trans. on Computers, Vol. 39, No.4, pp. 490-503, 1990.
9. S. Dutt and J.P. Hayes, "Designing Fault-Tolerant Systems Using Auto-morphisms" Journal of Parallel and Distributed Computing, Vol. 12, No.3, pp. 249-268, 1991.
10. S. Dutt and J.P. Hayes, "Some Practical Issues in the Design of Fault-Tolerant Multiprocessors" IEEE Trans. on Computers, Vol. 41, No.5, pp. 588-598, May 1992.
11. F.T. Boesch and A. P. Felzer, "A General Class of Invulnerable Graphs" Networks, Vol. 2, pp. 261-283, 1972.
12. F.T. Boesch and R. Tindell, "Circulants and their Connectivities" IEEE Journal of Graph Theory, Vol. 8, pp. 487-499, 1984.
13. F.T. Boesch and J. F. Wang, "Reliable Circulant Networks with Minimum Transmission Delay" IEEE Trans. on Circuits and Systems, CAS-32(12), pp. 1286-1291, 1985.
14. H.K. Ku and J.P. Hayes, "Connective Fault-Tolerance in Multiple-Bus Systems" Trans. on Parallel and Distributed Systems, Vol. 8, No.6, pp. 574-586, 1997.
15. P. LeMahieu, V. Bohossian and J. Bruck, "Fault-Tolerant Switched Local Area Networks" IEEE Proc. of the International Parallel Processing Symposium, pp747-751, 1999.
16. D. Avresky and Y. Varoglu, "Survivable Computer Networks in the Presence of Multiple Faults," IEEE Int. Workshop on Embedded Fault-Tolerant Systems, EFTS-2000, September 2000, Washington, D.C., USA.
17. J. Wang, L. Lu, and A. A. Chien. "Tolerating Denial-of-Service Attacks using Overlay Networks - Impact of Overlay Network Topology," in Proc. First ACM Workshop on Survivable and Self-Regenerative Systems, 2003.
18. S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker "A Scalable Content-Addressable Network", ACM SIGCOMM'01, 2001.
19. D. West Introduction to Graph Theory., Sec. ed. Upper Saddle River, NJ.: Prentice Hall, pp. 150, 161-172, 461-463, 2001.
20. F. Harary "The Maximum Connectivity of a Graph," Proc. Nat. Acad. Sci. U.S.A. 48, pp. 1142-1146, 1962.
21. J. Wang, A. A. Chien. "Using Overlay Networks to Resist Denial-of-Service Attacks," Technical Report, Univ. of San Diego, 2003.
22. C. Labovitz, R. Malan, and F. Jahanian. "Internet Routing Instability," IEEE/ACM Trans. on Networking, vol. 6, no. 5, pp. 515-528, Oct. 1998.
23. S. Frechette and D.R. Avresky "An Open Source Framework for Adaptive InifiniBand-Based Cluster and Grid Computing in the Presence of Anomalies," Submitted for publication
24. H. Whitney "Congruent graphs and the connectivity of graphs," American Journal of Math, vol. 54, pp. 150-168, 1932.
25. K. Menger "Zur allgemeinen Kurventheorie," Fundamenta Mathematicae, vol. 10, pp. 96-115, 1927.
26. F. Boesch and J. Wang. "Reliable Circulant Networks With Minimum Transmission Delay," IEEE/ACM Trans. on Networking, vol. 32, no. 12, pp. 1286-1291, December 1985.
27. R. Beivide, E. Herrada, J.L. Balczar and A. Arruabarrena. "Optimal Distance Networks of Low Degree for Parallel Computers," IEEE Transactions on Computers, vol. C-40, no. 10, pp. 1109-1124, 1991.
28. J.F. Wang and C.S. Yang. "On the Number of Spanning Trees in Circulant Graphs," International Journal of Computer Mathematics, vol 16, pp. 1286-1291, 229-241, 1984.
29. J. Xu Topological Structure of Analysis of Interconnection Networks., Norwell, MA.: Kluwer Academic Publishers, pp. 53-56, 2001.