Showing papers on "Node (networking) published in 1988"

Training a 3-Node Neural Network is NP-Complete

Abstract: We consider a 2-layer, 3-node, n-input neural network whose nodes compute linear threshold functions of their inputs. We show that it is NP-complete to decide whether there exist weights and thresholds for the three nodes of this network so that it will produce output consistent with a given set of training examples. We extend the result to other simple networks. This result suggests that those looking for perfect training algorithms cannot escape inherent computational difficulties just by considering only simple or very regular networks. It also suggests the importance, given a training problem, of finding an appropriate network and input encoding for that problem. It is left as an open problem to extend our result to nodes with non-linear functions such as sigmoids.

Water Distribution Reliability: Simulation Methods

Abstract: Following a companion paper on analytical methods, this paper presents simulation as a complementary method for analyzing the reliability of water distribution networks. For this simulation, the distribution system is modeled as a network whose pipes and pumps are subject to failure. Nodes are targeted to receive a given supply at a given head. If this head is not attainable, supply at the node is reduced. Pumps and pipes fail randomly, according to probability distributions with user‐specified parameters. Several reliability measures are estimated with this simulation. Confidence intervals are also supplied for some of these reliability measures. Simulation results are presented for a small network (ten nodes) and a larger network (sixteen nodes). Simulation enables computation of a much broader class of reliability measures than do analytical methods, but it requires considerably more computer time and its results are less easy to generalize. It is therefore recommended that analytical and simulation me...

Dynamic resource allocation scheme for distributed heterogeneous computer systems

Abstract: In a distributed heterogeneous computer system having a plurality of computer nodes each operatively connected through a network interface to a network to provide for communications and transfers of data between the nodes and wherein the nodes each have a queue for containing jobs to be performed, an improvement for dynamically reallocating the system's resources for optimized job performance. There is first logic at each node for dynamically and periodically calculating and saving a workload value as a function of the number of jobs on the node's queue. Second logic is provided at each node for transfering the node's workload value to other nodes on the network at the request of the other nodes. Finally, there is third logic at each node operable at the completion of each job. The third logic includes, logic for checking the node's own workload value, logic for polling all the other nodes for their workload value if the checking node's workload value is below a preestablished value indicating the node as being underutilized and available to do more jobs, logic for checking the workload values of the other nodes as received, and logic for transfering a job from the queue of the other of the nodes having the highest workload value over a preestablished value indicating the other of the nodes as being overburdened and requiring job relief to the que of the checking node. The third logic is also operable periodically when the node is idle.

Negotiation as a metaphor for distributed problem solving

Abstract: We describe the concept of distributed problem solving and define it as the cooperative solution of problems by a decentralized and loosely coupled collection of problem solvers. This approach to problem solving offers the promise of increased performance and provides a useful medium for exploring and developing new problem-solving techniques. We present a framework called the contract net that specifies communication and control in a distributed problem solver. Task distribution is viewed as an interactive process, a discussion carried on between a node with a task to be executed and a group of nodes that may be able to execute the task. We describe the kinds of information that must be passed between nodes during the discussion in order to obtain effective problem-solving behavior. This discussion is the origin of the negotiation metaphor: Task distribution is viewed as a form of contract negotiation. We emphasize that protocols for distributed problem solving should help determine the content of the information transmitted, rather than simply provide a means of sending bits from one node to another. The use of the contract net framework is demonstrated in the solution of a simulated problem in area surveillance, of the sort encountered in ship or air traffic control. We discuss the mode of operation of a distributed sensing system, a network of nodes extending throughout a relatively large geographic area, whose primary aim is the formation of a dynamic map of traffic in the area. From the results of this preliminary study we abstract features of the framework applicable to problem solving in general, examining in particular transfer of control. Comparisons with planner, conniver, hearsay-ii , and pup 6 are used to demonstrate that negotiation—the two-way transfer of information—is a natural extension to the transfer of control mechanisms used in earlier problem-solving systems.

Coherent cooperation among communicating problem solvers

Abstract: When two or more computing agents work on interacting tasks, their activities should be coordinated so that they cooperate coherently. Coherence is particularly problematic in domains where each agent has only a limited view of the overall task, where communication between agents is limited, and where there is no ``controller'' to coordinate the agents. Our approach to coherent cooperation in such domains is developed in the context of a distributed problem-solving network where agents cooperate to solve a single problem. The approach stresses the importance of sophisticated local control by which each problem-solving node integrates knowledge of the problem domain with (meta-level) knowledge about network coordination. This allows nodes to make rapid, intelligent local decisions based on changing problem characteristics with only a limited amount of intercommunication to coordinate these decisions. We describe three mechanisms that improve network coherence: 1) an organizational structure that provides a long-term framework for network coordination to guide each node's local control decisions; 2) a planner at each node that develops sequences of problem-solving activities based on the current situation; and 3) meta-level communication about the current state of local problem solving that enables nodes to dynamically refine the organization. We present a variety of problem-solving situations to show the benefits and limitations of these mechanisms, and we provide simulation results showing the mechanisms to be particularly cost effective in more complex problem-solving situations. We also discuss how these mechanisms might be of more general use in other distributed computing applications.

Functionally accurate, cooperative distributed systems

Abstract: A new approach for structuring distributed processing systems, called functionally accurate, cooperative (FA/C), is proposed. The approach differs from conventional ones in its emphasis on handling distribution-caused uncertainty and errors as an integral part of the network problem-solving process. In this approach nodes cooperatively problem-solve by exchanging partial tentative results (at various levels of abstraction) within the context of common goals. The approach is especially suited to applications in which the data necessary to achieve a solution cannot be partitioned in such a way that a node can complete a task without seeing the intermediate state of task processing at other nodes. Much of the inspiration for the FA/C approach comes from the mechanisms used in knowledge-based artificial intelligence (Al) systems for resolving uncertainty caused by noisy input data and the use of approximate knowledge. The appropriateness of the FA/C approach is explored in three application domains: distributed interpretation, distributed network traffic-light control, and distributed planning. Additionally, the relationship between the approach and the structure of management organizations is developed. Finally, a number of current research directions necessary to more fully develop the FA/C approach are outlined. These research directions include distributed search, the integration of implicit and explicit forms of control, and distributed planning and organizational self-design.

Apparatus and method for realtime monitoring of network sessions in a local area network

Abstract: A method is used for collecting information at the session level for a multiple node distributed processing system. A first component software program monitors all packets passing through a node and extracts packet headers having a predetermined format from all nodes. A second component software program identifies a session in which each of the extracted packet headers was transmitted and, for each session, accumulates characterizing information about that session and calculates statistical data concerning all the sessions.

Compiling programs for distributed-memory multiprocessors

Abstract: We describe a new approach to programming distributed-memory computers. Rather than having each node in the system explicitly programmed, we derive an efficient message-passing program from a sequential shared-memory program annotated with directions on how elements of shared arrays are distributed to processors. This article describes one possible input language for describing distributions and then details the compilation process and the optimization necessary to generate an efficient program.

Method and apparatus for updating system software for a plurality of data processing units in a communication network

Abstract: In maintaining a communication network of processing units distributed in multiple nodes linked by communication channels, system software in a plurality of data processing units is updated by first installing the updated software in a first node. The updated software is transmitted through the network to other nodes. A trial use of the updated software is initiated in the nodes. If failures of the updated software are detected in a node, that node will be restored to the original software version. If the trial use of the updated software is completed successfully in a node, the updated version will be installed as a preferred operational version in the node. a

Training a 3-node neural network is NP-complete

Abstract: We show for many simple two-layer networks whose nodes compute linear threshold functions of their inputs that training is NP-complete. For any training algorithm for one of these networks there will be some sets of training data on which it performs poorly, either by running for more than an amount of time polynomial in the input length, or by producing sub-optimal weights. Thus, these networks differ fundamentally from the perceptron in a worst-case computational sense.

Operations controller for a fault tolerant multiple node processing system

Abstract: A fault tolerator for an operations controller of a multiple node fault tolerant processing system having a data memory for storing the content of all received error free messages, an error file for storing the content of all received inner node error reports, an error handler for generating a base penalty count for each node based on the content of the errors recorded in the error file and for excluding each node from the operation of the multiple node processing system whose base penalty count exceeds an exclusion threshold. The fault tolerator also includes a synchronizer interface for passing the selected fields of the received messages to a synchronizer, a scheduler interface for passing selected information to a scheduler, and a message interface which stores the error free messages in the data memory and passes the selected fields of the messages to the synchronizer.

Remote bootstrapping a node over communication link by initially requesting remote storage access program which emulates local disk to load other programs

Abstract: A system and method of down loading, over a network, operating systems or other executable programs to a computer which does not have a boot device or other device containing the executable program. Down loading is accomplished without modification of the loadable image. The computer has a network interface which requests a minimum-boot program be transferred from a host computer on the network. The minimum-boot program, when executed, establishes a logical connection to a disk server on the network and allows the requesting computer to treat the disk server as a local boot device.

Ring transmission system

Abstract: A transmission system comprises nodes coupled in a ring via two multiplexed transmission paths having opposite transmission directions. The two paths can be time, space, or wavelength division multiplexed. Bidirectional communications between any two nodes are provided in normal operation using both paths around a first, most direct, part of the ring. In the event of a fault affecting such communications, a protection switch is made to maintain bidirectional communications between the two nodes using both paths around a second, remaining, part of the ring. In this manner, each path can simultaneously carry both normal and protection switched signals. In an embodiment of the invention, only the two nodes adjacent a fault need be aware of the fault, each of these nodes effecting a protection switch for signals terminated at the node and effecting a protective loopback for other signals needing protection. The invention enhances the total capacity of the paths for carrying normal and protection switched signals. A network may comprise a plurality of such ring transmission systems intersecting at at least one network node, the network node comprising a node of each ring and a cross connect switch for switching signals therebetween.

Method for handling conversational transactions in a distributed processing environment

Abstract: In a distributed processing system having a least an originating node and a responding node connected through a communication path, the responding node comprising a plurality of processors and a memory device and where each of these processors is capable of accessing information from a corresponding database residing within the memory device, the inventive method involves: storing context information for an associated conversational transaction using a first processor situated within the responding node wherein the context information is stored at a pre-defined address in a first database residing within the memory device and associated with the first processor; producing a first message using the first processor for transmission from the responding node over the communication path to the originating node wherein the first message contains a first transaction identifier field having a value that corresponds to the pre-defined address; generating within the originating node a second message for transmission from the originating node over the communication path to the responding node wherein the second message contains a second transaction identifier field having substantially the same value as the first transaction identifier filed; and accessing the record using a second processor located within the responding node in response to reception of the second message at the second processor by generating the pre-defined address within the second processor using the value of the second transaction identifier field so as to permit the second processor to incrementally process said conversational transaction within the responding node.

Reliable broadcast in hypercube multicomputers

Abstract: A simple algorithm for broadcasting in a hypercube multicomputer containing faulty nodes/links is proposed. The algorithm delivers multiple copies of the broadcast message through disjoint paths to all the modes in the system. Its salient feature is that the delivery of the multiple copies is transparent to the processes receiving the message and does not require the processes to know the identity of the faulty processors. The processes on nonfaulty nodes that receive the message identify the original message from the multiple copies using some scheme appropriate for the fault model used. The algorithm completes in n+1 steps if each node can simultaneously use all of its outgoing links. If each node cannot use more than one outgoing link at a time, then the algorithm requires 2n steps. >

Session control in network for digital data processing system which supports multiple transfer protocols

Abstract: A distributed digital data processing system includes a plurality of nodes which communicate over a network. A node maintains one or more objects, each of which may be a file, that is, an addressable unit in the system, such as a program, database, text file, or the like, or a directory which may contain one or more files or other directories. One node maintains a naming service which associates each object in the system with one or more protocol towers. Each protocol tower identifies the object name and a series of entries each identifying a name for each of the protocol layers, along with the communications parameters and address information, to be used in communicating with the object. When a node requires access to an object maintained by another node, it first retrieves from the naming service the protocol towers for the object. The node also maintains a tower identifying the names of each of the protocols over which it can communicate. The node then compares the protocol names in the retrieved protocol towers with the protocol names over which it can communicate. If the protocol names in a retrieved tower match the protocol names in the node's tower, the node uses the communications parameters and address information in future communications with the object. If the node is unable to identify a retrieved protocol tower which matches its supported tower or towers, it is unable to communicate with the object.

Self-configuration of nodes in a distributed message-based operating system

Abstract: In a distributed system comprising a plurality of nodes, each node is provided with the same set of generic configuration rules which configures the resources for the node according to the application requirements and the hardware configuration of the node. The resource server modules are configurable at run-time by node-based configuration management processes in accordance with information contained in resource definition messages. A resource definition message is derived from a resource template message in accordance with the information contained in the node definition message. Accordingly, adding or modifying resources at a given node can be accomplished at start-up or at run time without affecting the remainder of the system.

Distributed security procedure for intelligent networks

Abstract: A security technique for use in an intelligent network. The security technique provides a method for authorizing access by a process located in an invocation node to an object, or a network resource, located in an execution node. The method includes the steps of granting permission to the invocation node to access the object by transmitting a capability and a signature from the execution node to the invocation node. The capability includes a unique indentifier of the object and access rights to the object. The signature is formed at the execution node by encryption of the capability with an encryption key that is unique to the invocation node and is stored only in the execution node. A request for access to the object is transmitted with the capability and the signature from the invocation node to the execution node. At the execution node, the request is authenticated by encryption of the capability with the encryption key that is associated with the invocation node to form a test signature. Access to the object is authorized only when the test signature matches the signature received from the invocation node.

Method for selecting least weight end node to end node route in a data communications network

Abstract: When computing a least weight path from an origin node to a destination node in a data communication network, a route-computing network node uses information provided by the origin and destination nodes to compute least weight routes from those nodes to adjacent network nodes. The route-computing network node uses information in the topology database to compute least weight routes from network nodes adjacent the origin node to network nodes adjacent the destination node. The results of the computations are concatenated to determine an optimum route from the origin node to the destination node. The topology database need not include information about the transmission groups connecting the origin/destination nodes to network nodes.

Method and apparatus for diagnosing problems in data communication networks

Abstract: Data communications neworks may be composed of many different physical devices linked together in various layers and using various protocols for communication. The multiple physical elements that make up such communication networks or links are often supplied by diverse vendors. As a result, isolation and diagnosis of communication failures becomes an extremely difficult and cumbersome process. The present system and method simplify the process greatly by premitting a system control operator or control application program to issue generic, non-device-specific problem isolation, control or diagnostic commands to the communication neetwork by identifying the link and target node for which problem isolation and diagnosis is required. The non-device-specific commands are received first at an intermediate translation facility which retrieves communication link physical configuration data and identifies the physical components and characteristics thereof that make up that communication link to the identified target node. The translation facility then issues one or more device-specific problem determination commands on the communication link directed toward said node. It receives one or more device-specific responses from one or more physcial devices in the communication link and, responsive thereto, either issues further device-specific commands on the communication link to complete the diagnosis or issues generic, non-device-specific problem identification results as responses to the requesting control nodes' initial request.

Method of reducing the amount of information included in topology database update messages in a data communications network

Abstract: In a communications network, each network node can maintain its own list of network resources in a topology database. When the state of a resource "owned" by a particular node changes, that node broadcasts a topology database update (TDU) message to adjacent nodes. Each adjacent node updates its own topology database and rebroadcasts the message. To minimize the amount of information that must be included in TDU messages when two nodes are reconnected after an outage, each node assigns flow reduction sequence numbers (FRSNs) to TDU meassages and keeps a record of the FRSN for the last TDU message sent to an adjacent node. The node also records, for each resource in its database, the FRSN of the last TDU message including that resource. When two nodes are reconnected, the sending node includes in the TDU message only those resources having a FRSN greater than the FRSN assigned to the last TDU sent to the adjacent node to which the TDU message is directed.

Parallel discrete event simulation using shared memory

Abstract: With traditional event-list techniques, evaluating a detailed discrete event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments using the Chandy-Misra distributed simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential simulation of most queuing network models. >

Route end node series preparing system of navigation apparatus

Abstract: Disclosed is a system for preparing a route end node series which is equipped with a route search means 7 for preparing a node series, an intersection series or a combination of both as the data series for navigation, and a route end node series preparing means 3 for preparing the node series from the starting point and the destination to the respective nearest particular points. The route end node series preparing means 3 prepares node series by successively performing node search until the node nearest to the point indicated by the positional information on the starting point or the destination is attained. This construction makes it possible to perform course guidance through navigation based upon the node series between the starting point or the destination and the nearest intersection thereto even if the starting point or the destination is set at a point between intersections when particular points are set as intersections.

Multiprocessing system having nodes containing a processor and an associated memory module with dynamically allocated local/global storage in the memory modules

Abstract: A multiprocessing system is presented having a plurality of processing nodes interconnected together by a communication network, each processing node including a processor, responsive to user software running on the system, and an associated memory module, and capable under user control of dynamically partitioning each memory module into a global storage efficiently accessible by a number of processors connected to the network, and local storage efficiently accessible by its associated processor.

Erasure, capture, and random power level selection in multiple-access systems

Abstract: Multiple-access algorithms that handle erasures as well as captures are introduced. The algorithms are evaluated according to the maximal throughput that they can support for a Poisson arrival process. An example is given which shows that, in practice, the positive effect of captures compensates the negative effect of erasures. An approach that effectively utilizes the capture phenomena is introduced. This approach incorporates a random power-level-selection scheme that allows each node to choose randomly to transmit in one of several allowable levels of power. Design issues such as number of levels, selection schemes, etc. are discussed. >

Adaptive link assignment for a dynamic communication network

Abstract: An adaptive link assignment scheme for dynamically changing communication node topologies such as satellite networks, fleets of ships or aircraft, etc. Periodically each node in the network transmits topology information to all the nodes in the network. Then each node determines the degree of connectivity of the network. It is preferred that the network be at least triconnected, and if the network is less than that each node determines what connections it can make to improve the network connectivity. If more than one alternative is available, a choice is made based on line of sight endurance and then on traffic delay. The identification of the selected connection is then broadcast to all the nodes in the network. Each node thus receives the proposed changes from all the network nodes, and each node then resolves conflicts between the broadcast selections and determines what change it should make. Finally, the changes are implemented. The scheme emphasizes network connectivity to bring the network to a triconnected state and then emphasizes line of sight endurance and reduction of traffic delay.

Node autonomy in distributed systems

Abstract: The goal of this paper is to explore the notion of node autonomy in distributed computer systems. Some motivations for autonomy are exposed. Different facets of autonomy as well as relationships among them are discussed. Finally, we look into how autonomy affects other aspects of distributed computing, including timeliness, correctness, load sharing, data sharing, and data replication.

Control token mechanism for sequence dependent instruction execution in a multiprocessor

Abstract: A controlled flow parallel computer incorporating a node drive register which designates the location of executable instructions. The node drive register allows instructions to be executed concurrently and non-deterministically without a complex control. Control token locations in the node drive register associated with a given instruction are filled upon the completion of a prior instruction required to be executed before executing that instruction. The instruction is ready for execution once the control token locations are filled.

Multiprocessor/memory interconnection network wherein messages sent through the network to the same memory are combined

Abstract: A method and apparatus is described for enabling efficient, bilateral communications in a network connecting a plurality of target address modules and a plurality of source address generators. The source address generators are enabled to generate requests to target addresses within the target address modules. The function of the network is to forward the requests to the target address modules holding the respective target addresses and to return the replies generated by the target address module to the respective source address generators. The network interconnects the source generators to each target address module and vice versa. The interconnection network includes a plurality of interconnected nodes, each node having M inputs and N outputs (where M may or may not be equal to N) and a processor for carrying out a communication protocol. The protocol comprises each node first placing incoming target addresses from messages appearing on the node's inputs into a queue associated with each respective input. The target addresses of the messages at the head of each queue are examined, and the message is transmitted whose target address bears a predetermined relationship to the other message's target address. The messages are combined in case their target addresses are found to be equal. Additionally, a direction bit queue is provided in which is stored a sequence of bits indicating from which of the M inputs to the node, the transmitted message was received. A "ghost" message is transmitted (which includes the target address of the message transmitted) on the node's other outputs, to notify interconnected nodes of the transmitted target address. In addition, each source address generator periodically generates an "end of stream" message.

Ring bus hub for a star local area network

Abstract: A ring hub in a local area network. A parallel ring bus (20, 22, 24, 26) connects a plurality of ring controllers (10, 12, 14, 16) in a closed loop. At reset time one controller (12) is selected to act as a ring monitor and is not connected to a network node. Each one of the remaining controllers are connected to a single node, so that one controller is linked to a corresponding node. The ring monitor and the ring controllers communicate by inserting message packets onto the bus and stripping messages and control information off of the bus. A transfer request packet is used by a source controller (10) to signal a destination controller (14) for permission to send a data packet. A packet acknowledge signal is generated at the destination controller (14) by asserting one of the bus control lines. The packet acknowledge signal is used to signal to the source controller that the transfer request packet has been received and placed in a request queue (40) at the destination controller. A send data reply packet is used by the destination controller to signal the source controller that the queued request can now be serviced. Data packets are inserted on the ring bus by the source controller to send the actual data message.