Abstract: A switching apparatus is disclosed that employs a relatively simple and inexpensive switching matrix, but which avoids interruption of existing connections when connections are added or removed. The switching matrix switches errorlessly by controlling the point in time at which switching occurs. Using such a technique, switching can be performed without disturbing the connections already configured in the switching matrix, and so is referred to herein as being non-blocking. Optionally, the incoming data can be rearranged to provide a larger window of time in which the switching matrix can be switched. In the case of a switch using an optical backplane, this also allows more time for various components of the system (e.g., clock/data recovery units) to re-acquire lock. The switching apparatus includes a switching matrix and control circuitry. The switching matrix has a matrix input, a control input and a number of matrix outputs, and is configured to receive an information stream at the matrix input.

Abstract: A WAP gateway interconnecting a PLMN network with a private network is disclosed. The WAP gateway receives a request from a mobile terminal and accesses the WDP layer of the WAP protocol stack responsive to the request. Communications take place between the WDP layer of the protocol stack and at least a second layer of the protocol stack using SSL/TLS tunneling.

Abstract: A forwarding agent is implemented on a router. The forwarding agent receives instructions from a service manager for redirecting packets that match the instructions. A packet is received that matches the instructions and the packet is redirected according to the instructions.

Abstract: An available bandwidth measurement system and method. The available bandwidth of a network path is determined by determining round-trip times of packets utilizing varying bandwidth to a receiving node. An increase in packet round-trip time indicates congestion of a link in the path. In some embodiments, the bandwidth range measured is expanded or decreased to locate a congestion point or to provide greater precision in determining available bandwidth.

Abstract: A time division multiplexed communications method and system in which time is divided into a number of frames and each frame is divided into N data bursts. The method and system further has a first multiplexer by which a half rate channel is formed as a series of bursts that occur periodically every N bursts once per frame, a second multiplexer in which a full rate channel is formed as two half rate channels on consecutive timeslots, and a transmitter transmitting the full rate channel from a first wireless station to a second wireless station. The full rate channel provided by two half rate channels on consecutive timeslots yields a significantly larger resource pool available for assignment of communication traffic. For full rate channels, the interleaving 0246/1357 method that is used by the system is just as good as the known 0123/4567 method when ideal frequency hopping is used, and the 0246/1357 method performs better when non-ideal frequency hopping or no frequency hopping is used.

Abstract: A TDMA/TDD link adaptation method determines radio link quality at a base station. The radio link quality is used to update and broadcast a physical layer parameter indicator (10-16) from the base station on a broadcast control channel having a common physical layer parameter indicator for all uplink and downlink channels.

Abstract: Methods and apparatus are disclosed for determining a next round robin element requesting service using a cascaded approach. The cascaded approach could be implemented in numerous ways, including, inter alia, a circuit or in software, and be used, inter alia, in a network or computer system. In one implementation, a first stage of the cascaded implementation is divided into multiple groups, each of the multiple groups receives an indication of elements requesting service. Based on a last round robin result and its address, each of the multiple groups determines a candidate for the next result. In the situation where the last result was in a group and the group has a requesting element subsequent in the round robin sequence, that next requesting element is selected and forced to be the selected next result. Otherwise, this processing is repeated by subsequent stages to determine the round robin result.

Abstract: A method and apparatus for performing a lookup in a switching device of a packet switched network where the lookup includes a plurality of distinct operations each of which returns a result that includes a pointer to a next operation in a sequence of operations for the lookup. The method includes determining a first lookup operation to be executed, executing the first lookup operation including returning a result and determining if the result includes a pointer to another lookup operation in the sequence of operations. If the result includes a pointer to another lookup operation, the lookup operation indicated by the result is executed. Else, the lookup is terminated.

Abstract: A method for formatting a signal in a mobile communication system by appending a plurality of medium access control headers to a plurality of medium access control-service data units for data transfer between a mobile statio and network in the mobile communication system. If the service data units have the same characteristics, a medium access control-protocol data unit is formed by successively coupling the service data units to any one of the medium access control headers. If the service data units have different characteristics, the protocol data unit is formed by sequentially coupling each of the service data units and each of the medium access control headers.

Abstract: A method for building a hierarchical multicast tree which is centered around a specific node in an Internet Protocol (IP) communications network. The method on a subnetwork comprising dynamically electing a subnetwork leader node for each subnetwork using multicast communications confined to the subnetwork. Receiving a configuration file containing a list of all the network addresses of the nodes in a network. Receiving a number of permissible connections each subnetwork leader node in the network is permitted with other subnetwork leader nodes. And establishing a multicast connection between each subnetwork leader node as identified in the configuration file so that there is a multicast connection path from each subnetwork leader node for each subnetwork and a subnetwork containing a network leader node. In another embodiment, a system and computer readable medium is disclosed to carry out the above method.

Abstract: The invention provides methods (300) for organizing and assigning network address to network nodes in clusters (108, 110, 112, 114, 116, 118, 120, 212, 214, 216, 218, 220), and forming new clusters and also provides a method 700 for routing messages in clusters. According to the invention, clusters are organized into hierarchical tree arrangements, with addresses assigned in a manner that facilitates routing messages.

Abstract: In one embodiment, a method is disclosed for holding instruction fetch requests of a processor in an extended reset. Fetch requests are disabled when the processor undergoes a reset. When the reset is completed, fetch requests remain disabled when the instruction memory is being loaded. When loading of the instruction memory is completed, fetch requests are enabled.

Abstract: A method related to a data communication system, and more specifically to frame relay multiplexing, in which system data frames are forwarded by nodes performing inter alia multiplexing and concentration of traffic from a plurality of input sources, and wherein the sum of transmission time in question, the queue delay and acknowledge frame transmission time, should not exceed a transmission timer setting, and for the purpose of solving the problem with queuing of data frames in such a communication network, it is according to the present invention suggested to combine the following steps: a) simulating an output queue length, b) estimating an input source traffic value, and c) using fuzzy logic, for thereby deciding when a data frame has to be deleted from the data stream.

Abstract: Scheduling techniques for communication applications using receiver directed broadcast schemes are disclosed. The invention includes techniques for the implicit reservation of receive slots and techniques for the optimization of receiver directed broadcast schedules. The implicit reservation scheme includes the mechanics of implicit reservation. Implicitly reserved slots can be reclaimed by their owners. Further, simultaneous implicit reservations can be identified and resolved. Procedures are also provided for determining the number of channels and slots required to optimize a receiver directed broadcast schedule for a neighborhood of a given number of nodes.

Abstract: A data communication method in a network is disclosed. The present invention increases the efficiency of the data communication by preventing a saturation of the network load by receiving only a proper amount of data to be processed and by reducing data communication errors caused by a redundancy of the transmitted addresses.

Abstract: A method is disclosed for determining the admissibility of an offered session of traffic of a specified class to a server in a packetized communication network. Each class c has a peak traffic rate r(c). The server has a total processing rate C. Admitted packets are scheduled according to an EDF scheduling discipline. The method for determining admissibility comprises defining an operating point for the server. The operating point represents the number of sessions Nc of each respective class currently offered or currently being served. The method further comprises determining whether the defined operating point falls within a set of operating points that together define an admissible region. The admissible region consists of operating points for which the probability of violating a delay bound for any packet is below a threshold. The determination of the admissible region involves principles of statistical multiplexing.

Abstract: A method 900 of and apparatus for effecting a handoff from a first Internet Protocol (IP) connection 221 to a second IP connection 331 is disclosed.

Abstract: A computer chip having on-chip internetworked modules and implementing a network protocol for on-chip and, also preferably, off-chip data transfers. The modules on chip are interconnected through a plurality of on-chip packet-switched local area networks or LANs. The familiar Internet topology may be implemented on-chip with each module being treated as a “host.” A plurality of network interconnect (e.g. routers, gateways, etc.) may also be provided to interconnect the plurality of LANs. The computer chip implements a network protocol for on-chip data transfer. The network protocol may be TCP/IP. In that case, the computer chip itself may be treated as an Internet. This flexible chip architecture in that the computer chip may have modules clustered conveniently according to functionality, and the various modules may interact with one another without overburdening the chip packing density.

Abstract: A networking method is disclosed. At least one silent slot is included in either a collision detection prefix disposed before a preamble of one or more frames of data to be transmitted across a media or in the one or more frames of data to be transmitted across the media. Transmission collision is detected during the at least one silent slot included. In one embodiment, the method is embodied in a network interface controller having a media access control block to control access to a media, and a physical signal block to physically signal data to be transmitted. The media access controller includes the at least one silent slot in either the collision detection prefix or in the data, and the physical signaling block performs the transmission collision detection during the included at least one silent slot.

Abstract: An Internet network protocol stack, along with special logic, is embedded with a modem, thereby enabling a modem to become Internet-ready. As a result, the modem offloads much of the network protocol processing from the main CPU and improves the overall performance of the communication system.