Oriented Multicast Routing Applied to Network Level Agent Search
Many protocols need a discovery mechanism to enable a given node to locate one or several nodes involved in the same communication. However, there is no protocol ready to fulfill this service at the network-layer. Every protocol usually implements its own solution. In particular, multicast protocols...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2001-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/268/pdf |
| _version_ | 1797270191100395520 |
|---|---|
| author | Damien Magoni Jean-Jacques Pansiot |
| author_facet | Damien Magoni Jean-Jacques Pansiot |
| author_sort | Damien Magoni |
| collection | DOAJ |
| description | Many protocols need a discovery mechanism to enable a given node to locate one or several nodes involved in the same communication. However, there is no protocol ready to fulfill this service at the network-layer. Every protocol usually implements its own solution. In particular, multicast protocols often use a searching technique based on an algorithm called expanding ring search. This algorithm searches for nodes in all directions and thus uses much bandwidth. However a typical search can usually restrict its scan in a specific direction. To enable this broadcast restriction, we propose an oriented multicast routing algorithm. The algorithm's principle is to direct the multicast of packets towards a special node, involved in the communication, in order to search only in a limited area. The area must be as small as possible to reduce network flooding but still has to contain many nodes satisfying the search criteria. This new algorithm is the core part of a network-level node search framework also defined herein. A search protocol based on this framework could provide a network-level agent discovery service to current protocols. We have simulated an agent search with our algorithm on one side and with the expanding ring algorithm on the other side and we give comparative results. |
| first_indexed | 2024-04-25T02:00:20Z |
| format | Article |
| id | doaj.art-21ac5616bf324975a54051b9bb832ee5 |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T02:00:20Z |
| publishDate | 2001-01-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-21ac5616bf324975a54051b9bb832ee52024-03-07T15:04:11ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502001-01-01Vol. 4 no. 210.46298/dmtcs.268268Oriented Multicast Routing Applied to Network Level Agent SearchDamien Magoni0https://orcid.org/0000-0003-2578-1803Jean-Jacques Pansiot1Laboratoire des Sciences de l'Image, de l'Informatique et de la TélédétectionLaboratoire des Sciences de l'Image, de l'Informatique et de la TélédétectionMany protocols need a discovery mechanism to enable a given node to locate one or several nodes involved in the same communication. However, there is no protocol ready to fulfill this service at the network-layer. Every protocol usually implements its own solution. In particular, multicast protocols often use a searching technique based on an algorithm called expanding ring search. This algorithm searches for nodes in all directions and thus uses much bandwidth. However a typical search can usually restrict its scan in a specific direction. To enable this broadcast restriction, we propose an oriented multicast routing algorithm. The algorithm's principle is to direct the multicast of packets towards a special node, involved in the communication, in order to search only in a limited area. The area must be as small as possible to reduce network flooding but still has to contain many nodes satisfying the search criteria. This new algorithm is the core part of a network-level node search framework also defined herein. A search protocol based on this framework could provide a network-level agent discovery service to current protocols. We have simulated an agent search with our algorithm on one side and with the expanding ring algorithm on the other side and we give comparative results.https://dmtcs.episciences.org/268/pdf[info.info-ni] computer science [cs]/networking and internet architecture [cs.ni] |
| spellingShingle | Damien Magoni Jean-Jacques Pansiot Oriented Multicast Routing Applied to Network Level Agent Search Discrete Mathematics & Theoretical Computer Science [info.info-ni] computer science [cs]/networking and internet architecture [cs.ni] |
| title | Oriented Multicast Routing Applied to Network Level Agent Search |
| title_full | Oriented Multicast Routing Applied to Network Level Agent Search |
| title_fullStr | Oriented Multicast Routing Applied to Network Level Agent Search |
| title_full_unstemmed | Oriented Multicast Routing Applied to Network Level Agent Search |
| title_short | Oriented Multicast Routing Applied to Network Level Agent Search |
| title_sort | oriented multicast routing applied to network level agent search |
| topic | [info.info-ni] computer science [cs]/networking and internet architecture [cs.ni] |
| url | https://dmtcs.episciences.org/268/pdf |
| work_keys_str_mv | AT damienmagoni orientedmulticastroutingappliedtonetworklevelagentsearch AT jeanjacquespansiot orientedmulticastroutingappliedtonetworklevelagentsearch |