scispace - formally typeset
Search or ask a question

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


Proceedings ArticleDOI
01 Dec 1998
TL;DR: A much simpler algorithm is devised that is conceptually so simple that it is extensible for more realistic network models and shows that the Boolean network of size 100,000 can be identified by the algorithm from about 100 INPUT/OUTPUT pairs if the maximum indegree is bounded by 2.
Abstract: Liang, Fuhrman and Somogyi (PSB98, 18-29, 1998) have described an algorithm for inferring genetic network architectures from state transition tables which correspond to time series of gene expression patterns, using the Boolean network model. Their results of computational experiments suggested that a small number of state transition (INPUT/OUTPUT) pairs are sufficient in order to infer the original Boolean network correctly. This paper gives a mathematical proof for their observation. Precisely, this paper devises a much simpler algorithm for the same problem and proves that, if the indegree of each node (i.e., the number of input nodes to each node) is bounded by a constant, only O(log n) state transition pairs (from 2n pairs) are necessary and sufficient to identify the original Boolean network of n nodes correctly with high probability. We made computational experiments in order to expose the constant factor involved in O(log n) notation. The computational results show that the Boolean network of size 100,000 can be identified by our algorithm from about 100 INPUT/OUTPUT pairs if the maximum indegree is bounded by 2. It is also a merit of our algorithm that the algorithm is conceptually so simple that it is extensible for more realistic network models.

746 citations


Patent
16 Sep 1998
TL;DR: In this paper, an apparatus and method is provided for transparent communication between a remote or mobile device and a fixed communication host network. But it is not clear how to determine whether the remote devices are indistinguishable to the host network from the locally attached devices.
Abstract: An apparatus and method is provided for transparent communication between a remote or mobile device and a fixed communication host network. The apparatus and method may include a remote network controller that logically resides between the host network and the existing infrastructure(s) that are used to provide communications network contact with one or more remote devices. The remote network controller is connected to the host communication network as a protocol-appropriate communications controller so that remote devices are indistinguishable to the host network from the locally-attached devices. Each remote device may be provided with an asynchronous serial data interface to communicate with a mobile data controller. The mobile data controller, in combination with the remote network controller, provides end-to-end data communication such that incompatible protocols are transparent to the remote device and host communication network. A router may be provided which selects a communications network in accordance with user configured parameters. The router communicates over a plurality of incompatible networks and is capable of using a variety of different protocols. Switching between the plurality of incompatible networks is transparent to the remote device and host communication network.

519 citations


Patent
30 Apr 1998
TL;DR: In this article, the authors proposed a solution to integrate wideband and narrowband channels so as to keep the users informed of any updates to their desired information and meanwhile provide efficient means to the users for retrieving the latest updates without incurring uncontrollable costs and increasing unnecessary network traffics.
Abstract: The present invention has particular applications to the navigation of Internet web pages using two-way interactive communication devices, such as a mobile device, a mobile phone, a landline telephone, and an Internet capable remote controller. According to one aspect of the present invention, each of the two-way interactive communication devices is a node in a distributed network, thus the devices can access hypermedia or hierarchic layers of information stored in server devices on the network. When one or more pages of information are updated, rather than sending the entire updated information to users of the devices subscribing to the updated information through the network, the present invention sends a notification to a proxy server that forwards the notification to the users using a messaging system via a low cost narrowband channel. Upon receiving the notification, the users can fetch the updates, when needed, through a wideband channel. Hence systemic solutions are provided in the present invention to integrate wideband and narrowband channels so as to keep the users informed of any updates to their desired information and meanwhile provide efficient means to the users for retrieving the latest updates without incurring uncontrollable costs and increasing unnecessary network traffics.

493 citations


Patent
31 Jul 1998
TL;DR: In this article, a new form of signaling based on precise control of the frequency, amplitude, and phase of the waveform of the signal is proposed, which is a unique signature of the transmitting node preventing security breaches.
Abstract: Nodes on a network are synchronized with each other using a clock transfer system (16). The communications channels between the nodes are then measured (164) and calibrated (163) for optimal bandwidth. The optimized channels and synchronization enable a new form of signaling based on precise control of the frequency, amplitude, and phase of the waveform of the signal. Receiving nodes receive information in order to locate the signal at the frequency, phase and amplitude. Precision control (165, 166) of these parameters also serves as a unique signature of the transmitting node preventing security breaches (162) as the signal's characteristics are unique to the transmitting node. The channel is continuously updated with a precision control system (165, 166) to insure that the nodes are not out of phase.

390 citations


Patent
28 Oct 1998
TL;DR: In this paper, the authors present a monitoring system for locating and tracking persons and assets in an awareness area, which includes a central server (10), a communication network to which the central server is connected, a tag associated with each person and asset (55) to be tracked, and at least one monitoring system (25) to locate and track tags (50, 52) within a sub-area of the awareness area.
Abstract: A personnel and asset tracking system for locating and tracking personnel and assets throughout an awareness area (2). The system includes a central server (10), a communication network to which the central server (10) is connected, a tag (50, 52) associated with each person (51) and asset (55) to be tracked, and at least one monitoring system (25) to locate and track tags (50, 52) within a sub-area (4) of the awareness area (2). The tags (50, 52) include a transmitter for periodically transmitting a unique identifier for each person (51) and asset (55). The monitoring system includes a router (14) connected to the communication network, at least one intermediate location processor (16) that transmits location messages to the router (14), and at least one receiver node (18) connected to each intermediate location processor (16), such that when the receiver node receives a transmission from the tag (50, 52), the receiver node (18) creates and sends a location message to the intermediate location processor (16), the intermediate location processor (16) transmits the location message to the router (14), and the router (14) transmits the location message to the central server (10) over the network.

285 citations


Journal ArticleDOI
TL;DR: This work develops limit theorems for a large class of stochastic service network models where parameters like arrival and service rates, routing topologies for the network, and the number of servers at a given node are all functions of time as well as the current state of the system.
Abstract: Inspired by service systems such as telephone call centers, we develop limit theorems for a large class of stochastic service network models. They are a special family of nonstationary Markov processes where parameters like arrival and service rates, routing topologies for the network, and the number of servers at a given node are all functions of time as well as the current state of the system. Included in our modeling framework are networks of M_t/M_t/n_t queues with abandonment and retrials. The asymptotic limiting regime that we explore for these networks has a natural interpretation of scaling up the number of servers in response to a similar scaling up of the arrival rate for the customers. The individual service rates, however, are not scaled. We employ the theory of strong approximations to obtain functional strong laws of large numbers and functional central limit theorems for these networks. This gives us a tractable set of network fluid and diffusion approximations. A common theme for service network models with features like many servers, priorities, or abandonment is “non-smooth” state dependence that has not been covered systematically by previous work. We prove our central limit theorems in the presence of this non-smoothness by using a new notion of derivative.

279 citations


Patent
Jan Forslow1
14 Jul 1998
TL;DR: In this article, the authors define and reserve different quality of service parameters for different ones of the application flows in a packet session, and then deliver the corresponding packets corresponding to each application flow from the external network entity all the way to the mobile host.
Abstract: In a mobile communications system (10), a mobile host (12) communicates packet data with an external network (56) by way of a packet gateway node (54). The mobile host establishes a packet session during which plural application flows are communicated with an external network entity. Each application flow includes a corresponding stream of packets. In addition, a corresponding quality of service parameter is defined and reserved for each of the plural application flows. In this way, different quality of service parameters may be defined and reserved for different ones of the application flows. Packets corresponding to each of the application flows are then delivered, for example, from the external network entity all the way to the mobile host in accordance with the quality of service reserved for that application flow. Different qualities of service may have different allocated bandwidths, delays, and/or reliabilities.

278 citations


Patent
Jan Forslow1
23 Jul 1998
TL;DR: In this article, a mobile station and a mobile network gateway node each include a mapper for mapping an individual application flow to one of a circuit-switched network and a packet-switching network bearer depending on the quality of service requested for the individual flow.
Abstract: Applications running on a mobile station or an external network entity such as an Internet service provider may specify on an individual application flow basis a requested quality of service. From that requested quality of service, an optimal type of bearer to transfer the application flow through the mobile communications network is determined. For example, a circuit-switched bearer may be allocated if the request is for a real-time service, and a packet-switched bearer may be allocated if the request is for a non-real time type of service. Various other decision making criteria may be employed. A mobile station and a mobile network gateway node each include a mapper for mapping an individual application flow to one of a circuit-switched network and a packet-switched network bearer depending on the quality of service requested for the individual application flow. The network layer quality of service parameters corresponding to an individual application flow are mapped to circuit-switched bearer parameters if the application flow is mapped to the circuit-switched network and to packet-switched bearer parameters if the application flow is mapped to the packet-switched network. The gateway node includes a common access server which permits a mobile station initially establishing a communications session with an external network entity to perform only a single, common access procedure for subsequent communications using one of the circuit-switched and packet-switched networks. After that common access procedure is completed, subsequent application flows between the mobile station and the external network entity are established using abbreviated procedures without having to access the external network entity.

272 citations


Journal ArticleDOI
TL;DR: The current article develops the theoretical framework of variants of the origin-destination flow problem and introduces Bayesian approaches to analysis and inference.
Abstract: We study Bayesian models and methods for analysing network traffic counts in problems of inference about the traffic intensity between directed pairs of origins and destinations in networks. This is a class of problems very recently discussed by Vardi in a 1996 JASA article and is of interest in both communication and transportation network studies. The current article develops the theoretical framework of variants of the origin-destination flow problem and introduces Bayesian approaches to analysis and inference. In the first, the so-called fixed routing problem, traffic or messages pass between nodes in a network, with each message originating at a specific source node, and ultimately moving through the network to a predetermined destination node. All nodes are candidate origin and destination points. The framework assumes no travel time complications, considering only the number of messages passing between pairs of nodes in a specified time interval. The route count, or route flow, problem is ...

267 citations


Patent
15 Dec 1998
TL;DR: In this paper, a system for time synchronization in a computer cluster is provided, in which a master node sends a SYNC message including a first time stamp to a slave node.
Abstract: A system for time synchronization in a computer cluster is provided. For the system of the present invention a master node sends a SYNC message including a first time stamp to a slave node. The slave node adds a second time stamp and returns the SYNC message to the master node. The master node then adds a third time stamp to the SYNC message. Using the three time stamps, the master node determines if the time clock within the slave node leads or follows the time clock in the master node. The calculation does not depend on the assumption that transmission delays to the slave node are the same as the transmission delays from the node. If the time clocks do not match, the master node sends an INFO message to the slave node informing the slave node of the correct time for clocks within the computer cluster.

246 citations


Proceedings ArticleDOI
22 Jun 1998
TL;DR: In this article, the authors outline the system design issues for a distributed sensor network, in which each node has a limited energy supply and relatively low data rate link, and the nodes must establish a synchronous multi-hop network, determine locations, and cooperate for such purposes as beamforming and passing messages to the outside world.
Abstract: Advances in commercial IC fabrication technology have made possible the integration of wireless transceivers, CMOS signal processing, and sensing in one integrated circuit package. Combination with actuation is also possible. This amounts to a low-cost means to link communications and computer networks to the physical world, and may have profound consequences in such diverse areas as security, process control, planetary exploration, and medical monitoring and diagnosis. We outline the system design issues for a distributed sensor network, in which each node has a limited energy supply and relatively low data rate link. The nodes must establish a synchronous multi-hop network, determine locations, and cooperate for such purposes as beamforming and passing messages to the outside world.

Patent
31 Mar 1998
TL;DR: In this paper, a presentation system (50) is disclosed for distributing a performance of a presentation to a plurality of client sites (54) comprising client nodes on a network such as the Internet.
Abstract: A presentation system (50) is disclosed for distributing a performance of a presentation to a plurality of client sites (54) comprising client nodes on a network such as the Internet. The presentation system (50) distributes presentation content data to a plurality of network server nodes, and during a performance of the presentation, the client nodes receiving the presentation determine a particular variation of data presentation to retrieve from the network server nodes. In particular, the retrieval of presentation data depends upon the transmission characteristics of the network such as data transmission rate. Thus, if a low transmission data rate is detected at a first client node, presentation elements of a reduced size can be retrieved. Alternatively, if a higher transmission rate is detected at a second client node, presentation elements of greater size (and corresponding enhanced quality of presentation) can be retrieved. Thus, within a single performance, client network nodes with varying available network bandwidths can be utilized for synchronously performing the presentation.

Patent
23 Oct 1998
TL;DR: In this article, a method and apparatus for facilitating computer network transactions are disclosed, where the computer network connects a host node and at least one user node, each user node includes a display for displaying an icon and an input device for selecting the icon.
Abstract: A method and apparatus for facilitating computer network transactions are disclosed herein. The computer network connects a host node and at least one user node. The host node has access to a database including records having predetermined contents, each record associated with a unique identification indicia. Each user node includes a display for displaying an icon and an input device for selecting the icon. The icon is typically an advertising banner having graphics related to an advertised product or service. The icon has embedded therein the network address of the host node, and the indicia for a record associated with the advertised product or service. The icon displayed on one user node is selected by actuating the respective input device (e.g., a mouse). The host network address embedded in the selected icon is used to contact the host node. Then, the record associated with the selected icon is retrieved by searching the database using the indicia embedded in the selected icon as a pointer. An input form is dynamically generated which includes at least one input field requesting data from the user, a portion of the input form depending on the contents of the retrieved record. The input form is presented on the display of the one user node. After entry, at least a minimum set of the requested data is communicated to the host node over the network. The requested data may be validated, with the user requested to provide any needed corrections. Once the data is valid, a confirmation form is generated based on the requested data and is displayed to the user. If the user acknowledges the confirmation form, an acknowledgment form is generated and displayed. The acknowledgment form may include a second cascaded icon.

Patent
Rohit Sharma1, Larry R. Mcadams1
09 Feb 1998
TL;DR: In this article, a ring-switched signals propagate around the ring on protection fibers without encountering the terminal equipment at the intervening nodes, to the extent that the protection fiber links between any given pair of nodes are incapable of supporting all the relevant communication regimes, such links are modified to provide such support.
Abstract: Techniques for providing normal operation and service restoration capability in the event of failure of terminal equipment or transmission media in a heterogeneous network, such as a hybrid network containing single- and multi-wavelength lightwave communications systems. An optical switching node (OSN) is placed at each node in the ring network to provide the required connections between various fibers and terminal equipment, but having switch states that allow signals on the protection fibers to bypass the terminal equipment at that node. Ring-switched signals propagate around the ring on protection fibers without encountering the terminal equipment at the intervening nodes. To the extent that the protection fiber links between any given pair of nodes are incapable of supporting all the relevant communication regimes, such links are modified to provide such support.

Patent
20 Oct 1998
TL;DR: In this paper, a distributed computer system is determined by determining with which other nodes each node is in communication and distributing that connectivity information through the nodes of the system, and each node can determine an optimized new cluster based upon the connectivity information.
Abstract: Cluster membership in a distributed computer system is determined by determining with which other nodes each node is in communication and distributing that connectivity information through the nodes of the system. Accordingly, each node can determine an optimized new cluster based upon the connectivity information. Specifically, each node has information regarding with which nodes the node is in communication and similar information for each other node of the system. Therefore, each node has complete information regarding interconnectivity of all nodes which are directly or indirectly connected. Each node applies optimization criteria to such connectivity information to determine an optimal new cluster. Data represent the optimal new cluster is broadcast by each node. In addition, the optimal new cluster determined by the various nodes are collected by each node. Thus, each node has data representing the proposed new cluster which is perceived by each respective node to be optimal. Each node uses such data to elect a new cluster from the various proposed new clusters. For example, the new cluster represented by more proposed new clusters than any other is elected as the new cluster. Since each node receives the same proposed new clusters from the potential member nodes of the new cluster, the new cluster membership is reached unanimously. In addition, since each node has more complete information regarding the potential member nodes of the new cluster, the resulting new cluster consistently has a relatively optimal configuration.

Patent
Radha Krishna Uppala1
30 Nov 1998
TL;DR: In this paper, a data structure for managing query friendly hierarchical values is presented, which contains a hierarchical value hash value derived from the node value identifier representation of the hierarchical value using a second hashing algorithm and a hierarchy value identifier.
Abstract: An architecture for managing query friendly hierarchical values contains a data structure having node value entries for node values that make up the hierarchical values, hierarchical value entries for the hierarchical values expressed in terms of node value identifiers found in the node value entries, and hierarchy parent entries for parent-child pairs of hierarchy values. A node value entry contains a node value, a node hash value generated from the node value by a first hashing algorithm, and the node value identifier. The node hash value defines the node value entry in which the corresponding node value is stored. The hierarchical value entry contains a hierarchical value represented by the node value identifiers that correspond to the node values that make up the hierarchical value. The hierarchical value entry also contains a hierarchical value hash value derived from the node value identifier representation of the hierarchical value using a second hashing algorithm and a hierarchical value identifier. The hierarchical value hash defines the hierarchical value entry in which the corresponding hierarchical value is stored. A hierarchy parent entry contains the hierarchical value identifier for the parent hierarchical value and the hierarchical value identifier for the child hierarchical value. The hierarchy parent entry also contains a depth value representing the distance in nodes between the parent hierarchical value and the node in the child hierarchical value that is furthest from the parent.

Patent
12 Jun 1998
TL;DR: In this article, a method and device for generating, merging and updating data for use in a destination tracking system, which contains, among other, the following steps: Generation of data by mobile units (vehicles) representing real information of the road network and traffic conditions, and storage of said data.
Abstract: The invention relates to a method and device for generating, merging and updating data for use in a destination tracking system, which contains, among other, the following steps: Generation of data by mobile units (vehicles) representing real information of the road network and traffic conditions, and storage of said data. A highly up-to-date and extremely reliable database is made by merging data from many units in a simple and efficient way. This database makes it possible to answer a number of complex problems, for example, about the passable route network and realizable travel times. On input of an origin and destination node together with the intended travel time, destination tracking data is calculated from the stored data. Since the dependency of the origin-destination relationships on all conceivable parameters relating to the movements executed by the mobile units is known, the destination tracking recommendations for each individual participant can be given such that the sum of the travel times of all participants is minimised.

Patent
27 Jan 1998
TL;DR: In this article, a road network is represented by separating the network into road networks and one-way traffic regulations are set on suitable links to allow representation of the composite intersection transfer regulation.
Abstract: In areas where composite intersection traffic regulation exits, nodes and links for use in the conventional network are separated into a plurality of nodes and links, respectively. For example, one node is separated into N1a to N1c, and one link is separated into L1a to L1c. Then, the whole road network is represented by separating the network into a road network (L1a, L2a, L3a, L4a, L5a, N1a, N2a) in view of entering links (L1a, L3a) which the composite intersection traffic regulation does not affect, and road networks α (L1b, L2b, L3b, L4b, N1b, N2b) and β (L1c, L2c, L3c, L5c, N1c, N2c) in view of entering links (L4b, L5c) which the composite intersection traffic regulation affects, and one-way traffic regulations are set on suitable links to allow representation of the composite intersection transfer regulation. Use of such map data enables selection compliant with the composite intersection traffic regulation without specific processing at the time of search processing.

Proceedings ArticleDOI
29 Mar 1998
TL;DR: The planning tool prototype ICEPT (Integrated Cellular network Planning Tool), which is based on the application of a new discrete population model for the traffic description, the demand node concept, is presented and a first result from a real world planning case is shown.
Abstract: This paper presents a demand-based engineering method for designing radio networks of cellular mobile communication systems. The proposed procedure is based on a forward-engineering method, the integrated approach to cellular network planning and is facilitated by the application of a new discrete population model for the traffic description, the demand node concept. The use of the concept enables the formulation of the transmitter locating task as a maximal coverage location problem (MCLP), which is well known in economics for modeling and solving facility location problems. For the network optimization task, we introduced the set cover base station positioning algorithm (SCBPA), which is based on a greedy heuristic for solving the MCLP problem. Furthermore, we present the planning tool prototype ICEPT (Integrated Cellular network Planning Tool), which is based on these ideas and show a first result from a real world planning case.

Patent
05 Jun 1998
TL;DR: In this article, a computer implemented process for enterprise collaboration is provided, where a workflow is designed such that at least one activity is instantiated as a plurality of activities each tailored to a particular node in the node group.
Abstract: A computer implemented process for enterprise collaboration is provided. The process includes designing a workflow where the workflow has at least one heterocast split and at least one heterocast join. The heterocast split and the heterocast join allow at least one activity to be parameterized, and at least one of the parameters comprising nodes within a node group. The workflow is then instantiated such that the at least one activity is instantiated as a plurality of activities each tailored to a particular node in the node group. The process then involves deploying the workflow including distributing the activities over the nodes in the node group, and executing the workflow to provide multi-enterprise collaboration

Patent
Mooi Choo Chuah1
22 May 1998
TL;DR: In this paper, a fair queuing service discipline for data transmission in an on-demand multiple access (OMA) network with a fair queueing service discipline is proposed, where each remote host computes its own service tag and reports it to the base station, which assigns transmit permits based on the service tag values and the available data slots.
Abstract: A method for data transmission in a wireless communication network utilizes an on-demand multiple access method with a fair queuing service discipline for efficient utilization of the limited bandwidth available in the network by sharing bandwidth among the remote hosts. In one embodiment, the base station broadcasts the system virtual time and the assigned shares of service classes to each of the wireless remotes. Each remote host computes its own service tag and reports it to the base station, which assigns transmit permits based on the service tag values and the available data slots. If a packet is lost or in error, the sending remote recomputes the service tag values of all its queued packets, including the packet whose transmission failed. Alternatively, the remote informs the base station of its queue size and the base station computes service tags for each remote based on the service shares of the remote and the available data slots. If a packet is lost or in error, the base station recomputes the service tag values for that remote host based on the current system virtual time. In an alternate embodiment, the AP or wireless node maintains a packet queue and a head-of-line tag. If a packet is lost, only the head-of-line tag needs to be changed. Once the head-of-line packet has been transmitted successfully, the rest of the queued packets will automatically receive the correct tag, the recomputed head-of-line tag plus appropriate increments. For half-duplex, both the uplink and downlink queues at the access points are managed as if there is only one system virtual time. For full-duplex, separate system virtual times for the uplink and the downlink traffic may be used. Remotes may also be divided into one or more separate groups, with each group having a different priority and receiving a different system virtual time. Service tags of all other remotes remain unaffected by the retransmission of a packet from any particular remote, meaning that the QoS experienced by the other remotes does not suffer.

Patent
11 Feb 1998
TL;DR: In this paper, the authors propose a peer-to-peer I/O distribution of block level requests to peer intelligent host-bus adapters (hereinafter referred to as HBA).
Abstract: The present invention retrieves data across independent computer nodes of a server cluster by providing for I/O shipping of block level requests to peer intelligent host-bus adapters (hereinafter referred to as HBA). This peer-to-peer distribution of block I/O requests is transparent to the host. The HBA has the intelligence to decide whether to satisfy a block I/O request locally or remotely. Each HBA driver utilizes the I2O protocol, which allows peer-to-peer communication independent of the operating system or hardware of the underlying network. In a first embodiment of the present invention, local and remote storage channels, within a node, are supported by a single HBA. In a second embodiment of the present invention, local storage channels, within a node, are supported by one HBA, and the remote storage channel, within a node, is supported by a separate HBA.

Patent
15 Oct 1998
TL;DR: In this article, the first and second embodiment of the present invention, the configuration agent resides on a network device (such as a switch or bridge) that is coupled to two network segments, with one network segments including a node to be configured and another network segment including a server capable of automatically providing configuration parameters.
Abstract: A configuration agent allows a network node seeking to be automatically configured with an IP address and a default gateway address to be configured as its own gateway. In first and second embodiments of the present invention, the configuration agent resides on a network device (such as a switch or bridge) that is coupled to two network segments, with one network segments including a node to be configured and another network segment including a server capable of automatically providing configuration parameters. In the first embodiment, the configuration agent acts as a snoopy agent. Messages from the configuration server to the node to be configured are "snooped" to discover messages containing an IP address and a default gateway address. Such messages are altered to copy the IP addresses offered to the nodes seeking configuration to the default gateway addresses, and the messages are sent on their way, thereby causing the node seeking to be configured to be its own default gateway. In the second embodiment of the invention, the configuration acts as a proxy agent. From the point of view of the node to be configured, the proxy agent appears to be a configuration agent. From the point of view of the configuration server, the proxy agent appears to be a relay agent if the configuration server and the node to be configured are on different subnets. When the configuration server sends messages to the node to be configured (possibly treating the proxy agent as a relay agent), the proxy agent intercepts the message and copies the offered IP address to the default gateway address in the message, thereby causing the node seeking to be configured to be configured as its own gateway. The proxy agent also substitutes its IP address for the IP address of the actual configuration server, thereby causing the node seeking to be configured to treat the proxy agent as the configuration agent.

Patent
30 Jun 1998
TL;DR: In this article, the root is positioned in the center of the map as a root, and a node directly connected to the root node is arranged as a node at the second hierarchical level on the circumference of the circle with the root centered.
Abstract: In monitoring a network in which nodes such as a host, a hub, rooter, etc. are interconnected, each node is indicated by an icon, and the connection between the nodes is indicated by a line. A node to be regarded is positioned in the center of the map as a root, and a node directly connected to the root is arranged as a node at the second hierarchical level on the circumference of the circle with the root centered. The node connected to the node at the second hierarchical level is arranged as a node at the third hierarchical level on the circumference of the concentric circle, with the root centered, having a larger radius than the node at the second hierarchical level. Similarly, the network configuration is assumed to be a hierarchical structure with the root centered, and an icon indicating an object at a higher hierarchical level is arranged on the circumference of a concentric circle having a larger radius.

Patent
06 Feb 1998
TL;DR: In this paper, a system for enabling network convergence and interworking between multiple communications networks is disclosed, where a subscriber is associated with a plurality of communications networks (10A, 10B, 10C) each utilizing its own schemes, protocols, and standards for effectuating communication therein.
Abstract: A system for enabling network convergence and interworking between multiple communications networks is disclosed. A subscriber is associated with a plurality of communications networks (10A, 10B, 10C) each utilizing its own schemes, protocols, and standards for effectuating communication therein. A main centralized database (220) storing subscription, network, service, and location data associated with each of the communications networks is provided. A main administrative node (200) for defining and providing new subscription, subscriber preference, and parameters is further provided. The main centralized database and the administrative node then communicate (270, 280) with corresponding functions (200 A-C, 220 A-C) within each of the communications networks to provide centralized information sharing, data control, and network resource management across the plurality of associated communications networks.

Patent
26 Jan 1998
TL;DR: In this paper, the authors present a method of optimizing the performance of a communications network with respect to admission and control of communications data, which relates to communications network and particularly, although not exclusively, to the method of optimization of a telecommunications network.
Abstract: The present invention relates to communications network and particularly although not exclusively to a method of optimizing the performance of a communications network with respect to admission and control of communications data. A communications network comprising N node elements operates N decision tables for controlling admission and control of data communications to the N node elements. Each node element generates corresponding performance data, and the N decision tables and N performance data are collected at a central network controller (1003). The network controller determines a set of new decision tables from the collected decision tables (1004) and distributes a new set of decision tables (1006) to each of the N node elements, which then proceed to operate the new decision tables throughout the network.

01 Jan 1998
TL;DR: An ad-hoc network is a temporary network without any form of centralized administration where each node acts as a node in the network, and multiple hops might be necessary to reach other nodes in thenetwork.
Abstract: An ad-hoc network is a temporary network without any form of centralized administration Multiple hops might be necessary to reach other nodes in the network For this reason, each node acts bo

Patent
13 Aug 1998
TL;DR: In this article, a clock synchronization system and method in a communication network comprise a plurality of nodes in communication with each other by data transfer over communication links, each of the nodes has its own local time base and exchanges timing information with a predefined node called master whose time base is the master clock against which the local clock base is to be synchronized.
Abstract: A clock synchronization system and method in a communication network comprise a plurality of nodes in communication with each other by data transfer over communication links. Each of the nodes has its own local time base and exchanges timing information with a predefined node called master whose time base is the master clock against which said local time base is to be synchronized. At predefined moments in time, each node having a master exchanges timing information with the master node, calculates therefrom a timing data and stores said timing data into a predefined storage location called History; such as to obtain after at least two exchanges, a sequence of timing data stored in the History. From said sequence of timing data, a set of parameters is calculated and stored. The stored parameters are further used for computing a conversion function whereby the node local time is converted upon request into the master time base with a pre-specified and guaranteed precision.

01 May 1998
TL;DR: Mobile IP uses tunneling from the home agent to the mobile node's care-of address, but rarely in the reverse direction, so when this assumption is not true, it is convenient to establish a topologically correct reverse tunnel.
Abstract: Mobile IP uses tunneling from the home agent to the mobile node's care-of address, but rarely in the reverse direction. Usually, a mobile node sends its packets through a router on the foreign network, and assumes that routing is independent of source address. When this assumption is not true, it is convenient to establish a topologically correct reverse tunnel from the care-of address to the home agent.

Patent
12 Oct 1998
TL;DR: A communication system includes an aircraft supporting an airborne switching node that provides communication services to a variety of ground-based devices located in the service region as discussed by the authors, such as subscriber devices, such as customer premises equipment and business premises equipment.
Abstract: A communication system includes an aircraft supporting an airborne switching node that provides communication services to a variety of ground-based devices located in the service region The devices include subscriber devices, such as customer premises equipment and business premises equipment, as well as gateway devices