95 results about "Demand assignment" patented technology

A protocol, method, and apparatus for managing network communications which are particularly well suited for ATM communications across a wireless medium. Contiguous time slots within a frame are allocated to each node having traffic to send. Each node is assured a nominal bandwidth, and excess bandwidth is distributed by demand. The allocation of excess bandwidth can be dependent upon the size of the buffer at each node, as well as the time-criticality of each message. Nodes communicate their requests for allocation by appending such control information to the first of their transmitted packets. The allocation, of each node's transmit and receive time slots, is transmitted to all the nodes at the beginning of each frame. Thereafter, each node need not participate on the network until their allocated time periods, thereby allowing portable devices to enter inactive states to conserve power. The network is operated in a connection mode; connections are established in a relatively non-interfering manner by the use of periodically occurring beacons. Inactive, unconnected, nodes need only monitor the network during these beacon periods, further allowing for power conservation.

A method comprises receiving into a planning tool a representative workload for a consumer. The method further comprises receiving into the planning tool quality of service desires of the consumer which define permitted degraded performance. In certain embodiments, the permitted degraded performance is time-limited wherein demands of the representative workload may exceed a pre-defined utilization constraint for at least one resource servicing the demands for no more than a pre-defined amount of contiguous time. The planning tool determines an allocation of demand of the consumer for each of a plurality of different classes of service (COSs). In certain embodiments, a first COS provides guaranteed resource access for servicing demand allocated thereto, and a second COS provides non-guaranteed resource access for servicing demand allocated thereto. In certain embodiments, the allocation of demand to the different COSs may be determined for both a normal mode and a failure mode of operation.

A method of forecasting, allocating and scheduling in a single or multi-site skills-based contact or call center environment organized into a hierarchy of zero or more business units at a first, upper level, one or more contact types at a second, intermediate level, and one or more management units at a third, lower level. A user creates (a) a set of given contact allocations that define how contacts are distributed from a given business unit to multiple contact types, and (b) a set of given requirement allocations that define how agent requirements are distributed from a contact type to one or more management units. Agent availability by contact type is then predicted to generate agent availability data. Thereafter, forecasted contacts and forecasted agent requirements are allocated based on the given contact and requirement allocations as well as the agent availability data. Preferably, the agent availability data is predicted using a schedule simulator and is characterized by contact type for agents in the same skill group.

A method comprises receiving into a planning tool a representative workload for a consumer. The method further comprises receiving into the planning tool quality of service desires of the consumer which define permitted degraded performance. In certain embodiments, the permitted degraded performance is time-limited wherein demands of the representative workload may exceed a pre-defined utilization constraint for at least one resource servicing the demands for no more than a pre-defined amount of contiguous time. The planning tool determines an allocation of demand of the consumer for each of a plurality of different classes of service (COSs). In certain embodiments, a first COS provides guaranteed resource access for servicing demand allocated thereto, and a second COS provides non-guaranteed resource access for servicing demand allocated thereto. In certain embodiments, the allocation of demand to the different COSs may be determined for both a normal mode and a failure mode of operation.

A protocol for an optical network can control the time at which subscriber optical interfaces of an optical network are permitted to transmit data to a transceiver node. The protocol can prevent collisions of upstream transmissions between the subscriber optical interfaces of a particular subscriber group. With the protocol, a transceiver node close to the subscriber can allocate additional or reduced upstream bandwidth based upon the demand of one or more subscribers. That is, a transceiver node close to a subscriber can monitor (or police) and adjust a subscriber's upstream bandwidth on a subscription basis or on an as-needed basis. The protocol can account for aggregates of packets rather than individual packets. By performing calculation on aggregates of packets, the algorithm can execute less frequently which, in turn, permits its implementation in lower performance and lower cost devices, such as software executing in a general purpose microprocessor.

A communications network includes an optical waveguide to which is connected a head-end station and at lest one optical network unit (ONU). An ONU provides an interface to the communications system for connected user equipment. Data received by an ONU from connected user equipment are stored in a buffer prior to transmission to the head-end station. The head-end station is arranged to implement, in conjunction with the ONUs a demand-assignment protocol for the transfer of data upstream from the ONUs to the head-end station according to which an ONU demands upstream capacity based upon a prediction of its future capacity requirements, calculated using at least one record of earlier granted capacity by the head-end station and at least one measurement of a quantity of data awaiting transmission to the head-end station in the buffer of the ONU.

According to one embodiment, a method comprises receiving into a planning tool a representative workload for a consumer. The method further comprises determining, by the planning tool, an allocation of demand of the consumer for each of a plurality of different classes of service (COSs). According to one embodiment, a method comprises defining a plurality of classes of service (COSs) for use by a scheduler in allocating capacity of a resource pool to a consumer, wherein the COSs each specify a different priority for accessing the capacity of the resource pool. The method further comprises evaluating, by a planning tool, a representative workload of the consumer, and determining, by the planning tool, a partitioning of resource demands of the representative workload between the plurality of COSs.

A system for monitoring a resource in a processing system is disclosed. The processing system includes a display. The system comprises a total resource graphic provided on the display. The total resource graphic represents the total resource. The system includes at least one allocation graphic provided within the total resource graphic. The allocation graphic represents the proportion of the resources allocated to an object. The system and method in accordance with the present invention allows for allocation of a resource across all demands, the relative size of the allocations, and the usage of the resource by the individual demanding operation within a single graphical object. In addition, the object would provide for changes to that allocation by direct manipulation, in addition, the status indicator would provide additional information on demand by the user. The graphical object will provide a single view of the total resource available, the allocation of that resource to individual operations, and the amount of the allocated resource to each operation currently in use. Therefore, in a preferred embodiment, a computer is used to perform the numeric calculations of the allocations and provides a single picture to the user. The user can then derive information regarding the relative importance of any single element. This enables the computer and the user or users to perform the functions for which they are best suited within the operation (computers are best suited to perform calculations; humans users of computers are bested suited to seek patterns and assign relevance to their needs).

A satellite routing protocol is provided in a packet switched mesh network environment (i.e., where user traffic is not routed through a single or central node) wherein all IP planning and routing in the global WAN network is provided through a central database management element and routing information is disseminated separately from the communication traffic via a bandwidth constricted control channel in communication with each node but typically set aside for other purposes (such as conventional DAMA control). Two specific approaches include a link state approach and a distance vector approach. The specific embodiments disclosed for the Satellite Routing Protocol (SRP) system according to the invention allows both fixed and mobile networks to connect directly to each other or to a gateway network via either a terrestrial LAN or a Demand Assigned Multiple Access (DAMA) WAN where there are links that are dynamically assignable.

A wireless communication network includes a plurality of mobile nodes each including a transceiver, a directional antenna, such as a phased array antenna, connected to the transceiver, and a controller connected to the transceiver. The controller schedules a respective semi-permanent time slot for each time frame to establish a communication link with each neighboring mobile node and leaves at least one available time slot in each time frame. The controller also schedules the at least one available time slot to also serve the communication link with a neighboring mobile node based upon link communications demand. The directional antenna is aimed by the controller towards each neighboring mobile node during communication therewith. The controller also coordinates communication with each neighboring mobile node by allocating time slots based upon link communications demand.

The invention discloses a resource allocator in BS and an allocation method thereof, which are used for allocating resources to a plurality of users belonging to the BS. The resource allocator comprises a user classification module, a basic requirement allocation module and a remaining resource allocation module; wherein the user classification module is used for allocating the user in one of a plurality of user sets with prearranged priority sequence according to the channel quality information fed back to the BS by each user; the basic requirement allocation module is used for carrying out resource allocation in each user set sequentially according to the prearranged priority sequence so as to meet the basic data speed requirement of each user; and the remaining resource allocation module is used for determining the remaining resource set and the remaining user set according to the remaining situation of the resource and the remaining requirement situation of the user so as to allocate the remaining resource, thus increasing the system throughput. The method and the structure can find out the optimum user-sub-band pair, meet the basic data speed requirement of each user, increase the system capability and reduce the byte expense of UCD / DCD and UL_MAP / DL_MAP.

A method for transmitting data over an uplink from a terminal TE taken out of a plurality of terminals to a gateway GW switches data packets or packet fragments between a first random access mode and a second demand assigned multiple access DAMA mode. Each terminal TE routes the data packets or the packet fragments over the random access channel RACH or over a demand assigned multiple access channel via a demand assigned multiple access DAMA according to the size of the packets and their class of service, and information items representative of the current transmission resources allocated to the random access channel RACH and to the demand assigned multiple access DAMA mode, the representative information items being notified to the terminals via a return link.

A medium access contention protocol that is highly beneficial in wireless networks and particularly in wireless networks that employ a fixed minimum burst size such as OFDM wireless networks. In one embodiment, a MAC protocol is a demand-assigned protocol that maximizes utilization of the bus medium (the allocated frequency spectrum.) Each data communication device (DCD) in the network communicates with a central access point (AP). Multiple DCDs may request access from the AP in the same request access (RA) burst. Each of the multiple DCDs transmits its access request to the AP within a frequency domain channel in the RA burst that is orthogonal to the frequency domain channels used by the other DCDs requesting access. Each DCD includes channel training information in the access request burst to allow the AP and / or DCD to adapt to rapid variations in channel characteristics.

A medium access contention protocol that is highly beneficial in wireless networks and particularly in wireless networks that employ a fixed minimum burst size such as OFDM wireless networks. In one embodiment, a MAC protocol is a demand-assigned protocol that maximizes utilization of the bus medium (the allocated frequency spectrum.) Each data communication device (DCD) in the network communicates with a central access point (AP). Multiple DCDs may request access from the AP in the same request access (RA) burst. Each of the multiple DCDs transmits its access request to the AP within a frequency domain channel in the RA burst that is orthogonal to the frequency domain channels used by the other DCDs requesting access. Each DCD includes channel training information in the access request burst to allow the AP and / or DCD to adapt to rapid variations in channel characteristics.

The present invention provides a satellite communication network management and intelligent scheduling system which can automatically realize the bandwidth scheduling, the communication capacity management and the network monitoring, and a carrier wave switching method thereof. The satellite communication network management and intelligent scheduling system comprises a network management module, a satellite management module, a modulator-demodulator management module, an antenna management module, a spectrum analyzer module, an intelligent scheduling module, an in-band switching module and a log management module. The satellite communication network management and intelligent scheduling system provided by the present invention is suitable for the situations, such as military, emergency, disaster rescue, etc., establishes a two-party communication link by the satellite communication scheduling, guarantees the communication establishment of the emergency, enables the operation cost of the satellite communication to be reduced according to the priority demand assignment bandwidths of the communication businesses, displays the device information state in a terminal and displays the communication carrier wave situation in a virtual spectrum analyzer, and can monitor and manage conveniently and uniformly.

Upstream information arriving through a gateway from a user terminal in a satellite link subject to propagation delay is efficiently scheduled through a modified Demand Assigned Multiple Access (DAMA) algorithm such that arriving data packets arriving at the software queue at the user terminal are concatenated to form a large frame for transmission to improve efficiency. A piggyback request replacing a conventional DAMA contention request for the succeeding packet is issued to request bandwidth allocation for the succeeding concatenated packet. In a specific embodiment, all packets up to the physical request limit arriving at the user terminal since a prior piggyback request or contention request are concatenated so that all currently known packets (up to that limit) are accounted for by the next piggyback request.

The invention discloses a resource distribution method of hot plug bus interface and a relative device, belonging to the computer bus interface technical field, which resolves the defect of prior hot plug bus interface as insufficient preformed resource. The invention comprises when the hot plug bus interface is plugged into device, according to the demand of the device, distributing resource without affected by preformed resource to confirm the normal operation of the device. The invention is mainly used in PCIE interface, with wide application bus interfaces supporting hot plug.

A satellite telecommunication system includes a plurality of user stations and at least one satellite. A resource manager for the satellite telecommunication system includes a congestion controller that assigns resources to uplinks, a demand assignment device that assigns resources to uplinks, and, for each satellite, a central entity that includes a subsystem of the congestion controller adapted to receive requests sent by user stations using the satellite, each request expressing the bit rate necessary for a group of connections supported by a user station and by the same downlink of the satellite, and to determine the bit rate authorized for the group of connections. It further includes, for each satellite, a subsystem of the demand assignment device adapted to allocate resources to an uplink, at each user station, as a function of the bit rates authorized by the congestion controller subsystem and globally for all connections supported by the user station.

Described herein are computer-implemented reverse auction systems, having a reverse auction environment wherein sellers compete to obtain business from a buyer, featuring improvements comprising an assured demand allocation system with guaranteed buyer funds and automated dynamic item and price allocation.

A base station performs bandwidth assignment for each terminal station or each wireless link even when the base station does not receive a bandwidth request in random access from the terminal station in the demand assignment period present in a specific period in which a transmission frequency of data to transmit is high, the specific period being specified for each terminal station or each wireless link between the terminal station and the base station, and the terminal station transmits at least one of bandwidth request information and the data to transmit in a bandwidth assigned by the base station.

The invention relates a method for monitoring a memory in real time by an embedded system, which comprises the following steps: (1) executing programs; (2) allocating a memory block according to the requirements of the programs; (3) respectively collocating data breakpoints at an initial address and an end address of the memory block; (4) providing the initial address and the end address to the programs and storing the memory block; and (5) triggering the data breakpoints when the stored memory block touches one of the initial address and the end address. The invention can position the mistake of program memory violation rapidly, lighten the debugging difficulty to the memory corruption problem for a user, accelerate the software development and removal speed, shorten the development cycle, save the developed labor cost and prompt the software quality.

Upstream information arriving through a user terminal in a satellite link is efficiently scheduled through a modified Demand Assigned Multiple Access (DAMA) algorithm such that data packets arriving at the user terminal are concatenated to form a larger frame for transmission and the concatenated packet is held in a first queue disposed ahead of a second queue, where the data in the second queue cannot be modified (typically a hardware queue), sufficient to allow the second queue to be emptied. In a specific embodiment, all packets arriving at the user terminal since a prior piggyback request are concatenated so that all currently known packets (up to a preselected limit) are accounted for by each succeeding piggyback request. Since it is desirable to concatenate all packets that arrive at the user terminal since the last piggyback request, the piggyback request according to the invention covers all currently known packets (up to the preselected limit) in the user terminal. The held-back packets are released or dumped to the second queue by a trigger operative according to a map, the map being a grant allocation schedule. This mechanism handles instances where the second queue is not able to handle all known packets.

In a data transmitting and receiving method of a demand assignment type, a master device schedules an occupancy band of a fixed size for requesting a band to the master device by slave devices, with respect to a specific number of slave devices for each cycle, and the slave device waits for assignment of the occupancy band of the fixed size based on the schedule and performs message transmission of requesting a band for data transmission to the master device, thereby suppressing an influence of pressure on the data transmission band and preventing line utilization efficiency from decreasing while avoiding signal collision on a Random Channel.

The invention discloses a search and rescue network based on an unmanned equipment swarm intelligence algorithm and a scheduling method thereof. The invention provides a complete maritime affair multi-agent joint search and rescue network based on an unmanned equipment swarm intelligence algorithm and a scheduling method. According to the invention, a hierarchical control network system composed of multiple intelligent agents is established. Based on edge calculation and distributed control thought, different tasks such as position determination, path planning and independent search are allocated to various distributed group control agents for calculation according to requirements. The independent calculation decision-making capability of the intelligent algorithm and the intelligent agentis fully utilized. A central control intelligent agent and a group control intelligent agent only communicate with a small amount of necessary information. In the dynamic change process of the network topological structure, data can be intelligently dispatched through the particle swarm optimization according to the forwarding strategy, the network forwarding requirement is met, and the inventionis suitable for offshore low-bandwidth resources and low QoS.

A computational network system that permits service a group of technicians access to the manufacturer network to provide their work capacity and availability for a specific area. A customer contacts the manufacturer via the computational network system, requesting a service call. Service call request processing results in assigning a service request / demand to a technician based on their qualifications, availability, and proximity. When a service technician is assigned, their availability is decremented. Cancellation of a service call yields an increment in the affected service provider's availability. This information is stored in a in an on-line database residing in the network system. Updates are dynamically reflected as they occur resulting in automated schedule administration of a customer's service requests / demands.

A time division multiple access (TDMA) waveform for controlling a MIL-STD-188-183 compliant demand assignment multiple access (DAMA) satellite communication network contains a short duration and minimal data content, time-hack, that is repeatedly transmitted by a supervisory control radio, so that the time hack occurs twice within a DAMA frame, ensuring that every radio can acquire frame synchronization, irrespective of overlap in receipt of one of the time-hacks with a voice / data channel transmission by that radio. The time-hack also identifies which one among a list of different frame formats stored in the radio is to be employed.

A demand assignment method for a communication network including a hub and a plurality of user nodes includes adding a demand field to each data burst from a user node. Further, the method includes transmitting a first and second frame with first and second burst time plans from the hub to each user node, and transmitting a first and second respective data burst and demand field from each of the user nodes to the hub according to the first and second control information. The first data burst from each user node arrives simultaneously at the hub, and the second data burst from each user node arrives simultaneously at the hub. Further, the second data burst from each user node arrives immediately following the arrival of the first data burst from each user node.