The ATM Forum's PNNI (private network node interface) standard specifies a flooding mechanism to distribute topological state information amongst nodes participating in a PNNI network. While the flooding mechanism...
详细信息
The ATM Forum's PNNI (private network node interface) standard specifies a flooding mechanism to distribute topological state information amongst nodes participating in a PNNI network. While the flooding mechanism provides robust topology distribution, we show by simulation, that it can disproportionately overload lower-bandwidth links and, due to its inherent redundancy, can generate considerable computational overheads due to the processing of redundant topology updates. To address these issues, we introduce the hybrid spanning tree algorithm, a spanning tree-based topology distribution mechanism that has low computational maintenance and can support policy that restricts topology distribution control traffic from being carried over lower-bandwidth links. Unlike other spanning tree proposals, the hybrid spanning tree algorithm provides a simple and practical migration path to smoothly transition PNNI nodes executing the flooding algorithm to that of the hybrid spanning tree algorithm.
The paper presents our state sharing support for building object oriented interactive groupware in wide area distributed environments. We motivate and present an asynchronous model for updating replicated state, which...
详细信息
The paper presents our state sharing support for building object oriented interactive groupware in wide area distributed environments. We motivate and present an asynchronous model for updating replicated state, which supports atomicity of updates across multiple shared objects. Coupled with our flexible marshalling framework, this model allows existing application data structure classes to be easily extended and made shareable. To solve the problem of replica consistency we use a novel combination of three mechanisms: (1) global locks, (2) detection of incorrect update ordering, and (3) cloning a subset of the shared objects and state reinitialization. Finally, to reduce network load due to fine grain user interaction, we provide a framework for application specified event batching called Late Event Modification.
This paper introduces a new concept and model for building complex ATE systems. The underlying principles were discovered over several years but were driven home by the difficulty found in modernizing a legacy test sy...
详细信息
This paper introduces a new concept and model for building complex ATE systems. The underlying principles were discovered over several years but were driven home by the difficulty found in modernizing a legacy test system. The result of this effort produced a solution that provided answers to the following three questions: (1) How to achieve asset interchangeability in complex test and measurement systems; (2) How to place test system software in a modular component form that can be reused in different ATE or desk top environments, and (3) How to apply new software technologies in distributedcomputing to ATE systems.
A network management system (NMS) has been built using distributed object technology and a four-layered architecture with device model objects. This NetKeeper NMS, which is built on a distributed object platform, has ...
详细信息
A network management system (NMS) has been built using distributed object technology and a four-layered architecture with device model objects. This NetKeeper NMS, which is built on a distributed object platform, has improved scalability and fault tolerance, and can be customized easily. It can thus be used to manage enterprise networks, which consist of a huge number of multi-vendor network devices and have original management policies. NetKeeper is being used in a commercial internet service provider's network and in several LANs.
This article introduces an information collecting method for shop and service information from the internet. Because the shop information is heterogeneous and distributed it is difficult for users to gather and handle...
详细信息
This article introduces an information collecting method for shop and service information from the internet. Because the shop information is heterogeneous and distributed it is difficult for users to gather and handle it. Although it is heterogeneous, it cart be semistructured insofar as it usually has a name, address, etc. The introduce the telephone directory information as an ontology server that defines relationships between the user's abstract expression of shops and the concrete expression, such as shop names. We designed a software agent architecture. Agents work together to support creating queries for users, to search and locate the information providers, and to organize the search results on behalf of the user. We applied this architecture to the Intelligent Pages and developed it on portable computers, a UNIX workstation, and internet servers, including the telephone directory server we also developed. Intelligent Pages lists shops from the Yellow Pages with additional information from other sources. The advantage of this method is that it produces precise and well-organized information.
The integration of the two recognized network management protocol standards;Common Management Information Protocol (CMIP), and Simple Network Management Protocol (SNMP), and Common Object Request Broker Architecture (...
详细信息
ISBN:
(纸本)0818677430
The integration of the two recognized network management protocol standards;Common Management Information Protocol (CMIP), and Simple Network Management Protocol (SNMP), and Common Object Request Broker Architecture (CORBA) technology, allows management applications to take advantage of distributed object computing as well as the standardized network management protocols. This paper describes the distributedcomputing Platform (DCP) prototype developed in Nokia Research Center The DCP prototype is a framework, including tools, compilers and gateways, built to support both internet and OSI management through a CORBA infrastructure.
We describe three contributions for distributed resource allocation in scientific applications. First, we present an abstract model in which different resources are represented as tokens of different colors;processes ...
详细信息
The current programming models, tools and environments associated with internet programming and parallel, high-performance distributedcomputing have remained isolated from one another. The focus of the IceT project h...
详细信息
The MetaCenter 3-year project was launched in 1996 as a part of the TEN-34 CZ activities of the Czech Republic. Its main goal is to create a MetaComputer whose nodes will be computers at the largestcomputing centers ...
详细信息
ISBN:
(纸本)0780343182
The MetaCenter 3-year project was launched in 1996 as a part of the TEN-34 CZ activities of the Czech Republic. Its main goal is to create a MetaComputer whose nodes will be computers at the largestcomputing centers of the Czech ATM network bandwidth allocation protocols to support unhindered execution of parallel tasks communicating via the ATM backbone. Effects of network latency will also be investigated. Personalized computing environment may be freely moved with researchers, increasing both their mobility and the efficiency of computing resources utilization. Also, the metacomputing paradigm increases efficient use of computers and installed software.
The reliability of a distributed database systems is the probability that a program which runs on multiple processing elements and needs to communicate with other processing elements for remote database will be execut...
详细信息
The reliability of a distributed database systems is the probability that a program which runs on multiple processing elements and needs to communicate with other processing elements for remote database will be executed successfully. This reliability varies according to 1) the topology of the distributed database system, 2) the reliability of the communication links, 3) the databases and program distribution among processing elements, and 4) the databases required to execute a program. This paper shows that solving this reliability problem is NP-hard even when the distributed database system is restricted to a series-parallel, a 2-tree, a tree, or a star structure. Two polynomial-time algorithms are proposed for computing the reliability of a distributed program which runs on a linear and a ring distributed database system, respectively.
暂无评论