Abstract: A distribution pattern is established to distribute multilink frame relay (MFR) fragments. The distribution pattern includes a sequence of link entries associated with links in a link bundle. A number of link entries in the distribution pattern is determined by dividing a total link speed of the link bundle by a minimum possible link speed supported by a system. Each link entry is placed in the distribution pattern when the associated link is capable of transmitting a current fragment in a fastest transmit time. The fastest transmit time is determined based on the link speed of the link and a transmit time for the link to transmit other fragments previously allocated to that link. The fragments are distributed to the links in the link bundle according to the distribution pattern from a first link entry to a last link entry in the distribution pattern. The distribution pattern is repeated after the last link entry.

Abstract: An approach to facilitating positioning operations or other designated tasks performed by mobile stations within a wireless communication network enables individual mobile stations to request “free” or idle time if the mobile station's current operations do not provide sufficient background time to perform the required task. For example, the mobile station might be commanded to perform a positioning computation within a required time limit. If its background processing time is insufficient, the mobile station requests additional idle time from the network, which, if allocated by the network, is used by the mobile station to complete the required processing task. In an exemplary application, a GPRS-based network allocates additional “idle” blocks into the time-multiplexed multiframe structures supporting packet data communications with the mobile station.

Abstract: A system and method of providing a subscriber service to service users in a telecommunications network. In networks utilizing Session Initiation Protocol (SIP) control signaling for call setup and control, the SIP REGISTER message is modified to indicate service capability information and optionally a traffic load indication for service providers. The REGISTER message is sent to a modified Presence and Instant Messaging (PIM) server that stores presence information and the service capability information for registered service providers. The PIM server then notifies subscribing service users of the identity of the service provider that is registered on the network. The PIM server may utilize the traffic load information to balance the traffic load between service providers by providing users with the identity of the service provider that is the most lightly loaded.

Abstract: A modular, reconfigurable, intelligent signal multiplexer for telecommunications purposes includes multiple feature cards. Each feature card contains an embedded microprocessor with associated RAM memory and flash ROM. The signal multiplexer processes digital inputs from a wide range of user equipment for transmission over digital facilities, including T1 and T3 lines. The system employs an Advanced Intelligent Multiplexer Network software package to perform network configuration and the establishment of maps. The maps including alternate maps, which in an embodiment include time-of-day-specific alternate routes. The functions of the signal multiplexers of a network are controlled by a mapping scheme. A map change alters the circuit-to-time slot assignments.

Abstract: An access interface module includes a first network interface module for interfacing with a first access network and a second network interface module for interfacing with a second access network of a type that is different from the first network. The access module can further include a processor coupled to the first and second network interface modules and a device interface module coupled to the processor for interfacing with a host device.

Abstract: Methods and apparatus are presented for dynamically adjusting parameters of an outer-loop algorithm, which is used to determine the feasibility of a transmission format. The parameters of the outer-loop algorithm are adjusted according to channel conditions. In one embodiment, an erasure-based approach is used to determine whether to incrementally increase or incrementally decrease a margin parameter in the outer-loop algorithm. Once one margin parameter is altered, other margin parameters can be adjusted accordingly.

Abstract: A scheduler allowing high-speed scheduling scalable with the number of input and output ports of a crosspoint switch and suppressed unfairness among inputs is disclosed. The scheduler includes an M×M matrix of scheduling modules, each of which schedules packet forwarding connections from a corresponding input group of input ports to selected ones of a corresponding output group of output ports based on reservation information. A diagonal module pattern is used to determine a set or M scheduling modules to avoid coming into collision with each other. Each determined scheduling module performs reservation of packet forwarding connections based on current reservation information and transfers updated reservation information in row and column directions of the M×M matrix.

Abstract: In a communications network, each network node includes a first module that handles a group of channels between its input and output ports as a route decision unit and a second module that handles a channel between its input and output ports as a route decision unit. A module state database stores module cost data of the first and second modules and a link state database stores link cost data of the links. Using the module and link state databases a route of minimum cost is determined and a connection is established between an incoming link and one of the input ports of the first and second modules and a connection is established between one of the output ports of the first and second modules and an outgoing link. The contents of the module and state databases are broadcast to the network.

Abstract: A transmitting/receiving apparatus includes a packet construction section for dividing continuous data into a plurality of subpackets, and constructing a packet by concatenating the plurality of subpackets; a modulation transmission section for modulating the constructed packet, and transmitting the modulated packet to another apparatus; a training session execution section for checking channel conditions, when a predetermined condition is satisfied, and changing a modulation rule; and a subpacket transmission confirmation section for confirming whether or not a subpacket included in the transmitted packet is transmitted successfully to the transmission destination apparatus.

Abstract: Transactions are scheduled over a half duplex link between a first device, such as an IO unit, and a second device, such as a memory controller. Information flowing over the half duplex link is divided into a plurality of service periods, and an isochronous transaction, such as an isochronous memory read or write, is scheduled in a service period N if the isochronous transaction is ready to be serviced before service period N at the first or second device. An asynchronous transaction ready to be serviced at the first or second device, such as an asynchronous memory read or write, is scheduled if no isochronous transaction is ready to be serviced.

Abstract: An apparatus and method for polling stations that transmit periodic traffic streams are disclosed. A station transmits a polling request that specifies the temporal period of the station's traffic stream, and a coordinator, after receiving the polling request, repeatedly sends polls to the station in a rapid-fire manner until a response from the station is received. The coordinator estimates the temporal offset for the temporal period based on one or both of (i) the time at which the coordinator received the response, and (ii) the time at which the coordinator transmitted the particular poll to which the station responded. Based on the temporal period and temporal offset, the coordinator establishes a polling schedule that polls the station soon after the station generates a frame. The coordinator also monitors downlink traffic to polled stations and, when the downlink traffic is periodic, establishes a downlink transmission schedule accordingly.

Abstract: A system and method for providing a handoff of a call from a mobile node. The call has associated state information. The call is established between the mobile node and a first RNN and the mobile node and a first PDSN. Thereafter, the mobile node roams and establishes a link between the mobile node and a second RNN. A second PDSN is selected to service the mobile node. A direct communication path is established between the first PDSN and the second PDSN. State information of the call is exchanged between the first PDSN and the second PDSN using the communication path.

Abstract: A system and method for establishing a conference call in an Internet Protocol (IP) telecommunications network between a conference owner and a plurality of other conference participants. The IP network includes a conference server and at least one Call State Control Function (CSCF). The CSCF includes a Presence and Instant Messaging (PIM) server that notifies the conference server when participants are present and available. A first user is registered with the conference server as the conference owner, and the owner identifies the conference participants and provides criteria for initiating the conference. The conference server identifies each participant's serving CSCF, and sends a request to A each CSCF to notify the conference server when served participants are present and available. When the predefined number of participants are present and available, the conference server initiates the conference call.

Abstract: The present invention provides a system and method for slot deflection routing of optical data packets. The method of the present invention includes the steps of establishing a schedule pattern that includes a plurality of time slots. The schedule pattern includes at least one time slot in which an ingress edge unit can communicate with a destination egress edge unit, at least one time slot in which the ingress edge unit can communicate with a intermediate edge unit, and at least one time slot in which the intermediate edge unit can communicate with the destination egress edge unit. The present invention also includes receiving a data packet at the ingress edge unit and determining if the schedule pattern allocates sufficient bandwidth to send the data packet from the ingress edge unit to the destination egress edge unit without deflecting the data packet through an intermediate edge unit.

Abstract: In a method and multi-queue packet scheduling system for managing network packet traffic, each of a plurality of output buffer queues is assigned with a reserved weight in bandwidth sharing of an output link, is associated with a respective service class, and may be optionally assigned with a maximum rate to constrain packet transmission therethrough. The output buffer queues are adapted for enqueueing incoming packets therein according to associated service classes of the incoming packets. A shared bandwidth rate calculator determines in real-time shared bandwidth rates of maximum-rate constrained backlogged output buffer queues with reference to the reserved weights and such that the shared bandwidth rates do not exceed the assigned maximum rates. A packet scheduler transmits outgoing packets from the backlogged output buffer queues in accordance with a schedule that is based on the shared bandwidth rates determined by the shared bandwidth rate calculator.

Abstract: A packet converting apparatus and method is disclosed, in which audio packet data of various types used in cable/radio networks can effectively be converted. The packet converting apparatus includes a bit unpacking unit for bit unpacking first type packet data, a parameter inverse quantization unit for inverse quantizing the unpacked data to obtain a main parameter of the first type packet data, a parameter converter for converting the obtained main parameter to a parameter of second type packet data through inter-frame interpolation, a quantization unit for quantizing the second type parameter converted by the parameter converter, and a bit packing unit for bit packing the quantized data to reassemble the bit packed data to second type packet data and output the second type packet data to a destination.

Abstract: Data transmission system comprising a plurality of Local Area Networks (LANs) (10-1 to 10-4) interconnected by a hub (12) including the same plurality of LAN adapters (16-1 to 16-4) respectively connected to the LANs and a packet switch (14) comprising at least a packet switch module interconnecting all LAN adapters wherein a packet transmitted by any adapter to the packet switch includes a header containing at least the address of the adapter to which the packet is forwarded. The system comprises a memory block at each crosspoint of the switch module including memory control means for determining from the header of the received data packet whether the packet is to be forwarded to the output port associated with the crosspoint and a data memory unit for storing at least the data packet into the data memory unit before sending it to the output port.

Abstract: A communication network is provided having source and destination switching routers connected by two different communication paths. A primary label switched path is established on one of the communication paths and a secondary label switched path is established on the other label switched path. The source switching router can be enabled to place one or more data flows within the primary label switched path and can be enabled to place one or more of the same data flows within the secondary label switched path. The destination switching router stores a label identifying each data flow and a forwarding instruction and can be enabled to reference data carried within the primary or secondary LSP with the appropriate data flow label.

Abstract: A method for performing a hash transformation in a network device to generate a hash pointer for an address input by using rotation. The method includes to step of receiving an address input. Rotated copies of the address input are subsequently logically combined in accordance with a key to generate a hashing result corresponding to the address input. The hash result is subsequently output.

Abstract: A system for assisting a user in selecting a packet-based telephony service provider (“PBTSP”) from a group of PBTSPs, and in registering the user with the selected PBTSP for outbound and/or inbound calling. The selection of a particular PBTSP may be stored in a database, and this stored information may be used to enable the user to exchange telephone call data with one of the PBTSPs. One preferred system receives data from the user's computer device, determines whether the user is registered with one the PBTSPs and, if so, transmits data to the computer device which enables it to exchange telephone call data with one of the PBTSPs. The system also receives telephone call data from the computer device, accesses contact information for a PBTSP, and transmits the received telephone call data to the PBTSP using the accessed contact information.