A lightweight intrusion-tolerant overlay network

Proceedings - Ninth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, ISORC 2006

Volumn , Issue , 2006, Pages 496-503

  Obelheiro, Rafael R ^a   Da Silva Fraga, Joni ^a  

^a FEDERAL UNIVERSITY OF SANTA CATARINA   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; INTERNET; MATHEMATICAL MODELS; NETWORK PROTOCOLS; ROUTERS;

COMMUNICATION INFRASTRUCTURES; INTERNET ROUTING LAYERS; NETWORK ARCHITECTURE; UNDERLYING NETWORKS;

COMPUTER NETWORKS;

EID: 33751054998     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISORC.2006.     Document Type: Conference Paper

References (19)

1. D. G. Andersen. Mayday: Distributed filtering for Internet services. In Proc. USENIX Symp. Internet Technologies and Systems, Seattle, WA, 2003.
2. D. G. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris. Resilient overlay networks. In Proc. ACM Symp. Operating Systems Principles, pp. 131-145, 2001.
3. B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens. An on-demand secure routing protocol resilient to Byzantine failures. In Proc. ACM WiSe, pp. 21-30, Atlanta, GA, 2002.
4. K. Calvert, M. Doar, and E. W. Zegura. Modeling Internet topology. IEEE Communications Magazine, 35(6): 160-163, June 1997.
5. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach. Secure routing for structured peer-to-peer overlay networks. In Proc. Symp. Operating Systems Design and Implementation, Boston, MA, 2002.
6. M. Dahlin, B. B. V. Chandra, L. Gao, and A. Nayate. End-to-end WAN service availability. IEEE/ACM Trans. Networking, 11(2):300-313, Apr. 2003.
7. F. Harary. Graph Theory. Addison-Wesley, Reading, MA, USA, 1969.
8. Y.-C. Hu, A. Perrig, and D. B. Johnson. Ariadne: A secure on-demand routing protocol for ad hoc networks. In Proc. MobiCom, pp. 12-23, Atlanta, GA, 2002.
9. A. D. Keromytis, V. Misra, and D. Rubenstein. SOS: Secure overlay services. In Proc. ACM SIGCOMM, pp. 61-72, Pittsburgh, PA, 2002.
10. H. Krawczyk, M. Bellare, and R. Canetti. HMAC: Keyed-hashing for message authentication. IETF RFC 2104, 1997.
11. C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian. Delayed Internet routing convergence. IEEE/ACM Trans. Networking, 9(3):293-306, June 2001.
12. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Trans. Programming Languages and Systems, 4(3):382-401, July 1982.
13. H. H. Muhammad and M. P. Barcellos. Simulating group communication protocols through an object-oriented framework. In Proc. Annual Simulation Symp., pp. 143-150, San Diego, CA, 2002.
14. P. Papadimitratos and Z. J. Haas. Securing the Internet routing infrastructure. IEEE Communications Magazine, 40(10):60-68, Oct. 2002.
15. V. Paxson. End-to-end routing behavior in the Internet. IEEE/ACM Trans. Networking, 5(5):601-615, Oct. 1997.
16. V. Paxson. End-to-end Internet packet dynamics. IEEE/ ACM Trans. Networking, 7(3):277-292, June 1999.
17. R. J. Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, Jan. 1988.
18. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. IFIP/ACM Middleware, pp. 329-350, Heidelberg, Germany, 2001.
19. Y. Xue and K. Nahrstedt. Providing fault-tolerant ad hoc routing service in adversarial environments. Wireless Personal Communications, 29:367-388, 2004.