Optimization of Semantic Routing Table Conference Paper

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. 2008 IEEE.

name of conference

• 2008 Proceedings of 17th International Conference on Computer Communications and Networks

authors

• Mahapatra, Rabinarayan

published proceedings

• 2008 PROCEEDINGS OF 17TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, VOLS 1 AND 2

author list (cited authors)

• Biswas, A., Moban, S., & Mahapatra, R.

citation count

• 6

complete list of authors

• Biswas, Amitava||Moban, Suneil||Mahapatra, Rabi

publication date

• August 2008

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Proceedings - International Conference on Computer Communications and Networks, ICCCN  Journal

keywords

• Semantic Content Addressable Network
• Small World

Digital Object Identifier (DOI)

• 10.1109/icccn.2008.ecp.69

International Standard Book Number (ISBN) 13

• 978-1-4244-2389-7

start page

• 298

end page

• 303

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Ficccn.2008.ecp.69