The authors have defined information models for power systems and devices based on object oriented technology, and designed Global and Local information models. The Global information model is used for EMS/SCADA and p...
详细信息
ISBN:
(纸本)0780375254
The authors have defined information models for power systems and devices based on object oriented technology, and designed Global and Local information models. The Global information model is used for EMS/SCADA and power systems operation in the control center, and the Local information model represents the behavior of components and devices in the power station and/or substation. Similar information models are being developed by IEC-TC57 as IEC61970 and IEC61850, and by EPRI as CCAPI and UCA2.0, aiming for standardization of open and multi-vendor systems integrated by cooperating EMS/SCADA systems, or equipment and devices. The information models are based on those of IEC and EPRI, and they are expanded for distributed processing in network environments. The authors implemented IEC61970 as the Global information model and IEC61850 as the Local information model with Java Class library. Also, the authors developed a prototype system that consists of a personal computer (PC) as control center, and 2 PCs as substations, and a network computing terminal with current and voltage sensors as another substation. The authors implemented agent applications for simple SCADA and simulation of the power systems devices (ex. Power Transformer, Circuit Breaker) to evaluate the cooperation between agent applications and the information model, and proved the usefulness of the information model. The authors examined the functional expansions for distributed environments, and clarified their ease of implementation and effectiveness.
open Shortest Path First (OSPF) is a popular protocol for routing within an Autonomous System (AS) domain. In order to scale for large networks containing hundreds and thousands of subnets, OSPF supports a two-level h...
详细信息
ISBN:
(纸本)0780374762
open Shortest Path First (OSPF) is a popular protocol for routing within an Autonomous System (AS) domain. In order to scale for large networks containing hundreds and thousands of subnets, OSPF supports a two-level hierarchical routing scheme through the use of OSPF areas. Subnet addresses within an area are aggregated, and this aggregation is a crucial requirement for scaling OSPF to large AS domains, as it results in significant reductions in routing table sizes, smaller link-state databases, and less network traffic to synchronize the router link-state databases. On the other hand, address aggregation also implies loss of information about the length of the shortest path to each subnet, which in turn, can lead to suboptimal routing. In this paper, we address the important practical problem of configuring OSPF aggregates to minimize the error in OSPF shortest path computations due to subnet aggregation. We first develop an optimal dynamic programming algorithm that, given an upper bound k on the number of aggregates to be advertised and a weight-assignment function for the aggregates, computes the k aggregates that result in the minimum cumulative error In the shortest path computations for all source-destination subnet pairs. Subsequently, we tackle the problem of assigning weights to OSPF aggregates such that the cumulative error in the computed shortest paths is minimized. We demonstrate that, while for certain special cases (e.g., unweighted cumulative error) efficient optimal algorithms for the weight-assignment problem can be devised, the general problem itself is NP-hard. Consequently, we have to rely on search heuristics to solve the weight-assignment problem. To the best of our knowledge, our work is the first to address the algorithmic issues underlying the configuration of OSPF aggregates and to propose efficient configuration algorithms that are provably optimal for many practical scenarios.
Future communication networks will carry many WDM channels at very high bit rate. Thus, it is desirable to avoid electronic switching at the core. The all-optical backbone network can be interconnected by optical cros...
详细信息
ISBN:
(纸本)081944698X
Future communication networks will carry many WDM channels at very high bit rate. Thus, it is desirable to avoid electronic switching at the core. The all-optical backbone network can be interconnected by optical cross-connects at strategic locations to allow for flexible capacity provisioning and fault-tolerant rerouting. Such an all-optical core layer nicely decouples the long-term capacity planning problem from the short-term dynamic bandwidth allocation problem which can be better tackled in the electronic domain. An essential requirement for the all-optical core layer is that it must be fully fault-tolerant, otherwise, a single failed link can cause a disaster for the entire network. We consider the problem of how to allocate the required capacities and spare capacities on a given all-optical core network so as to make the network fully single-fault (or multi-faults) tolerant. The objective function is the total cost of the spare fibers. Based on a given traffic requirement on all source-destination pairs, the optimal bandwidth requirement for each link in the given topology is first computed. We then consider link failures one-by-one for the entire network. For each link failure, we show how spare capacity can be added in other links so as to take advantage of existing spare capacities that have already been added. The algorithm is based on the shortest path routing algorithm and has a polynomial time complexity. Preliminary investigations suggest that the algorithm can give results comparable to those obtained by integer programming.
This paper describes a security framework in distributed systems where an Intelligent Agent handles the security monitoring at each host. The agents are made responsible for alerting the system administrators about an...
详细信息
This paper describes a security framework in distributed systems where an Intelligent Agent handles the security monitoring at each host. The agents are made responsible for alerting the system administrators about an attempted intrusion or misuse for a particular system. Recently, there has been an increase in the number of reports of the attacks, which are wide spread across the network and affecting a chain of systems before they attack the actual target system. To detect such attacks, the amount of information associated within a single isolated system is inadequate for an agent to confirm an intrusion. Therefore, the need for a framework that allows the agents to negotiate with their co-agents to share information about an intrusion, thereby aiding in effective handling of Intrusion Detection is emphasized. Our design aims at developing such a framework in the FIPA-OS (Foundation for Intelligent Physical Agents - open Source) environment, which provides most of the source code for building agents on its platform. The concept of mutual co-operation among agents has been developed as a means of queries. These queries are carried out by tasks associated with each agent. The protocols to support these interactions by means of queries are explained. The issues and requirements involved in standardizing formats, interaction protocols and architectures to co-manage intrusion detection are discussed.
We study the topology design of an important subset of mesh network-regular mesh network in the context of wavelength division multiplex (WDM) metropolitan area network (MAN). We find that minimum hop distance is an i...
详细信息
We study the topology design of an important subset of mesh network-regular mesh network in the context of wavelength division multiplex (WDM) metropolitan area network (MAN). We find that minimum hop distance is an important parameter in dimensioning both the network's physical size but also the network node resources required to support the ever increasing traffic demand. By assigning realistic cost structures to these network nodes and link resources, we are able to specify the optimal node degrees analytically for interesting classes of good regular topologies as the networks scale in size.
Problem frames provide a means of analyzing and decomposing problems. They emphasise the world outside of the computer, helping the developer to focus on the problem domain, instead of drifting into inventing solution...
详细信息
Problem frames provide a means of analyzing and decomposing problems. They emphasise the world outside of the computer, helping the developer to focus on the problem domain, instead of drifting into inventing solutions. However, even modestly complex problems can force us into detailed consideration of the architecture of the solution. This is counter to the intention of the problem frames approach, which is to delay consideration of the solution space until a good understanding of the problem is gained. We therefore extend problem frames, allowing architectural structures, services and artifacts to be considered as part of the problem domain. Through a case study, we show how this extension enhances the applicability of problem frames in permitting an architecture-based approach to software development. We conclude that, through our extension, the applicability of problem frames is extended to include domains with existing architectural support.
The proceedings contain 35 papers. The special focus in this conference is on System Modeling, Architecture, Distance Learning System Engineering, Collaborative Systems and Experiences in Distance Learning. The topics...
ISBN:
(纸本)3540440410
The proceedings contain 35 papers. The special focus in this conference is on System Modeling, Architecture, Distance Learning System Engineering, Collaborative Systems and Experiences in Distance Learning. The topics include: An open framework for smart and personalized distance learning;a metadata framework for description of learning objects;a web-based motivation-supporting model for effective teaching-learning;the design and implementation of a web-based teaching-learning model for information communication technology application education;on analysis and modeling of student browsing behavior in web-based asynchronous learning environments;conceptual network based courseware navigation and web presentation mechanisms;web-based knowledge-based system on liquid retaining structure design as instructional tool;creating a revolutionary real-time interactive distance learning system;critical success factors for web-based organizational IT training systems;application of quality assurance in web-based laboratories;an educational community using collaborative virtual environments;a component-based architecture for adaptive, collaborative web-based learning;virtual programming lab for online distance learning;experiences in running a flexible, web-based, and self-paced course;virtual teaching and learning based on multimedia techniques;experiences in developing a large-scale school IT project;a web-based lecture video database system with flexible indexing method using action logs;design and evaluation of lecture support functions for question databases;web-based video indexing and retrieval for teaching and learning;multimedia knowledge exploitation for E-learning and web-based interactive 3D visualization for computer graphics education.
This paper reports progress on creating a case-based implementation of the well-known Snort intrusion detection system. Snort is a simple rule-based system that is known to suffer limitations, including both failure t...
详细信息
This paper reports progress on creating a case-based implementation of the well-known Snort intrusion detection system. Snort is a simple rule-based system that is known to suffer limitations, including both failure to detect certain kinds of intrusions and the frequent raising of false alarms. We believe that a case-based reasoning approach can provide a framework in which to incorporate more sophisticated artificial intelligence techniques that will help overcome some of these limitations. In addition, the present system is intended to apply more generally to other aspects of network security, as well as other domains related to protecting the nation's critical infrastructure. The system is being built using the modern software engineering technique known as "adaptive" or "reflective architectures," which will make it easily adaptable to other kinds of problem domain.
open shortest path first (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In this paper, we address the important practical problem of configuring OSPF aggregates to minimize the error...
详细信息
open shortest path first (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In this paper, we address the important practical problem of configuring OSPF aggregates to minimize the error in OSPF shortest path computations due to subnet aggregation. We first develop an optimal dynamic programming algorithm that, given an upper bound k on the number of aggregates to be advertised and a weight-assignment function for the aggregates, computes the k aggregates that result in the minimum cumulative error in the shortest path computations for all source-destination subnet pairs. Subsequently, we tackle the problem of assigning weights to OSPF aggregates such that the cumulative error in the computed shortest paths is minimized. We demonstrate that, while for certain special cases (e.g., unweighted cumulative error) efficient optimal algorithms for the weight-assignment problem can be devised, the general problem itself is /spl Nscr//spl Pscr/-hard. Consequently, we have to rely on search heuristics to solve the weight-assignment problem. To the best of our knowledge, our work is the first to address the algorithmic issues underlying the configuration of OSPF aggregates and to propose efficient configuration algorithms that are provably optimal for many practical scenarios.
The proceedings contain 13 papers. The topics discussed include: lightweight, dynamic and programmable virtual private networks;NetTap: an efficient and reliable pc-based platform for networkprogramming;accelerating ...
ISBN:
(纸本)0780362683
The proceedings contain 13 papers. The topics discussed include: lightweight, dynamic and programmable virtual private networks;NetTap: an efficient and reliable pc-based platform for networkprogramming;accelerating service creation and deployment in mobile networks;tags for high performance active networks;seraphim: dynamic interoperable security architecture for active networks;exposing the network: support for topology-sensitive applications;lightweight policing and charging for packet networks;a reliability model for distributed adaptation;the pronto platform: a flexible toolkit for programmingnetworks using a commodity operating system;a scalable architecture for active networks;and a new dynamic architecture for an active network.
暂无评论