Abstract: A multi-channel scheduling method in a wireless network is provided. The wireless network includes a plurality of Wireless Local Area Network (WLAN) device with a single radio interface. A regular time interval P and a Channel Coordination Window (CCW) to be repeated in a period of P are set. A request is made such that the plurality of devices are tuned to a first channel at a start point of the CCW. A pair of arbitrary WLAN devices among the plurality of WLAN devices is allowed to transmit control frames in the regular time interval P. The control frames are a transmission proposal control frame for proposing communication in a second channel and a response frame, responding to the transmission proposal control frame, for indicating whether the second channel has been accepted or rejected. The arbitrary WLAN device of the pair are switched to the second channel after acceptance.

Abstract: A wireless communication infrastructure entity including a transceiver coupled to a controller configured to generate parity bits based on scheduling grant information and to encode the parity bits based on additional scheduling grant information not used to generate the parity bits, wherein the encoded parity bits are combined with the scheduling grant information. The additional scheduling grant information may be transport block size or redundancy version information.

Abstract: A mobile communication method according to the present invention includes: controlling, at the radio base station NodeB, the transmission power in the DPCCH by use of an inner loop transmission power control based on a target SIR; transmitting, at the mobile station UE, the uplink packet, at the transmission power in the E-DPDCH, the transmission power being determined based on the SG and the transmission power in the DPCCH; and determining, at the radio base station NodeB, the target SIR, by use of an outer loop transmission power control based on a HARQ transmission number and a reception result of an uplink packet transmission of the HARQ transmission number, the HARQ transmission number indicating what number transmission in the HARQ retransmission control is the uplink packet transmission.

Abstract: A system that indicates which frame should next be removed by a scheduler from flow queues within a network device, such as a router, network processor, and like devices is disclosed. The system includes a search engine that searches a set of calendars under the control of a Finite State Machine (FSM), a current pointer, and input signals from an array and a clock line providing current time. Also included is a decision block that determines which of the searches are critical and which, during peak calendar search periods, can be postponed with minimal impact to the system. The postponed searches are then conducted at a time when there is available calendar search capacity.

Abstract: A base station for use in wireless network that communicates with subscriber stations according to a multicarrier protocol. The base station receives an uplink subframe comprising a plurality of blocks. Each of the blocks comprises up to N subcarriers transmitted by the subscriber stations. The base station receives a first acknowledgment signal transmitted by a first subscriber station in the uplink subframe. The first acknowledgment signal is carried on at least one selected subcarrier in a first block of the uplink subframe and on at least one selected subcarrier in a second block of the uplink subframe.

Abstract: Data collected by sensors (10, 30) is transmitted to data collection points (31, 61) over a network using an epidemic protocol in which data received by a relay (3) is forwarded to a randomly-selected group of further relays (4, 5, 6) unless the same data has been previously received by the relay (3) or the data is time-expired. Data received by a relay (3) from different sources (1, 2, 30) in the same time-frame is aggregated using a Bloom filter process so that in each time frame only a single Bloom filter message is transmitted by each relay.

Abstract: Methods and apparatus related to scheduling decisions of a peer to peer communications device for transmission into traffic intervals are described. A first peer to peer communications device maintains a set of information which allows it to base a scheduling decision for a current traffic interval upon prior performance in a prior traffic interval in which users of other connections were also operating. In some embodiments, the set of information includes a list of device or connection identifiers which the first peer to peer communications device has previously determined to have corresponded to a prior traffic interval in which the first peer to peer device had a low determined data rate.

Abstract: A system for foreign agent relocation in a wireless network. The system comprises at least one first foreign agent; at least one second foreign agent; and at least one mobile node. Relocation negotiation is performed to determine whether foreign agent relocation of the mobile node from the at least one first foreign agent to the at least one second foreign agent is agreed, and foreign agent relocation is performed if the foreign agent relocation is agreed.

Abstract: Techniques for controlling transmission of packets on multiple links are described. In one design, a transmitter may generate packets of data for a receiver, assign the packets with sequence numbers from a single sequence number space, demultiplex the packets into multiple streams for multiple links, and send each stream of packets on the associated link to the receiver. The receiver may receive some packets in error, and the correctly received packets may be out of order. In one design, the receiver may maintain the largest sequence number of correctly received packets for each link. After detecting at least one missing packet, the receiver may send status information conveying the missing packet(s) and the largest sequence numbers for all links to the transmitter. The transmitter may use the largest sequence numbers for all links and its packet-to-link mapping to determine whether to quickly resend each missing packet or wait.

Abstract: A system and method that can be deployed to schedule links in a switch fabric. The operation uses two functional elements: to perform updating of a priority link list; and then selecting a link using that list.

Abstract: A space-time division multiple-access (STDMA) laser communications (lasercom) system and related techniques. The STDMA system includes a plurality of remote nodes and an STDMA access node which uses precise electronic beam steering and beacons to provide access to each of a plurality of remote access nodes by means of both space and time-division multiple access.

Abstract: A network resource allocation system and method of the same are provided according to the present invention. The system and method are applicable to a wireless mesh network, the method including: programming traffic of connections between routers; exchanging data between neighboring routers, thereby enabling the routers to perform dispersive network resource allocation according to the exchanged data; checking a local time window and a global time window for expiration by the router; and, under the condition of local performance deterioration or local traffic variation, activating a local routing adjustment mechanism by the router, wherein, if global performance deterioration currently exists, then activating a global optimization mechanism by a central controller, and, if not, then resetting the global time window.

Abstract: An approach is provided for providing random access window configuration by estimating a processing time margin for processing random access preambles received in one or more random access channels. The estimated processing time margin is then used to offset the respective random access window configuration.

Abstract: In a network node, a method and apparatus assemble fixed cell length cells resulting from the segmenting of variable length frames into cells. A finite state machine fetches frame data moves frame data and control block data to the cell and outputs cell data. A counter points to the frame. A multiplexer selects the correct data to form the cell. The finite state machine builds cells corresponding to a frame using a cell pattern applied to these cells using two constraints. The first constraint is a 64 unit cell size with a 6 unit cell header and 10 unit frame header; the second constraint is that the insert and overlay field have to be even. The method replaces a field by a definite value when a frame is modified during the segmenting processing, when a new field is inserted in the frame or when frames are packed into one cell.

Abstract: This invention is a method for time-sharing sounding resources. This invention time-shares one sounding source across plural user equipment for different sub-frames. This invention uses different sounding periods which are periodic and either non-changing in time or changing in time. Different user equipment have sounding periodicities where one is an integral multiple of the other. This invention also allocates and updates a sub-frame offset for each user equipment.

Abstract: A method of supporting data retransmission in a wireless communication system is disclosed. A method of supporting data retransmission in a wireless communication system which uses multiple carriers includes receiving NACK from a user equipment in response to a transmitted packet, transmitting scheduling information to the user equipment, the scheduling information indicating change of radio resources previously allocated for transmission of a retransmission packet, and transmitting the retransmission packet in accordance with the scheduling information.

Abstract: A packet relay method and device in which even in the presence of a relay device between transmitting and receiving devices, a normality of a protection route can be surely confirmed is provided; A specific source address or destination address are registered, and when a route normality confirmation packet having the source address or destination address is received, the packet is transmitted to a protection route regardless of a hash operation; The registering can include link aggregation information in addition to the source address or destination address and the transmitting is made when the route normality confirmation packet consistent with both of the source address or destination address and the link aggregation information is received.

Abstract: Systems and methodologies are described that facilitate efficiently providing scheduling information from an access terminal to a base station to enable effectuating scheduling decisions. Access terminals may transmit scheduling information in bifurcated requests. For instance, coarse scheduling information may be transferred utilizing a dedicated out-of-band channel, and fine scheduling information may be transmitted over an in-band channel.

Abstract: A method for providing a priority-based, low-collision distributed coordination function (DCF) in a wireless network is provided. The network includes an access point and a plurality of stations. The method includes receiving at a first station a super-frame from the access point. The super-frame is operable to define a service period for each of the stations. A priority for the first station is determined based on the super-frame. A back-off time is selected for the first station based on the priority.

Abstract: To transmit multimedia data in such a manner that is adaptive to the transmission capability of a receiving apparatus and/or to the congestion state of a network. In a transmitting apparatus (100), a receiver capability estimating part (102) estimates, based on feedback information from a receiving apparatus (200), a useable band. A receiver classifying part (103) classifies, based on the useable band, the receiving apparatus. A receiver list rearranging part (105) rearranges, in order of transmission capability, a receiver list where classified receiving apparatuses are listed in classes. A packet generating part (106) generates a packet having the receiver list and transmits it at an appropriate transmission rate.

Abstract: A radio terminal, in a transmission opportunity of each of plural kinds of allocation request schemes for a first uplink radio resource, the transmission opportunity being periodically allocated from the base station, estimates timings that the first uplink radio resource is allocated from the base station when an allocation request of a corresponding allocation request scheme is transmitted, based on a cycle of the transmission opportunity and a turnaround time of the allocation request scheme, and transmits the allocation request to the base station in a transmission opportunity selected by the estimated timing.

Abstract: The present invention relates to selecting a transport format combination (TFC) such that a quality of service (QoS) is guaranteed in a mobile communication system of a certain level even for a service having a low priority. The present invention selects a transport format combination such that not only a priority of each service is guaranteed but also a service quality is guaranteed by an MAC layer at the time of transporting services having different QoSs and different priorities.

Abstract: There is disclosed a mobile station performing packet communications with a base station, including: a reservation control signal generating unit configured to generate a reservation control signal, based on control information transmitted in advance of a data packet; and a reservation control signal transmission control unit configured to transmit the reservation control signal at a predetermined timing.

Abstract: With time intervals and transmission times of packets of real time streams, transmission end times thereof are calculated. The transmission order of packets of the real time streams is decided in the order of the earlier transmission end times thereof. Transmission end times of packets of a non-real time stream are compared with the scheduling times of packets of the plurality of real time streams. When the transmission end times of packets of the non-real time stream are earlier than any one of the scheduling times of packets of the plurality of real time streams, the packets of the non-real time streams are transmitted.

Abstract: Schedules may use burst tolerance values to adjust the scheduling in a time-based schedule, such as, but not limited to, adjusting for accumulated but not used bandwidth, and/or adjusting eligibility of schedule entries. A best schedule item associated with an eligible schedule entry of a schedule is identified. Whether or not a particular schedule entry is eligible is typically determined based on the relationship of an associated timestamp with a current scheduling time, such as its timestamp being less than or equal to the current time. A burst tolerance time bound might also be used to allow certain priorities and/or types of items to be considered eligible if even its timestamp exceeds the current time by an amount, but less than or equal to the burst tolerance time bound.

Abstract: A method for transmitting measured data from a sensor device to a control device is disclosed. The method is distinguished in that synchronization messages sent by the control device can be received in the sensor device and, on the basis of the reception of synchronization messages, the sensor device is put into a synchronous mode (SM) in which the sensor device sends data messages comprising the measured data to the control device in sync with the reception of the synchronization messages. A sensor device is also disclosed which is suitable for carrying out the foregoing method.

Abstract: A method may include determining a schedule of flush events for a queue and identifying whether the queue includes information associated with a partial data unit, the partial data unit being a data unit that is less than completely filled with data. The method may include identifying whether the queue should be flushed based on the schedule of flush events, and identifying that the queue includes the information associated with the partial data unit. The method may further include waiting for additional data to add to the queue, in response to identifying that the queue should not be flushed; and sending out the partial data unit, in response to identifying that the queue should be flushed.

Abstract: Apparatus and method that schedules movement of packets within network devices, such as network processors, includes a calendar using a segmented hierarchical routine to identify the next packet to be moved from one of a plurality of flow queues.

Abstract: A communication mode which should be set to a mobile communication terminal having a function of switching between an autonomous mode and a scheduling mode is determined based on an amount of interference in each of the communication modes in the cell of a base station, and/or communication characteristics of each of the communication modes, and a signal indicating an amount of communication data notified from the mobile communication terminal. The base station then notifies the determined communication mode to the mobile communication terminal.

Abstract: A medium access control (MAC) architecture reduces transmission latency for data block retransmissions. A plurality of data blocks are received and temporarily stored in a first memory (e.g., queue, buffer). The plurality of data blocks are then transmitted. A determination is made as to whether each of the transmitted data blocks was received successfully or needs to be retransmitted because the data block was not received successfully. Each of the transmitted data blocks that needs to be retransmitted is marked and temporarily stored in a second memory having a higher priority than the first memory. The marked data blocks are retransmitted before data blocks stored in the first memory location.

Abstract: Systems, devices, and methods are disclosed for managing multimedia traffic across a common wireless communication network. Embodiments may include content devices, end point devices, a network node, and a wireless dongle. The network node and the wireless dongle may have application functions transmitting and receiving application data streams including a video application. The video application may include a conversion engine to compress, expand, or convert video data. Further, both the network node and the wireless dongle may transmit downstream video streams and receive upstream video streams. In addition, the network node may have a master controller function and a node management function, and a dongle management function each managing video traffic streams and application data streams. In addition, the dongle management function controls admission of a video traffic stream originating from the wireless dongle to the wireless communication network.

Abstract: A method for enhancing transmission efficiency of burst data by estimating a void between burst data and filling the void with new burst data in an optical burst switching (OBS) network. To this end, a node in the OBS network receives burst data (BD) aggregated from data packets, and a burst control packet (BCP) that is received prior to the BD by an offset time. The BCP contains information relating to the offset time and the BD. To predict the void between the BDs, a void filling time is defined within the offset time using the BCP. The present invention provides the method for determining whether to fill the void and filling the void by directly monitoring the BD over a preset time.

Abstract: A dynamic bandwidth allocation method of an Ethernet passive optical network, comprises a predictor and a rule of QoS-promoted dynamic bandwidth allocation (PQ-DBA); the predictor predicts a client behavior and numbers of various kinds of packets by using a pipeline scheduling predictor consisted of a pipelined recurrent neural network (PRNN), and a learning rule of the extended recursive least squares (ERLS); the present invention establishes a better QoS traffic management for the OLT-allocated ONU bandwidth and client packets sent by priority.

Abstract: Expanding the coverage of a time-shared network comprising electronic edge nodes interconnected by bufferless fast-switching optical nodes is enabled by combining spatial switching with temporal switching. The output side of each edge node preferably connects to a large number of core switches through individual time-locked channels and the input side preferably connects to each of a small number of core switches through a channel band having a sufficiently large number of channels. Wavelength routers may be used to aggregate individually-routed channels into WDM links.

Abstract: An apparatus comprising a plurality of data framers, a time division multiplexer coupled to the data framers, and an optical transmitter coupled to the time division multiplexer. Also disclosed is an apparatus comprising an optical receiver, a time division demultiplexer coupled to the optical receiver, and a data framer coupled to the time division demultiplexer. Also disclosed is an apparatus comprising at least one component configured to implement a method comprising combining a first plurality of data frames corresponding to a first plurality of channels into a first plurality of combined data frames using time division multiplexing and transmitting the first combined data frames over a single optical channel.

Abstract: System and methodologies are provided herein for multiuser scheduling in a multiple-input multiple-output (MIMO) communication system. Various aspects described herein facilitate full feedback scheduling, wherein multiuser scheduling is performed based on an antenna selection and signal quality feedback, such as signal-to-interference-plus-noise ratio (SINR) feedback, from respective users. Based on information received from respective users, independent information streams can be transmitted from respective transmit antennas to respective users with the highest signal quality. Receive antenna selection can also be employed to allow respective users to select a single receive antenna on which information is to be received. Additional aspects described herein facilitate quantized feedback scheduling, wherein scheduling is performed based on signal quality feedback that is quantized into a finite number of bits by respective users.

Abstract: A first traffic flow directed to a first wireless device is received. A second traffic flow directed to a second wireless device is received. These traffic flows comprise at least a first service flow classification and a second service flow classification. The first traffic flow and the second traffic flow are scheduled based on the first service flow classification and the second flow classification. This produces first and second device scheduled flows. The first and second device scheduled flows are classified into a plurality of flow classes. The plurality of flow classes comprises at least a first flow class and a second flow class. The first scheduled flow and the second scheduled flow are scheduled based on the first flow class and the second flow class. This produces an aggregate traffic flow.

Abstract: Disclosed herein is a printing device connected to a client, the printing device including: a reception unit which receives plural types of logic packets from the client; a hardware packet processing unit which processes the logic packets by hardware; a software packet processing unit which includes a microprocessor and processes the logic packets by software; and a sorting unit which sorts the plural types of logic packets into a logic packet to be processed by the hardware packet processing unit and a logic packet to be processed by the software packet processing unit, wherein the sorting unit sorts a reply requiring logic packet including contents replying to the client as the logic packet to be processed by the hardware packet processing unit when sorting the plural types of logic packets.

Abstract: Disclosed herein is a method and system for WiMAX ranging using OVSF ranging codes. Specifically, in an exemplary embodiment, a WiMAX communication system that is configured to provide service at a plurality of quality of service (QoS) levels, may be configured to (a) broadcast a QoS level message in a downlink sub-frame, wherein the QoS level message comprises one or more spreading factor codes, and wherein each spreading factor code indicates a spreading factor for a particular QoS level, (b) receive a ranging request from a device, wherein the ranging request comprises an orthogonal variable spreading factor (OVSF) code, wherein the OVSF code was selected according to the one or more spreading factor codes, (c) determine a spreading factor of the OVSF code in the received ranging request, and (d) use the spreading factor as a basis for selecting a QoS level at which to provide service to the device.

Abstract: The invention discloses a method of optimizing handoff time in a wireless communication system from a first base station to a second base station through a dynamic data source control, the method comprising determining a communication delay between a network service node of the wireless communication system and the second base station; setting a scheduling delay for the second base station; determining a handoff delay based on the communication delay and the scheduling delay and indicating said handoff delay to a mobile communication device, wherein the mobile communication device performs the handoff from the first base station to the second base station on expiry of the handoff delay so determined.

Abstract: A communication resource management device changes the transfer rate of a first control channel related to a first mobile terminal according to a communication condition. The device determines whether there is a frequency band for which it is not determined whether the frequency band is to be used in a predetermined time period based on a current transfer rate of a second control channel related to a second mobile terminal and an amount of data to be transmitted in the second control channel; and allocates, to the first mobile terminal, at least a part of the frequency band for the second control channel with respect to the second mobile terminal in a predetermined period of time. The device changes the transfer rate in the first control channel while maintaining the total frequency band for plural control channels related to plural mobile terminals at a constant value.

Abstract: In general, techniques are described for performing work conserving packet scheduling in network devices. For example, a network device comprising queues that store packets and a control unit may implement these techniques. The control unit stores data defining hierarchically-ordered nodes, which include leaf nodes from which one or more of the queues depend. The control unit executes first and second dequeue operations concurrently to traverse the hierarchically-ordered nodes and schedule processing of packets stored to the queues. During execution, the first dequeue operation masks at least one of the selected ones of the leaf nodes from which one of the queues depends based on scheduling data stored by the control unit. The scheduling data indicates valid child node counts in some instances. The masking occurs to exclude the node from consideration by the second dequeue operation concurrently executing with the first dequeue operation, which may preserve work in certain instances.

Abstract: The invention relates to a method and an arrangement for optimizing a link latency on a communication interface in a communication network comprising a first communication network node (18) and a second communication network node (16) communicating with said first communication network node (18) on said communication interface and sending framed data packets having frame numbers to a plurality of user equipments over a radio interface. A transmission delay on said communication interface is measured and downlink data having an adjusted frame number based on said measured transmission delay is requested.

Abstract: A scheduling system may include a read sequence management table that includes a group of positions for arranging data received from a group of lines and a schedule management table to store a group of peak rate values that are each associated with one of the group of positions of the read sequence management table. The scheduling system may further include a schedule computation section to determine the association between each of the group of peak rate values and the group of positions based on an availability of the group of positions, store each of the associations in the schedule management table, and select one of the group of positions in the read sequence management table as a starting position to arrange data from a new line, where the selected position is based on a comparison of a peak rate value of the new line and the group of peak rate values stored in the schedule management table.

Abstract: One embodiment of the present invention provides a system that performs a query-based convergecast scheduling in a convergecast network, which includes a base-station and a plurality of nodes. During operation, the system receives a convergecast tree for the convergecast network. Each node in the convergecast tree is associated with a hop-count to the base-station through a specific branch and each node can generate zero or more packets to transmit. Next, the system initializes a query from the base-station, wherein the query is successively propagated to the nodes through the branches. In response to the query, the system computes distributed-timing-information indicating a packet transmission schedule for the nodes. The system next aggregates the distributed-timing-information associated with the nodes toward the base-station through the branches. The system then forwards the aggregated distributed-timing-information to the plurality of nodes.

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 modulo pattern is used to determine a set of 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: A method of allocating radio resources in a wireless communication system is disclosed. A method of allocating radio resources from a network of a wireless communication system in accordance with a plurality of scheduling modes comprises transmitting first scheduling information to a user equipment to allocate radio resources to the user equipment in accordance with a first scheduling mode, the first scheduling information including a first user equipment identifier, and transmitting second scheduling information to the user equipment to allocate radio resources to the user equipment in accordance with a second scheduling mode, the second scheduling information including a second user equipment identifier.

Abstract: In an embodiment of the method, an estimated use of an uplink resource by prioritized users, if transmission rates for the prioritized users are granted, is determined. The transmission rates are then granted if the estimated use of the uplink resource is less than or equal to an available amount of the uplink resource. Otherwise, the granting of transmission rates of the prioritized users is controlled in order of lower priority prioritized users to higher priority prioritized users until the estimated use of the uplink resource by the prioritized users falls within the available amount of the uplink resource for the channel.

Abstract: The invention concerns a scheduler for sharing a resource comprising a storage unit for storing user deadlines, FIFO storage units, associated each with a first increment value (d(j)) and, for some of them (c(j, i), with a second increment value (d(i)), for storing user-identifiers. The scheduler comprises a management unit selecting one of the FIFO storage units to serve the user designated as next to serve for the resource, recycling his user-identifier, and a recycling decision unit for redirecting, in accordance with conditions, which include a comparison between the second increment value of the FIFO where the user is going and the first increment value from where the user is coming.

Abstract: A Pipelined-based Maximal-sized Matching (PMM) scheduling approach for input-buffered switches relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration may operate in a pipelined manner. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient maximal matching algorithm such as iSLIP and DRRM. PMM maximizes the efficiency of the adopted arbitration scheme by allowing sufficient time for a number of iterations. PMM preserves 100% throughput under uniform traffic and fairness for best-effort traffic.