Abstract: According to one embodiment, a system for controlling passing of a token among a plurality of clients that access a shared resource includes at least one controller. The at least one controller is configured to cause the token to be passed to each of the plurality of clients when the system is in a first state, and to cause the token to be passed to fewer than all of the plurality of clients when the system is in a second state. According to another embodiment, a token-ring system includes a shared resource, at least first and second clients that access the shared resource, and error detection logic. The first client includes a primary device and a secondary device which provides bootstrap information to the primary device. The error detection is configured to directly monitor the secondary device for an anomaly in the operation thereof. According to yet another embodiment, a method is disclosed for operating a multi-port memory including at least first and second memory ports that access a shared memory.

Abstract: In a network system which sequentially passes a right to transmit in the form of a token and includes a plurality of data processors, at least one of the plurality of data processors is set so as to be able, during each possession of the token, to send messages in greater number than those transmitted by each of the remaining data processors by at least one. The data processor that is allowed to send many messages consecutively sends messages by inserting, into a token address field included in a message format, its own address during transmission. In the case of a server/client network, a server is set so as to consecutively send a number of messages at a time, while in possession of the token.

Abstract: A method, system and network device routes a message to a temporarily unavailable network user, wherein a subscription to a registration state of the network user is initiated if the network user is indicated as being unavailable. Then, a notification is generated, when the registration state of the network user is changed to indicate a state when the network user is available again or when the network user is registered again, and the message is routed to the network user in response to receiving the notification. Thereby, network elements or servers generating messages can be informed about the connection state of the network user.

Abstract: A communication apparatus and a method for supporting carrier sense multiple access/collision detection (CSMA/CD) are disclosed.

Abstract: The invention is directed to an architecture that includes a first queue 128, a first queue reader 148 that reads data entities in the first queue, and a first queue writer 124 that writes data entities to the first queue. The architecture is able to periodically set one or more backup administration parameters equal to administration parameter(s) associated with the first queue 128 and, when the first queue 128 is restored, copy data entities from backup storage to the first queue 128 and set the administration parameter(s) to the corresponding backup administration parameter(s).

Abstract: A token over Ethernet protocol is described which allows a plurality of ports connected to a shared channel to communicate with each other. The communication is controlled by tokens that are transmitted before the transmission of packets. A packet can contain digital data from a digital device such as a computer, or digitized voice signals from a voice device such as a telephone. Voice packets are given priority over data packets to minimize delays that might provide distortion to the received voice signal. Each transmitted token identifies the next port to transmit which is determined from a valid list maintained within each port. All ports can receive tokens and packets during any receiving cycle, but only the port authorized by the last transmitted token can transmit a token, or a token and a packet. All ports check each transmitted token for a turn at transmitting information.

Abstract: A method and apparatus for switching from a primary network controller to a secondary network controller. A switchover request is received. Messages accepted by the node from the peer nodes are limited. An active link is maintained between the node and peer nodes. Finally, control is transferred from the primary controller to the secondary controller.

Abstract: A system and method for managing a communications network establishes an initial polling interval for a corresponding network element. The network management system detects whether the network element provides at least one status message during a group of sequential polls. Each poll within the group is preferably separated by the initial polling interval. The network management system adjusts the initial polling interval to a subsequent polling interval for the network element based on the detection of the status message to adaptively meet the communications traffic requirements.

Abstract: A channel configuration of a digital mobile communications system comprises two or more lower-rate transmission channels for each high-speed radio interface traffic channel between a base station and an interworking function. Radio frames, such as EDGE frames, are transmitted over a radio interface traffic channel. Transmission frames, such as TRAU frames, are transmitted on a transmission channels. The base station and the interworking function provide the transmission frames to be transmitted with frame and/or channel numbering which indicates the order of the transmitted frames and/or the transmission channel via which the transmission frame was transmitted. According to the invention, the base station does not restore the order of the downlink transmission frames on the basis of said frame and/or channel numbering but it places the data of the transmission frames and at least the frame and/or channel numbering in the payload of the downlink radio frame to be transmitted.

Abstract: The invention relates to a method in the packet switched data transmission between a wireless communication device (MS) and a packet network (PLMN1, PLMN2), in which data transmission between the wireless communication device (MS) and the packet network (PLMN1, PLMN2) is controlled with at least one packet switching controller (SGSN). A group of connection states is defined in the method, from said connection states one is selected at a given time, and the selected connection state is set to the wireless communication device (MS) and to the packet switching controller (SGSN). In addition, said connection states are defined in the method to be: a ready state (303), in which packets are transmissible in an activated data transmission connection, a standby state (302), in which data transmission connection packets to transmitted and received are waited for, and an idle state (301), in which the data transmission connection is deactivated.

Abstract: An arbiter circuit is provided for resolving a plurality of N request signals received from a plurality of agents requesting access to a resource.

Abstract: A data communications system accommodates high transfer rates of non-isochronous data to and from a communications medium handling isochronous data. The system suitably includes an interface for transmitting non-isochronous data to and from a first system, such as a host system, and transmitting isochronous data to and from a second system, such as a WAN. The interface includes a clear-to-send (CTS) signal generated by the system receiving the non-isochronous data. If the CTS signal is asserted, the sending system continues to provide data to the receiving system. On the other hand, if the CTS signal is deactivated, the sending system withholds the non-isochronous data for the relevant channel until the CTS is reasserted. In an exemplary embodiment, the CTS signal is an out-of-band hardware-implemented signal, which tends to provide optimal simplicity and speed.

Abstract: According to an embodiment of the invention, a data controller comprises a traffic pattern collector to observe a data traffic pattern, the data traffic being comprised of data packets; a traffic service engine to receive data from the traffic controller concerning the data traffic pattern and to determine a data flow specification for the data traffic pattern, the received data including the size and arrival time of each of the data packets; and a quality of service provider to receive the data flow specification. The data flow specification is the minimum data flow specification data flow specification that will allow each of the data packets to be transferred by the traffic controller within a delay upper bound. According to one embodiment, the minimum data flow specification for the data traffic pattern is determined according to an algorithm known as the Any-Delay TB Algorithm.

Abstract: A system and method are disclosed for automatically configuring an Ethernet device as either an Ethernet end station or as an Ethernet hub to permit the Ethernet device to be coupled to another Ethernet device regardless of whether the Ethernet devices are Ethernet end stations or Ethernet hubs and regardless of whether a straight-through or crossover cable is used to interconnect the Ethernet devices. According to one embodiment, a control device is disposed between an Ethernet device physical layer and a connector for periodically reversing a transmit/receive configuration of the device until an Ethernet link is established. More particularly, a plurality of multiplexers are positioned in front of the Ethernet physical layer to switch between transmit and receive leads of the same polarity to selectively reverse the transmit/receive configuration of the associated Ethernet device. In operation, the transmit/receive configuration of and Ethernet device is positioned in a default, or initial, setting.

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 Resource Reservation System includes a Token Generation Unit (TGU) which generates and circulates among nodes of a communications system a Slotted Token (SLT) message having sub-fields to carry identification number for each input port in a node and the resource available for each input port. On receiving the message the Resource Control Unit (RCU) in each node can write port identification number, available resource in appropriate sub-fields of the SLT message, and reserve resources in other nodes by adjusting information in the sub-field associated with the other nodes.

Abstract: A system and method for managing the spectrum utilization of a frequency band that is shared, both in frequency and time, by multiple devices. At one or more devices operating in the frequency band, pulses associated with signals occurring in the frequency band are detected by sampling part or all the frequency band for a time interval. From the detected signal pulses, the signals can be classified. In addition, overall spectrum activity can be measured. Using classification information for signals detected in the frequency band, policies can be executed so that a device may take certain actions in order to avoid interfering with other signals, or to optimize simultaneous use of the frequency band with the other signals. Signal detection occurs at one or more devices operating in a frequency band.

Abstract: The state of a telecommunications network comprising a plurality of nodes is monitored. Each node is at a time in one of a number of node states dependent upon a predetermined set of rules and local conditions at that node. The value of a parameter is determined where the value of the parameter is dependent upon the entropy of the node states in the network.

Abstract: A serial/parallel converter 2—converts a B channel data in an ISDN into an 8-bit parallel data and outputs it to a latch circuit 3. A comparator 4—compares an octet data latched by the latch circuit 3 with a preset idle pattern and, when the octet is different from the preset idle pattern, outputs a disaccord signal to a pulse generator 5. When an idle pattern appears continuously on the B channel, a timer circuit 6 outputs a significant signal. With using the significant signal from the timer circuit 6, it is possible to judge that the B channel is in non-use state, so that it can be determined by the simple circuit construction whether or not the B channel is in the use state.

Abstract: Methods, apparatus, and computer-readable media are disclosed for performing diagnostic tests of a communication link between a headend and a cable modem without having to assign an IP address to the cable modem. The diagnostic tests are performed at the MAC layer and test the state of the hardware between and including the cable modem termination system (CMTS) and a selected cable modem. By doing so, a network operator is able to more easily focus in on a potential problem in cable RF/MAC connectivity between the two components by first eliminating (or identifying) a problem with hardware before focusing on problem-solving at the software level, typically at the Network layer, at which point the cable modem is assigned an IP address. A network command is received from a network operator causing the CMTS to place a service identifier corresponding to a cable modem in possible need of diagnosing into a poll list.

Abstract: An idle frame counter is not reset after retransmission of a data frame. Additionally, if a non-acknowledgment (NAK) is received for the last data frame sent, then no more idle frames are transmitted. Finally, an Idle Acknowledgment (ACK) is transmitted when an idle frame has been received with a sequence number equal to the sequence number of the next new data frame expected.

Abstract: The invention relates to a system and methods for allowing the extension of the ISDN/GSM Call Completion to Busy Subscriber Supplementary Service across a Network Boundary between a general Switched Circuit Network (SCN) using ISUP as call control protocol, and an IP Packet Network using SIP as session control protocol.

Abstract: When a communication is established between a mobile unit 1 and a base station 2B, the base station 2B requests a management server 4 of an update of an idle channel information thereof through a cable network 3. The management server 4 updates the idle channel information of the requesting base station and transmits an idle channel information of base stations 2A and 2C peripherally of the base station 2B to the mobile unit 1 through the cable network 3 and the base station 2B. When the mobile unit 1 is moved from a cell of the base station 2B to a cell of one of the base stations 2A and 2C, the mobile unit 1 selects an idle channel from the idle channel information of the peripheral base stations provided by the management server 4 and uses a frequency of the selected idle channel as a frequency of the mobile unit.

Abstract: To avoid lost packets that could otherwise occur were a round robin scheduling policy to be used to assign PPP packet fragments to multiple communication links, the links are assigned tokens based on their capacities, with a fragment being assigned to the link with the most tokens. When a fragment is scheduled to a link, the tokens of the link are decremented accordingly. The tokens are periodically refreshed.

Abstract: The present invention relates to a method, a system and apparatuses for transferring data on a bitstream in a circuit switched time division multiplexed network, wherein said bitstream is divided into frames, each frame is divided into time slots, and said time slots are divided into control slots and data slots, and wherein an isochronous channel, comprising one or more data slots within each cycle of said bitstream, has been established between a first node and a second node of said network. According to the invention, said bitstream is provided with data distinguishing each data slot, within said channel, that contains non-valid data as a result of said first node not being able to transmit valid data into said each data slot.

Abstract: An improvement is disclosed for a Totem system having a network and a plurality of host processors connectable to the network, each of which host processors includes a CPU and is configured for executing processes, wherein the improvement includes, for each host processor, a buffer memory and a co-processor for each host processor. The buffer memory is electrically connected to the CPU and configured for storing messages sent to or from the CPU. The co-processor is electrically connected for providing an interface between the network and the host processor, and is configured for responding to tokens and for delivering messages from the network to the buffer memory for retrieval by the CPU, and for delivering to the network messages stored in the buffer memory by the CPU.

Abstract: Serialization of global operations within a multiprocessor system is achieved utilizing a single token, requiring a bus master to acquire the token for completion of each individual global operation initiated by that bus master. A combined token and operation request, in which a token request and an operation request are transmitted in a single bus transaction, is employed once for a global operation, to initiate the global operation for the first time. A token manager determines whether the token is available or checked out and responds to the token portion of the combined request. Snoopers respond to the operation portion of the combined request depending on whether they are busy. If the entire combined request is retried, a token request (only) is employed to request the token and, when the token is acquired, an operation request (only) is employed to request the operation.

Abstract: Channel allocation can be performed efficiently even when there is a mix of up/down allocations. A dedicated “uplink” priority table and a dedicated “downlink” priority table are provided, and priorities are controlled separately on the uplink and downlink for all channels.

Abstract: In a communication terminal holding apparatus 101, the control right of communication in a direct link type network is acquired by a control right acquiring section 205. After acquiring the control right, a first scheduling section 203 assigns communication resources to a terminal apparatus in the direct link type network. A second scheduling section 204 cooperates with a first scheduling section 203 so as not to allow any competition or collision of communication resources in the communication between the direct link type network and the master-slave type network and assigns communication resources to a terminal apparatus in the master-slave type network. Owing to this, it is enabled to use a slave terminal apparatus in a master-slave type network as it is in a network integrated with a direct link type network.

Abstract: Only a single snooper queue for global operations within a multiprocessor system is implemented within each bus snooper, controlled by a single token allowing completion of one operation. A bus snooper, upon detecting a combined token and operation request, begins speculatively processing the operation if the snooper is not already busy. The snooper then watches for a combined response acknowledging the combined request or a subsequent token request from the same processor, which indicates that the originating processor has been granted the sole token for completing global operations, before completing the operation. When processing an operation from a combined request and detecting an operation request (only) from a different processor, which indicates that another processor has been granted the token, the snooper suspends processing of the current operation and begins processing the new operation.

Abstract: Serialization of global operations within a multi-processor system is achieved utilizing a plurality of tokens each permitting completion of a single global operation, requiring a bus master to acquire the token for completion of each individual global operation initiated by that bus master. A combined token and operation request, in which a token request and an operation request are transmitted in a single bus transaction, is employed once for a global operation, to initiate the global operation for the first time. A token manager determines whether a token is available or all are checked out and responds to the token portion of the combined request. Snoopers respond to the operation portion of the combined request depending on whether they are busy. If at least the token portion of the combined request is acknowledged or if a token request is acknowledged, the combined response will include a token number for the token granted to the bus master initiating the global operation.

Abstract: A user terminal (10) using an internet protocol using session initiation protocol to interconnect a number of user terminals (11-13) in a conference call. A conference bridge (30) or user terminal (10) detects speech of one of the user terminals (203). A “babble ” timer is started (207). The speaker is allowed to continuously speak until silence is detected (217) or until the “babble” timer timers out (211).

Abstract: Systems and methods for providing access to a time-slotted communication channel are disclosed. Access to the channel is granted by possession of a pseudo-token transmitted between communication units with packets, such that the recipient of a data packet receives the pseudo-token with the packet. Communication units may be assigned reserved slots during which the pseudo-token automatically is assigned to the communication unit. Further, communication units may be assigned priority levels according to which contention contests may be resolved. Reserved slots and priority rankings may used in combination to accommodate varying levels of QoS required or requested by communication units on the channel.

Abstract: In a switch having input ports and output ports, a fast ring reservation arbitration is provided by grouping crosspoint units associated with an output port. If any of the crosspoint units of a group request the output port, a received token will be passed to crosspoint units within the group. If, on the other hand, none of the crosspoint units of a group request the output port, then a received token will bypass the group and be forwarded to a next group.

Abstract: A method for saving power in a network system, such as the Ethernet. Assume that all nodes in the network system can support at least two transmission protocols, such as 10 BaseT and 100 BaseTX in the Ethernet. First, network nodes may continuously detect the status of the network system and determine whether the network is in an idle state. If the idle period exceeds a pre-determined period, a first auto-negotiation function, in which priorities of the transmission protocols are inversely proportional to the power consumption, will be activated to select 10 BaseT. When the network system attempts to transmit data, a second auto-negotiation function, in which priorities of the transmission protocols are directly proportional to the data transmission performance, will be activated to select 100 BaseTX.

Abstract: Critical resource management is disclosed. In one embodiment of the invention, a method is provided. First, the method detects whether maximum utilization of a critical resource has been reached. For example, the critical resource can be a number of modems within a modem pool of an Internet Server Provider (ISP). Second, the method determines the priority of access to this critical resource for each of a plurality of clients. For example, such clients can be end-user computers attempting to dial into the modem pool of the ISP. Third, the method denies access to at least one of the clients that have the lowest priority of access to the critical resource. For example, this can mean that a client currently connected to the ISP via a modem of the model pool is disconnected, or can mean that a client attempting to dial into the ISP is refused access.

Abstract: A method and associated hardware for managing communications in a cellular network. Network usage is monitored by signaling mediation probes, either by monitoring signaling links or by receiving usage information from network elements. Based on the monitored network usage, an activity server predicts a forthcoming time interval during which sufficient network resources will be available to allow a predetermined message to be sent to one or more users of the network. When the time interval arrives, the activity server initiates the sending of the message, either by itself sending the message or by triggering another device to send the message.

Abstract: A method and apparatus of improving serial bus efficiency. Improvement of bus efficiency through the reduction of enforced subaction gaps can be accomplished by attaching an explicit end of subaction (EOS) token to packets that are the last packet of a subaction. The EOS should be selected to be an encoding that is not easily confused with any encoding used for normal data encoding. The presence of the EOS token permits arbitration to begin without waiting for a subaction gap after the EOS token is seen on the bus. Additionally, it permits fly by concatenation with packets containing an EOS token. In some cases multiple concatenations are possible. Because the EOS token is independent of subaction type, this technique expands readily as new subactions are developed. Employing the features overall bus efficiency can be increased.

Abstract: A communication system including a collection of modules coupled in a ring architecture which integrates synchronous and asynchronous message transmission. Asynchronous data packets and synchronous voice packets are exchange on a single communication link. Packetized information exchange references a fixed length window with all synchronous data being exchanged at the beginning of each window and with asynchronous data exchanged during the remaining portion of each window. Virtual circuits utilizing the synchronous packets can deliver telephone conversations without degradation in voice quality and yet the system can also transmit asynchronous data packets.

Abstract: A data transfer management method is provided for transferring data between nodes of a multi-node communication system. The method provides target nodes with fair opportunity to transfer data to originator nodes in the communication system. The originator node initiates data transfer by establishing a connection with one or more target nodes. The originator node signals target nodes to transfer data by generating and transmitting credit tokens over the network. Before a target node can transfer data to the originator node, it must receive and absorb at least one credit token from the originator. All credit tokens transmitted by the originator node and not absorbed by target nodes return back to the originator node. Each target node is provided with buffer credit tokens up to its quota in a rotating manner.

Abstract: A network system comprises a main loop in which one master node which issues a token packet for data communication, and at least one slave node are connected in a loop; a first sub loop in which the master node, one sub-master node, and at least one slave node are connected in a loop; and at least one second sub loop in which the master node, at least two sub-master nodes including the sub-master node of the first sub loop, and at least one slave node are connected in a loop. In this network system, each node has an analysis execution unit which performs analysis of the token packet, control of data transmission and data reception, and a switch for changing the connection. When each node receives and analyzes the token packet, it controls the switch so as to output, transmit, or discard the token packet and a data packet. Therefore, addition of nodes and loops is facilitated while maintaining the transmission efficiency, without increasing the packet transmission time.

Abstract: Transmitting/receiving apparatuses are installed in a base station and a mobile station, respectively, to perform mutual transmission and reception by using a plurality of spreading codes. The transmitting/receiving apparatus installed in the base station has a block for designating to the mobile station the kind and the number of spreading codes used in a reverse link from the mobile station to the base station through a forward link at the time that communication with the mobile station is started. The transmitting/receiving apparatus installed in the mobile station has a block for transmitting a signal to the base station by using spreading codes of the designated kind and number.

Abstract: A distributed processing telephone system for providing “plug-and-play” capability. In particular, a key telephone system comprises a plurality of telephone sets. Each telephone set is coupled to at least one common communications channel, or telephone line, and includes at least one tunable RF modem. There is no key service unit (KSU). That is, the system is KSU-less. Resources of the telephone system are allocated using a peer-to-peer protocol. For example, as each telephone set is newly added to the system, the new telephone set adaptively determines its own allocation of resources, e.g., intercom numbers, etc. During operation, each telephone set requests the appropriate resources from its peers.

Abstract: A local area network routing switch for routing data transmissions between buses includes a set of input buffers, each for receiving and storing successive data transmissions arriving via a corresponding one of the bus. The switch also includes a set of output buffers for forwarding data transmissions outward via a corresponding bus, and a routing system for selectively routing data transmissions from the input buffers to the output buffers in response to routing requests from the input buffers. The routing system sends STATUS data to each input buffer indicating which output buffers are busy receiving data transmissions and which output buffers are idle. An input buffer makes a routing request only when it stores a data transmission to be forwarded to an idle output port. If its longest-stored data transmission is destined for a busy output port, it may send a routing request for a more recently stored data transmission if that data transmission is to be forwarded to an idle output buffer.

Abstract: A system for connecting low-cost, simple peripherals to an ATM network is disclosed. A plurality of such devices is connected to a standard ATM switch in a ring configuration. A polling station, located remotely in the ATM network, periodically generates a token cell which is delivered to the switch and, thereafter, is transmitted onto the ring configuration. The devices transmit cells in response to the token cells by transmitting cells behind the token cell as they forward it around the ring. The resultant cell chain is received at the ATM switch, where the cells are then sent onto the ATM network using virtual circuits.

Abstract: A ring connection which has been used for connecting processors connected far from each other, is improved in latency, throughput and operational function and is applied to attain high speed connection between processors. A plurality of modules such as processors are connected with rings having a plurality of signal lines. An independent signal line for a flag for acquiring a transmission right is provided. A transmission right is requested by setting the flag, and reception and transmission operations and transfer operation in the ring are operated in parallel by confirming later the advance acquisition of the transmission right based on the detection of no setting of the received flag.

Abstract: Adaptive bandwidth allocation for Non-Reserved traffic over high speed transmission links of a digital network is operated through regulation of data packet transfers over network nodes/ports including input/output adapters connected through a switching device. A network node is assigned with a Control Point computing devise (CP) storing a Topology Data Base containing an image of the network. This Data Base is periodically and at call set up updated by Topology Data Base Update messages (TDUs) including an Explicit Rate parameter for link l indicating the current available bandwidth on link l, and a parameter NNRl indicating the number of Non-Reserved connections on link l. This information are used within each Adapter to periodically regulate the transmission bandwidth assigned to each Non-Reserved traffic connection within the network.

Abstract: A communication system including a collection of modules coupled in a ring architecture which integrates synchronous and asynchronous message transmission. Asynchronous data packets and synchronous voice packets are exchange on a single communication link. Packetized information exchange references a fixed length window with all synchronous data being exchanged at the beginning of each window and with asynchronous data exchanged during the remaining portion of each window. Virtual circuits utilizing the synchronous packets can deliver telephone conversations without degradation in voice quality and yet the system can also transmit asynchronous data packets.

Abstract: Conflicts are resolved between competing nodes in a multi-node communications network. After a first node in the network requests an initiation of communications with a target node, the requesting node may simply initiate the requested communications with the target node if the target node is not busy. If the first node determines that the target node is busy, it proceeds to resolve the conflict. Namely, the first node repeats the process of waiting for a first delay then requesting initiation of communications with the target node. After each unsuccessful attempt, the first delay is successively increased. As an example, the delay may be increased exponentially, with a controlled randomness added. After a or more queued messages to other nodes. Following this, the first node performs another sequence to initiate communications with the target node, successively increasing the delay between unsuccessful attempts, as before.

Abstract: The mobile station to base station access in a cellular radio system is a classical problem of random multiple access using a shared common channel. Many multiple access protocols have been invented in the past with varied degrees of success in improving the throughput of the multiple access channel. The current invention is a new multiple access protocol which enhances the throughput and reduces the access delay by providing feedback of the detailed status of the access channel from the base station to the mobile station. The feedback mechanism and multiple access protocol are also applicable to other types of radio or wire-based channels.