Abstract: A method and apparatus employable in a wireless, packet-based network communication system for managing transmission-limit build-up performed by participating network BSS stations, whereby, when singular ones (one only) of these stations, during a given transmission budget beacon interval, are attempting to gain access to network transmission bandwidth, they are permitted to invoke an algorithm for rapid transmission-limit build-up. Such rapid build-up is based upon allowing such a station to begin its accessing process with an elevated, initial transmission limit which is created as a relatively high percentage (preferably about 80-percent) of the last prior beacon-announced network transmission budget. If more than one such currently non-transmitting stations are simultaneously attempting anew to gain network bandwidth access, rapid build-up is not permitted, thus to minimize an otherwise possible network communication traffic jam.

Abstract: A system-on-a-chip with a variable bandwidth bus. The integrated circuit includes at least one bus, a clock, a plurality of modules coupled to the bus and operable to transfer and receive data on the bus, and a bus controller coupled to the bus that controls data transfers on the bus. The modules are operable to generate requests to the bus controller to perform transfers on the bus. Each request comprises an identifier which identifies one or more receiving modules, a transfer size value which specifies the amount of data to be transferred, and a timing value providing a time frame within which the requested data transfer should occur.

Abstract: A system and method are disclosed for interleaving time-critical packets and lower-priority packets onto a common data link. A packet arrival prediction mechanism predicts when a time-critical packet is expected to arrive. When transmission of a waiting lower-priority packet might cause a substantial delay in the expected time-critical packet's transmission, the lower-priority packet is parked until it can be transmitted without interfering with a time-critical packet.

Abstract: In a multi-access communication system where a center station dynamically allocates the band of an uplink to subscriber stations, the band of an uplink is flexibly and efficiently allocated when the up-service quality is insured. When requesting a service quality assurance, the subscriber station 30 transmits the service quality request information 210 to the center station 10. The center station 10 transmits the identifier allocation information 310 to the subscriber station 30 to allocate an identifier. When the service priority is high, the center station 10 periodically transmits the reservation transmission permission information 410 and 411 to the subscriber station 3 at the reservation permission transmission intervals 910, thus checking for the presence or absence of reservation information. Waste consumption of the up-band can be suppressed by periodically transmitting the reservation transmission permission information even if subscriber stations issue up-data at irregular intervals.

Abstract: A next generation wireless data network and method for handing off a mobile node is presented. The network includes a core network (CN) coupled to a plurality of radio access networks (RANs). The RAN servicing the mobile node examines overload factors in the wireless data network while the CN examines admission capabilities to neighboring RANs. The wireless data network determines a traffic situation of the neighboring RANs and admits a new user to one of the neighboring RANs based on results of the examinations and the determination.

Abstract: In the dynamic access priority method, priority classes with different backoff delays are used to prioritize random access over shared channels and to reduce collision in the presence of a surge of random access requests. Service class information for a plurality of service classes is stored at user equipment. The service class information for a service class includes at least one of a maximum and a minimum back off value; the maximum back off value being indicative of a maximum back off interval and the minimum back off value being indicative of a minimum back off interval. At least one of a maximum and a minimum back off value is determined based on a selected service class of the user equipment, and a back off interval is determined based on the determined back off value. The back off interval indicates a period of time the user equipment waits before the user equipment attempts a transmission.

Abstract: Media Access Control (MAC) layer transmit and receive buffering with multi-level prioritization. The receive buffering allocates receive buffers for receiving frame data from a PHY interface in priority order using both a static and dynamic buffer allocation, and delivers completed buffers queued in a multi-level priority queue to a host interface highest priority first. The transmit buffering delivers completed buffers queued in a multi-level priority queue to the PHY interface in priority order. When the multi-level priority queue contains a buffer that is higher priority than one being prepared for transmit, a priority-based interruption causes the transmit processing of the buffer to be suspended at its current state with the higher priority buffer taking its place. Upon completion of the higher priority buffer, the suspended buffer is resumed at its current state.

Abstract: A method for allocating a processing resource among multiple inputs includes defining a sequence of multiplexing iterations, each such iteration including a first plurality of windows, each such window containing a second plurality of time slots. A respective weight is assigned to each of the inputs, and each of the inputs is allotted one of the time slots in each of a respective number of the windows in each of the iterations, the respective number being determined by the respective weight. Each of the inputs is then provided with access to the processing resource during the time slots allotted thereto.

Abstract: Methods for sequencing datagram transmissions are disclosed, including, receiving an unqueued segment to be enqueued in a queue. The queue comprises at least one segment. Determining a priority level and a number of attempted transmissions for the unqueued segment (100). If the unqueued segment is enqueued in front of a segment belonging to a datagram in the queue, and at least one segment belonging to the datagram has been transmitted before all the segments belonging to the datagram have been transmitted, at least one of the following functions is performed: discarding any remaining segments belonging to the datagram in the queue, transmitting any remaining segments belonging to the datagram in the queue, and re-enqueuing segments belonging to the datagram at the same location in the queue as the partially transmitted datagram, but with a different identifier.

Abstract: A method (18) for scheduling packet data transmissions in a wireless communication system wherein a per-user Priority Function (PF) (24) is based on a channel condition indicated by a Rate Request Indicator (RRI). The method also considers fairness criteria dictated by predetermined Quality of Service (QOS) requirements. In one embodiment, the rate request indicator is a Data Rate Request (DRR). In another embodiment, the rate request indicator is Carrier-to-Interference (C/I) information. In the exemplary embodiment, the base station calculates a Priority Function (PF) for the multiple mobile users. Each PF is a function of the rate request indicator and the projected throughput of a given mobile user. In one embodiment, the predicted throughput is calculated by T′=(T′)&agr;.

Abstract: A network node and a method of dynamically reconfiguring routes of established connections in a communications system operate to provide the optimal path for a new connection based on a priority status of the new connection. The optimal path is provided even when a communication link on the optimal path does not have a sufficient amount of available bandwidth to accommodate the new connection. The network node operates in conjunction with other network nodes in the system to reroute one or more established connections that have reserved bandwidth on a communication link on the optimal route and have a lower priority status than the new connection, thereby increasing the available bandwidth on the communication link to accommodate the new connection. The network node also performs conventional functions of a router. The network node and the method can be implemented in any communications system where information is transmitted in packets, blocks, frames or cells.

Abstract: The scheduling queue of the present invention is configured as a systolic array utilizing self-sorting scheduling cells to sort information packets based upon previously assigned priorities, while at the same time yielding a small constant latency independent of the length of the queue. The scheduling queue of the present invention is effective in supporting various Quality of Service (QoS) policies and algorithms, including both Differentiated Services (DiffServ) and Integrated Services (IntServ) having an arbitrary number of flows.

Abstract: In a connection management system for setting up connections in a communications network, run-time negotiation is carried out to avoid feature interaction. Users of the network are provided with user agents (intelligent software) which have access to user profiles. When a calling user wants to set up a particular connection configuration, which may involve service features such as ring back later on busy, their user agent sends a connection configuration proposal to the user agent for a called user. The two user agents then negotiate to establish a mutually acceptable connection configuration, if one is available. The negotiation is based on alternative connection configurations stored in order of preference in the respective user profiles. These are proposed and counter-proposed by the user agents in descending preference order until the mutually acceptable configuration is reached or the connection fails.

Abstract: A priority corresponding to the emergency level of a communication in each slave station is allocated to a time slot assignment request transmitted from each slave station to master station. When master station receives the time slot assignment request to which the priority is set, the priority of the time slot assignment request is judges in slot assignment controller. When there is not any vacant time slot having the priority judged and at the same time there is a vacant time slot whose priority is lower than the priority concerned, the time slot whose priority is lower than the priority concerned is allocated to the time slot assignment request, whereby the assignment waiting time until data having a high emergency level are transmitted can be shortened.

Abstract: In order to call mobile'stations, mobile stations are, according to the invention, allocated to time slots for calling on the basis of subscriber-specific profiles. The number of time slots allocated for calling within a macroframe can be set individually for the mobile, stations. The requirement for time slots allocated for calling is thus covered individually for each mobile station. For time-critical applications, shorter delay times can be achieved using the method according to the invention.

Abstract: In a mobile communication system of multi-cell environment, a pico-cell indicator is installed at predetermined positions for easy cell-registration change of a mobile station from a micro-cell service area to a pico-cell service area.

Abstract: A switching unit that includes a number of input/output (I/O) ports and a processing module. The I/O ports include a number of distinct I/O ports and a like number of data network ports. The distinct I/O ports are associated, through the processing module to each other and are further associated, each, through the processing module to a corresponding data network port. The processing module is configured to process traffic arriving at one of the distinct I/O ports to which the traffic should be forwarded.

Abstract: An architecture for distributing digital information to subscriber units wherein selection from among multiple digital services is accomplished by transmitting a tuning command from a subscriber unit to an intermediate interface. The intermediate interface selects the desired service from a broadband network and transmits it to the subscriber unit over a bandwidth-constrained access line. The bandwidth-constrained access line may be implemented with existing infrastructure, yet the subscriber unit may access a wide variety of digital information available on the broadband network. Universal broadband access is thus provided at low cost. Output bandwidth of broadcast equipment may also be optimized.

Abstract: In packet communications between a mobile terminal and a base station, the mobile terminal checks a priority level of a traffic and judges a type of the traffic, and transmits a reservation signal for a transmission request to the base station when the type of the traffic is a high priority level or realtime type, and does not transmits it when the type of the traffic is a low priority level or non-realtime type, while the base station determines a resource amount to be reserved for packet transmission according to a resource utilization state and the reservation signal for the traffic of the high priority level or realtime type, or an average transmission interval or transmission rate for the traffic of the low priority level or non-realtime type according to margins in remaining resources, and notifies the resource amount or the average transmission interval or transmission rate to the mobile terminal.

Abstract: In the multi-priority re-sequencing method and apparatus, received data packets each have a priority class indicator and a transmission sequence number. The priority class indicator indicates a priority class of the data packet, and the transmission sequence number indicates a sequence of transmission for data packets of a same priority class. The received data packets are sent to the next processing layer in sequence based on the transmission sequence number and the priority class indicator of the data packets.

Abstract: A system-on-a-chip with a variable clock rate bus. The integrated circuit includes at least one bus, a clock, a plurality of modules coupled to the bus and operable to transfer and receive data on the bus, and a bus controller coupled to the bus that controls data transfers on the bus. The modules are operable to generate requests to the bus controller to perform transfers on the bus. Each request comprises an identifier which identifies one or more receiving modules, a transfer size value which specifies the amount of data to be transferred, and a timing value providing a time frame within which the requested data transfer should occur. Thee bus controller receives the requests, analyzes the timing value, and selectively adjusts the clock rate of the bus based on the timing value.

Abstract: A method for scheduling packet data transmissions in a wireless communication system wherein a per-user Priority Function (PF) is calculated based on the channel condition and throughput for each user. In one embodiment, the system supports retransmission of data packets and sub-packets, wherein the retransmission information is used to schedule data transmissions. In another embodiment, at each time interval the system updates the priority factor for the user having the highest priority factor in the previous time interval. The priority factors of the other users remain unchanged.

Abstract: A method of transmitting packet data in a CDM and TDM mobile data communication system is provided. The method comprises determining priorities of one or more control channels, transmitting control information related to one or more packet data sets to one or more mobile stations through corresponding control channels according to the priorities; and transmitting the one or more packet data sets to each mobile station through one or more data channels that correspond to the one or more control channels, respectively. And, a frame duration of the higher priority data control channel restricts a frame duration of the lower priority data control channel.

Abstract: An adaptive scheduling method, systems and apparatus for streaming data service for either single-carrier channel or multi-carrier channel are provided. This adaptive scheduler assigns data transmission using mixed round-robin and maximum CIR user selections based on a predetermined threshold relative to the target streaming data transmission rate. It can provide a very high flexibility for a streaming data service and exploits a multi-user diversity in single-carrier system and an additional frequency diversity in multi-carrier system.

Abstract: Location-based call management methods for geographically-distributed communication systems, including conventional (FIG. 1) and trunking (FIG. 3) systems operable in full duplex mode. A base station controller (111) of a conventional system receives (202) a message, determines (204) a message priority and sends (210, 214, 220) the message to recipient devices selected from among a console (122), local base station (101) and adjacent base station(s) (102, 103) based on the message priority. A zone controller (308) of a trunking system determines an associated site (301) and one or more adjacent sites (302, 303) for a prospective talkgroup call and, based on availability (406, 416, 428) of resources, assigns (424, 432) site(s) to the call. A mobile communication device (320) determines (506, 510) a selected site and adjacent site(s) and respective talkgroups, affiliates (508) with the selected site talkgroup and enters (512) the adjacent site talkgroup(s) in a scan list.

Abstract: A system and method for increasing bandwidth usage between an access point and a wireless device are described. One embodiment can include an access point, a prioritizer, and a priority storage device. These components can increase bandwidth usage between an access point and a wireless device by allocating previously unused transmission slots.

Abstract: A system and method reduces the delay of speech processing over a packet-switched network in a discontinuous transmission system. According to exemplary embodiments, a base transceiver station assigns priority indicators to information received therein. When the information is speech or a first SID frame, a high priority indicator is assigned. When the information is a SID update frame, a low priority indicator is assigned. The information is transferred from the base transceiver station to a base station controller in an order determined by the priority indicators. As such, the delay in transferring and processing speech information is reduced.

Abstract: In the method, at least one timing message is generated by a first arrangement at predefinable time intervals and is transmitted to at least a second arrangement. The timing message contains a synchronization method, as a function of which time intervals which are provided for the transmission of data packets (DP) each having a predefinable priority class are determined. After reception of the timing message, the received timing message is evaluated, a synchronization time being determined, as a function of which the time intervals which are provided for the transmission of data packets each having a predefinable priority class are determined.

Abstract: A radio paging signal coding control scheme capable of improving the reception characteristic of the receiver by carrying out a coding control to determine logical channels for accommodating paging signals such that the transmission rate equivalently becomes as low as possible according to the paging signal traffic, without interrupting the paging signal coding processing while maintaining the combination of transmission rate and modulation scheme for frames, is disclosed. In the case of using prescribed transmission rate and N-valued modulation scheme, logical channels to be used for transmission of paging signals among a plurality of available logical channels are determined by setting priority orders among a plurality of available logical channels such that a number of states of modulated signals becomes less than N when paging signal traffic is small.

Abstract: A system and method for traffic congestion control at the media access controller (MAC) level. The MAC receives an inbound packet and preclassifies the packet for determining its priority. A utilization level of a queue associated with the determined priority is analyzed for determining its level of congestion. The packet is admitted or not based on the congestion information. Admitted packets are forwarded to the packet switching controller which engages in further classification and congestion control for determining whether the admitted packet is to be forwarded to a destination address.

Abstract: A method of filtering data packets in a network device is disclosed. An incoming packet is received from a port and the incoming packet is inspected and packet fields are extracted. The incoming packet is classified based on the extracted packet fields and action instructions are generated. The incoming packet is then modified based on the action instructions. Further, the inspection and extraction includes applying inspection mask windows to any portion of the incoming packet to extract programmable packet fields.

Abstract: The invention relates notably to a method for allocating resources in the uplink of a wireless communication network supporting real-time packet data services, said wireless communication network comprising a centralized resource allocation module (13) and a plurality of radio terminals (11).

Abstract: One of a number, n, of slave devices is selected for express or implicit polling by a master device in a communication system that transmits during individual ones of a number of sequentially occurring time slots. This is done by assigning a corresponding priority level to each slave device, wherein at least two slave devices are assigned different corresponding priority levels. A corresponding count parameter and a corresponding initial count value are assigned to each of the slave devices. For each of the slave devices, the corresponding count parameter is initialized to the corresponding initial count value. For each successive time slot, each of the count parameters is adjusted (e.g., by decrementing). A highest priority slave device whose corresponding count parameter has reached or passed a predetermined value is selected for polling.

Abstract: Embodiments of the present invention comprise systems and methods for providing transmission priority to stations in a wireless LAN system.

Abstract: A method of providing data for transmission on a time division multiplexed (TDM) serial data stream. The method comprises mapping channels of the TDM stream to contexts, each context comprising a set of memory buffers for storing data to be transmitted. Data is extracted from the contexts in a sequence defined by said mapping and transmitting the extracted data on the TDM stream. When a buffer or buffers of a context become empty, a buffer refill request is generated to cause data to be read from a memory to refill the buffer, wherein each buffer refill request is assigned a priority. The context buffers are refilled in an order defined by the respective priorities of the refill requests.

Abstract: A system and method of transferring data through a network by adaptively fragmenting frames of information into subframes. The method contemplates receiving a first frame and a second frame at a first node of the network. The first frame is segmented into a fragmented frame comprised of at least a first subframe and a second subframe, and the first subframe transmitted to a second node of the network. Following transmission of the first subframe to the second node, the second frame is transmitted to the second node prior to transmission of the second subframe to the second node. A first identifying field is appended to the first subframe and a second identifying field is appended to the second subframe, the first and second identifying fields respectively indicating the relative position of the first subframe and the second subframe within the fragmented frame.

Abstract: In a two way cable system that includes a controller and a plurality of user terminals, a method of granting rights for upstream data transmission from the user terminals includes processing contention requests to generate contention grants and maintaining a list of connections, each connection having specified therefor a predetermined bit rate. The controller sends a downstream data stream to the user terminals and receives an upstream data stream from the user terminals. The downstream data stream includes a plurality of grant fields, and the upstream data stream includes upstream data slots and upstream control slots.

Abstract: The invention is a novel slot structure and method of transmitting data at a controllable power level. The slot comprises a header, a DATA field adjacent the header and a ramp interval adjacent the DATA field. The method consists of transmitting the entire slot at a sufficiently high power when the DATA field is occupied by data traffic or control information but to lower the power during transmission of the DATA field when the slot is a null slot. In the latter case, a gradual decrease of the transmitted power is effected during the first few symbols of the DATA field, whereas the power is brought back to a higher level during the ramp interval. The new power level may be higher or lower than the initial power level, depending on the destination mobile unit associated with the following slot.

Abstract: A queue scheduler that distributes a partition worth of bandwidth to a plurality of queues according to a weight assigned to each of the queues. The plurality of queues are arranged from a highest priority to a lowest priority. The queues are serviced by the scheduler until each of the corresponding weights is consumed for each queue. The higher priority queues are serviced before the lower priority queues.

Abstract: A communications network such as a Global Multi Service Network is provided with a management system which includes a distributed control system. The distributed control system is an open community of co-operating intelligent software agents which individually have control, or responsibility for managing, one or more nodes of the communications network. There are software agents of more than one type and the service management agents which have control over nodes of the network enter a negotiation process with customer agents in the provision of new services, so as to meet the constraints of both customer requirements and the interest of the relevant service provider. In the event of agent failure, the service management agents initiate a bidding process to reallocate the responsibilities of a failed agent.

Abstract: A broadcast message indicating the utilization level associated with Stand-alone Dedicated Control Channels (SDCCH) within a mobile telecommunications network serving a particular geographic area is transmitted over a broadcast channel. A plurality of mobile stations located within that particular geographic area monitoring the broadcast channel then receives the transmitted message. Thereafter, a mobile service request with a lower priority level than the indicated status level is queued by the associated mobile station and delayed until the channel utilization level rescinds to a network acceptable level.

Abstract: A non-blocking crossbar for packet based networks and a method of operation thereof. In one embodiment, the non-blocking crossbar includes: (1) n inputs, n numbering at least two, (2) n outputs, each of the outputs having a destination first-in, first-out buffer (FIFO) and n crossbar FIFOs interposing corresponding ones of the n inputs and the destination FIFO, and (3) a scheduler configured to cause a packet to be transmitted from one of the inputs toward one of the outputs only when both the destination FIFO associated therewith and an interposing one of the crossbar FIFOs are available to contain the packet.

Abstract: A scheduler allocates service to enqueued cells of connections provisioned for guaranteed service levels employing a structure with one or more of the following features to achieve efficient high-speed packet switching (cell relay). For very high-speed switching of connections, such switches operating up to 10, or even 100, Tbps, burst scheduling of cells is employed in which a number of cells, termed a burst, are serviced when a queue is eligible for service. When a queue has less than the number of cells in the burst (termed a short burst), the scheduler still schedules service, but accounts for saved service time (or bandwidth) of the short burst via queue length when the queue's eligibility is next considered for service. In addition, high and low bandwidth connections of a queue may be allocated into two sub-queues, with priority assigned to the two queues and delay-sensitive traffic (high bandwidth connections) assigned to the higher priority sub-queue.

Abstract: A method of providing network access across a shared communications medium between competing users includes the steps of monitoring network access usage by each user for a past time interval and, based on the monitored network access usage, allocating network access for each user during a future time interval. Features include forecasting network access that will be utilized or requested by users in a future time interval, and prioritizing the users for allocating network access to the users.

Abstract: The present invention is directed toward methods and apparatus for packet transmission scheduling in a data communication network. In one aspect, received data packets are assigned to an appropriate one of a plurality of scheduling heap data structures. Each scheduling heap data structure is percolated to identify a most eligible data packet in each heap data structure. A highest-priority one of the most-eligible data packets is identifying by prioritizing among the most-eligible data packets. This is useful because the scheduling tasks may be distributed among the hierarchy of schedulers to efficiently handle data packet scheduling. Another aspect provides a technique for combining priority schemes, such as strict priority and weighted fair queuing. This is useful because packets may have equal priorities or no priorities, such as in the case of certain legacy equipment.

Abstract: Apparatus and method for transmitting data messages between a plurality of stations interconnected by a bus line is disclosed, in which each message includes a frame portion and a data portion. The frame portion represents content and priority information of the data message, and the data portion represents data to be transmitted. At least one station transmits a data message having the frame portion transmitted at a first data transmission rate, and the data portion transmitted at a second data transmission rate which is not less than the first data transmission rate. The first and/or second data transmission rate is adjustable in dependence on a signal quality determined for transmission of a data message.

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: An exemplary method for managing requests in a mobile device system comprises the steps of assigning a priority to each queue in a set of priority queues, inputting requests into the set of priority queues based on a priority associated with each request, merging multiple requests in the set of priority queues into a merged request based on priorities associated with the multiple requests and a destination for the multiple requests, and sending the merged request to a request queue for a connection in a connection pool for the destination.

Abstract: Apparatus, and an associated method, for a fixed wireless access communication system, by which to initiate a call to an emergency dispatch center, or other priority call to a priority location. When communication resources are initially unavailable to permit establishment of the call, normal call set-up procedures are emulated at a subscriber station from which the call is to be originated. Communication resources are reallocated in the communication system to permit the establishment of the call and the call is thereafter established.

Abstract: In transmission systems whereby data packets of a single type and having a fixed structure are used to transmit a given type of information, the invention optimizes the transmission by utilizing data packets of the same type to transmit information of different types and by differentiating the information transmitted in such packets by the rate of re-transmission thereof. In an application of the invention to RDS systems, the block PS is used to transmit both the program service name, as usual, and the radio text, and arrangements are made for the rate of re-transmission of the service name to be high and that of the text to be low, or possibly zero.