• Title/Summary/Keyword: network agents

Search Result 460, Processing Time 0.024 seconds

Implementation of Network Management by Communicating Mobile Agents with the SNMP Agents (이동 에이전트와 SNMP 에이전트와의 대화를 통한 통신망 관리 구현)

  • Jeon, Byung-Kook
    • Journal of Information Management
    • /
    • v.32 no.1
    • /
    • pp.50-70
    • /
    • 2001
  • As todays's networks are typically heterogeneous and very often comprised of multi-platform, multi-vendor network components, mobile agents have been proposed as a solution to the problem of the management of increasingly heterogeneous networks. Mobile agents are no longer statically resident on managed devices for network management: in contrast, they are migratory, replaceable at any time as necessary, and may be equipped with mini expert systems which can diagnose and fix networks' faults on behalf of the manager. Therefore, in this paper, the MIB browsing facilities for network management using the JAMAS and mobile agents are implemented. That is, the network manager accesses the MIB information through mobile agents with which communicate the SNMP agent of each of managed devices. The implementation performance is also evaluated.

  • PDF

Network Analysis to Describe Service Link for Customized Visiting Health Care Program (맞춤형방문건강관리사업의 지역사회 네트워크 탐색)

  • Jang, Soong-Nang;Cho, Sung-Il
    • Korean Journal of Health Education and Promotion
    • /
    • v.29 no.1
    • /
    • pp.1-11
    • /
    • 2012
  • Objectives: The nurse visiting health service named Customized Visiting Health Care Program(CVHCP) requires the service innovations incorporating community support into a local service network. The purpose of this study was to assess the community network in CVHCP and inform improvement in this network. Methods: We used Social Network Analysis(SNA) in one CVHCP at H city. Network links were generated by self-administered questionnaires by the 14 community resource centers who quantified their links to all other 25 agents on the list. Links were analyzed by a dichotomous scale for any experience of collaboration and a scored scale of 0 to 3 for level of collaboration using UCINET v6. Results: A list of 14 agents was generated, and local network was dominated by the Public Health Center and a local welfare center named Unlimited Care Center(UCC). According to centrality score, UCC was the most prominent agent, and Public Health Center was the most influential agent, being a link in the pathway flow between other agents for 9.5% of contribution. CVHCP scored lower rank of prominent with 30.8% of other agents reported referring to it. Conclusions: Social network analysis provides a useful network description for informing and evaluation service network improvement in maximizing its service for the CVHCP.

XML-Based Network Management for IP Networks

  • Choi, Mi-Jung;Hong, James W.;Ju, Hong-Taek
    • ETRI Journal
    • /
    • v.25 no.6
    • /
    • pp.445-463
    • /
    • 2003
  • XML-based network management, which applies XML technologies to network management, has been proposed as an alternative to existing network management. The use of XML in network management offers many advantages. However, most existing network devices are already embedded with simple network management protocol (SNMP) agents and managed by SNMP managers. For integrated network management, we present the architectures of an XML-based manager, an XML-based agent, and an XML/SNMP gateway for legacy SNMP agents. We describe our experience of developing an XML-based network management system (XNMS), XML-based agent, and an XML/SNMP gateway. We also verify the effectiveness of our XML-based agent and XML/SNMP gateway through performance tests. Our experience with developing XNMS and XML-based agents can be used as a guideline for development of XML-based management systems that fully take advantage of the strengths of XML technologies.

  • PDF

A Super-Peer Coordination Scheme for Decentralized Peer-to-Peer Networking Using Mobile Agents

  • Chung, Won-Ho;Kang, Namhi
    • International journal of advanced smart convergence
    • /
    • v.4 no.2
    • /
    • pp.38-45
    • /
    • 2015
  • Peer-to-Peer(P2P) systems are generally classified into two categories; hybrid and pure P2P. Hybrid systems have a single central index server keeping the details of shared information, so that undesirable effects such as heavy load on that server and lack of fault-tolerance can be caused. Pure P2P causes the other problems such as message flooding and scalability although it shows high degree of fault-tolerance. Recently, mobile agent-based distributed computing has been receiving wide attention for its potential to support disconnected operations, high asynchrony, and thus saving network bandwidth. In this paper, a new scheme of peer coordination is proposed for a decentralized P2P network with self-organizing structure. We deployed mobile agents for incorporating the advantages of usage of mobile agents into our P2P network. Proposed P2P network has both advantages of hybrid and pure P2P. The problems of heavy load on the server and lack of fault-tolerance are improved by using multiple special peers called super-peers. And the problems of pure P2P can be reduced by using mobile agents.

Scalability of a Mobile Agents based Network Management Application

  • Rubinstein, M.G.;Duarte, O.C.M.B.;Pujolle, Guy
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.240-248
    • /
    • 2003
  • This paper analyzes mobile agent performance in network management compared to the client-server model used in the Simple Network Management Protocol (SNMP). Prototypes of an application that gathers MIB-II (Management Information Base-II) variables have been created and tested on a LAN. After acquiring implementation parameters related to network management and to the mobile agent infrastructure, simulation results have been obtained on large topologies similar in shape to the Internet. Response time results show that mobile agents perform better than SNMP when the number of managed elements ranges between two specific limits, an inferior bound and a superior one, determined by the number of messages that pass through a backbone and by the mobile agent size which grows along with MIB-II variables collected on network elements. The results also show that a significant improvement is achieved when the mobile agent returns or sends data to the management station after visiting a fixed number of nodes.

An Efficient Network Management Architecture Usign Mobile Agents on DPE (분산처리환경에서 이동에이전트를 이용한 효율적인 망 관리 구조)

  • 이정환;홍충선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6C
    • /
    • pp.535-543
    • /
    • 2002
  • In order to overcome disadvantages of existing centralized network management systems that use simple objects, dynamic object platforms are proposed as alternative systems. So the distributed network management systems are implemented using various distributed platform such as CORBA and Java-RMI. Subsequently mobile agent-based platforms are proposed. The mobile agent-based platform can additionally provide flexibility and scalability to network management system that CORBA or Java-RMI based platforms do not support. In this paper, we address an architecture to solve the problem of the occurrence of additional traffic by using mobile agent and to save resources of network element. Our proposal in this paper is an efficient network management architecture using motile agents. And we make use of mobile agents for minimizing of traffic that can happen when mobile agents moves. Also we design agents using information architecture of TMN for efficient resource management of network element and improvement of operation performance.

An Energy Efficient Distributed Approach-Based Agent Migration Scheme for Data Aggregation in Wireless Sensor Networks

  • Gupta, Govind P.;Misra, Manoj;Garg, Kumkum
    • Journal of Information Processing Systems
    • /
    • v.11 no.1
    • /
    • pp.148-164
    • /
    • 2015
  • The use of mobile agents for collaborative processing in wireless sensor network has gained considerable attention. This is when mobile agents are used for data aggregation to exploit redundant and correlated data. The efficiency of agent-based data aggregation depends on the agent migration scheme. However, in general, most of the proposed schemes are centralized approach-based schemes where the sink node determines the migration paths for the agents before dispatching them in the sensor network. The main limitations with such schemes are that they need global network topology information for deriving the migration paths of the agents, which incurs additional communication overhead, since each node has a very limited communication range. In addition, a centralized approach does not provide fault tolerant and adaptive migration paths. In order to solve such problems, we have proposed a distributed approach-based scheme for determining the migration path of the agents where at each hop, the local information is used to decide the migration of the agents. In addition, we also propose a local repair mechanism for dealing with the faulty nodes. The simulation results show that the proposed scheme performs better than existing schemes in the presence of faulty nodes within the networks, and manages to report the aggregated data to the sink faster.

A Heuristic Algorithm for Designing Near-Optimal Mobile Agent Itineraries

  • Gavalas Damianos
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.123-131
    • /
    • 2006
  • Several distributed architectures, incorporating mobile agent technology, have been recently proposed to answer the scalability limitations of their centralized counterparts. However, these architectures fail to address scalability problems, when distributed tasks requiring the employment of itinerant agents is considered. This is because they lack mechanisms that guarantee optimization of agents' itineraries so as to minimize the total migration cost in terms of the round-trip latency and the incurred traffic. This is of particular importance when MAs itineraries span multiple subnets. The work presented herein aspires to address these issues. To that end, we have designed and implemented an algorithm that adapts methods usually applied for addressing network design problems in the specific area of mobile agent itinerary planning. The algorithm not only suggests the optimal number of mobile agents that minimize the overall cost but also constructs optimal itineraries for each of them. The algorithm implementation has been integrated into our mobile agent framework research prototype and tested in real network environments, demonstrating significant cost savings.

Anti-air Unit Learning Model Based on Multi-agent System Using Neural Network (신경망을 이용한 멀티 에이전트 기반 대공방어 단위 학습모형)

  • Choi, Myung-Jin;Lee, Sang-Heon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.11 no.5
    • /
    • pp.49-57
    • /
    • 2008
  • In this paper, we suggested a methodology that can be used by an agent to learn models of other agents in a multi-agent system. To construct these model, we used influence diagram as a modeling tool. We present a method for learning models of the other agents at the decision nodes, value nodes, and chance nodes in influence diagram. We concentrated on learning of the other agents at the value node by using neural network learning technique. Furthermore, we treated anti-air units in anti-air defense domain as agents in multi. agent system.

A study of emergent behaviors multiple cooperating agent using learning method (학습기법을 이용한 다중 협동 에이전트의 창발 행동에 관한 연구)

  • 박성수;안동언
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.137-140
    • /
    • 2003
  • This paper proposes a pursuing system utilizing the learning method where multiple cooperating agents emulate social behaviors of animals and insects and realize their group behaviors. Each agent contains sensors to perceive other agents in several directions and decides its behavior based on the information obtained by the sensors. In this paper, a neural network is used fir behavior decision controller. The input of the neural network is decided by the existence of other agents and the distance to the other agents. The output determines the directions in which the agent moves. The connection weight values of this neural network are encoded as genes, and the fitness individuals are determined using a genetic algorithm. Here, the fitness values imply how much group behaviors fit adequately to the goal and can express group behaviors. The validity of the system is verified through simulation.

  • PDF