scispace - formally typeset
Search or ask a question
Topic

Network management

About: Network management is a research topic. Over the lifetime, 17859 publications have been published within this topic receiving 234520 citations. The topic is also known as: computer network management & NM.


Papers
More filters
Proceedings Article
29 Jul 1990
TL;DR: The SharedPlan model of collaborative behavior is modified and expanded and an algorithm for updating an agent's beliefs about a partial SharedPlan is presented and an initial implementation of this algorithm is described in the domain of network management.
Abstract: Agents collaborating to achieve a goal bring to their joint activity different beliefs about ways in which to achieve the goal and the actions necessary for doing so. Thus, a model of collaboration must provide a way of representing and distinguishing among agents' beliefs and of stating the ways in which the intentions of different agents contribute to achieving their goal. Furthermore, in collaborative activity, collaboration occurs in the planning process itself. Thus, rather than modelling plan recognition, per se, what must be modelled is the augmentation of beliefs about the actions of multiple agents and their intentions. In this paper, we modify and expand the SharedPlan model of collaborative behavior (Grosz & Sidner 1990). We present an algorithm for updating an agent's beliefs about a partial SharedPlan and describe an initial implementation of this algorithm in the domain of network management.

99 citations

Journal ArticleDOI
TL;DR: A study of three different approaches to integration based on the spatial and temporal proximity of related information objects in ecological displays developed using an abstraction hierarchy analysis found that the most integrated condition, high-space/high-time, resulted in the fastest and most accurate fault diagnosis performance.
Abstract: Computer displays are being designed for increasingly larger industrial systems. As the application domain scales up, maintaining integration across different kinds of views becomes more challenging. This paper presents the results of a study of three different approaches to integration based on the spatial and temporal proximity of related information objects. The domain used for evaluation was a simulation of an industry-scale conventional power plant. All three displays were ecological displays developed using an abstraction hierarchy analysis. Views were integrated in a high-space/low-time, low-space/high-time, and high-space/high-time integration of means-end related objects. During a fault detection and diagnosis task, it was found that a low level of integration, high-space/ low-time, provided the fastest fault detection time. However, the most integrated condition, high-space/high-time, resulted in the fastest and most accurate fault diagnosis performance. Actual or potential applications of this research include computer displays for large-scale systems such as network management or process control, for which problem solving is critical and integration must be maintained.

99 citations

Proceedings ArticleDOI
22 Aug 2014
TL;DR: A Distributed and Collaborative Monitoring system, named DCM, that allows switches to collaboratively achieve flow monitoring tasks and balance measurement load and is able to perform per-flow monitoring, by which different groups of flows are monitored using different actions.
Abstract: Network traffic monitoring supports fundamental network management tasks However, monitoring tasks introduce non-trivial overhead to network devices such as switches We propose a Distributed and Collaborative Monitoring system, named DCM, with the following properties First, DCM allows switches to collaboratively achieve flow monitoring tasks and balance measurement load Second, DCM is able to perform per-flow monitoring, by which different groups of flows are monitored using different actions Third, DCM is a memory-efficient solution for switch data plane and guarantees system scalability DCM uses novel two-stage Bloom filters to represent monitoring rules using small memory space It utilizes the centralized SDN control to install, update, and reconstruct the two-stage Bloom filters in the switch data plane We study how DCM performs two representative monitoring tasks, namely flow size counting and packet sampling, and evaluate its performance Experiments using real data center and ISP traffic data on real network topologies show that DCM achieves highest measurement accuracy among existing solutions given the same memory budget of switches

99 citations

Journal ArticleDOI
TL;DR: RMTP-II builds on a rich field of existing work, and adds to it the following novel contributions: it differentiates the roles of the nodes in the protocol, provides algorithms for smoothing and control of the return (TRACK) traffic, and provides explicit support for highly asymmetrical networks.
Abstract: This document provides an overview of the reliable multicast transport protocol II, RMTP-II. RMTP-II is a reliable multicast protocol, designed to reliably and efficiently send data from a few senders to large groups of simultaneous recipients. It works over both symmetric networks and asymmetrical network topologies such as those provided by satellite, cable modem, or ADSL carriers. Before sending, each sender must connect with a trusted top node to receive permission and control parameters for its data stream. The top node provides network managers with a single point of control for the senders, allowing them to monitor and control the traffic being sent. RMTP-II builds on a rich field of existing work, and adds to it the following novel contributions. It differentiates the roles of the nodes in the protocol, provides algorithms for smoothing and control of the return (TRACK) traffic, and provides explicit support for highly asymmetrical networks. It provides explicit network management controls through a centralized point of control, a fully distributed membership protocol that enables positive confirmation of data delivery, and fault recovery algorithms which are integrated to the reliability semantics of the protocol. It includes a novel reliability level called time bounded reliability, and offers a unique combination of TRACKs, NACKs, and FEC for increased scalability and real-time performance. Finally, it integrates distributed algorithms for RTT calculation to each receiver, and provides automatic configuration of receiver nodes.

99 citations

Journal ArticleDOI
TL;DR: A new analytical model is established available for the analysis of the important dynamic movement-based location management method for PCS networks with real HLR/VLR architecture.
Abstract: Location management is a key issue in personal communication service (PCS) networks. Performance analysis plays important roles in the implementation of location management methods and system design in PCS networks. Existing PCS networks have the home location registers (HLRs) and visitor location registers (VLRs) architecture for location management. Some interesting dynamic location management methods are proposed to improve the system performance of PCS networks. However, the existing performance analysis of the dynamic location management methods are too simple and not available for PCS networks with real HLR/VLR architecture. One of the reasons is the complexity and difficulty of the problem. In this paper, we challenge the problem and successfully establish a new analytical model available for the analysis of the important dynamic movement-based location management method for PCS networks.

98 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
90% related
Wireless network
122.5K papers, 2.1M citations
89% related
Wireless ad hoc network
49K papers, 1.1M citations
88% related
Server
79.5K papers, 1.4M citations
88% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
88% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202348
2022147
2021446
2020649
2019774
2018842