Representation of Complex Concepts for Semantic Routed Network Conference Paper

abstract

• Semantic Routed Network (SRN) can provide a scalable distributed solution for searching data in a large grid. In SRN, messages are routed in a overlay network based on the meaning of the message key. If the message key describes the desired data, then SRN nodes can be addressed and accessed by the description of their data content. The key challenges of materializing a SRN are: (1) designing a data structure which will represent complex descriptions of data objects; (2) computing similarity of descriptors; and (3) constructing a small world network topology that minimize the routing response time and maximize routing success, which depends on solving the first two problems. We present a design of a descriptor data structure and a technique to compare their similarity to address the first two problems. 2009 Springer.

authors

• Mahapatra, Rabinarayan

published proceedings

• DISTRIBUTED COMPUTING AND NETWORKING

author list (cited authors)

• Biswas, A., Mohan, S., Panigrahy, J., Tripathy, A., & Mahapatra, R.

citation count

• 10

complete list of authors

• Biswas, Amitava||Mohan, Suneil||Panigrahy, Jagannath||Tripathy, Aalap||Mahapatra, Rabi

publication date

• October 2009

publisher

• Springer Nature  Publisher

published in

• Lecture Notes in Computer Science  Journal

keywords

• P2p Systems
• Semantic Routing
• Semantic Similarity

Digital Object Identifier (DOI)

• 10.1007/978-3-540-92295-7_17

International Standard Book Number (ISBN) 10

• 3540922946

International Standard Book Number (ISBN) 13

• 978-3-540-92294-0

start page

• 127

end page

• 138

volume

• 5408

URL

• http%3A%2F%2Fdx.doi.org%2F10.1007%2F978-3-540-92295-7_17