Abstract: A motion control system and method that includes a central controller configured to generate first and second demand control signals to be used to define actuation motion of respective first and second actuators. The central controller is in communication with first and second nodes by way of a data network, each node including at least a respective actuator configured to implement at an actuator time a motion or force-related effort based upon the respective demand control signal. Each node also includes a memory configured to store at least one respective propagation delay parameter related to a signal propagation delay between the central controller and the node. A timing mechanism establishes timing at each node based on the respective propagation delay parameter so that the actuator time at the nodes occurs simultaneously. Strictly cyclic and/or full-duplex high-speed communication can be supported. The network can be wired in a ring or as a tree and with twisted pair cabling or fiber.

Abstract: There is disclosed a system, method, apparatus and computer program product for managing a storage system including a SAN within a computer network. The storage system can be managed in object-oriented computer language. Object trees of each component in the storage system or SAN are obtained and combined on each storage processor in the storage system. The user interface (UI) can therefore select one storage processor within the storage system, and request such combined object tree information for the entire storage system or SAN from only that singular storage processor on which such combined information is stored. This eliminates a severe computational drain on the UI, which otherwise would be required to make these object tree combinations, and further allows a single point of storage management contact between UI and storage system or SAN by way of that singular storage or portal processor.

Abstract: The invention is directed to techniques for maintaining a map of node relationships for a network of nodes (e.g., network of computers). In one example, the map of node relationships represents relationships overlaying and typically different from the network of physical connections among the nodes. Each child node periodically checks in with its parent nodes, and the parent nodes can thus determine when a child node has terminated a relationship with the parent or created a new relationship with a new parent. Changes in relationships propagate upward through the network of nodes so that each node maintains a map of the relationships among the descendants of that node. A root node receives the propagated change relationship information and maintains a map of the entire network and valid pathways through the network.

Abstract: The invention relates to a network comprising a plurality of network nodes. At least part of the network nodes are directly intercoupled via at least one star node. The star node contains a plurality of star interfaces which are assigned to at least one network node. A star interface is provided for transferring a message from the assigned network node to the other star interfaces or from another star interface to at least one of the assigned network nodes always in dependence on a pilot signal.

Abstract: An optical network unit of each consumer is connected to an optical line terminator of a network operator through a subscriber line formed of an optical fiber. When a particular consumer desires to download digital content from a content retailer to the particular consumer through a network of the network operator, the particular consumer requests a bandwidth reservation of a resource reservation server of the network operator, so that a transmission condition composed of a bandwidth and a time zone is reserved in cases where the downloading of the digital content at the transmission condition is possible. Thereafter, the bandwidth reservation is sent to a downward bandwidth managing unit, and the digital content is downloaded from the content retailer to the particular consumer through the network of the network operator at the transmission condition according to the bandwidth reservation under control of the downward bandwidth managing unit.

Abstract: A route bypassing a root node is constructed in a network in which a spanning tree is formed. A received frame is sent out on a designated port as well as on a root port by using a designated-port data send-out function, provided that a transmitting port for the received frame is learned on the root port. When a frame is received on a blocking port, a transmitting port for a frame whose destination matches the source address of the received frame is temporarily learned on the blocking port by using a blocking-port learning function, on the condition that the destination of the received frame is already learned on some other port. When a frame whose destination matches the temporarily learned address is received, the temporary learning is changed to normal learning by using a temporarily learned address-based data transfer function.

Abstract: Large payload files are selectively partitioned in blocks and the blocks distributed to a plurality of distribution stations at the edge of the network qualified to have the data. Each qualified station decides how much and what portion of the content to save locally, based on information such as network location and environment, usage, popularity, and other distribution criteria defined by the content provider. Different pieces of a large payload file may be available from different nodes, however, when a user requests access to the large payload file, for example, through an application server, a virtual file control system creates an illusion that the entire file is present at the connected node. However, since only selective portions of the large payload file may actually be resident at that node's storage at the time of request, a cluster of distribution servers at the distribution station may download the non-resident portions of the file as the application server is servicing the user.

Abstract: The invention relates to a network comprising a plurality of network nodes and one star node, which star node is provided for the direct coupling of at least two network nodes. The star node comprises a plurality of star interfaces which are assigned to at least one network node and which comprise each an activity detector for detecting activities in the message signal coming from the assigned network node and for transferring the message signal from the assigned network node to the other star interfaces or from another star interface to the assigned network node in dependence on at least one activity.

Abstract: Communication apparatus includes a plurality of interface cards, including a central interface card and spoke interface cards, which are adapted to link communication lines to a network. A protection bus includes multiple spoke connections that link the central interface card to the spoke interface cards in a partial star configuration, such that on at least one of the spoke connections there are two of the spoke interface cards connected together to the central interface card.

Abstract: Bridges (10, 12, 14) are used to interconnect local area networks transparently. In the IEEE 802.1D standard for bridges, a spanning tree is built among the bridges for loop-free frame forwarding (FIG. 10). Although this approach is simple, it does not support all-pair shortest paths. A novel bridge protocol is employed that attempts to find and forward frames over alternate paths that are shorter than their corresponding tree paths on the standard spanning tree, and makes use of the standard spanning tree for default forwarding. The proposed protocol, referred to as the Spanning Tree Alternate Routing (STAR) Bridge Protocol, is backward compatible with the IEEE 802.1D standard and has a complexity that is comparable to that of the standard and other existing protocols.

Abstract: A documentation system for a network having a source device which is connected to multiple network paths which are connected to destination devices, the documentation system comprising, a data port which includes an electronic module with an identification code on each of two or more of the network paths, each of the destination devices including an electronic module with an identification code, the source device having the capability to send query signals along a designated network path addressed to a data port and destination device corresponding to the designated network path, the electronic module corresponding to the data port responding to the query addressed to the data port by transmitting its identification code to the source device, and the electronic module of the destination device responding to the query addressed to the destination device by transmitting its identification code to the source device, and a processor and a scanner in communication with the source device, the processor and scanner

Abstract: Architecture for a SONET network element. The architecture includes an interconnection system for a network element, including a line unit slot, a switch fabric slot, and service unit slots. The line unit slot is connected as a hub to the switch fabric slot and the service unit slots in a first star interconnection configuration. The switch fabric slot is connected as a hub to the line unit slot and the service unit slots in a second star interconnection configuration. The star interconnection configurations provide fault isolation between different units, and allow for replacement of failed units without interfering with the links of other units to the hub. A service unit is provided including a first backplane interface for connecting with an ATM star interconnect configuration within the network element, and a second backplane interface for connecting to an STM star interconnect configuration within the network element.

Abstract: There is disclosed a technique for achieving scalable communication within a distributed system using dynamic communication trees. In a client server environment, and particularly in such an environment in which storage systems and storage area networks are managed by distributed management software, embodiments of the present invention are presented by which communication trees are built in a manner that evenly distributes load throughout nodes in the network, whereby scalability is enhanced allowing a larger number of nodes than otherwise allowable without such trees. Other advantages achievable by utilization of such trees are also disclosed.

Abstract: The present invention relates to a modular interconnection architecture for an expandable multiprocessor machine. It comprises a first interconnection level (MI) comprising connection agents (NCSi) that connect the multiprocessor modules and handle the transactions between the multiprocessor modules, and a second interconnection level (SI) comprising external connection nodes (NCEj) that connect the nodes (Nj) to one another and handle the transactions between the nodes (Nj). Each external connection node (NCEj) comprises two connection agents identical to the connection agent (NCSi), connected head-to-tail, one of the two agents (NCS?j) receives and filters the transactions sent by the node (Nj) to which it is connected. The other agent (NCS?j) receives and filters the transactions sent by the other nodes (Nj) to which it is connected. Its applications specifically include the construction of an entire range of machines: UMA, QUASI-UMA, NUMA, cluster, etc.

Abstract: An Internet user transfers directly to a domain within an e-community without returning to a home domain or re-authenticating. The user's home domain server prepares and forwards a home domain identity cookie (DIDC) with an enrollment request to a user's browser, with the enrollment request being redirected to an affiliated domain server in the e-community. The affiliated domain server prepares and sends an affiliated DIDC with an enrollment confirmation to the user's browser, redirecting the enrollment confirmation to the home domain server. The home domain server modifies the home DIDC to include a symbol which indicates successful enrollment at the affiliated site. The process may be repeated for a plurality of affiliated domains to achieve automatic enrollment a portion of or an entire e-community.

Abstract: A method and apparatus is described for receiving a new policy tree at a network element in a network. The network element stores a current policy tree of classes for quality of service of packets being processed by the network element. Classes of the current policy tree are compared with the classes of the new policy tree. Classes of the current policy tree are selectively deleted and classes of the new policy tree are selectively added to the current policy tree based on the comparison of the classes.

Abstract: A star communication network including a hub node (102) and links (102E) couple to the hub node for carrying data along routes in W channels. The hub node has switches connecting each channel of a first one of the links to various channels of a second one of the links through the hub node.

Abstract: A point-to-multipoint communications network connecting multiple subscribers to a single communications line. A plurality of subscriber communications interfaces are connected in parallel to form a local group in which one communications interface serves as a master communications interface and the other communications interfaces serve as slaves. Each communications interface may be capable of serving as the master communications interface according to a demand division multiplexing technique, which assigns master status based on upstream data demands. As a communications interface is switched to master status, the communications interface previously holding master status is switched back to slave status. A plurality of communications interfaces can thus be connected to a single communications port without increasing the upstream transmission bandwidth requirements.

Abstract: A server system of the present invention includes a server apparatus and one or more terminal apparatuses electrically connected to the server apparatus through a transmission line, in which each of the one or more terminal apparatuses include one or more input devices, the server apparatus implements an operating system and an application program, the server apparatus includes input information recognition means for recognizing an input information signal which is output from each of the one or more input devices and input to the server apparatus, and the server apparatus executes the operating system and the application program based on the input information signal.

Abstract: A technique can be used to obtain content (e.g., a live feed, pre-positioned content, etc.) from a content-originating device (a content source). The technique involves identifying a tree-based location-path having a series of locations which leads from the computerized device to the content-originating device. Each location includes a set of devices, and the set of devices of at least one location includes multiple devices. The technique further involves selecting a device-path from the computerized device to the content-originating device based on the identified location-path, and acquiring the content from the content-originating device from at least one of the devices along the selected device-path. The selected device-path includes at least one device of each location of the series of locations.

Abstract: A technique for adding a participant to a network is provided. This technique allows for the simultaneous sharing of information among many participants in a network without the placement of a high overhead on the underlying communication network. To connect to the broadcast channel, a seeking computer first locates a computer that is fully connected to the broadcast channel. The seeking computer then establishes a connection with a number of the computers that are already connected to the broadcast channel. The technique for adding a participant to a network includes identifying a pair of participants that are connected to the network, disconnecting the participants of the identified pair from each other, and connecting each participant of the identified pair of participants to the added participant.

Abstract: A method for distributing sets of collision resolution parameters to be used for resolution of network access contention events among nodes of a non-centralized media access control shared medium network. A set of collision resolution parameters is provided which includes a sequence of fixed numbers for resolving a single network access contention event. A single collision signal slot master node is identified when one or more candidate collision signal slot master nodes exist. Collision signal slot request messages are sent from client nodes addressed to all network nodes. Collision signal slot assignment messages are sent from the master node to the client nodes. A collision resolution parameter set to be employed by that given client node is obtained at a given client node from within a received collision signal slot assignment message. Collision signal slot acknowledgment messages are sent from client nodes addressed to all network nodes.

Abstract: In a communication network in which one master device and a plurality of slave devices are connected via a multiplexer to each other in a tree form with the master device provided at the vertex, the master device specifies each of the slave devices via the multiplexer according to a round-robin. Then the slave device transmits specific information for starting used for matching the sampling time to the master device according to the specified order. Finally, the sampling time is adjusted by executing a prespecified operation according to the specific information for returning returned from the master device in response to the specific information for starting.

Abstract: Methods and apparatus are disclosed for communication between appliances. In one embodiment, the method comprises receiving at an appliance communications manager that stands apart from source and destination appliances, a connection request from a source appliance, receiving at the appliance communications manager destination appliance communication information for a destination appliance, and receiving at the appliance communications manager a communication message from the source appliance. The method additionally comprises storing the communication message in a data memory of the appliance communications manager, establishing, via the appliance communications manager, a communication link with the destination appliance, and transferring the stored communication message to the destination appliance via the communication link.

Abstract: There is disclosed a system, method, apparatus and computer program product for managing a storage system including a SAN within a computer network. The storage system can be managed in object-oriented computer language. Object trees of each component in the storage system or SAN are obtained and combined on each storage processor in the storage system. The user interface (UI) can therefore select one storage processor within the storage system, and request such combined object tree information for the entire storage system or SAN from only that singular storage processor on which such combined information is stored. This eliminates a severe computational drain on the UI, which otherwise would be required to make these object tree combinations, and further allows a single point of storage management contact between UI and storage system or SAN by way of that singular storage or portal processor.

Abstract: A route bypassing a root node is constructed in a network in which a spanning tree is formed. A received frame is sent out on a designated port as well as on a root port by using a designated-port data send-out function, provided that a transmitting port for the received frame is learned on the root port. When a frame is received on a blocking port, a transmitting port for a frame whose destination matches the source address of the received frame is temporarily learned on the blocking port by using a blocking-port learning function, on the condition that the destination of the received frame is already learned on some other port. When a frame whose destination matches the temporarily learned address is received, the temporary learning is changed to normal learning by using a temporarily learned address-based data transfer function.

Abstract: A distribution of location information in IP networks by intelligent endpoints is presented. The network comprises an intelligent endpoint operably coupled to a plurality of clients. A first one of the clients registers with the intelligent endpoint that stores location information of the first client. A second one of the clients may also register with the intelligent endpoint that stores the location information of the second client. The intelligent endpoint automatically presents the location information of the first client to the second client and of the second client to the first client. The first client can then directly communicate with the second client. Either client can also be an intelligent endpoint.

Abstract: A network control apparatus for controlling devices in a predetermined area of a communication network includes a request-receiving unit for receiving a first route-setting request, a database for storing device information and topology information, a request-range-judging unit for forming a judgment as to whether or not the first route-setting request is relevant to any of the controlled devices, and a request-transmitting unit for transmitting the first route-setting request to an upper-level network control apparatus in the case of the request-range-judging unit's judgment outcome indicating that the first route-setting request is irrelevant to any of the controlled devices.

Abstract: The present invention concerns interprocess communication systems consisting of an arbitrary number of homogeneous or heterogeneous physically connected units, where a central unit executes at least one central process—called Central Process—and at least one of the units executes peripheral process(es), which are connected to the Central Process via at least one standing logical bidirectional connection. The Central Process assigns logical identifications to the connections of the peripheral processes. Using these logical identifications, peripheral processes can communicate independently of the physical units with selected peripheral processes or connections. Peripheral processes of the same kind can be exchanged transparently for other peripheral processes. Peripheral processes can maintain parallel connections to multiple Central Processes and Central Processes can be linked directly or indirectly via links to arbitrary hierachies or topologies.

Abstract: A network configuration and method provide communication setup between neighbor nodes in a communication network, without broadcasting this setup information over the network. A signaling bandwidth separated from the data communication channel bandwidth facilitates address resolution over a common transmission medium. The user is not required to know any physical address properties of the neighbor nodes. This reduces the complexity of the information that a network administrator is required to manage. This processing feeds into a complete address resolution table, which is employed for controlling network communication over the main data communication channel bandwidth. Typically, substantially continuous transmission and/or reception over the signaling bandwidth is useful not only to determine the neighbor node's active address upon startup, but also while the network is running, to detect if a signaling element has been exchanged or has changed activity.

Abstract: A system and method of handling and routing a desired command between a sender with a coupled invoker and a recipient With a coupled receiver that uses and implements a next hop technique. A router object is provided with a hierarchical tree of routers mapped by a router destination table. A destination address of the desired command is examined, moved, and routed to a next hop location based on the router destination table and the destination address. It is determined whether the desired command has reached the final destination, and the command is delivered from the invoker to the receiver when the final desired destination address has been reached.

Abstract: A digital processing system P, configured as a regular tree with n+1 levels S0, S1, S2 . . . Sn and degree k, provided in the form of a circuit Pn on the level Sn and forms the root node of the tree, an underlying level Sn−q, q=1,2, . . . n−1, in the circuit P provided nested in the Kq−1 circuits Pn−q+1 on the overlying level Sn−q+1, each circuit Pn−q+1 on this level including k circuits Pn−q. A q=n defined zeroth level in the circuit Pn includes from Kn−1+1 to Kn circuits P0 which form kernel processors in the processing device P and on the level S0 and constitute the leaf nodes of the tree, the kernel processor P0 being provided nested in each of the circuits p1 on the level S1. Each of the circuits P1, P2, . . . Pn, includes a logic unit E which generally is connected with circuits P0, P1, . . . Pn−1. Each of the circuits P0, P1, . . . Pn has additionally identical interfaces I, such that IP0−IP1− . . .

Abstract: A method for initializing a computing system comprising a plurality of devices which communicate on a communication link comprising a plurality of independent point-to-point links is provided, each of the point-to-point links interconnecting a respective pair of the plurality of devices. The method includes a link initialization procedure comprising initially configuring each respective pair of devices to communicate on the respective interconnecting link using common communication parameters, including a common frequency and a common link width. The link initialization procedure also may include an optimization procedure for determining maximum communication parameters for each interconnected pair of devices. If the maximum compatible parameters differ from the common parameters for any pair of devices, then the pair of devices may be reconfigured to communicate on the interconnecting link using the maximum compatible parameters.

Abstract: Bridges (10, 12, 14) are used to interconnect local area networks transparently. In the IEEE 802.1D standard for bridges, a spanning tree is built among the bridges for loop-free frame forwarding (FIG. 10). Although this approach is simple, it does not support all-pair shortest paths. A novel bridge protocol is employed that attempts to find and forward frames over alternate paths that are shorter than their corresponding tree paths on the standard spanning tree, and makes use of the standard spanning tree for default forwarding. The protocol, referred to as the Spanning Tree Alternate Routing (STAR) Bridge Protocol, is backward compatible with the IEEE 802.1D standard and has a complexity that is comparable to that of the standard and other existing protocols and further includes an ability to prioritize the forwarding of frames over at least two different paths responsive to a priority value carried by a frame to be forwarded.

Abstract: In a multicast network, a method is employed for selecting a low cost multicast conference tree subject to an end-to-end delay constraint for transmissions between any two nodes in the tree that terminate conference participants. The method employs a constrained minimum cost Steiner tree selection technique that integrates facilities costs and a delay constraint into a single objective function to be minimized as the tree is incrementally configured. The method also incorporates a unique path delay metric (delta diameter) that indicates the effect on end-to-end delay resulting from the incremental addition of a next node to the Steiner tree.

Abstract: A method and system for operating multiple communicating caches. Between caches, unnecessary transmission of repeated information is reduced. Pairs of communicating caches compress transmitted information, including noncacheable objects. A first cache refrains from unnecessarily transmitting the same information to a second cache when each already has a copy. This includes both maintaining a record at a first cache of information likely to be stored at a second cache, and transmitting a relatively short identifier for that information in place of the information itself. Caches are disposed in a graph structure, including a set of root caches and a set of leaf caches. Both root and leaf caches maintain noncacheable objects beyond their initial use, along with a digest of the non-cacheable objects. When a server devices returns identical information to a root cache, root caches can transmit only a digest to leaf caches, avoiding re-transmitting the entire noncacheable object.

Abstract: The invention relates to a communicating system comprising a data terminal, a wireless communication device, and data transmission means for setting up a local data transmission connection between the data terminal and the wireless communication device. The data transmission means comprise a data transmission means of the data terminal and a data transmission means of the wireless communication device. The data terminal comprises means for running application software, an application software connection, means for controlling the data transmission means of the data terminal, and a first connection interface for data transmission between the application and the application programming interface. The data transmission system comprises also a data adapter, a second connection interface for data transmission between the application programming interface and the data adapter, and one or several media interfaces for data transmission between the data adapter and the data transmission means of the data terminal.

Abstract: A network route tracing system traces a path through a network and identifies network components and communications links affected by the path. According to one embodiment of the present invention, a route is traced between two hosts in a network. The network is represented as a logical tree having a plurality of nodes. Each one of the nodes corresponds to a component in the network and each non-root node has a parent node. Two nodes are identified in the logical tree. A first node corresponds to a first host and a second node corresponding to a second host. If one of the two nodes exists at a lower level of the logical tree, then a first path is traced from the first node at the lower level to the parent node at a higher level until the parent node is at a same level of the logical tree as the second node. The first path is further traced up the logical tree from the parent node and a second path is traced up the logical tree from the second node until the first path and the second path meet at a same node.

Abstract: The bandwidth of a group of Internet users, called listeners, is pooled, and that bandwidth is employed to broadcast a data stream, substantially concurrently, to those listeners. A broadcast manager coordinates the connections between the originator of the data stream and the listeners. The originator divides the data stream into a number of channels. Each channel is transmitted over a tree of interconnected listeners. A given listener in a given tree receives that channel from its parent in that tree, and retransmits the channel as it is received to its children in that tree. Each listener is present once in each tree, so the listener receives each channel once. Listeners combine the incoming channels to reproduce the originator's data stream. The result is that almost the entire transmission bandwidth required for the broadcast is provided by the listeners. In some embodiments, a given listener is required to transmit no more data than it receives.

Abstract: A multiple processor integrated circuit includes a plurality of processing units, cache memory, a memory controller, an internal bus, a packet manager, a node controller, configurable packet-based interfaces, and a switching module. The internal bus couples the plurality of processing units, the cache memory, the memory controller, the packet manager, and the node controller together. The switching module couples the configurable packet-based interfaces with the packet manager and node controller. Each of the packet-based interfaces may be configured to provide a tunnel function, a bridge function, and/or a tunnel-bridge hybrid function. In the tunnel-bridge hybrid mode, the packet-based interfaces enable the multiple processor integrated circuit to provide peer-to-peer communication with other multiple processor integrated circuits in a processing system that includes a plurality of multiple processor ICs.

Abstract: The present invention is directed to a system and method for establishing a point to multipoint communication network. Preferable, the point to multipoint communication network is established in the environment of a home of small office, and the invention is realized through a computer that may dynamically establish both LAN and WAN communications. Broadly, the system and method of the present invention are realized by a computer that is configured to assume a role as either a Master or a Slave on a LAN. If the computer is the first (or only) computer powered up on the LAN, then it assumes the role of Master. In this role, the computer establishes a communication link with a WAN (such as with an Internet Service Provider), and directs all WAN communications over the WAN, using a WAN frequency and protocol (such as DSL). As other computers join the LAN, then WAN communications from those computers are relayed through the Master to the WAN.

Abstract: In a computer network including plural communications nodes connected through buses, the bus use efficiency in data transfer is improved. A root node having received a transmitted data from a first node repeats the received data to a port connected with a second node corresponding to a destination of the data, and outputs, to other ports, an NW signal indicating that a data is being transferred. A third node having received the NW signal at its root port sets a fourth node having a function as a root node as a local root node, so as to form a local network capable of independent data transfer therein. In this local network, data transfer is executed between other nodes. Through this control, plural data transfer can be executed in parallel in point of time.

Abstract: A method for allowing appliance-to-appliance communication transactions wherein an appliance communications manager that stands apart from source and destination appliances receives a connection request from a source appliance. A phonebook having a plurality of phonebook entries, and stored in the appliance communications manager, is then accessed. Each of the phonebook entries includes a destination appliance identifier and associated destination appliance communication information. A user of the source appliance is presented with a list having a plurality of the phonebook entries. The appliance communications manager receives the identity of a destination appliance selected from said list and, via the appliance communications manager, a communication link is established with the selected destination appliance. When a communication message is received from the source appliance, the communication message is sent to the selected destination appliance.

Abstract: A module connection assembly connects modules in a torus configuration that can be changed remotely. In particular, a single module can be added to or deleted from the configuration by remotely switching from conducting paths that provide end-around electrical paths to conducting paths that provide pass-through electrical paths. The assembly includes two backplanes, a first set of module connectors for electrically connecting modules to one of the backplanes, and a second set of module connectors for electrically connecting modules to the other backplane. The assembly further includes configuration controllers. Each configuration controller selects between end-around electrical paths that electrically connect multiple module connectors of the first set to each other, and pass-through electrical paths that electrically connect module connectors of the first set to module connectors of the second set.

Abstract: A mobile agent is provided with ancestor gene information and self gene information. The self gene information is encrypted information which indicates how many generations the mobile agent is descendant from the original agent. When the mobile agent creates a clone (creates a child agent), it generates gene information of its self generation+1 and implants it in the child agent. The mobile agent moving on the network and encountering another mobile agent on a same place obtains gene information from that agent, converts the obtained gene information by a predetermined algorithm, and determines if the agents are descended from the same ancestor.

Abstract: In a hierarchical tree-based protection scheme, a node in a mesh network is designated as a root node of a spanning hierarchical protection tree and subsequently invites each adjacent node to become its child within the tree. If the inviting node provides a more capacious protection path to the root node than is currently enjoyed by the invitee, the invitee designates the inviting node as its primary parent and assumes a new tree position. Otherwise, the invitee designates the inviting node as a backup parent. A node assuming a new tree position invites all adjacent nodes except its parent to become its child. The invitations propagate throughout the network until a spanning hierarchical protection tree is formed. Upon a subsequent failure of a straddling link, the tree may be used to re-route data. Further, given a tree link failure, protection switching is quickly achieved at a disconnected node through use of a backup parent as the new primary parent.

Abstract: A communications apparatus having: a communication cable receptacle having signal terminals and power supply terminals for connection to a communication cable having signal lines and power supply lines; a communication interface for transferring a signal to and from an external via the signal terminals of the communication cable receptacle; and one or a plurality of light emitting elements capable of emitting light, the light emitting element being disposed near the communication cable receptacle, being selectively connected to the power supply terminals of the communication cable receptacle, and being capable of displaying at least one of a communication state, a state of the apparatus, an alarm state, and a connection state of the apparatus while receiving a power from the communication cable via the power supply terminals.

Abstract: Systems involving generations of a complex node respresentation of a PNNI peer group are provided. Use is made of a set of restrictive costs, such as a transition matrix, defining the restrictives costs of paths between pairs of border nodes of the peer group. The complex node representation generation method is based on the group evolution process of the logical group representation of a peer group, and use is also made of the spanning tree representation of a network. Complex node representations generated by the disclosed possible number of exception bypasses.

Abstract: A Gigabit Media Independent Interface (RGMII), which is adapted to also implement a ten bit interface (RTBI) that is intended to be an alternative to both the IEEE 802.3z GMII and the TBI is disclosed. The interface has a reduced number of input and output pins, i.e., pin-count, that can implement the above BMII and TBI standards. More particularly, the interface reduces the number of pins required to interconnect the MAC and the PHY from a maximum of 28 pins (TBI) to 12 pins in a cost effective and technology independent manner. The RGMII maps pins to transfer data at the same data rate with control functionality with a minimum number of input and output pins, and does so by utilizing both the rising and falling edges of the clock signal and complies with existing interface specifications set forth in the IEEE standards.

Abstract: A novel method and apparatus for managing communication transactions between electronic appliances is presented. The invention includes a source input/output (I/O) communications function which establishes a first communication link between the apparatus and a source appliance, and a destination I/O communications function which establishes a second communication link between said apparatus and a destination appliance. The apparatus stores and executes a communications program in program memory which manages communications transactions between the source I/O communications function and destination communications function.