Title :
Security Issues in Small World Network Routing
Author :
Halim, Felix ; Wu, Yongzheng ; Yap, Roland H C
Author_Institution :
Sch. of Comput., Nat. Univ. of Singapore, Singapore
Abstract :
Small world network (SWN) have been shown to be navigable - a short route can be found using efficiently using decentralized algorithms. This routing relies on nodes having a position to guide the routing such as its coordinates. Even in the absence of positional information such as node coordinates, by using local self-reorganization, it is possible to reconstruct a proxy for the node coordinates which still allows for efficient routing. This paper shows that in the presence of malicious nodes, the self-reorganization mechanism breaks down. We investigate self-protection mechanisms for such SWNs. Preliminary results using a simple restart mechanism for self-tuning shows that much of the effect of malicious nodes can be mitigated.
Keywords :
computer network reliability; fault tolerant computing; graph theory; telecommunication network routing; telecommunication security; decentralized algorithm; graph theory; local self-reorganization mechanism; malicious node; network security; self-protection mechanism; small world network routing; structured overlay network; Computer networks; Costs; Facebook; Lattices; National security; Peer to peer computing; Routing; Self-organizing networks; Social network services; Switches; routing; security; self-organization; small world network;
Conference_Titel :
Self-Adaptive and Self-Organizing Systems, 2008. SASO '08. Second IEEE International Conference on
Conference_Location :
Venezia
Print_ISBN :
978-0-7695-3404-6
DOI :
10.1109/SASO.2008.21