Abstract: The present invention provides a carrier network in which a spanning tree with no loops can be constructed even in a dual homing configuration, and a communication method for a control frame. By allocating an identical virtual network identifier to a plurality of user networks connected to the carrier network, a single virtual network is constituted. An ingress communication node connected to a first user network of the plurality of user networks attaches a tag including the virtual network identifier to a control frame transmitted from the first user network, and transmits the control frame attached with the tag to a transmission destination determined on the basis of the virtual network identifier.

Abstract: A high availability computing system includes a plurality of computer nodes (for example, a server system) connected by a first and a second network, wherein the computer nodes communicate with each other to detect server failure and transfer applications to other computer nodes on detecting server failure. The system incorporates methods of maintaining high availability in a server cluster having a plurality of nodes. A group communications service, a membership service and a system resource manager are instantiated on each node and the group communications service, the membership service and the system resource manager on each node communicate with other nodes to detect node failures and to transfer applications to other nodes on detecting node failure.

Abstract: Reduction of administrative overhead in maintaining network information, rapid convergence on an optimal routing path through the data network, and utilization of only required network resources are realized by a novel method for establishing a call path between network users. The method is based upon deployment of a network information server that stores network topology information and that is addressable by each end user. In this method, the network information server receives a request to establish a call path. The request identifies at least the calling party. In response to the request, the network information server determines a network traversal between the calling party and a root network wherein the network traversal includes call path information about the sub-networks between the calling party and the root network. The request for establishing a call path can also identify the called party.

Abstract: A method for constructing a network topology is applied in a streaming delivery system. The streaming delivery system includes: a center server (CS-P), an edge server (ES-P), a request scheduling server (RRS-P), and a client. The disclosed embodiments utilizes the upload capabilities of the client to transmit a part of streaming data, thus consuming fewer center server resources. By constructing the network topology, the disclosed embodiments enable the client to obtain a part of streaming data from other clients, reduces the load capability requirements for the server, and ensures that a streaming delivery network may provide streaming live services with higher bandwidths and better quality.

Abstract: A spanning tree creation unit creates a plurality of spanning trees based on the network topology, and registers the spanning trees to a spanning tree information table. A spanning tree selection unit selects a spanning tree wherein communication resources will be used most effectively, out of the plurality of spanning trees registered to the spanning tree information table. A node setup unit sets the mapping information which expresses correspondence between the requested virtual LAN and the selected spanning tree in each node.

Abstract: Methods, systems, and products are disclosed for broadcasting a message in a parallel computer. The parallel computer includes a plurality of compute nodes connected together using a data communications network. The data communications network optimized for point to point data communications and is characterized by at least two dimensions. The compute nodes are organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer. One compute node of the operational group assigned to be a logical root. Broadcasting a message in a parallel computer includes: establishing a Hamiltonian path along all of the compute nodes in at least one plane of the data communications network and in the operational group; and broadcasting, by the logical root to the remaining compute nodes, the logical root's message along the established Hamiltonian path.

Abstract: A method to manage nodes in a ZigBee network. In a ZigBee network including a plurality of nodes, a multicast group is generated including at least two nodes among the plurality of the nodes. A multicast group coordinator (GC) which manages the multicast group is set among the nodes forming the multicast group. The multicast group includes the GC, a multicast group member (GM) requesting to join the multicast group, and/or a multicast router (MR) which links GMs to each other or links the GC and the GC. Accordingly, since the GC manages the multicast group, the load is decreased and the packet data transmission rate is enhanced.

Abstract: The invention relates to a device and a method, which reduce the outlay required when searching for a suitable network configuration, in particular in the field of automation. The device for the automatic planning of a network configuration, in particular for an automation system, comprises at least one partition module to break down at least one described network planning problem into sub-problems, at least one production module to generate at least one solution to each of the sub-problems of the at least one network planning problem based on predefinable rules and at least one validation module to verify the generated solutions to the sub-problems. The purpose of the device and the method according to the invention for automatic network planning is to support the planning process for network structures for major systems, in particular for systems with more than 1000 users, by supplying suitable methods and tools.

Abstract: A method of managing a computer network switch is disclosed. The method has the steps of: setting a port of the switch to root guard protected status (RG status); selecting by a spanning tree protocol (STP) the port as a designated port; and setting said port into blocked status, in response to said port being both in root guard protected status and selected by STP as a root port. By setting a port to root guard protected, the port is prevented from becoming a designated port, and so then forcing the root port to remain in a desired core network.

Abstract: The invention is a system for distributing content data over a computer network and a method of arranging receiver nodes in a computer network such that the capacity of the server is effectively multiplied many times over, and may even be increased exponentially. The invention takes advantage of the excess capacity many receiver nodes possess, and uses them as repeaters. The distribution system includes nodes having databases which indicate their ancestors and descendants so that reconfiguration of the distribution network may be accomplished without burdening the systems primary server. The invention includes a process for configuring a computer information distribution network having a primary server node and user nodes docked in a cascaded relationship, and reconfiguring the network in the event that a user node departs from it.

Abstract: A network storage system includes a non-volatile memory to store data including a log of received data access requests, and a cluster interconnect adapter through which to send data to a cluster partner. The nonvolatile memory and the cluster interconnect adapter are implemented in a single device connected to an expansion bus in the network storage system. Communication with the nonvolatile memory is carried out using LDMA, and communication with the cluster partner is carried out using RDMA via the cluster interconnect adapter. LDMA and RDMA functionality are merged in a common software stack.

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: Network topology is inferred by (a) determining which non-interconnect devices are visible to each adapter in the network; (b) determining sets of adapters having visibility to identical sets of non-interconnect devices; (c) for each set of adapters having more than one adapter, associating an interconnect device to the set and assigning links to the associated interconnect device from the adapters; (d) obtaining a list of non-interconnect devices in the network excluding non-interconnect devices already having satisfied visibilities; (e) for each visible non-interconnect device in the list of all non-interconnect devices, finding an adapter not already linked to the non-interconnect device having visibility to the non-interconnect device, and assigning a link between the non-interconnect device and an interconnect device assigned to the found adapter or directly between the found adapter and the non-interconnect device; and (f) iterating steps (d) and (e) until visibility of each adapter is satisfied.

Abstract: A preference programmable first-one detector and quadrature based random grant generator in a crossbar switch is disclosed. The crossbar switch emulates a FIFO switching function in a single chip crossbar switch architecture that operates at a high switching speed with a large bandwidth and supports multiple QoS levels, yet do not demand an inordinately large number of input and output queues or otherwise excessively tax memory requirements. The system and method operate at a high switching speed with a large bandwidth and support multiple QoS levels, yet do not require a complex pointer management system, nor constrain switching speeds and bandwidth capacity therein. The system and method efficiently select data for switching within a crossbar switch based structure based on an urgency counter based WRR grant selection. This switching is achieved with economy of hardware by quadrature basing and quadrature preference selection.

Abstract: A network comprising a plurality of trees each comprising at least one ingress leaf node, at least one interior node, and at least one egress leaf node, wherein at least some of the ingress leaf nodes and the egress leaf nodes are common to the trees, and wherein the ingress leaf node is configured to transport data to the egress leaf node using any of the trees is disclosed. Also disclosed is a network component comprising a processor configured to implement a method comprising selecting one of a plurality of trees associated with information contained within a frame, directing the frame to the selected tree, and maintaining a filtering database (FDB) entry in an interior node in the unselected tree or trees.

Abstract: A layer 2 loop detection apparatus includes a unit recognizing a topology of an L2 network at normal time by collecting MIB information including information concerning ports of a plurality of L2 switches from the plurality of L2 switches through SNMP communication; a unit discriminating, based on a topology recognition processing, a blocking port for traffic blocking and a disable port under a port disable state each set under a Spanning Tree Protocol (STP); a unit setting each of the blocking port and the disable port as a monitoring point and periodically monitoring a state thereof; and a unit performing detection of an L2 loop by re-collecting a part of the MIB information from the plurality of L2 switches through SNMP communication and re-recognizing the topology of the L2 network, the detection of the L2 loop detection being triggered by a change of a state of one of the blocking port and the disable port.

Abstract: An Internet user transfers directly to a domain within an e-community by providing a home identity cookie having an extensible data area and enrollment token to a web browser by a home domain server, and enrolling through an e-community for a user of the web browser by redirecting the home identity cookie via the web browser to each of the affiliated domains in the e-community until each affiliated domain has been visited once by the web browser. Upon each visit to each affiliated domain, an affiliated domain identity cookie is sent to the web browser including an enrollment successful indicator. Enrollment success indicators are accumulated and persistently stored received in the extensible data area of said home identity cookie. Subsequently, the identity of the user is vouched for at an affiliated domain through exchange of a vouch-for request and vouch-for response between the home domain server and an affiliated domain server.

Abstract: The invention relates to a system and method called autotopology of a network or advertising based network management which enables the analysis and automatic graphical and hierarchical representation of any hierarchical or flat network topology, especially a switched Ethernet (SE). The autotopology can be used for self-configured networks (for example by using zeroconf) and for any otherwise configured networks, especially using DHCP or manually configured networks. The use of zeroconf is called autoconfiguration. Autoconfiguration and autotopology enable a comfortable and safe administration of a network. Administration of a self-configured network using the autotopology data proceeds in a separate and low-priority sub-network (link local) so that the productive operation of the network remains undisturbed. The topology of the network is used as a clear possibility of administering a network. Administration of the network is possible immediately after determination of the topology.

Abstract: Data is received from a plurality of processes of a distributed computing arrangement. The computing arrangement contains a plurality of processing nodes. In a first processing node of the plurality of processing nodes data objects are received from a subset of the plurality of processes. A set of non-responsive processes of the plurality of processes is determined based on arrival times of the data objects relative to a current time. The data objects are aggregated into a set of data objects without waiting for data objects associated with the non-responsive processes. The set of data objects are sent to a second processing node of the plurality of processing nodes.

Abstract: A network route tracing system traces a path through a network and identifiesnetwork 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: A method to organize nodes into an overlay network and to disseminate multicast messages within this overlay both through an efficient tree embedded in the overlay and through gossips exchanged between overlay neighbors. Regardless of the size of the system, this invention incurs a constant low overhead on each node.

Abstract: A system for performing storage operations using hierarchically configured storage operation cells, the system comprising: a first storage manager component; and a first storage operation cell, the first storage operation cell having a second storage manager component directed to performing storage operations in the first storage operation cell; wherein the first storage manager component is programmed to instruct the second storage manager regarding performance of storage operations in the first storage operation cell.

Abstract: A method and apparatus for producing a multicast tree in a network traces such tree based upon information retrieved from a multicast database that is protocol independent. More particularly, the network includes a plurality of network devices. A set of the plurality of network devices each includes the prior noted protocol independent multicast database. After the multicast database in each of the set of network devices is located, the multicast information in such databases is retrieved. After being retrieved, the multicast information is traced across the plurality of network devices to form the multicast tree.

Abstract: The present invention is provides a system and method for managing connectivity objects and their associated parameters for a mobile device. The connectivity parameters are stored in a tree structure. For example, a proxy may be a node in the tree with its connectivity parameters listed as leafs. Similarly, a network access point (NAP) object may be a node within the tree. The parameters stored within the tree may be created, modified, deleted, and queried remotely or locally. Any portion of the tree may be modified or queried without having to send the entire tree to the device. Provisioning and modification of the tree is enabled via eXtensible Markup Language (XML). A wireless access protocol (WAP) sub tree is defined under the proxy object. The NAP object may also be used to help manage Wi-Fi connections and desktop pass-through connections. A vendor specific sub tree is also included within the tree that may be used to contain vendor specific settings.

Abstract: A system for rapidly switching at least one virtual local area network (VLAN) from a first loop-free topology to a second loop-free topology in response to a failure within the first loop-free topology. Each VLAN has one “logical” VLAN which represents the network entities organized into the VLAN and a set of “physical” VLANs each having its own VLAN designation. For each physical VLAN, a different loop-free topology is defined, although only one physical VLAN is “active” at any given time. Messages associated with the logical VLAN are tagged with the designation of the currently active physical VLAN, and forwarded along its loop-free topology. Upon detecting a failure in the loop-free topology, the logical VLAN is rapidly switched to the loop-free topology defined by a second, back-up physical VLAN. Following the switch, messages associated with the logical VLAN are tagged with the designation of this back-up VLAN and are forwarded along its loop-free topology.

Abstract: A Kitchen Display System (KDS) includes a workstation including a first Personal Computer (PC)-based controller, a fanless workstation including a second PC-based or a non-PC-based controller having lower cost than the first PC-based controller, an Ethernet network operatively coupling the controllers, and a bump bar, keyboard, touchscreen, or keypad operatively coupled to at least one of the controllers. The first PC-based controller stores and displays video, multimedia, or a build card. At least one of the controllers includes a rugged computing module, which includes a circuit board including an outer perimeter and traces associated therewith, an integrated circuit mounted on the circuit board, at least one interface connector, a housing, and a thermal transfer device.

Abstract: A groupware management system for collaborative groups is disclosed that is scalable to support large, dynamic, multiple, and other virtual VPNs. The system may introduce a graph (or hierarchical) structure to the VPN, providing multiple master nodes controlling membership in subsets of the collaborative group. Use of multiple master nodes in a graph-structured (or hierarchical) network topology often relaxes the need for a single, centralized, globally consistent view of VPN group membership, and enables distribution of the management burden among multiple master nodes. Membership in the VPN may be changed dynamically by the second master node for the member nodes of the second subset, without requiring the first master node to dynamically update its group membership records to reflect the change and in many cases without even having to notify the first master node (and vice versa), for example.

Abstract: In one embodiment, a computer cluster network includes at least three switches communicatively coupled to respective at least one client nodes. At least one of the at least three switches communicatively couples together at least two other ones of the plurality of switches. In a method embodiment, a method of networking client nodes includes communicatively coupling each switch of at least three switches to respective at least one client nodes. The method also includes communicatively coupling together at least two switches of the at least three switches through at least one other switch of the at least three switches.

Abstract: A switching network for multiple computer systems is disclosed which utilises pairs of multi-port switches (S1-S4) and (preferably) less complex switches (S5-S7). The multi-port switches are arranged in pairs with a computer of the multiple computer system being able to be connected to each port of each multi-port switch except for one port. That one port of each multi-port switch is connected to a single one of the less complex switches. All the less complex switches are arranged in a twin branch multi-level tree structure. The arrangement overcomes bottlenecks arising from the serial interconnection of multi-port switches.

Abstract: A switching network for multiple computer systems is disclosed which utilises pairs of multi-port switches (S1-S4) and (preferably) less complex switches (S5-S7). The multi-port switches are arranged in pairs with a computer of the multiple computer system being able to be connected to each port of each multi-port switch except for one port. That one port of each multi-port switch is connected to a single one of the less complex switches. All the less complex switches are arranged in a twin branch multi-level tree structure. The arrangement overcomes bottlenecks arising from the serial interconnection of multi-port switches.

Abstract: Computer systems and methods using efficient module and backplane tiling to interconnect computer nodes via a Kautz-like digraph. A multinode computing system includes a large plurality of computing nodes interconnected via a Kautz topology having order O, diameter n, and degree k. The order equals (k+1)kn?1. The interconnections from a node x to a node y in the topology satisfy the relationship y=(?x*k?j) mod O, where 1?j?k, and the computing nodes are arranged onto a plurality of modules. Each module has an equal plurality of computing nodes on it. A majority of the inter-node connections are contained on the plurality of modules and a minority of the inter-node connections are inter-module connections. Inter-module connections are routed among modules in parallel on an inter-module connection plane.

Abstract: System and method for automatically updating a memory map coupled to or included in a programmable logic controller (PLC). A PLC may automatically detect at least one programmable hardware element (PHE) coupled to the PLC. The PHE may provide a customizable interface, i.e., input and output (I/O) interface, between one or more devices and the PLC. The devices may include one or more measurement, data acquisition, signal generation, automation, motion control, and/or analysis device(s), among others. The PHE may perform one or more functions on the data transmitted between the device(s) and the PLC. One or more of the PHEs and/or device(s) may be local or remote to the PLC. The PLC may automatically update the memory map based on a hardware I/O interface of the at least one programmable hardware element, where the memory map facilitates communications between programs executing on the PLC and the programmable hardware element.

Abstract: The invention concerns a method whereby each module is determined from the address of the module located immediately upstream in the networked relative to the central unit, the detected address being transmitted by the upstream module in an attribution message, which triggers off an automatic search phase for the module without address, nearest downstream to a module with an address, during which each downstream module without address receives (50) the address attribution message, triggers (52) a delay whereof the duration is so much longer if the received message reception is low, and if at the end (54) of the delay, no address capture message is detected (53), it transmits (56) such a message, stores (57) the received address, determines the address of the nearest downstream module without address, and triggers (30) the search phase for the nearest downstream module without address.

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: A network management apparatus and method for determining the topology of a network 1 is described. The present invention uses data relating to discovered devices on the network 1, typically network management address table data, to build a network tree. Due to the presence of unsupported or unmanaged connecting network devices, some branches of the resulting tree may not be resolved. In order to address this, for each unresolved branch of the network tree, the present invention attempts to determine the type of each of the discovered network devices on the branch, and if the type of every discovered network device on the branch is determined to be an endstation type, the present invention determines that an undiscovered connecting device is present on the branch.

Abstract: An aspect of the invention is physical layer interface for a network interface including a plurality of input/output pins. The input/output pins are coupled for being multiplexed into a physical layer interface selected from among a Reduced Gigabit Media Independent Interface and a Gigabit Media Independent Interface. The input/output pins internal to a programmable logic device are for access to and from a processor block located in the programmable logic device.

Abstract: A method and system of managing resource allocation in a non-uniform resource access computer system is disclosed. A method comprises determining access costs between resources in a computer system having non-uniform access costs between the resources. The method also includes constructing a hierarchical data structure comprising the access costs. The hierarchical data structure is traversed to manage a set of the resources.

Abstract: A relative address protocol for communicating message packets along a linear chain network or quasi-linear chain network is disclosed. The protocol includes a relative destination address field that includes a counter having a preselected initial value at a source node. The initial value is a function of the desired number of node hops that the message packet should travel from the source node. The counter is adjusted in value at each subsequent node by a preselected step in value. When the counter value reaches a trigger value the message packet is accepted by a destination node. In a preferred embodiment, a relative source address field stores the initial value so that the destination node may return a status message to the source node.

Abstract: In a network system, each ECU transmits a start control frame when to start, and is started when it receives the start control frame from any other ECU during the stop of its operation. Besides, each ECU transmits a stop control frame cyclically during its operation, and continues its operation in spite of being capable of stopping its operation, while it is receiving the stop control frame from any other ECU. In transmitting each of the frames, each ECU affixes cause information expressive of a start cause or an operation stop incapability cause to the frame. In stopping a network, a supervisory device specifies the start ECU and the start cause thereof from the start control frame and stores them in a nonvolatile memory.

Abstract: In one embodiment, a router includes a star switching fabric operable to receive a plurality of optical signals each having a wavelength and each associated with a payload received by the router and to communicate from the switching fabric a plurality of substantially similar sets of the optical signals. The router further includes a plurality of tunable filters each having a configuration speed and each associated with a communication path coupled to one of a plurality of destination elements. Each filter is operable to receive one of the sets of optical signals from the switching fabric and to selectively tune to a wavelength of one of the plurality of optical signals received to facilitate communication of at least the payload associated with that optical signal toward the destination element associated with that filter. The router also includes a plurality of line cards operable to facilitate generation of at least some of the optical signals for transmission to the star switching fabric.

Abstract: A process for merging and using the Mediation Device Protocol with a network layer protocol. Under the merged protocol, each device joining a network enters into two stages: the Set-Up Stage and the Normal Operational Stage. During the Set-Up Stage, the device identifies its neighbors, builds a neighborhood list, obtains a Logical ID, and picks a parent node in the network. After the Set-Up Stage is complete, the device enters the Normal Operational Stage where it will send/receive control and data messages, invite and help new nodes to join the network, recover from broken links or topology changes, and other normal network operations.

Abstract: A client-server based system for providing location related information and services to mobile users is disclosed. A plurality of servers, wherein a server is a provider of information and services related to a specific predefined geographical coverage area, operate in a tree-shaped network. An operating mobile client, preferably operating in a mobile phone or PAD of a mobile user, establishes upon connection to the network an association, based on client location information, with one server at a time. A server association can be transferred from one server to another on an existing network connection as the user relocates from one server coverage area to another, and a user profile stored with the client or a special user profile server is applied to the standard user interface in the current server to provide the client with a personal user interface adapted at any time to the requirements of the user and to the information and/or services available at the current server.

Abstract: A method for generating a simulated network using a graphical user interface (GUI). A network topology generated at a GUI by a user is received, wherein the network topology includes a plurality of devices and at least one connection between devices. A build file describing the network based on the network topology is automatically generated. A user is able to create and edit a simulated network through the GUI, thereby obviating the need for manually coding a simulated network. Large simulated networks can be quickly created, edited and maintained.

Abstract: A modular computer system includes at least two processing functional modules each including a processing unit adapted to process data and adapted to input/output data to other functional modules through at least two ports with each port including a plurality of data lines. At least one routing functional module is adapted to route data and adapted to input/output data to other functional modules through at least two ports with each port including a plurality of data lines. At least one input or output functional module is adapted to input or output data and adapted to input/output data to other functional modules through at least one port including a plurality of data lines. Each processing, routing and input or output functional module includes a local controller adapted to control the local operation of the associated functional module, wherein the local controller is adapted to input and output control information over control lines connected to the respective ports of its functional module.

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: The present invention provides methods and apparatus for classifying and demultiplexing packets in a network protocol stack. It provides extendibility for packet processing in the network protocol stack by defining a standard method for adding new functionality. It provides a method to obtain external information, from an application scheduled outside of the forwarding or interrupt context of the kernel, in order to augment packet classification and/or augment packet disposition. In some embodiments, external information augments a criteria of a node in a classification tree with additional information. It presents a way of augmenting which suspends the classification process until an application, scheduled outside of the forwarding or interrupt context of the kernel, completes. The resulting external information is used to augment the packet classification.

Abstract: System and method for establishing a virtual circuit from a client, through an ATM network, to any one of a plurality of servers forming a functional group. The present invention operates as a peer group leader within the ATM network, routing virtual circuits when a routing request is received. The present invention selects an operation server from the functional group, computes a route from the client to the selected server, and returns the route in a designated transit list.

Abstract: A distributed multi-axis motion control system comprises a multicast communications network having several node components. Each of the node components includes a clock and an actuator. The actuators are part of a motor system and a pattern profile table of the motor system is generated. The pattern profile table is translated into a separate single-direction-of-motion pattern table to separately direct the motion of each of the actuators of the node components. A grandmaster clock generates synchronization signals which are transmitted through the network at a sync interval and which synchronize the clocks. Time-bombs are generated at an interval which is a whole number multiple of the sync interval. The time-bombs cause concurrent execution of the first and subsequent steps from the single-direction-of-motion pattern tables to produce synchronized multi-axis motion of the motor system.

Abstract: System for personalized information distribution (PID) from an information source server (1) to several user terminals (2) via an information distribution network (3) comprising several active nodes (4), forming a PID-tree (5). The active nodes comprise distribution control means (6) setting the information distribution process in the relevant active node in accordance with local distribution parameters (parm). The distribution parameters are manageable via said network by distribution control codes (dcc) originated by said user terminals or by other active nodes in the PID-tree.

Abstract: This invention relates to apparatus and associated methods for providing access to and switching of information in a packet data network. More particularly, the invention is directed to a platform facilitating both packet switching capabilities and associated access interface functions in a single system.