Welcome to IEEE Xplore 2.0: Optimization of Semantic Routing Table

Cart | Sitemap | Help

Abstract


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT

View TOC

Optimization of Semantic Routing Table
Biswas, A. Mohan, S. Mahapatra, R.
Dept. of Comput. Sci., Texas A&M Univ., College Station, TX;

This paper appears in: Computer Communications and Networks, 2008. ICCCN '08. Proceedings of 17th International Conference on
Publication Date: 3-7 Aug. 2008
On page(s): 1-6
Location: St. Thomas, US Virgin Islands,
ISSN: 1095-2055
ISBN: 979-1-4244-2389-7
INSPEC Accession Number: 10323523
Digital Object Identifier: 10.1109/ICCCN.2008.ECP.69
Current Version Published: 2008-11-17

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.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.

Citing Documents
Available to subscribers and IEEE members.

You are not logged in.

Guests may access Abstract records free of charge.