Showing papers on "Network management published in 2002"

Optimizing sensor networks in the energy-latency-density design space

Abstract: In wireless sensor networks, energy efficiency is crucial to achieving satisfactory network lifetime. To reduce the energy consumption significantly, a node should turn off its radio most of the time, except when it has to participate in data forwarding. We propose a new technique, called sparse topology and energy management (STEM), which efficiently wakes up nodes from a deep sleep state without the need for an ultra low-power radio. The designer can trade the energy efficiency of this sleep state for the latency associated with waking up the node. In addition, we integrate STEM with approaches that also leverage excess network density. We show that our hybrid wakeup scheme results in energy savings of over two orders of magnitude compared to sensor networks without topology management. Furthermore, the network designer is offered full flexibility in exploiting the energy-latency-density design space by selecting the appropriate parameter settings of our protocol.

Energy-aware routing in cluster-based sensor networks

Abstract: There has been a growing interest in the applications of sensor networks. Since sensors are generally constrained in on-board energy supply, efficient management of the network is crucial in extending the life of the sensor. We present a novel approach for energy-aware and context-aware routing of sensor data. The approach calls for network clustering and assigns a less-energy-constrained gateway node that acts as a centralized network manager. Based on energy usage at every sensor node and changes in the mission and the environment, the gateway sets routes for sensor data, monitors latency throughout the cluster, and arbitrates medium access among sensors. Simulation results demonstrate that our approach can achieve substantial energy saving.

Managing Networks: Propositions on What Managers Do and Why They Do It

Abstract: Measuring management in networks is difficult because the allocation of managerial resources in network structures is fluid—that is, the utilization of management behaviors varies across time and space within a given program or project As a means of focusing the network management research agenda, propositions based in contingency logic are suggested to test ideas regarding when, why, and how network managers undertake these behaviors The propositions are intended to identify the vast inventory of network management behaviors and, most importantly, determine how the manager strategically matches behaviors with the governing context Suggestions are also offered to help us understand how and why managerial resources are re allocated over time and space The proposed research agenda is offered as a guide to help us determine which choices are most likely to be effective

The role of optical CDMA in access networks

Abstract: We investigate the possible role of optical CDMA (O-CDMA) in future access networks. We begin with a short review of the O-CDMA technique for those unfamiliar with the technology. Next, we investigate in detail those characteristics of O-CDMA that make it an attractive technology for application in metro access networks: fairness, flexibility, simplified network control and management, service differentiation, and increased security. Although O-CDMA has many favorable attributes, it also has several actual or perceived drawbacks. We discuss the technical, economic, and perception barriers that may have limited the widescale deployment of O-CDMA access networks. We try to determine which of these drawbacks may be surmountable in the near future and which may be true "showstoppers".

A novel distributed dynamic location management scheme for minimizing signaling costs in Mobile IP

Abstract: Mobile IP is a simple and scalable global mobility solution. However, it may cause excessive signaling traffic and long signaling delay. Mobile IP regional registration is proposed to reduce the number of location updates to the home network and to reduce the signaling delay. This paper introduces a novel distributed and dynamic regional location management for Mobile IP where the signaling burden is evenly distributed and the regional network boundary is dynamically adjusted according to the up-to-date mobility and traffic load for each terminal. In our distributed system, each user has its own optimized system configuration which results in the minimal signaling traffic. In order to determine the signaling cost function, a new discrete analytical model is developed which captures the mobility and packet arrival pattern of a mobile terminal. This model does not impose any restrictions on the shape and the geographic location of subnets in the Internet. Given the average total location update and packet delivery cost, an iterative algorithm is then used to determine the optimal regional network size. Analytical results show that our distributed dynamic scheme outperforms the IETF Mobile IP regional registration scheme for various scenarios in terms of reducing the overall signaling cost.

Simplifying network administration using policy-based management

Abstract: The management of network infrastructure in an enterprise is a complex and. daunting affair. In an era of increasing technical cornplexity, it is becoming difficult to find trained personnel who can manage the new features introduced into the various servers, routers, and switches. Policy-based network management provides a means by which the administration process can be simplified and largely automated. In this article we look at a general policy-based architecture that can be used to simplify several new technologies emerging in the context of IP networks. We explain how network administration can be simplified by defining two levels of policies, a business level and a technology level. We discuss how business-level policies are validated and transformed into technology-level policies, and present some algorithms that can be used to check for policy conflicts and unreachable policies. We then show how to apply this architecture to two areas: managing performance service level agreements, and supporting enterprise extranets using IPSec communication.

Method and system for encrypted network management and intrusion detection

Abstract: A network security system includes a system data store capable of storing a variety of data associated with an encrypted computer network and communications transmitted thereon, a communication interface supporting communication over a communication channel and a system processor. Data corresponding to communications transmitted over the encrypted communication network are received. One or more tests are applied to the received data to determine whether a particular communication represents a potential security violation. An alarm may be generated based upon the results of the applied test or tests.

Energy aware network management

Abstract: A method of managing a network of sensors in an energy aware manner includes the steps of clustering the sensors to minimize energy consumption, routing the network (step 44), modeling the energy available at each sensor (step 45), and re-routing the network (step 47) when the sensor battery level drops to a predetermined value, or when the energy model is adjusted because it deviates from a sensor's actual energy state.

Event notification in storage networks

Abstract: A heterogeneous network includes network related hardware and software products from a plurality of vendors The network includes a storage system configured to store data, a server configured to process requests, a switch coupling the storage system and the server for data communication, and a network manager including an event dictionary to interpret an event message received from a device experiencing failure

Communicating data through a network so as to ensure quality of service

Abstract: Techniques for communicating data through a network so as to satisfy various Quality Of Service (“QOS”) levels are described. The QOS levels may be selected based on a determined type of the data or the data communication, such as by a network manager after the data communication is registered, and QOS communication parameters are selected for the data communication to ensure that the QOS levels are achieved. Other techniques may also be used to ensure that a selected QOS level is achieved, including selecting an appropriate path through the network, controlling other data communications that use some or all of the selected path, and/or enabling preemption of such other data communications. QOS levels that are actually achieved may also be monitored, and the QOS communication parameters and/or path for a data communication may be dynamically modified based on differences between actual achieved QOS levels and desired QOS levels.

GMPLS-based photonic multilayer router (Hikari router) architecture: an overview of traffic engineering and signaling technology

Abstract: A new extended signaling and traffic engineering method for the GMPLS-based photonic and electrical multilayer router (Hikari router) is proposed. The method allows dynamic optical network management and photonic signal recovery, such as regeneration, reshaping, etc., to be realized adaptively. Wavelength conversion is also adaptive, which reduces network cost. Multilayer traffic engineering, which yields the dynamic cooperation of IP and photonic layers, is described to provide IP services cost effectively. To realize multilayer traffic engineering, we propose the OSPF extension, which advertises both the number of total wavelengths and the number of unused wavelengths, and the RSVP-TE extension, which minimizes the number of wavelength conversions needed. In addition, this paper proposes a heuristics-based multilayer topology design scheme that uses IP traffic measurements in a generalized multi-protocol label switch (GMPLS). The proposed scheme yields the optical label switch path (OLSP) network topology, that is, OLSP placement, that minimizes network cost, in response to fluctuations in IP traffic demand. In other words, the OLSP network topology is dynamically reconfigured to match IP traffic demand. Networks are reconfigured by the proposed scheme so as to utilize network resources in the most cost effective manner.

Application-specific Network Management for Energy-Aware Streaming of Popular Multimedia Formats

Abstract: The typical duration of multimedia streams makes wireless network interface (WNIC) energy consumption a particularly acute problem for mobile clients. In this work, we explore ways to transmit data packets in a predictable fashion; allowing the clients to transition the WNIC to a lower power consuming sleepstate. First, we show the limitations of IEEE 802.11 power saving mode for isochronous multimedia streams. Without an understanding of the stream requirements, they do not offer any energy savings for multimedia streams over 56 kbps. The potential energy savings is also affected by multiple clients sharing the same access point. On the other hand, an application-specific server side traffic shaping mechanism can offer good energy saving for all the stream formats without any data loss. We show that the mechanism can save up to 83% of the energy required for receiving data. The technique offers similar savings for multiple clients sharing the same wireless access point. For high fidelity streams, media players react to these added delays by lowering the stream fidelity. We propose that future media players should offer configurable settings for recognizing such energy-aware packet delay mechanisms.

Management Information Base (MIB) for the Simple Network Management Protocol (SNMP)

Abstract: This document defines managed objects which describe the behavior of a Simple Network Management Protocol (SNMP) entity. This document obsoletes RFC 1907, Management Information Base for Version 2 of the Simple Network Management Protocol (SNMPv2).

A Stackelberg Network Game with a Large Number of Followers

Abstract: We consider a hierarchical network game with multiple links, a single service provider, and a large number of users with multiple classes, where different classes of users enter the network and exit it at different nodes. Each user is charged by the service provider a fixed price per unit of bandwidth used on each link in its route, and chooses the level of its flow by maximizing an objective function that shows a tradeoff between the disutility of the payment to the service provider and congestion cost on the link the user uses, and the utility of its flow. The service provider, on the other hand, wishes to maximize the total revenue it collects. We formulate this problem as a leader-follower (Stackelberg) game, with a single leader (the service provider, who sets the price) and a large number of Nash followers (the users, who decide on their flow rates). We show that the game admits a unique equilibrium, and obtain the solution in analytic form. A detailed study of the limiting case where the number of followers is large reveals a number of interesting and intuitive properties of the equilibrium, and answers the question of whether and when the service provider has the incentive to add additional capacity to the network in response to an increase in the number of users on a particular link.

Intelligent caching and network management based on location and resource anticipation

Abstract: A system (100) for intelligent caching and network management. The system (100) includes event and time information (102) representing a user's schedule, a location database (106) including information about destination devices (110) and capabilities of the destination devices (110), a predictor (104) which receives the event and time information (102) and the information and capabilities of the destination devices to predict a location of the user and/or resources needed at the location, such that the resources are transferred to the user at a location when and where the resources are needed. User preference profiles (108), which include user preference information, are further employed by the predictor (104) to predict a location of the user and/or resources needed at the location.

100 Gb/s optical time-division multiplexed networks

Abstract: We present ultrafast slotted optical time-division multiplexed networks as a viable means of implementing a highly capable next-generation all-optical packet-switched network. Such a network is capable of providing simple network management, the ability to support variable quality-of-service, self-routing of packets, scalability in the number of users, and the use of digital regeneration, buffering, and encryption. We review all-optical switch and Boolean logic gate implementations using an ultrafast nonlinear interferometers (UNIs) that are capable of stable, pattern-independent operation at speeds in excess of 100 Gb/s. We expand the capability provided by the UNI beyond switching and logic demonstrations to include system-level functions such as packet synchronization, address comparison, and rate conversion. We use these advanced all-optical signal processing capabilities to demonstrate a slotted OTDM multiaccess network testbed operating at 112.5 Gb/s line rates with inherent scalability in the number of users and system line rates. We also report on long-haul propagation of short optical pulses in fiber and all-optical 3R regeneration as a viable cost-effective means of extending the long-haul distance of our OTDM network to distances much greater than 100 km.

Method and apparatus for updating network device configuration information in a network management system

Abstract: A managed network device maintains running configuration information, and changes the information in response to configuration change requests from a network management system (NMS) at a first interface and configuration change requests received from outside the NMS at a second interface, which may include a command line interface and dial-up connection such as TELNET Configuration information for the device is maintained in a database in the NMS, and can become outdated due to the configuration change requests received at the second interface To update the information in the NMS database, the NMS sends an upload configuration request to the network device, which responds by transferring a configuration file containing the running configuration information to the NMS The NMS uses the contents of the uploaded configuration file to update the information in the NMS database The synchronization process can be initiated by a network management client in the NMS in response to input from a user, and can also be initiated via a trap message from the network device at power-up or upon insertion or removal of a circuit card The configuration file may have an extensible format, for example by using the Extensible Markup Language (XML)

Traffic manager, gateway signaling and provisioning service for all packetized networks with total system-wide standards for broadband applications including all legacy services

Abstract: Broadband integrated services are performed via digital, channelized or optically coded networks by a system which organizes, interfaces, provisions, loads and controls, in real time, the transport of grouped or organized information (such as packetized cell data) through interface access devices and packet switches that are compliant with domestic and international communication standards. A packet core network includes multiple packet switches and interface access devices coupled to an existing narrowband or broadband network. A signaling manager, a provisioning manager and a traffic manager perform all broadband and narrowband routing, port provisioning and connecting functions for all network devices. A set of software interface modules for each equipment vendor allows the provisioning manager, the signaling manager and the traffic manager to impose control demands and make network management decisions on a real time basis via an application protocol interface. Bit error rate caused by the disparity between low speed (such as TDM) networks and high speed (such as OCR) networks is substantially reduced by synchronizing the overall network and all switching components to a primary reference clock that has an accuracy of 1×10 −11 second per month or better.

Extracting origin destination information from mobile phone data

Abstract: Traffic origin destination data is one of the most important pieces of information required for effective network management and strategic planning. Origin destination (OD) matrices provide an estimate of the number of vehicles travelling between points on a network over a given period of time. Accurate origin destination matrices are required in assignment models, but have a wide variety of other uses. At TRL both the assignment model CONTRAM8 and the microscopic simulation model SISTM require OD matrices as input, as do almost all existing traffic models. For future applications, the Highways Agency are likely to require a national OD matrix, covering the trunk road network in the UK.

SEC - a lightweight event correlation tool

Abstract: Event correlation has become one of the most important techniques in today's network management, and there is a clear trend to extend its use to other application domains as well. Unfortunately, existing event correlation systems are often platform-dependent and heavyweight solutions that have complicated design, being therefore difficult to deploy and maintain, and requiring extensive user training. Their complexity and size makes them often unfeasible to apply for smaller networks and for smaller event correlation tasks. Also, some systems are cumbersome to use outside the domain of network fault management. In addition, commercial event correlation products tend to be quite expensive. In this paper the author presents a lightweight, open-source, and platform independent tool for rule-based event correlation called SEC (simple event correlator), and describes its application experience.

Analysis of dynamic location management for PCS networks

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.

Systems and methods for managing wireless communications using link space information

Abstract: Disclosed are systems and methods which provide for management of wireless communications through the development and use of link space information. Such link space information provides link-centric information with respect to wireless links of a network to thereby provide a view of the network which takes into account phenomena affecting the wireless links. Utilizing such link space information, automated management of various aspects of a wireless network may be provided, including automated provisioning, management, and/or optimization of network links. Network operations may include use of link space information in providing network management applications such as automatic fault management, automatic performance management, operation advisories, and/or the like.

Method and apparatus for graphically depicting network performance and connectivity

Abstract: A network management software system monitors and displays performance and capacity information about networks and computers using computer graphics similar to weather maps one might see on television. High-resolution color graphics allow the display of thousands of pieces of performance on network information on one computer screen. This allows end users to view computer performance metrics such as processor utilization, disc capacity and application availability, in large network computing environments across thousand of network elements at a glance. Virtually any metric that can be determined from a network element may be displayed. Thus, performance information is collected and displayed to the end user in a color-coded graphical format that also depicts the network as opposed to the traditional tabular format. This eliminates the need for the end-user to “work” the application in an attempt to monitor performance.

Efficient reactive monitoring

Abstract: Networks are monitored in order to ensure that the system operates within desirable parameters. The increasing complexity of networks and services provided by them increases this need for monitoring. Monitoring consists of measuring properties of the network, and of inferring an aggregate predicate from these measurements. Conducting such monitoring introduces traffic overhead that may reduce the overall effective throughput. This paper studies ways to minimize the monitoring communication overhead in IP networks. We develop and analyze several monitoring algorithms that achieve significant reduction in the management overhead while maintaining the functionality. The main idea is to combine global polling with local event driven reporting. The amount of traffic saving depends on the statistical characterization of the monitored data. We indicate the specific statistical factors that affect the saving and show how to choose the right algorithm for the type, of monitored data. In particular, our results show that for Internet traffic our algorithms can save more than 90% of the monitoring traffic.

Routing in Mobile Ad-hoc and Peer-to-Peer Networks A Comparison

Abstract: The goal of this paper is to make the similarities and differences of Peer-to-Peer (P2P) and Mobile Ad Hoc (MANET) networks clear Thus we want to show the synergetic potential hidden in these two decentralized and self organizing networks As well as both networks are established on a different physical layer, both networks hold similarities concerning their routing and network management principles The reason therefore is, that both of them have to solve a similar goal, namely to provide networking functionalities in a completely unmanaged and decentralized environment One of the most interesting tasks in these networks is thus how queries are guided through the network Therefore we concentrate in this work on the different routing algorithms employed in Peer-to-Peer and mobile ad hoc networks Finally, the similarities of both networks can be used, to bring up the synergetic effects of looking at both networks at the same time

Contact center management

Abstract: A network of contact centres is managed by a network management server which allows contact centres (which may be independently run from one another) to register over the Internet or an intranet. Contacts received at a contact centre which is overly busy can be transferred to a different contact centre based on a determination made by the network management unit as to the most suitable agent in the network of contact centres. The network management unit receives events messages from the various contact centres as events occur which impact on the availability of individual agents. In this way, a dynamically updated database at the network management unit can determine the most suitable agent to which a contact should be transferred. The system allows independent contact centres to act as part of a larger network of contact centres without reducing the ability of a given centre to receive and handle contacts independently of one another.

Network management tool for maintaining printing device information

Abstract: A network management tool is programmed to automatically: discover printing devices on a network; record information about the discovered printing devices in a main device list; and organize at least a portion of the information from the main device list, into one or more secondary device lists based upon criteria that define each of the one or more secondary device lists

Managing capacity for telecommunications networks under uncertainty

Abstract: The existing telecommunications infrastructure in most of the world is adequate to deliver voice and text applications, but demand for broadband services such as streaming video and large file transfer (e.g., movies) is accelerating. The explosion in Internet use has created a huge demand for telecommunications capacity. However, this demand is extremely volatile, making network planning difficult. In this paper, modern financial option pricing methods are applied to the problem of network investment decision timing. In particular, we study the optimal decision problem of building new network capacity in the presence of stochastic demand for services. Adding new capacity requires a capital investment, which must be balanced by uncertain future revenues. We study the underlying risk factor in the bandwidth market and then apply real options theory to the upgrade decision problem. We notice that sometimes it is optimal to wait until the maximum capacity of a line is nearly reached before upgrading directly to the line with the highest known transmission rate (skipping the intermediate lines). It appears that past upgrade practice underestimates the conflicting effects of growth and volatility. This explains the current overcapacity in available bandwidth. To the best of our knowledge, this real options approach has not been used previously in the area of network capacity planning. Consequently, we believe that this methodology can offer insights for network management.

DEN-ng: achieving business-driven network management

Abstract: Existing network management architectures suffer from a set of architectural and integration problems. Policy-based management was targeted to solve most of these problems, but its promises have not yet been fully realized. This paper presents a new approach to building network management solutions that is based on a new version of the DEN information model, called DEN-ng. DEN-ng is being designed to solve these problems by providing facilities to translate the business rules and procedures of an organization to the policies that configure and control its networks. Accordingly, the case is made for policy to become more than "just" a means for executing a change in a configuration file. Rather, it should be used to tie together configuration changes with how the changes should be done using a workflow system. This holistically binds business rules to the construction and deployment of configuration changes and their management.

Two-level pointer forwarding strategy for location management in PCS networks

Abstract: For a IPCS network to effectively deliver services to its mobile users, it must have an efficient way to keep track of the mobile users. The location management fulfills this task through location registration and paging. To reduce the signaling traffic, many schemes such as a local anchor (LA) scheme, per-user caching scheme and pointer forwarding scheme have been proposed in the past. In this paper, we present a new location management scheme which intends to mitigate the signaling traffic as well as reduce the tracking delay in the PCS systems. In this strategy, we choose a set of visitor location registers (VLRs) traversed by users as the mobility agents (MA), which form another level of management in order to make some registration signaling traffic localized. The idea is as follows: instead of always updating to the home location register (HLR), which would become the bottleneck otherwise, many location updates are carried out in the mobility agents. Thus, the two-level pointer forwarding scheme is designed to reduce the signaling traffic: pointers can be set up between VLRs as the traditional pointer forwarding scheme and can also be set up between MAs. The numerical results show that this strategy can significantly reduce the network signaling traffic for users with low CMR without increasing much of the call setup delay.