Abstract: A UMTS (Universal Mobile Telecommunications System) core network supports the negotiation of variable quality of service (QoS). A QoS information element (IE) is defined that supports downgradeable QoS requirements by allowing multiple traffic classes to be specified in a priority order. Similarly, a QoS information element (IE) is defined that supports upgradeable QoS requirements.

Abstract: A wireless communication system and method is disclosed. The system and method includes at least one base station controller setting resource allocation priority and producing a carrier loading information request in response to a request made by a mobile unit; a plurality of base stations coupled to at least one base station controller, each of the plurality of base stations operates on a plurality of carriers, at least one candidate base station transceiver of the plurality of base stations receiving the carrier loading information request, determining its carrier loading information, and responding with a carrier loading information response; and the at least one base station controller operating to assign the mobile unit to at least one candidate carrier within the one responding candidate base station of the plurality of base stations based upon both set resource allocation priority and received carrier loading information.

Abstract: Method and system for an adapter coupled to a network via a network link is provided. The method includes using a first selectable mode and a second selectable mode to provide quality of service to a plurality of applications executed by one or more computing system. In the first selectable mode, the quality of service is based on allocating bandwidth of the network link and dynamically adjusting an initial priority assigned to a plurality of queues, each queue being associated with an application from among a plurality of applications. In the second selectable mode, the quality of service is based on a user assigning a priority to each of the plurality of applications and the adapter determines a number of input/output (I/O) requests it needs to process within a duration and then transfers information based on the determined number of I/O requests and the assigned priority.

Abstract: Methods for performing packet classification. In one embodiment, packets are classified using a rule bit vector optimization scheme, wherein original rule bit vectors in recursive flow classification (RFC) chunks are optimized by removing useless bits that have no effect on the ultimate rule identified by an associated RFC lookup process. The unique optimized rule bit vectors for associated chunks are then cross-producted to produce an optimized downstream chunk. In another embodiment, a rule database splitting scheme is employed. Under this technique, split criteria is defined to split a rule database, such as splitting based on a particular field value or range. A respective set of downstream chunks is then generated for each partition, beginning with the chunks in a split phase. The applicable rule bit vectors for the chunks associated with a common group and partition are identified, and then unique applicable rule bit vectors for those chunks are cross-producted to produce downstream chunks.

Abstract: A function block containing a process-cache tag for storing process-cache tags in the pre-stage of a process cache and an FIFO queue for each tag entry are installed as a traffic controller. The traffic controller stacks packet groups, identified as being from the same flow, in the same FIFO queue. Each FIFO queue records the logged state of the corresponding process queues, and when a packet arrives at an FIFO queue entry in a non-registered state, only its first packet is conveyed to a function block for processing the process-cache misses, and then it awaits registration in a process cache. Access to the process cache from the FIFO queue is implemented at the time that registration of the second and subsequent packets in the process cache are completed. This allows packets other than the first packet in the flow to always access the process cache for a cache hit.

Abstract: The disclosed technology provides systems and methods for accommodating a diversity of services (e.g., telephone, video broadcasting, email, etc.) using a fixed connection of a certain service type. A method and system of communicating data using a fixed connection, including, based on at least two service data units (SDUs), associating a priority and a channel identifier with the at least two SDUs, iteratively (i) selecting one of the at least two SDUs based on priority to provide a selected SDU, and, (ii) forming at least one data packet, the at least one data packet including (a) data associated with the selected SDU, and, (b) the channel identifier associated with the selected SDU; and, transmitting the formed at least one data packet using the fixed connection.

Abstract: An apparatus and method for allocating a bandwidth for up-stream data transmission to a plurality of Optical Network Units (ONUs) in an Ethernet Passive Optical Access Network (EPON) in which the ONUs are connected to a single Optical Line Terminal (OLT) are disclosed.

Abstract: A network system includes a first device and a second device separated by a network having asymmetric routes in which traffic forwarded in a first direction from the first device to the second device may travel a different route than traffic forwarded in a second direction from the second device to the first device. At least three intermediate processing devices are located between the first device and the second device, wherein at least two of the intermediate processing devices are located along different asymmetric routes. The intermediate processing devices intercept a communication flow between the first device and the second device, and encapsulate the communication flow within network tunnels so that communications associated with the communication flow in the first direction and the second direction are forwarded between a same set of at least two of the intermediate processing devices.

Abstract: A method of arbitrating group calls in a digital mobile radio system without need of a central component. In general terms the base station that are serving mobile units in a call each announce the nature of the signals that they are receiving. The stations then each compare the signals and decide which signal will be broadcast to the mobile units. The signals are preferably transmitted between base stations via a packet network using IP multicast.

Abstract: A method, computer program product, and system are provided for prioritizing data in a network system. For example, an embodiment of the method may include allocating network system resources to high-priority data with an identifier and dynamically changing a threshold level from a pre-assigned, minimum level in the allocation of network resources based on data traffic with the identifier received by a communication device in the network system. In allocating network system resources, the data with the identifier may be filtered into a separate data stream from data without the identifier. For instance, the data stream containing data with the high-priority identifier may be directed to a high-priority buffer that has a minimum allocation of network resources dedicated to the buffer to ensure unencumbered data transfer between the communication device and a destination within the network system.

Abstract: A system comprises a plurality of wireless stations for exchanging data over a wireless network and a coordinator station such an access point. The coordinator station receives a request for a traffic specification from one of the wireless stations. The traffic request comprises a traffic parameter (202) representative of the traffic specification. The coordinator station runs an acceptance algorithm (226) to determine if the request can be met based on the parameter and a current traffic schedule based on other previously granted traffic requests (228). If the new request can be accommodated, a traffic scheduler thereafter generates a new traffic schedule (232, 234) using the Cyclic Executive Model (230).

Abstract: A system for implementing a communication transports in a configuration that may utilize control plane resources for the conveyance of data. A communication protocol may be originally designed to support planned data conveyance at a data plane. This strategy may improve quality of service for the transport, but may impact the execution speed of communication due to the required overhead involved in scheduling. In view of this limitation, messages that are sensitive to delay may be negatively impacted by scheduling steps occurring in mediums such as described above. Execution speed may be increased by routing certain payloads to the control plane for transmission in a beacon signal, which avoids the overhead inherent in the data plane.

Abstract: A MAC unit processes the flow of data a first processor and a physical-layer control unit of a network component. The first processor processes the data flow between a higher protocol-layer unit and the MAC and assigns connection identifiers to each outgoing MAC protocol-data unit. The MAC unit includes a connection port adapted to couple to the first processor and a second processor that receives outgoing MAC protocol-data units generated by the first processor and generates outgoing FEC blocks therefrom for outputting to the input port of the physical-layer control unit. The second processor having an output port to provide outgoing FEC blocks to the physical-layer control unit and an input port to receive incoming FEC blocks from the physical-layer control unit. The second processor is adapted to generate incoming MAC protocol-data units from incoming FEC blocks received at its input port and to output them on the connection port.

Abstract: A technique for improving utilization of a data link coupled to a network. Scores are generated for one or more data flows that transfer onto the network via the data link. The scores are kept in a “scorecard” that represents a pool of data flows that are eligible to transfer data onto the data link when the data link becomes idle. Each score represents a rating of a particular data flow's eligibility to transfer data onto the data link when it becomes idle. A check is performed to determine if the data link is idle, and, if so, data associated with the highest scoring data flow are transferred onto the data link.

Abstract: Systems, methodologies, media, and other embodiments associated with prioritizing network traffic are described. One exemplary method embodiment includes receiving a notice from a computer component to prioritize network traffic associated with a selected service. Network communications are inspected to identify priority network traffic associated with the selected service. Priority settings can then be dynamically reconfigured in the priority network traffic.

Abstract: Techniques for adaptive QoS include selecting, based on one or more QoS criteria corresponding to a client, one or more given data items suitable for sending to the client in response to a query from the client. The one or more given data items are selected from a set of data items. One or more statistics are associated with the one or more data items. The one or more statistics are useable to modify which data items are included in the set of data items. The statistics may be used by removing unpopular data items, as determined by the statistics, from the set of data items in the communication system. Additionally, data items exceeding the one or more QoS criteria can be transcoded to create new data items meeting the one or more QoS criteria, and the new data items can be added to the set of data items in the communication system. Thus, the set of data items can be changed depending on current demand by users for particular data items.

Abstract: An in-line network simulator is provided that disrupts packets traveling through it to simulate network conditions. According to one embodiment, a method comprises receiving, at an in-line network simulator, packets sent from a source node to a destination node. The in-line network simulator classifies the received packets into respective ones of a plurality of different classifications, and disrupts the received packets based on corresponding disruption characteristics defined for their respective classifications. Such disrupting of the packets may include selectively performing at least one of delaying, dropping, and reordering of the received packets.

Abstract: An information distribution system and method capable of averaging a traffic load over time and effectively utilizing communication facilities, wherein a terminal station 30 transmits to a contents server 10 a distribution request for desired information including information of time limit of distribution, and the contents server 10 receives the distribution request, estimates a time band where the traffic load is small in the communications system in the period until the time limit of distribution, pages the terminal station again at that period of time, and, if the terminal station is in a state able to receive the information content, transmits the requested information content to the terminal station 30 through a network node.

Abstract: A shared memory stores packets for a packet processor. The shared memory is arranged into banks that are word-interleaved. All banks may be accessed in parallel during each time-slot by different requesters. A staggered round-robin arbiter connects requesters to banks in a parallel fashion. Requestor inputs to the arbiter are staggered to allow access to different banks in a sequential order over successive time-slots. Multi-processor tribes have many processors that generate random requests to the shared memory. A slot scheduler arranges these random requests into a stream of sequential requests that are synchronized to the staggered round-robin arbiter. A packet interface requestor stores incoming packets from an external network into the shared memory. The packet's offset within pages of the shared memory is determined by the first available bank that the packet can be written to, eliminating delays in storing incoming packets and spreading storage of frequently-accessed fields.

Abstract: A method and apparatus for bundling packets together for transmission in a Voice over IP communications network based on packet location within a talk spurt. Illustratively, all frames other than the first and last frames of a talk spurt may be advantageously bundled up to a predetermined maximum bundle size. This results from the recognition that the first and last packets of the talk spurt are the packets that will most directly affect the conversational delay. Therefore, other packets can be advantageously considered to be “non-critical” (with respect to conversational delay), and thus, may be bundled together with one or more other packets. In this manner, bandwidth may be advantageously reduced without negatively impacting the perceived conversational delay.

Abstract: A method for selecting a transport format combination used in a wireless communication network for multiplexing data between logical channels and transport channels. After receiving a configuration table with logical and transport channel information, a transport format selection mechanism prioritizes each transport channel and sorts the transport formats according to priority and minimum buffer occupancy. The transport format selection mechanism selects a transport format combination by comparing the logical channel size with the minimum and maximum buffer occupancy of each sorted transport format associated with a transport channel that are also associated with the logical channel in such a manner as to not exceed logical channel size restrictions so that a transport format combination can be selected having a transport format of the most compatible size.

Abstract: Distributed distribution of patches and other updates is disclosed. A request for an update is received. In some embodiments it is determined whether the source of the request will serve as a redistribution point. If the source will serve as a redistribution point, a redistribution identifier associated with the source is stored. In some embodiments it is determined whether the update will be provided to the source of the request directly, e.g., from a (more) primary source of the update, such as a source that received the request, or indirectly, e.g., from a secondary source such as a host to which a (more) primary source provided the update previously. The request is serviced either directly or indirectly, in accordance with the determination.

Abstract: The present invention provides a method of scheduling packet in a wireless telecommunication system, in which the user packet queues to be transmitted are divided into the user packet queues with packet loss and the user packet queues without packet loss; for the user packet queues with packet loss, if a real time loss ratio of packet for the user exceeds a predetermined loss ratio threshold of packet, terminate a connection to the user; if the real time loss ratio of packet for the user does not exceed the predetermined loss ratio threshold of packet, schedule the user packet queues according to a volume of the loss ratio of packet; for the user packet queues without packet loss, schedule according to packet lengths, channel quality states, time delays and time delay jitters.

Abstract: The present invention relates to a method in a radio communication system providing packet data services. A radio communication system providing packet data services and a packet data scheduler (PS) are also disclosed. In accordance with the method capacity is requested for a packet data bearer, whereafter capacity is allocated for the packet data bearer based on a first timing scheme. The allocated capacity may be modified based on a second timing scheme. The packet data scheduler (PS) comprises two timers (T1, T2) fore implementing the two different timing schemes.

Abstract: Disclosed is an apparatus and method for receiving broadcasting data in a digital video broadcasting receiver using Digital Video Broadcasting-Handhelds (DVB-H), the method including detecting section headers carrying broadcasting service information from a received Transport Stream (TS) packet and extracting delta-t information from the section headers, counting the number of extracted delta-t information, comparing the counted number of delta-t information with a predetermined delta-t lock number, and when the counted number is less than the delta-t lock number, counting the start time of a next burst duration based on the delta-t information.

Abstract: A method of multiplexing a plurality of data flows into a single output using hierarchical gating operations instead of queues is disclosed. In the preferred embodiment, the hierarchical multiplexing method comprises sequentially processing a packet at each of a plurality of hierarchical levels by characterizing the flow at each hierarchical level and either passing or discarding the packet. The decision whether to pass or discard a packet is generally made for each packet at one or more hierarchical levels based on traffic parameters and the state of the system such as congestion. In the preferred embodiment, a Three Color Marker algorithm is used to characterize the flow and mark packets subjecting to the discard decision. The invention may be used by a router or multi-layer switch to process multiple data flows in a hierarchical fashion without hierarchical queues, thereby reducing processing and memory requirements.

Abstract: In general, in one aspect, the disclosure describes a switching device that includes a plurality of ingress ports to receive data from external sources and a plurality of egress ports to transmit data to external destinations. The switching device also includes a plurality of queues to store data waiting to be transmitted from a particular ingress port to a particular egress port. A request generator generates requests for permission to transmit data for the queues. A request indicates a cumulative amount of data contained in a respective queue. A switching matrix provides selective connectivity between the ingress ports and the egress ports. The switching device further includes a scheduler to receive the requests, generate grants based thereon, and configure the switching matrix. The scheduler incorporates a mechanism to periodically monitor its operating efficiency and perturb its internal state when its efficiency is below a certain desired level.

Abstract: Techniques for regulating streams in a Peer-to-Peer (P2P) network are provided. By establishing a priority of a stream, certain users may have some level of assurance that their stream will be received by other peers. The priority may be established based on a variety of parameters including, for example, an identification of the user, a communications channel used for a multicast session, and/or a role of the user.

Abstract: A network switching device is provided for enabling priority control of packets, enhancing the using efficiency of a buffer for storing a received packet, and reducing the costs of components. The received packet is stored in the corresponding buffer with information of the packet under the control of a buffer controller. Further, a priority determining circuit is also provided for determining a priority class and a destination of the received packet. The buffer controller creates a transmit queue to which the packets of priority classes are to be registered in each buffer. When writing the received packet in the buffer, the buffer controller is served to reserve the received packet for transmission next to the last registered one of the packets of the same priority class registered in the corresponding transmit queue based on the determination of the priority determining circuit.

Abstract: A ‘smart’ sub-channel hopping control mechanism executes one or more sub-channel selection discriminators to enable the communications controller of a spectral reuse transceiver to delineate on which of a plurality sub-channels the spectral reuse transceiver may transmit, so as to substantially reduce the likelihood of triggering squelch circuits of silent radios of primary (licensed) channel users.

Abstract: Prioritized transmission of data from a mobile device, where the mobile device includes the ability to transmit data using more than one transmission medium, includes generating data packets from sensor data. The data packet is then assigned a priority level based on the sensor data and various factors relating to the transmission mediums. The priority level may be assigned based on the transmission availability, bandwidth and cost of using the medium. The data packets, based on the assigned priority level, are then stored in a corresponding priority buffer associated with a transmission device using one of the transmission mediums. When available, the transmission device may then readily transmit the data packet from the priority buffer. Therefore, the data is transferred in a prioritized order based, in part, on the transmission medium and factors relating to the medium, as well as the sensor data being transmitted.

Abstract: A call admission control technique allowing flexible and reliable call admissions at an ATM switch in the case of an ATM network including both QoS-specified and QoS-unspecified virtual connections is disclosed. In the case where a QoS (Quality of Service) specified connection request occurs, an estimated bandwidth is calculated which is to be assigned to an existing QoS-unspecified traffic on the link associated with the QoS-specified connection request. A call control processor of the ATM switch determines whether the QoS-specified connection request is accepted, depending on whether a requested bandwidth is smaller than an available bandwidth that is obtained by subtracting an assigned bandwidth and the estimated bandwidth from a full bandwidth of the link.

Abstract: Load balanced transport of best efforts traffic together with delay-bounded traffic over a multilink bundle combines fragmentation and fragment distribution for best efforts packets with per-flow balancing for delay-bounded traffic. In the preferred embodiments, the best efforts packets receive Multilink Protocol treatment, including fragmentation and addition of sequence headers. Fragments of packets for one such communication go over the various links within the bundle, as appropriate for load balancing on the links. For each delay-bounded flow, such as for a VOIP service, the sending node hashes the packet header data and applies all packets for the flow to one of the links, assigned as a function of the hash value. Different flow headers produce different hash results; therefore the node sends different flows over the different links in a substantially balanced manner.

Abstract: A wireless LAN system if formed by a base station, mobile stations and a controller. The controller receives a frame over wireless media, and a frame analyzer analyzes the received frame. A determination section determines whether or not the frame received at a predicted time based on the rule of frame for a service on a layer higher than a media access control layer is an intended frame based on results from the frame analyzer. A frame transmitter sends out a frame containing a field specifying the duration of the frame to be transmitted to a destination station that should be given the first priority to transmit on a wireless uplink and downlink, based on the determination that the frame received is not in conformity with the rule of frame.

Abstract: Within the framework of a wireless local area network, the sending of the multipoint transmission streams is not made reliable by an acknowledgment of receipt mechanism. This reliability may be improved by the sending in point-to-point mode of the packets belonging to a multipoint transmission stream. In the case of a digital service consisting of several streams of different priorities, it is possible to send only some of these streams in point-to-point mode while the other streams remain in multipoint. A gateway between the local area network and the exterior may be tasked with this selective transformation of the mode of transmission of the streams received.

Abstract: The present invention relates to allocating the use of optical light-trails. Optical light-trails enable a plurality of nodes included in a light-trail to share the use of an optical wavelength to transmit traffic between the nodes included in the light-trail. A method for allocating the use of an optical light-trail includes calculating a bid at each of one or more nodes included in the light-trail. Each of the nodes calculates a bid with consideration for the criticality of the node's need to transmit particular traffic on the light-trail. The method also includes transmitting the calculated bids from one or more of the nodes to an arbiter node. The arbiter node determines the maximum received bid, determines whether to allocate the use of the light-trail to the node associated with the maximum bid, and then communicates one or more control messages to the nodes that transmitted the bids indicating to which node use of the light-trail is allocated.

Abstract: A system for deriving a quality of service indicator for a packet is described. A register holds a control element. A first resource derives a first candidate quality of service indicator for the packet. A second resource derives a second candidate quality of service indicator for the packet responsive at least in part to the control element held in the register. Resolution logic derives the quality of service indicator for the packet from the first and second candidate quality of service indicators.

Abstract: A method and apparatus for allocating access to a scarce resource. A load of each flow on the resource is calculated. The aggregate load is compared to a maximum steady state load. A drop policy is established responsive to the comparison. The drop policy is applied to the flows at an input interface of the device.

Abstract: Disclosed herein is a packet transmission method wherein received packets are sorted into prioritized QoS packets and general packets other than the prioritized QoS packets, the sorted prioritized QoS packets are accumulated, the accumulated QoS packets are capsulated and then transmitted as a capsulated packet, and the capsulated packet is transmitted in matching with the period of a CODEC. In the preferred embodiment, there is provided a wireless LAN system comprising a base station and at least one wireless LAN terminal connected to said base station via a wireless LAN; and a packet transmission system for transmitting a packet between said base station and said at least one wireless LAN terminal via the wireless LAN, the packet transmission system. In the packet transmission system, a packet sorter sorts received packet into prioritized packets and packets other than the prioritized packets. A FIFO queue buffer (QoS queue) accumulates the sorted prioritized packets.

Abstract: The embodiments provide an arbiter in a microprocessor that can handle requests to access a shared resource from function units with different priorities without starving the access opportunities of requests from function units with low priority. In one embodiment, a microprocessor is provided. The microprocessor includes a shared resource and a plurality of requesting entities accessing the shared resource. Each of the plurality of requesting entities has a priority value and requests from the each of the plurality of requesting entities are assigned the priority value. The plurality of requesting entities are function units of the microprocessor. The microprocessor also includes a priority-encode arbiter with an adjustable ring counter disposed between the shared resource and the plurality of requesting entities to control the access requests of the plurality of requesting entities to the shared resource.

Abstract: A method of processing a request for a connection through a multi-service gateway and a multi-service gateway for performing the method. The method includes allocating resources from a resource pool as a function of a usage level of the pool, as a function of a priority level of the connection request and as a function of an occupancy threshold associated with the pool. In particular, if the usage level of the resources in the pool is below the occupancy threshold, processing resources are allocated to satisfy the connection request. However, if the usage level of the resources in the pool is not below the occupancy threshold, resources may or may not be allocated to satisfy the connection request, depending on the priority level of the connection request.

Abstract: JPEG-2000 data is formatted into RTP packets for transmission through the Internet. A priority field is provided in the format, and a value indicating the importance of a code stream included in a packet is stored therein. A type field indicates a payload type of a JPEG-2000 code stream. An mh_id field is provided as an identifier of a main header of the JPEG-2000 code stream and indicates a change in the main header. An mh_length field indicates the length of the main header and a fragment offset field stores the number of offset bytes from the start of an image of the packet.

Abstract: In a network of a variable length packet system, a bps calculator colors an inputted packet based on a peak bandwidth or a committed bandwidth of a data bit number per unit time for every flow and a packet length of the inputted packet, a pps calculator colors the inputted packet based on a peak bandwidth or a committed bandwidth of a packet number per unit time for every flow and a packet number of the inputted packet, and one of a color of packet to be discarded, a color of packet to be passed and a color of packet to be discarded with a probability, within the colors obtained by colorings at both calculators is determined by a color selector.

Abstract: The present invention is a system and a method which enables implementing a scalable, carrier class bundling multiplexed data communication on low rate links. The proposed system and method, which comply with the data transference specifications of both CBR and statistical traffic, offer a data bundling solution with minimal overhead that may operate on different types of connections, using links with diverse capacities. The disclosed bundling mechanism is based on a two level mechanism: the lower level is composed of any number of superlinks, each gathering 8 communication links. The upper level is composed of two bundlers—for CBR data and for statistical traffic—each connected to all the superlinks. The header of each dataframe includes all the required information. This guarantees that the receiving side has full status information for all the links suffice that only one link is received without a CRC error.

Abstract: A linecard architecture for high speed routing of data in a communications device. This architecture provides low latency routing based on packet priority: packet routing and processing occurs at line rate (wire speed) for most operations. A packet data stream is input to the inbound receiver, which uses a small packet FIFO to rapidly accumulate packet bytes. Once the header portion of the packet is received, the header alone is used to perform a high speed routing lookup and packet header modification. The queue manager then uses the class of service information in the packet header to enqueue the packet according to the required priority. Enqueued packets are buffered in a large memory space holding multiple packets prior to transmission across the device's switch fabric to the outbound linecard. On arrival at the outbound linecard, the packet is enqueued in the outbound transmitter portion of the linecard architecture.

Abstract: A computer implemented method, apparatus, and computer usable program code to receive data from a source at a plurality of gateways for distribution using a selected priority. The data is transmitted from the plurality of gateways to a plurality of receivers using the selected priority. Every gateway in the plurality of gateways has an adaptive bandwidth control process and a respective set of parameters for controlling the adaptive bandwidth control process for sending the data at the selected priority. Transmission of the data from each gateway for the selected priority has a different impact on other traffic at different gateways in the plurality gateways for the selected priority when different values are set for the set of parameters for the different gateways.

Abstract: Method for transmitting high-priority packets in an IP transmission network based upon the Internet Protocol (IP) wherein low-priority packets or fragments of packets are transmitted between a sender and a receiver and at least a high-priority packet can be transmitted from the sender to the receiver by pre-emption of a low-priority packet or a fragment of packet. the method comprises in the sender, the steps of determining whether a low-priority packet or fragment of packet is being transmitted from the sender to the receiver when a high-priority packet has to be transmitted, setting to 1 a reserved bit within the IP header of the high-priority packet used as a pre-emption indicator if a low-priority packet or fragment of packet is currently transmitted, transmitting the high-priority packet with the pre-emption indicator set to 1 from the sender to the receiver, and resuming the transmission of the low-priority packet or fragment of packet at the end of transmission of the high-priority packet.

Abstract: A method and system are disclosed for modeling non-deterministic queues for efficient model checking. In this method and system, a multitude of messages are held in a plurality of queues, and these messages having n priorities. The method comprises the steps of providing (n+1) queues, including a first queue, and n priority queues; passing said messages from a source to the first queue; passing each of said messages from the first queue to one of said n priority queues based on the priority of the message; and passing each of said messages from the n priority queues to a destination based on the priority of the message. One or more non-deterministic waits are introduced into one or more of the passing steps to simplify passing the messages into or out of the n priority queues.

Abstract: An access point through which a wireless device attaches to a wireless network determines the access privileges that will be accorded to the device based on a criteria set, such as the ID and physical location of the device requesting network access, the access point through which the device is connected to the network and user credentials. The location of the device is determined by a location determination system using the signal strength of the device signal. The location information and ID information is provided to an access server that uses the criteria set to retrieve access privileges from a privilege database. The retrieved access privileges are then applied to the wireless device by means of the access point and other devices in the wireless network.

Abstract: A method of prioritizing messages on a Local Area Network comprises receiving a digitized incoming message, comparing a message signature of the incoming message with a stored priority message signature, passing non-priority messages to a standard Ethernet protocol stack for processing, storing priority messages temporarily, preventing priority messages from being processed in the standard Ethernet protocol stack, and handling priority messages using a simplified protocol stack designed to process a specific data packet type. This method may be performed by an Application Specific Integrated Circuit (ASIC) inserted between an Ethernet PHY layer and Ethernet MAC layer on a Network Interface Card of a host device. In particular, automated machinery control systems using the Ethernet protocol for networking are intended to benefit from the prioritizing method and implementation.