DocumentCode
3376584
Title
Optimization of Semantic Routing Table
Author
Biswas, Amitava ; Mohan, Suneil ; Mahapatra, Rabi
Author_Institution
Dept. of Comput. Sci., Texas A&M Univ., College Station, TX
fYear
2008
fDate
3-7 Aug. 2008
Firstpage
1
Lastpage
6
Abstract
In a semantic routed network (SRN), messages are routed based on the meaning of the message key. This means network nodes can be addressed by the meaning of the data content. Providing fast and successful semantic routing for any key is a challenging task due to conflicting performance demands. We present semantic routing table optimizing techniques to realize small world topology for fast and successful message routing. Our simulation shows that a SRN of 1000 nodes can achieve a competitive 57% routing success within 6 messaging delays, and have message delivery response of 3.3 messaging delays.
Keywords
Internet; telecommunication network routing; Internet; message delivery response; semantic routed network; semantic routing table optimization; Computer science; Content based retrieval; Delay; Humans; IP networks; Information retrieval; Internet; Network topology; Routing; Simple object access protocol;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communications and Networks, 2008. ICCCN '08. Proceedings of 17th International Conference on
Conference_Location
St. Thomas, US Virgin Islands
ISSN
1095-2055
Print_ISBN
978-1-4244-2389-7
Electronic_ISBN
1095-2055
Type
conf
DOI
10.1109/ICCCN.2008.ECP.69
Filename
4674229
Link To Document