An IP flow classification system is used in a wireless telecommunications system. The IP flow classification system groups IP flows in a packet-centric wireless point to multi-point telecommunications system. The classification system includes: a wireless base station coupled to a first data network; one or more host workstations coupled to the first data network; one or more subscriber customer premise equipment (CPE) stations in wireless communication with the wireless base station over a shared bandwidth using a packet-centric protocol; and one or more subscriber workstations coupled to each of the subscriber CPE stations over a second network; a resource allocation device optimizes end-user quality of service (QoS) and allocates shared bandwidth among the subscriber CPE stations; an analyzing and scheduling device analyzes and schedules internet protocol (IP) flow over the shared wireless bandwidth. The analyzing device includes the above IP flow classifier that classifies the IP flow. The classifier can include a device for associating a packet of an existing IP flow with the IP flow. The classifier can include a QoS grouping device that groups a packet of a new IP flow into a QoS class grouping. The QoS grouping device can include a determining device that determines and takes into account QoS class groupings for the IP flow. The QoS grouping device can include an optional differentiated services (Diff Serv) device that takes into account an optional Diff Servs field priority marking for the IP flow.

IP-flow classification in a wireless point to multi-point (PTMP) transmission system

The present invention can be used to facilitate the integration of wireless capability provided by wireless access points into an enterprise computer network. A gateway server is interposed between wireless access points and protected networks to provide security and integration functions, for example, authentication, access control, link privacy, link integrity, and bandwidth metering in various embodiments. Use of such a gateway server allows substantial control to be gained over network access even with the use of relatively simple access points. In general, such a gateway server receives a request to access the protected network. An authentication subsystem of the gateway server authenticates the user, preferably by accessing an external authentication server and returns a role to the authenticated user. An access controller in the gateway server provides differential access to the protected network based on the user's assigned role. A multiple gateway servers can be connected together to form a mesh network architecture.

Method and system for managing data traffic in wireless networks

A packet-centric wireless system includes: a wireless base station communicating via a transmission control protocol/internet protocol (TCP/IP) to a first data network; one or more host workstations communicating via TCP/IP to the first data network; one or more subscriber customer premise equipment (CPE) stations coupled with the wireless base station over a shared bandwidth via TCP/IP over a wireless medium; and one or more subscriber workstations coupled via TCP/IP to each of the subscriber CPE stations over a second network. The system can allocate shared bandwidth among the subscriber CPE stations to optimize end-user quality of service (QoS). The first data network includes at least one of: a wireline network; a wireless network; a local area network (LAN); and a wide area network (WAN). The second network includes at least one of: a wireline network; a wireless network; a local area network (LAN); and a wide area network (WAN).

Transmission control protocol/internet protocol (tcp/ip) packet-centric wireless point to multi-point (ptmp) transmission system architecture

In a method for admitting new connections based on measured quantities in a wireless communications network having a base station and remote hosts, the base station measures and computes performance metrics to determine whether admission of the new connection could cause a failure to meet the Quality of Service (QoS) promised to already admitted connections. Only if the QoS can be maintained is the new connection is admitted. In one embodiment, the base station may optionally disconnect one or more already admitted lower priority connections if doing so will allow a higher priority new connection to be admitted without loss of QoS to the remaining already admitted connections. In one embodiment, each connection request specifies the average bit rate required and a traffic burstiness factor, the base station measures the number of bytes sent by each connection for a certain period of time and a burstiness factor for the traffic in either direction. The base station computes an equivalent number of admitted connections and determines whether the new equivalent number of admitted connections, after admission of the new connection, would exceed a threshold. The measured quantities can be various metrics related to interference. In one embodiment, uplink Frame Error Rate (FER), an average uplink bit rate, a burstiness factor of the uplink trafc, and a packet loss rate are measured at the base station. Downlink FER is similarly measured at each already admitted remote host and is sent to the base station. Alternatively, the average downlink bit rate, burstiness factor of downlink traffic, and packet loss rate may also be sent from each remote host to the base station. Considering the effect of the average rate and packet loss rate requested by a new connection and the computed equivalent bandwidth, the base station decides whether to admit the new connection based on whether the QoS of all admitted connections can be maintained.

Method for admitting new connections based on usage priorities in a multiple access system for communications networks

An ad hoc network organizes itself to provide communications without need for an a priori designated central control mechanism or base stations Such self-organization is challenging in a multihop ad hoc network having member nodes that are highly mobile and widely distributed A Synchronous Collision Resolution (SCR) protocol and a Node State Routing (NSR) protocol are well suited to provide efficient ad hoc network organization SCR is an access protocol that achieves high capacity collision free access using a signaling approach that creates a random cellular-like network after each signaling period NSR is a routing protocol that uses the dissemination of node states to predict link availability and to assign metrics to those links for the creation of optimized routes In use, the present invention provides quality of service and supports energy conservation for the mobile nodes

An access and routing protocol for ad hoc networks using synchronous collision resolution and node state dissemination

In a method for conflict resolution among remote hosts in a wireless network where remotes make bandwidth requests to the base station via uplink frames partitioned into one or more reservation minislots, a collision occurs where two or more remotes have transmitted a request in the same minislot. Each remote is characterized by a stack level, and only remotes with a stack level equal to 0 are permitted to transmit access request packets. Newly active remotes are allowed to join in with those remotes already having stack level 0 during any particular conflict resolution period by setting their stack levels to 0 and entering the request state. If the stack level of a remote is 0, the remote randomly picks a minislot for transmission of an access request. If the outcome is SUCCESS, and the queue at the remote is empty, the remote transmits the current packet after receiving a transmit permit and exits the request state. If the queue is not empty, then, after receiving a permit, the current packet is transmitted with a piggybacked reservation request for transmission of the next packet in the queue, continuing until the queue is empty. If the outcome of the reservation request was not SUCCESS, the remote participates in a random draw to determine whether to increment its stack level by 1 or leave it at 0. If the stack level of any remote is not 0, then in one embodiment if the outcome of the previous reservation request was COLLIDED, the remote increments its stack level by 1, otherwise decrementing it by 1. In an alternate embodiment, if the outcome of all the reservation requests during the previous cycle was COLLIDED for greater than or equal to some threshold, the remote increments its stack level by 1, otherwise decrementing it by 1. The number of reservation minislots available in any particular uplink frame may be dynamically changed based on the percentage of idle minislots and the total uplink queue length.

Bandwidth reservation and collision resolution method for multiple access communication networks where remote hosts send reservation requests to a base station for randomly chosen minislots

In a method for conflict resolution among remote hosts in a wireless network
where remotes make bandwidth requests to the base station via uplink frames
partitioned into one or more reservation minislots, a collision occurs where two or
more remotes have transmitted a request in the same minislot. Each remote is
characterized by a stack level, and only remotes with a stack level equal to 0 are
permitted to transmit access request packets. Newly active remotes are allowed to join
in with those remotes already having stack level 0 during any particular conflict
resolution period by setting their stack levels to 0 and entering the request state. If
the stack level of a remote is 0, the remote randomly picks a minislot for transmission
of an access request. If the outcome is SUCCESS, and the queue at the remote is
empty, the remote transmits the current packet after receiving a transmit permit and
exits the request state. If the queue is not empty, then, after receiving a permit, the
current packet is transmitted with a piggybacked reservation request for transmission
of the next packet in the queue, continuing until the queue is empty. If the outcome
of the reservation request was not SUCCESS, the remote participates in a random
draw to determine whether to increment its stack level by 1 or leave it at 0.1 If the
stack level of any remote is not 0, then in one embodiment if the outcome of the
previous reservation request was COLLIDED, the remote increments its stack level
by 1, otherwise decrementing it by 1. In an alternate embodiment, if the outcome of
all the reservation requests during the previous cycle was COLLIDED for greater than
or equal to some threshold, the remote increments its stack level by 1, otherwise
decrementing it by 1. The number of reservation minislots available in any particular
uplink frame may be dynamically changed based on the percentage of idle minislots
and the total uplink queue length.

Mooi Choo Chuah

Papers

Bandwidth reservation and collision resolution method for multiple access communication networks where remote hosts send reservation requests to a base station for randomly chosen minislots

Method for conflict resolution in a multiple acess system for communications networks