Abstract: In an audio network system connecting a plurality of nodes in a ring form, a master node transmits a packet of frame data regularly every sampling cycle, such that the packet circulates through the nodes during the sampling cycle. The packet is provided with a plurality of regions for containing audio sample data in correspondence to a plurality of channels. A first node reads audio sample data from a particular region of the packet, which corresponds to a particular channel allocated to the first node, and stores the read audio sample data in a buffer. The first node acquires positional information indicating whether a second node which has written the audio sample data into the particular region is located upstream or downstream of the first node. The first node reads and outputs a previous one of the audio sample data from the buffer if the second node is located upstream of the first node, and outputs a current one of the audio sample data if the second node is located downstream of the first node.

Abstract: A network station for a data network for receiving external data and for transmitting device-internally prepared data has a repeater for transmitting an external data packet received at a data input to a data output, a first data preparation unit for transmitting an internal data packet generated from the prepared data via the data output, having a switching device for interrupting the data path between the data input and the data output, a control unit that is connected to the switching device in order, in a first operating mode, to block the transmission of the received external data packet via the data output if the internal data packet is currently being transmitted via the data output by the data preparation unit, and to permit the transmission of the received data packet by the repeater via the data output if no internal data packet is currently being transmitted via the first data preparation unit.

Abstract: A communication device (102), communication node (104), and method for transmitting a message are disclosed. The method includes calculating number of frames (402) in a message to be transmitted from the communication device. The method further includes determining transmission power (404) for the message based on the number of frames. The method further includes transmitting each frame of the message (406) using the determined transmission power.

Abstract: A communication control device comprising a plurality of network processors for performing high-speed communication among these network processors. The communication device connects a plurality of processor interfaces to each other using an internal communication path. Each processor interface is connected to one or a plurality of the network processors. The processor interface comprises a selector for each connected network processor. In one preferred embodiment of this invention, transmission rights are granted to a selector which received a token cell. The selector outputs communication cells received from a network processor onto the internal communication path only when the selector possesses the transmission rights. Having outputted all of the communication cells, the selector outputs the token cell onto the internal communication path. When the token cell is outputted, the selector loses the transmission rights.

Abstract: Embodiments of the present invention are related in general to data flow control in a network and in particular to packet flow control in a bidirectional ring interconnect. An embodiment of a method includes sending packets on the bidirectional ring interconnect in a first direction or on the bidirectional ring interconnect in a second direction, opposite to the first direction, between source and destination nodes on a semiconductor chip during a clock cycle based on a distance between the two nodes. An embodiment of an apparatus includes a semiconductor chip comprising a bidirectional ring interconnect and a plurality of nodes coupled to the bidirectional ring interconnect, where the bidirectional ring interconnect may transport packets in a clockwise or counterclockwise direction during a clock cycle based on the distance between source and destination nodes. Embodiments ensure single packet arrival at the destination node during any clock cycle. Exemplary applications include chip multiprocessing.

Abstract: A network includes multiple nodes interconnected to form a ring topology. These nodes support data transmissions over the network using tokens. To send and receive data over the network, nodes may process control messages. A node can receive a first token authorizing transmission on one of multiple data channels, generate a transmission control message identifying a destination node and the authorized data channel, and communicate the transmission control message to a next node. The node can also communicate a second token to the next node authorizing secondary transmissions on the authorized data channel, transmit data on the authorized data channel after communicating the transmission control message, and communicate the first token to the next node after communicating the second token to the next node.

Abstract: A communications system whose bandwidth resources can be used more efficiently by reserving them on an individual path basis. Upon receipt of a bandwidth reservation message, a path setup initiator examines the message and thereby recognizes that the local station device is the egress node of a specified logical network segment. It then consults a topology database to retrieve hop counts of the source station device, which reveals, for example, that a first ringlet has a smaller hop count than a second ringlet. The path setup initiator sends a working path setup message to the ingress network device over the first ringlet, as well as a protection path setup message to the same ingress device over the second ringlet. Upon receipt of those messages, a bandwidth reservation unit reserves a working path bandwidth on the second ringlet, as well as a protection path bandwidth on the first ringlet.

Abstract: Embodiments of the present invention automatically determine via heuristics optimal configurations to form sub-rings of nodes and where to position gateway processors among these sub-rings. The heuristics may be applied at a predefined timing interval configured by the user or in response to various events, such as a node failure or when a node joins the multi-ring network. Another embodiment of the invention may use automatic heuristics to determine when a suboptimal multi-ring configuration exists and formulates a new multi-ring configuration.

Abstract: There is disclosed a communication apparatus designed to assure the execution of ring type multi-address data transmission. In order to ensure that a user see a received image, transfer to a next station is not carried out until the received image is printed out. With the passage of specified time after the reception of the image, transfer is executed to the next station.

Abstract: A wireless communication method and system for controlling the current data bit rate of a radio link (RL) to maintain the quality of the RL. The system includes a core network (CN), a radio network controller (RNC) and at least one wireless transmit/receive unit (WTRU). The RL is established between the RNC and the WTRU. The RNC establishes a guaranteed data bit rate, a maximum data bit rate and a current data bit rate associated with the RL. When the RNC senses an event which indicates that the quality of the RL has substantially deteriorated, the RNC reduces the value of the current data bit rate. Then, in a recovery process, if a similar event does not occur during an established waiting period, the RNC restores the current data bit rate back to the maximum data bit rate.

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: A bandwidth brokering system and method incorporating methodology for supporting self-healing communication rings is disclosed. The present invention utilizes state-based tokens that are transmitted on a separate communication channel between network nodes to monitor and correct communication failures occurring at a link, interface, and network node level. The invention as taught permits generic brokering of all available network bandwidth in a granular method without the need for fixed designations of “protection” or “working” communication paths. As such, the present invention permits integration of “protection” and “working” communication data paths to permit full utilization of available system bandwidth with graceful recovery in the event of system or link malfunctions.

Abstract: A method of reducing loading on backhaul communications links in a wireless communications system suppresses a portion of the upward flow of frame information for idle and/or erased frames in certain situations, such as when multiple ones of such frames are successively encountered. A radio base station abstains from sending a frame header to a BSC/ANC for second and following frames of the Idle type and/or the radio base station abstains from sending a frame header to a BSC/ANC for second and following frames of the Erased type. The header may also or alternatively be suppressed for an Idle frame immediately following a Good frame. The BSC/ANC in effect fills in the suppressed frame information in such situations, forwards appropriate indications of frame type to the frame selection algorithm.

Abstract: A method and apparatus for minimizing starvation of a station in a ring networked environment includes allocating a tax to each of the stations in the ring, and, for each packet that is to be transited though the ring, providing bandwidth to the station in the form of a tax packet, which allows the station to have ring access.

Abstract: The present invention presents a method and system for providing an intelligent data concentrator communicatively coupled to a network by a wireless mode. Specifically, the present invention comprises a portable intelligent device, communicatively connected to a network by a wireless mode, which may, for example, be placed in the center of a conference table to facilitate a number of client devices connecting for simultaneous access to the network and, at the same time, allowing for ease in moving about the room. In one embodiment, the portable intelligent data concentrator is communicatively coupled by a wireless mode to an access point. In one embodiment, the intelligent data concentrator is battery powered. In one embodiment, the access point through which the intelligent data concentrator is connected to the network is another intelligent data concentrator. In another embodiment, the access point is a Bluetooth access point.

Abstract: In a ring topology digital network propagation delay is reduced A master node transmits a clock signal into the network in one direction. Each slave node propagates the signal to the next slave node without regeneration until the signal is received by the master node. The amount of time the signal takes to travel around the ring, is measured and is the total ring propagation delay. The master node then transmits a clock signal in both directions to the first slave node which measures the difference in their arrival times and transmits the difference to the master node. The process is repeated for each other slave node. Based upon each difference the master node computes the propagation delay for each ring segment. The master node transmits to each slave node the corresponding ring segment propagation delay and each slave node adjusts the phase of the node's clock.

Abstract: A ring access system, for use in system having a plurality of routing platforms coupled by redundant rings, that allows access to either ring when a token is received at a first ring if all outstanding locally-sourced data has been stripped from the second ring.

Abstract: A system, apparatus and method to increase bandwidth in a physically segmented downhole network are described herein.

Abstract: A method of bandwidth management enabling to insure a guaranteed bandwidth to each station of transmission network comprising a plurality of stations (10, 12, 14) forming a logical ring wherein a token frame is circulating from station to station, each station being allowed to transmit a credit (c) of data bytes upon reception of the token frame wherein the credit is increased in proportion to a variable TRTT standing for Token Round Trip Time which is the time taken for the token frame to circulate around the logical ring since the preceding reception of the token frame by the station. The credit is increased in proportion of a variable CIR standing for Committed Information Rate which is the guaranteed transmission rate that the station can use to transmit data wherein the value of CIR is determined by a class of bandwidth which has been previously selected by the station upon the preceding reception of the token frame by the station.

Abstract: A method and apparatus for allocating time slots in a communications network, comprising a headend, a plurality of outstations, and a shared medium connecting each outstation to the headend. The method involves scheduling timeslots for each outstation responsive to the measures of distance of each outstation from the headend. The method reduces the requirement for guard bands between timeslots, since it obviates allocation of a guard band between consecutive first and second timeslots where the outstation allocated the second timeslot is located no closer to the headend than the outstation allocated the first time slot. Ideally, the timeslots are allocated to outstations cyclically in ascending order of distance of the outstations from the headend, with the closest outstation following the farthest to complete the cycle, so that guard bands are rendered unnecessary between the majority of timeslots.

Abstract: In a servo control system, a numerical control device and at least one servo amplifier are connected to each other with a serial bus to control a servo motor connected to the servo amplifier. In this system, data transfer systems of at least two types for the serial bus are set, and a data transfer system is selected by a parameter set in the numerical control device.

Abstract: A system that facilitate data packet transportation includes multiplexing time-sensitive TDM (Time Division Multiplexed) and other synchronous data, and asynchronous data traffic, onto a communication channel in a manner that minimizes jitter in the delivery of the TDM data traffic while efficiently transporting asynchronous data traffic. The system may also include dynamic bandwidth sharing on a communication ring. The dynamic sharing aspect of the system facilitates the efficient utilization of bandwidth of communication rings, particularly in those rings that cover large geographic areas.

Abstract: A network having a plurality of nodes is reconfigured to reflect a change in topology of the network. In particular, upon receiving a reconfiguration request, each node enters a quiescent state for a predetermined period of time sufficient to allow at least one other node to also enter a quiescent state. Then, upon termination of the quiescent state, the node is reconfigured to reflect the change in the topology of the network without having to check with any other nodes of the network. In other embodiments, the predetermined period of time is sufficient to allow currently executing protocols to complete execution as well as to allow the transmission of reconfiguration requests for propagating reconfiguration in the network.

Abstract: A control network comprises multiple master nodes and multiple slave nodes, connected together in a loop configuration by at least one fiber optic cable. The master nodes share concurrent control over the network nodes by time multiplexing or other techniques. The control network may include two fiber optic rings which carry the same data simultaneously in opposite directions around the loop. A polling scheme may be used by the master nodes such that only one node transmits at a given time in both directions around the loop. The receiving node(s) propagate the transmissions and select between the transmissions based on time, error rate, or other factors. A hierarchical control network may be constructed with upper tier and lower tier fiber optic rings. Multiple master nodes may be used at any level of the ring, and some or all of the rings may include two fiber optics for bidirectional, redundant communication within the network.

Abstract: A control network comprises multiple master nodes and multiple slave nodes, connected together in a loop configuration by at least one fiber optic cable. The master nodes share concurrent control over the network nodes by time multiplexing or other techniques. The control network may include two fiber optic rings which carry the same data simultaneously in opposite directions around the loop. A polling scheme may be used by the master nodes such that only one node transmits at a given time in both directions around the loop. The receiving node(s) propagate the transmissions and select between the transmissions based on time, error rate, or other factors. A hierarchical control network may be constructed with upper tier and lower tier fiber optic rings. Multiple master nodes may be used at any level of the ring, and some or all of the rings may include two fiber optics for bidirectional, redundant communication within the network.

Abstract: A control network comprises multiple master nodes and multiple slave nodes, connected together in a loop configuration by at least one fiber optic cable. The master nodes share concurrent control over the network nodes by time multiplexing or other techniques. The control network may include two fiber optic rings which carry the same data simultaneously in opposite directions around the loop. A polling scheme may be used by the master nodes such that only one node transmits at a given time in both directions around the loop. The receiving node(s) propagate the transmissions and select between the transmissions based on time, error rate, or other factors. A hierarchical control network may be constructed with upper tier and lower tier fiber optic rings. Multiple master nodes may be used at any level of the ring, and some or all of the rings may include two fiber optics for bidirectional, redundant communication within the network.

Abstract: A hub connects groups of nodes to form a separate communication loop permitting access to the full bandwidth of the separate communication loop. The switching hub may operate from a subset of the messages defined in the Fiber Channel arbitrated loop protocol while allowing the nodes to use the full protocol.

Abstract: A communications network having two complementary optical networks each connectable to a headend, each optical network comprising a plurality of periodic interleaving filters serially connected by optical waveguides such that an output port of one periodic interleaving filter is couple to an input port of another periodic interleaving filter, and wherein an input or output node of the network is formed by a non-serially connected input or output port of a periodic interleaving filter.

Abstract: A control network comprises multiple master nodes and multiple slave nodes, connected together in a loop configuration by at least one fiber optic cable. The master nodes share concurrent control over the network nodes by time multiplexing or other techniques. The control network may include two fiber optic rings which carry the same data simultaneously in opposite directions around the loop. A polling scheme may be used by the master nodes such that only one node transmits at a given time in both directions around the loop. The receiving node(s) propagate the transmissions and select between the transmissions based on time, error rate, or other factors. A hierarchical control network may be constructed with upper tier and lower tier fiber optic rings. Multiple master nodes may be used at any level of the ring, and some or all of the rings may include two fiber optics for bidirectional, redundant communication within the network.

Abstract: A data transmission system including first and second source devices for transmitting video data (isochronous data) outputted from first and second data output units, and a sink device for receiving the video data transmitted from the source devices and outputting the data to a video composition device, in which the video data supplied from the data output units to the source device are synchronized in frame units and transmitted from the source devices to one sink device. In the data transmission system, synchronous information (reference signal information) in the video composition device is transmitted from the sink device to the source devices, and timing reference signals in the data output units are generated by the source devices based on the synchronous information.

Abstract: A control network comprises multiple master nodes and multiple slave nodes, connected together in a loop configuration by at least one fiber optic cable. The master nodes share concurrent control over the network nodes by time multiplexing or other techniques. The control network may include two fiber optic rings which carry the same data simultaneously in opposite directions around the loop. A polling scheme may be used by the master nodes such that only one node transmits at a given time in both directions around the loop. The receiving node(s) propagate the transmissions and select between the transmissions based on time, error rate, or other factors. A hierarchical control network may be constructed with upper tier and lower tier fiber optic rings. Multiple master nodes may be used at any level of the ring, and some or all of the rings may include two fiber optics for bidirectional, redundant communication within the network.

Abstract: A WDM ring network and method for distributing within such ring network for feeding in data and for distributing both working signals and protection signals on different transmission paths and in oppositely directed transmission directions, and for forwarding data from subscribers and for distributing the working signals to the subscribers.

Abstract: There is disclosed a communication apparatus designed to assure the execution of ring type multi-address data transmission. In order to ensure that a user see a received image, transfer to a next station is not carried out until the receive image is printed out. With the passage of specified time after the reception of the image, transfer is executed to the next station.

Abstract: A system and method of sanitizing a data frame from a node in a network loop includes receiving the data frame from the node, and, when the data frame includes invalid data, replacing a first word of the invalid data with a frame termination primitive and subsequent words of the invalid data with buffer data.

Abstract: In a broadcasting control system in an ATM ring network in which a control cell containing control information is transmitted by ATM (Asynchronous Transfer Mode) between a plurality of nodes connected into a ring shape, each of the nodes includes a receiving section and a transmitting section. The receiving section receives a control cell from an upstream node. The transmitting section writes response information of the self node for the control information contained in the received control cell in an area corresponding to the self node in the control cell and transmits the control cell to a downstream node. A broadcasting control method is also disclosed.

Abstract: Briefly, in accordance with one embodiment of the invention, a method of using a bypass buffer in a node coupled to a ringlet includes the steps of: writing a packet of binary digital signals on the ringlet into the bypass buffer; and retaining the packet of binary digital signals in the bypass buffer for a predetermined amount of time before transferring the packet to the ringlet. Briefly, in accordance with another embodiment, a node to be coupled to a ringlet includes: a transmit buffer and a receive buffer. The transmit and receive buffers are coupled in a configuration to transfer binary digital signals between the node and the ringlet via the transmit and receive buffers. The configuration further includes a bypass buffer to temporarily queue binary digital signals passing through the node. The bypass buffer is further coupled in the configuration to retain a packet of binary digital signals for a predetermined amount of time before transferring the packet to the ringlet.

Abstract: A node for use in a multi-source ring transmission system includes a controller and storage. Identifiers, such as ring addresses, for the relative first and relative last source nodes within the ring transmissions system are stored within the node's storage, in a squelch table for example. The node's relative first source node is the source node farthest upstream from the node and the node's relative last source node is the node that is farthest downstream from the node. The node blocks communications whenever both its relative first source node and its relative last source node fail.

Abstract: Systems and methods consistent with this invention allow for each node within one or more rings to obtain connection and topology information from other nodes within these rings. In such a system, each node is able to maintain connection table and topology tables for each node and each ring within a ring network. In particular, such information can be kept current because this scheme allows for dynamic updating of connection and topology information in real time. With such current information, a node is able to utilize this information to execute such operations as squelching connections on a protect line and timeslot interchange. In addition, by supporting timeslot interchange, the ring can be managed as more than a single logical entity as well as can have better bandwidth management utilization.

Abstract: Adaptively changing weights for fair scheduling in broadcast environments. In one embodiment, a computer-implemented method allocates bandwidth among a plurality of flows, such as nodes, sharing an output link, such as a network. The method includes adaptively determining a weight for each flow, based on a predetermined criterion, and allocating a portion of bandwidth to each flow proportionally to the weight for the flow. In one embodiment, the predetermined criterion takes into account an input rate of data packets for each flow, while in another embodiment, the predetermined criterion takes into account a queue size for each flow.

Abstract: The invention provides a communication apparatus easy for use. A CPU registers a nickname, a sub-address signal and a transfer address corresponding to a ring type multi-address transmission number, also registers a sub-address signal and a communication specification corresponding to a memory box, further select the start of a ring type multi-address transmission, enters a password signal, discriminates at the reception of a sub-address signal in data reception whether the ring type multi-address transmission is designated by such sub-address signal, and changes the handling of the password signal according to the result of such discrimination.

Abstract: A polling loop system provides all products to be prewired to the polling loop by technically unskilled labor followed by a plug and play enrollment process. The system combines the advantages of DIP switch zone addressing with smart serial number (S/N) addressing, which simplifies installation and replacement requirements. The system is fully backward compatible and is intended for a next generation of commercial polling loop systems.

Abstract: A system and method for dynamically establishing lightpaths in an optical telecommunications network. The system implements tokens which are used to advertise the availability of receivers downstream. The tokens notify a source when a transmission fails. The tokens also include lightpath reservations and indicate priority of reservations. The innovative system preferably comprises a ring topology with chords that connect non-contiguous nods of the ring.

Abstract: A method of exchanging data streams between a local exchange and a number of access devices for serving a plurality of destination users, the method comprises the steps of: (a) providing a local exchange capable of generating at least one output data stream and of receiving at least one corresponding input data stream for carrying data blocks respectively relevant to one or more of the access devices; (b) providing two or more said access devices, each permitting passage there-through of at least one data stream carrying data blocks, being capable of extracting, from said at least one data stream, data blocks relevant to this particular device and of introducing there-into data blocks to be transmitted from this particular device to the local exchange; and (c) arranging one or more close loop data streams, each being intended for serving said two or more access devices using one of said output data streams and the corresponding input data stream of the local exchange, by causing the output data stream leaving

Abstract: An apparatus for eliminating a loop formation in a serial bus system (IEEE1394) and a method therefore are disclosed. The apparatus includes a control state. The method includes judging whether a loop is formed between nodes based on a port connection state and a relationship with other nodes at each node while a tree identification is being performed, and eliminating one of the ports of an idle state when a loop is formed between the nodes as a result of the judgment.

Abstract: Explicit routing of network traffic over RPR rings using MPLS signaling techniques, including unnumbered links. A modified LSP_TUNNEL_INTERFACE_ID object is provided with a RPR IP address instead of the conventional LSR Router ID, and with a direction indicator in place of the conventional interface ID. A novel subobject is included in the ERO and RRO, which holds the RPR IP address of the sending node in place of the conventional router ID, and a direction indicator in place of the conventional interface ID. The network nodes inspect the directional indicator that is received in a path message or a Resv message to determine the direction in which traffic is to be sent and received in an explicit route.

Abstract: A backup CRF VLAN arrangement provides an alternate, redundant path for traffic between undistributed Concentrator Relay Functions (CRFs) located on separate switches interconnected by trunk links of a distributed token ring bridge. The backup CRF virtual local area network (VLAN) arrangement defines a backup network path which may be utilized if a primary active path is not a valid path to a backup network. Notably, the backup network comprises a special type of CRF that is distributed among the switches, but that has only one port active at any given time.

Abstract: A system and method of sanitizing a data frame from a node in a network loop includes receiving the data frame from the node, and, when the data frame includes invalid data, replacing a first word of the invalid data with a frame termination primitive and subsequent words of the invalid data with buffer data.

Abstract: A method and apparatus are disclosed for designing multi-ring networks based on generalized quadrangles of combinatorial design theory, together with a scaling algorithm for realizing networks of arbitrary size. Multi-ring networks based on generalized quadrangles ensures that the path between any two nodes is either confined to a single ring, or traverses exactly two rings (passing through a single bridge node), referred to herein as the “one-bridge property.” The one-bridge property allows the construction of networks with small rings and low degree, while also permitting efficient congestion-free flow control protocols. Routing, access and flow control protocols are provided for the multi-ring network that capitalize on the combinatorial properties of the disclosed multi-ring networks. A “self-routing” routing protocol is disclosed wherein a source node does not need to know how to route a packet to a destination node that is not a neighbor.

Abstract: A method of bandwidth management enabling to insure a guaranteed bandwidth to each station of transmission network comprising a plurality of stations (10, 12, 14) forming a logical ring wherein a token frame is circulating from station to station, each station being allowed to transmit a credit (c) of data bytes upon reception of the token frame wherein the credit is increased in proportion to a variable TRTT standing for Token Round Trip Time which is the time taken for the token frame to circulate around the logical ring since the preceding reception of the token frame by the station. The credit is increased in proportion of a variable CIR standing for Committed Information Rate which is the guaranteed transmission rate that the station can use to transmit data wherein the value of CIR is determined by a class of bandwidth which has been previously selected by the station upon the preceding reception of the token frame by the station.

Abstract: A master node and slave nodes which are connected in a ring-like manner transmit commands in one direction, each of the nodes transmits a state monitoring command for monitoring the operational state of the network to its immediate upstream-side node, and the operational state of the network is monitored by a response from the immediate upstream-side node with respect to the state monitoring command. A traffic monitoring unit monitors the amount of traffic in the network and determines whether or not the amount of traffic is less than a predetermined value, and a start-command transmitting unit transmits a start command for instructing the start of transmission of the state monitoring command to each of the slave nodes if it is determined that the amount of traffic is less than the predetermined value.