Chapter 3 Adapting Search Theory to Networks
Nathan Krislock
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
43 44 CHAPTER 3. SEARCHING NETWORKS order to gain access to local services and data. It is apparent that mobile network agents are going to undergo considerable development and become extensively used. The networked world is going to see many of these objects.
Related papers
Searching Distributed Data With Multi Agent System
2015
In distributed systems, to search out information is costly task because they have to be compel led to transfer information from node containing information to the node wherever query is generated, this will l consume latency, network traffic etc.For reducing these parameters mobile agents are accustomed fetch information from nodes wherever information resides. Alongside mobile agents directory containing information concerning database kept on completely different nodes is employed to focus retrieval method solely to those nodes that are containing answers to the query. 3 kinds of agents area unit accustomed fetch data specifically ly coordinator, search and local agent.
Management by network search
2012 IEEE Network Operations and Management Symposium, 2012
While networked systems hold and generate vast amounts of configuration and operational data, this data is not accessible through a simple, uniform mechanism. Rather, it must be gathered using a range of different protocols and interfaces. Our vision is to make all this data available in a simple format through a realtime search process which runs within the network and aggregates the data into a form needed by applicationsa concept we call network search. We believe that such an approach, though challenging, is technically feasible and will enable rapid development of new management applications and advanced network functions. This paper motivates and formulates the concept of network search, compares it to related concepts like web search, outlines a search architecture, describes the design space and research challenges, and reports on a testbed implementation with management applications built for exploratory purposes of this new paradigm.
An overview of search strategies in distributed environments
Distributed systems are populated by a large number of heterogeneous entities that join and leave the systems dynamically. These entities act as clients and providers and interact with each other in order to get a resource or to achieve a goal. To facilitate the collaboration between entities the system should provide mechanisms to manage the information about which entities or resources are available in the system at a certain moment, as well as how to locate them in an efficient way. However, this is not an easy task in open and dynamic environments where there are changes in the available resources and global information is not always available. In this paper, we present a comprehensive vision of search in distributed environments. This review does not only considers the approaches of the Peer-to-Peer area, but also the approaches from three more areas: Service-Oriented Environments, Multi-Agent Systems, and Complex Networks. In these areas, the search for resources, services, or entities plays a key role for the proper performance of the systems built on them. The aim of this analysis is to compare approaches from these areas taking into account the underlying system structure and the algorithms or strategies that participate in the search process.
A novel mobile agent search algorithm
Information Sciences, 2000
Intelligent Agent has been shown to be a g o o d approach to addressing the issues of limited c apacity and unreliable wireless links in mobile computing. However, before the approach can be c ommercially viable, a set of management capabilities that support the controls of intelligent agents in a mobile environment need t o b e in place. Since c ontrols can only be applied after the target agent is located, an e ective agent search algorithm is an indispensable part of the management functions. In this paper, we propose a new algorithm, the Highest Probability First Algorithm, for locating the target agent. The approach makes use of the execution time information to reduce c ost and network tra c. The execution time of the agent on a server is assumed t o b e binomial distributed and therefore is more r e alistic.
Network Routing by Mobile Agents for Query Retrieval Using Genetic Algorithms (Penjelajahan Rangkaian Oleh Agen Mobil Bagi Capaian Pertanyaan Menggunakan Algoritma Genetik)
Mobile agents often have a task to collect data from several predefined sites. This should be done in an efficient way by minimizing the elapsed time. Usually these agents only know the list of sites but not the distances between them. This research proposes a method to minimize a network routing time taken by the mobile agents using genetic algorithm (GA) to collect query datasets from different hosts from the World Wide Web. The mobile agents repeat traveling over short routes and avoid longer ones. The GA will be used to select the best routes that will be used by mobile agents to retrieve query datasets in a very short time. Specifically, the performance of mobile agent in obtaining a query result from the remote hosts using extended hierarchical query retrieval (EHQR) approach is proposed. It is based on a hierarchical and a parallel dispatching of mobile agents to the remote servers in order to retrieve the query results. the new dispatching algorithms for mobile agents to be dispatched to various sited have been developed such as an itinerary query retrieval approach (IQR), a parallel query retrieval approach (PQR), a serial query retrieval approach (SQR), a shuttle query retrieval approach (SHQR), a hierarchical query retrieval approach (HQR) and the EHQR approach Experimental results show that the proposed approach reduces the number of mobile agents and also improve the total time taken to retrieve the query results compared with other approaches.
Local Search in Unstructured Networks
Computing Research Repository, 2002
We review a number of message-passing algorithms that can be used to search through power-law networks. Most of these algorithms are meant to be improvements for peer-to-peer file sharing systems, and some may also shed some light on how unstructured social networks with certain topologies might function relatively efficiently with local information. Like the networks that they are designed for,
Mobile agents and their use for information retrieval: a brief overview and an elaborate case study
IEEE Network, 2002
Opportunistic Search in Disconnected Mobile Adhoc Network
To design a social network based P2P content based file sharing system in disconnected Mobile Adhoc Networks in a privacy preserving manner for efficient file searching based on interest casting. As the mobile digital devices are carried by people that usually belong to certain social relationships, this project focus on the P2P file sharing in a disconnected MANET community consisting of mobile users with social network properties. In such a file sharing system, nodes meet and exchange requests and files in the format of text in different interest categories. Interest of each node is dynamic and can vary drastically depending on the query search by time. Since time factor may affect the basic interest of a node as prolonged searching for a particular interested thing is liked by user. This interest extraction scheme is dynamic and the communities it belong differ based on the social contact the particular node is having. Query parsing and search strategies in keyword search enables lightweight efficient search towards community Nodes. The sharing among different community peoples, is performed by without revealing the sender and receiver identity.
Agents in network management
2000
Abstract The ubiquity and complexity of modern networks require automated management and control. With increases in scale, automated solutions based on simple data access models such as SNMP will give way to more distributed and algorithmic techniques. This article outlines present and near-term solutions based on the ideas of active networks and mobile agents, which permit sophisticated programmable control and management of ultra large scale networks.
Related topics
Related papers
On the Performance of Distributed Search by Mobile Agents
Lecture Notes in Computer Science, 2004
When using mobile agents in distributed search, the overall performance is influenced by several factors. In this paper, we study some of them and their impact. Several experiments were carried out to study the impact of network size, network topology, and the number of agents. These experiments were performed on two well-known mobile agent platforms: AGLET (a commercial environment), and TACOMA (an academic research environment). The results shed some light on the nature of the functional dependency of performance on these factors. Moreover, the experiments show that, except for the scale, the results are platform independent.
Search in the Universe of Big Networks and Data
Abstract—Searching in the Internet for some object characterised by its attributes in the form of data, such as a hotel in a certain city whose price is less than something, is one of our most common activities when we access the Web. We discuss this problem in a general setting, and compute the average amount of time and the energy it takes to find an object in an infinitely large search space. We consider the use of N search agents which act concurrently. Both the case where the search agent knows which way it needs to go to find the object, and the case where the search agent is perfectly ignorant and may even head progressively away from the object being sought.We show that under mild conditions regarding the randomness of the search and the use of a time-out, the search agent will always find the object despite the fact that the search space is infinite. We obtain a formula for the average search time and the average energy expended by N search agents acting concurrently and independently of each other. We see that the time-out itself can be used to minimise both the search time, and the amount of energy that is consumed to find an object. A simple approximate formula is derived for the number of search agents that can help us guarantee that an object is found in a given time, and discuss how the competition between search agents and other agents that try to hide the data object, can be used by opposing parties to guarantee their own success.
WhitePaper search computing
Search has become an important and necessary component of many diverse ICT applications. A large number of business and application areas depend on the efficiency and availability of search techniques that are capable to process and retrieve heterogeneous and dispersed data. These include: a) the Web, b) mobile devices and applications, c) social networks and social media, and d) enterprise data access and organization. The objective of this document is to provide an overview of the business areas, the research challenges and the socio-economic aspects related to “Search Computing”.
An Application for Resource Discovery in a Peer to Peer Network using Mobile Agents
2014
— This paper aims to present an application for resource discovery in a peer to peer network using mobile agents. Mobile agent technology offers a new computing paradigm in which a program, in the form of a mobile agent, can suspend its execution on a host machine and migrate to another agent enabled target machine and continue its execution there. A discovery algorithm to retrieve resources from peer machines has been developed which uses Mobile Agents written in Java and can be used in data intensive applications where data is remotely located and owned by remote service providers. Keywords—mobile agents, aglets, clone, resource discovery, peer to peer network, itinerary I.
Comparing performance of two mobile agent platforms in distributed search
Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004)., 2004
In this paper, we study the performance behavior of two mobile agent platforms (AGLET and TACOMA) in distributed search. The search problem is analyzed from two different standpoints: the single agent search and multiple agents search. Several experimental were carried out to measure the performance of mobile agents solution to distributed search problem under variable network size, network topology and number of agents. The results indicate that the two mobile agent platforms have similar behavior but their performance varies with underling implementation, and the multiple agents approach performs better than the single agent approach in large networks.
An Annotated Bibliography of Mobile Agents in Networks
2002
Sriraman, Sandhya, An Annotated Bibliography of Mobile Agents in Networks. Master of Science (Computer Science), December 2002, 254 pp., 2 tables, 34 figures, 212 titles. The purpose of this thesis is to present a comprehensive colligation of applications of mobile agents in networks, and provide a baseline association of these systems. This work has been motivated by the fact that mobile agent systems have been deemed proficuous alternatives in system applications. Several mobile agent systems have been developed to provide scalable and cogent solutions in network-centric applications. This thesis examines some existing mobile agent systems in core networking areas, in particular, those of network and resource management, routing, and the provision of fault tolerance and security. The inherent features of these systems are discussed with respect to their specific functionalities. The applicability and efficacy of mobile agents are further considered in the specific areas mentioned above. Although an initial foray into a collation of this nature, the goal of this annotated bibliography is to provide a generic referential view of mobile agent systems in network applications.
Oriented Multicast Routing Applied to Network Level Agent Search
Discrete mathematics & theoretical computer science DMTCS
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.
Mobile Agents in Distributed Environment for
Information Retrieval
With increase in amount of information being stored in remote locations, there is a need to have an efficient method that facilitates information retrieval. Most information retrieval operations use client server architecture which ends up taking much of bandwidth. Client server architecture moves data during operation and this takes too much bandwidth. This paper discusses mobile agents which present an ideal method that can be used in information retrieval due their ability to move the code instead of data and this property makes them suitable in saving bandwidth. Mobile agent is a technology generating a lot of interest due to its benefits in areas such as ecommerce, information retrieval. Mobile agent is a program that acts on behalf of the user and it is capable of moving from one location to another and performs action. The experiment was carried out to compare the performance of mobile agents and client server method in which it was found that mobile agents formed better that client server. General Terms Mobile Agents, distributed systems, information searching.
Mobile agents for network management
IEEE Communications Surveys & Tutorials, 1998
In this paper, we discuss the potential uses of mobile agents in Network Management. We define software agents and a navigation model, which determines agent mobility. We list a number of potential advantages and disadvantages of mobile agents. We include a short commentary on the ongoing standardization activity. The core of the paper comprises descriptions of several actual and potential applications of mobile agents in the five OSI functional areas of Network Management. A brief review of other research activity in the area and a brief prospectus for the future conclude the presentation.
Oriented Multicast Routing Algorithm 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 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.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.