Abstract:
A method is presented for adapting the packet size for VoIP communications, determined on-the-fly by the total network delay inherent at the time of packet transmission. If network delays are small relative to the maximum permissible latency for VoIP communications, the payload size per packet may be increased to maximize efficiency for the transmitted call. Alternatively, if network delays are large, the payload size per packet may be decreased in order to assure that the perceived quality of the transmitted call is acceptable.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    This application is a continuation of U.S. patent application Ser. No. 11/680,104 filed Feb. 28, 2007, which will issue as U.S. Pat. No. ______ on ______, and which claims priority under 35 U.S.C. 119(e) from U.S. Provisional Patent Application No. 60/780,058, filed Mar. 8, 2006. These documents are incorporated by reference herein. 
     
    
     BACKGROUND 
       [0002]    In recent years, the IEEE 802.11 standard for Wireless Local Area Networks (WLANs) has emerged as a prevailing technology for “last mile” broadband wireless access networks. While the principal application of these networks has been in providing connectivity to devices running best effort data applications, such as email and web browsing, interest is growing in supporting isochronous services such as telephony service or streaming video. Voice over Internet Protocol (VoIP) over WLAN (VoWLAN) is currently one of the fastest growing Internet applications. 
         [0003]    In VoIP, the voice signal is sampled at a fixed rate. A “packet” is assembled from the data, including multiple headers, a payload and one or more trailers. The headers and trailers include: (i) information about the packet origin and destination; (ii) information about the packet&#39;s relative position in the stream of packets that comprise the call; (iii) information about the communications protocols being used by the network; and (iv) error-checking information, among other things. Taken together, the headers and trailers are referred to as the overhead associated with a packet. The payload is the portion of the packet that contains the voice samples corresponding to the digitized voice signal. The time between generation of two consecutive packets is known as the packetization interval. Typically, the packets are of a constant length, and the packetization interval is determined by the type of Vocoder being used to transmit the call. Typical vocoders use 10-30 ms packetization intervals. For example, G.711 type vocoders often use a 20 ms packetization interval. 
         [0004]    For short packetization intervals, the fraction of a packet corresponding to overhead can be large, due mainly to the number of bytes required to characterize the various protocol layers. The transmission efficiency of the call is largely determined by the fraction of the packet that corresponds to the actual payload. Larger packets with a larger payload increase the efficiency of the communication, but under certain circumstances may result in poor quality of the phone call due to increased packetization latency. 
         [0005]    In many cases, the devices used for VoIP calls are portable handheld devices that are powered by batteries. Short packetization intervals result in faster depletion of the stored energy in a battery-powered mobile communications device, because the percentage of time that the device is involved in transmitting/receiving of voice packets is higher for the same amount of data due to the overhead in each short packet. Longer packetization intervals are also desirable in this context to decrease power usage and conserve batteries. 
       SUMMARY 
       [0006]    A method is presented for adapting the packet size for VoIP communications, determined on-the-fly by the network latency at the time of connection establishment or packet transmission. If network delays are small relative to the maximum permissible latency for VoIP communications, the payload size per packet may be increased, i.e. a longer packetization interval may be used, to maximize efficiency for the transmitted call. Alternatively, if network delays are large, a shorter packetization interval may be used in order to assure that the perceived quality of the transmitted call is acceptable. A single VoIP call may be broken into two or more concatenated legs, wherein each leg may use a different packetization interval. In addition to measuring or estimating the latency of the VoIP call to determine the packetization interval, overall network performance measures may also be considered. Packetization intervals may be adjusted to maximize the total number of VoIP calls that may be accommodated by the network at one time, or to reduce loading at certain network access points that are experiencing particularly heavy traffic. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0007]    Embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like reference numerals indicate corresponding, analogous or similar elements, and in which: 
           [0008]      FIG. 1  is a schematic of an exemplary packet structure; 
           [0009]      FIG. 2  is a schematic of an exemplary WLAN system that is compatible with an Adaptive Voice Packetization (AVP) scheme; 
           [0010]      FIG. 3  is a flowchart of an exemplary method for AVP, compatible with the WLAN system shown in  FIG. 2 ; and 
           [0011]      FIG. 4  is a schematic of an exemplary AVP server, compatible with the method shown in  FIG. 3 . 
       
    
    
       [0012]    It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity. 
       DETAILED DESCRIPTION 
       [0013]    In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of embodiments. However it will be understood by those of ordinary skill in the art that the embodiments may be practiced without these specific details. In other instances, well-known methods, procedures, components and circuits have not been described in detail so as not to obscure the embodiments. 
         [0014]    To increase the transmission efficiency of a VoIP call, a longer packet may be used to increase the payload relative to the overhead. However, under certain circumstances, longer packets can have a negative effect on the perceived quality of the call. Because more voice data is contained in each packet, the loss of a single packet during transmission has a more serious impact on the perceived quality of the call than the loss of shorter packets. While Packet Loss Concealment (PLC) techniques may be used to mask the effect of lost packets, current PLC techniques are inadequate for concealing a loss of more than 20 ms of samples for a type G.711 vocoder. 30-40 ms of samples may be concealed for G.729 and G.723 vocoders. Longer packetization intervals (resulting from longer packets) also contribute to increased latency, or transmission delay, for the call. A maximum latency target specified by International Telecommunication Union Standardization Sector (ITU-T) standard G.114 is often used; this states that a maximum one-way (mouth-to-ear) delay of 150 ms provides satisfactory quality for telephony applications. To limit the one-way latency to 150 ms, all internal network delays must be accounted for and controlled: including, for example, propagation and queuing delay through the network, scheduling delay because of congestion, and access link serialization delay. The packetization interval also contributes to latency, in that the minimum one-way delay for a 100 ms packetization interval is 100 ms. 
         [0015]    The latency for a single communicated call on a given network is highly variable and specific to that particular call. It depends on factors such as the amount of network traffic at that time, or the “location” of the originating device relative to the destination device, i.e. the number and type of intermediate devices that are required to connect the two devices. Currently, however, a standard packetization interval is typically used, corresponding to the vocoder used. Table I lists the typical packetization intervals used for common vocoder types. These vocoders are all constant-bit-rate (CBR) devices. Most commercially available WLAN mobile stations generate audio frames at a constant rate; however, several commercially available mobile stations support different sets of vocoders at different voice coding rates and with varying packetization intervals. New mobile stations may allow a more flexible determination of packetization intervals, for example, at multiples of 10 ms up to some maximum value. 
         [0000]    
       
         
               
             
               
               
               
               
               
             
               
               
               
               
               
             
           
               
                 TABLE 1 
               
             
             
               
                   
               
               
                 Example attributes of commonly used codecs 
               
             
          
           
               
                 Codec 
                 G.711 
                 G.723.1 
                 G.726-32 
                 G.729 
               
               
                   
               
             
          
           
               
                 Bit rate 
                 64 
                 5.3 or 6.3 
                 32 
                  8 
               
               
                 (Kbps) 
               
               
                 Framing 
                 20 
                 30 
                 20 
                 10 
               
               
                 interval (ms) 
               
               
                 Payload 
                 160 
                 20 or 24 
                 80 
                 10 
               
               
                 (Bytes) 
               
               
                 Packets/sec 
                 50 
                 33 
                 50 
                 50 
               
               
                   
                   
                   
                   
                 (2 frames/packet) 
               
               
                 Packetization 
                 20 
                 30 
                 20 
                 20 
               
               
                 Interval (ms) 
               
               
                   
               
             
          
         
       
     
         [0016]    The maximum packetization interval that may be used, subject to end-to-end latency constraints, may be highly specific for a particular call, according to the network useage at that time and the location of the origin and destination devices within the network. For example, at the time of the call, some of the access points (AP) in the network may be experiencing particularly heavy traffic. If the call requires routing through one of these APs, increased latency may be expected. By dynamically maximizing the packetization interval as a function of the actual end-to-end latency at the time of the actual call, the transmission efficiency for each call may be increased, and the overall efficiency of the WLAN network for supporting VoIP traffic may be maximized. In addition, using longer packetization intervals may result in reduced power consumption for battery-powered mobile stations. 
         [0017]      FIG. 1  is a schematic diagram of an exemplary packet structure for a VoWLAN call. Each packet  100  is comprised of the following component segments: (i) a header  102  comprised of a Physical layer header (PHY header), a Medium access control header (MAC header), and 40-Bytes of headers at other layers (e.g. Internet Protocol (IP), User Datagram Protocol (UDP), and Real-Time Transport Protocol (RTP)); (ii) a relatively small payload of 10-30 Bytes worth of data  104 ; and (iii) a trailer  106  comprised of cyclic redundancy check (CRC) values used to ensure the integrity of the received packet. 
         [0018]      FIG. 2  shows an exemplary WLAN system,  200 , capable of supporting an Adaptive Voice Packetization (AVP) scheme. A set of APs  202 ,  204  and  206 , provide wireless coverage for a population of Mobile Stations (MS), including  208  and  210 . Although the LAN is depicted as a shared medium, in practice it more commonly comprises a set of interconnected layer 2 switches. An AVP-enabled real-time gateway (AVP-RTG) server  212  is placed on the switched network that services the APs. A local router  214  controls communication with the Internet and/or a Public Standard Telephone Network (PSTN) through a gateway  216 . 
         [0019]    Examples of devices for mobile stations  208 ,  210 , are IP phones, cellular telephones, smart phones, personal digital assistants (PDAs), wireless handheld computers, wireless notebook computers, wireless laptop computers, wireless desktop personal computers and the like. 
         [0020]    The server can be any conventional voice gateway or RTP proxy that features the AVP scheme. The term “server” is intended to encompass a device functionally resembling a computer (e.g., having computation ability, memory, and/or connectivity capability). A typical server according to the definition as used in the present application may include, but is not limited to, any computer (e.g., mainframe, corporate server, personal computer, laptop, PDA, and the like). In various other embodiments of the present invention, the term “server” is intended to encompass a device not typically considered a computer but having similar capabilities. 
         [0021]      FIG. 3  shows an exemplary method for AVP that is compatible with IEEE 802.11 legacy mobile stations, and may be supported by a network such as is shown in  FIG. 2 . In this method, all intra-enterprise voice traffic through the APs is routed through the AVP-RTG server  212  before passing on to the destination APs, including traffic that passes through a single AP, i.e., when both call parties are in the coverage region of the same AP. Packet flow in the outbound direction from the LAN remains unchanged and is sent directly towards the local router  214 . During connection setup and SDP (Session Description Protocol) message exchange, the AVP-RTG server  212  negotiates the maximum possible voice packetization intervals with both mobile stations subject to codec type and round-trip latency constraints. For internal traffic, the packet loss rate is typically very low, so that the infrequent loss of longer packets has minimal effect on call quality. 
         [0022]    At  302 , MS  208  initiates a call to MS  210  by transmitting a call request through AP  202  to AVP-RTG server  212 . This call request could be sent directly from MS  208  to AVP-RTG server  212  or it may be forwarded via other means such as a SIP proxy server. At  306 , AVP-RTG server  212  negotiates a VoIP connection with both MS  208  and MS  210 , such that two “legs” constitute a single VoIP call, with each leg having one of the mobile stations (i.e.,  208  or  210 ) and AVP-RTG server  212  as its terminating points. At  308 , MS  208  measures the round-trip latency of the connection with AVP-RTG server  212 . An IP-based mobile station can easily measure the delay and jitter of an RTP connection using, for example, the SR and RR (Sender Report and Receiver Report) packets of the Real Time Control Protocol (RTCP). At  310 , MS  208  sends latency measurements to AVP-RTG server  212 , for example, statistics of the round-trip delay such as the mean and variance. AVP-RTG server  212  uses the measured latency information to determine the available “latency margin” for the leg, i.e. the difference between the actual latency and the maximum allowable latency. At  312 , AVP-RTG server  212  negotiates, through Session Initiation Protocol and Session Description Protocol (SIP/SDP) signaling, a packetization interval for the leg by determining the maximum packetization interval supported by MS  208 , subject to maximum latency constraints for that leg. At  314 - 318 , a second, separate packetization interval for the second leg of the communication is determined. At  320 , AVP-RTG server  212  acts as a translator by repackaging all incoming data from one leg into packets of the appropriate length for the other leg before transmitting them to AP  206 , and vice versa. This action is transparent to MS  208  and MS  210 . Having AVP-RTG server  212  break each end-to-end voice connection into two separate legs allows for negotiating asymmetric packetization intervals for the two legs of the same voice call. This may be useful, for example, because different IP-based mobile stations have different sets of voice codecs with different supported values for packetization intervals and playout buffers. 
         [0023]    In this exemplary method, the latency is actually measured by the mobile station, however, other methods for measuring the latency may be substituted. For example the latency of the connection may be measured by an additional, separate device that is in series with the connection, or by the AVP-RTG server itself. Alternatively, the latency may be estimated or modeled based on knowledge of the relative locations of the pair of communicating devices and the network characteristics. 
         [0024]    Computer-executable instructions for implementing an adaptive voice packetization scheme such as the above-described method may be stored on a form of computer readable media. Computer readable media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer readable media includes, but is not limited to, random access memory (RAM), read-only memory (ROM), electrically erasable programmable ROM (EEPROM), flash memory or other memory technology, compact disk ROM (CD-ROM), digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired instructions and which can be accessed by AVP-RTG  212 , including by internet or other computer network forms of access. 
         [0025]      FIG. 4  shows an exemplary internal configuration for an AVP-RTG server. As with any network server, AVP-RTG server  212  comprises a processor  450 , a network interface card (NIC)  452  coupled to processor  450 , and a memory  454  coupled to processor  450 . The device maintains a separate pair of queues for each VoIP session in the WLAN enterprise. The queues are created and maintained by code (not shown) stored in memory  454 , which is executed by processor  450 . In  FIG. 4 , it has been assumed that N active VoIP calls are being controlled by AVP-RTG server, with pairs  402 ,  404  and  406  of queues for calls  1 ,  2  and N, respectively. Code (not shown) stored in memory  454  is able, when executed by processor  450 , to establish the legs of the active VoIP calls between the participants and AVP-RTG server  212 . Within each pair, a single first-in-first-out (FIFO) queue may be used for voice packets arriving from each MS participating in the VoIP session. To conform to the negotiated packetization interval for each leg of the call, queued packets may be either split into shorter packets (as in queue  410 ) or aggregated into larger ones (as in queue  408 ) before they are passed on to the destination mobile station. 
         [0026]    In the exemplary method outlined above and in  FIGS. 2 to 4 , packetization intervals are determined according to the measured latency margin of the two legs of the call only. The determination of the packetization intervals is accomplished by code (not shown) stored in memory  454 , when executed by processor  450 . An AVP scheme may also be used at the network management level, for example, to relieve network congestion or to reduce loading at certain APs that are experiencing particularly heavy traffic. In such a scheme, packetization intervals may be determined by consideration of the current utilization and/or loading of different APs in the network in addition to the latency for the call. 
         [0027]    In one embodiment, a mobile station that is associated with a highly loaded (i.e. congested) access point may be favored by such an AVP algorithm by being assigned a larger packetization interval than the other mobile station that is associated with a relatively lightly loaded AP. As the volume of VoIP traffic across the WLAN changes with time, the AVP scheme may work to ensure equalization of load and utilization among different APs in the network. Such an algorithm has particular application for a WLAN with a highly variable, floating end user population, for example, at airports, hotels or coffee shops. Such an algorithm may also be extended to a multi-hop mesh network, resulting in significant improvements in the backhaul relaying capacity. By using an AVP scheme, the resulting capacity improvements are also strongly associated with improved power conservation for both IP-based mobile stations and APs. 
         [0028]    An AVP algorithm for assigning packetization intervals may be formulated to maximize the number of VoIP sessions that may be accommodated by the network at one time, before new calls are blocked. 
         [0029]    Maximizing Network Capacity: 
         [0030]    In formulating such an algorithm, one may, for example, seek to maximize the number of VoIP sessions that may be accommodated at all the APs in the network before the first new call is blocked because of insufficient available resources. An example of such an analysis follows: 
         [0031]    Let N i  be the maximum number of VoIP sessions that can be supported simultaneously by a single IEEE 802.11 AP, AP i . The transmission times for a downlink (DL) and an uplink (UL) packets are denoted T DL  and T UL , respectively. 
         [0032]    For a VoIP packet, the header overhead OH hdr  consists of the headers of RTP, UDP, IP, and IEEE 802.11 MAC layer: 
         [0000]        OH   hdr   =H   RTP   +H   UDP   +H   IP   +H   MAC  (Bits)   (1) 
         [0000]    It is assumed that when an AP sends a DL VoIP packet, the MS acknowledges the reception of this packet before it sends an UL VoIP packet which should also be acknowledged by the AP. The overhead incurred at the MAC layer of the AP is thus: 
         [0000]        OH   AP   =PHY+SIFS+ACK  (Second)   (2) 
         [0000]    Similarly, the overhead incurred at the MAC layer of the MS side is: 
         [0000]      OH MS   =PHY+SIFS+ACK  (Second)   (3) 
         [0000]    where PHY is the physical layer header and is sent at 1 Mbps. Throughout our analysis, we assume that MS uses a scheduled delivery mechanism for VoIP traffic since this can guarantee a minimum access delay for voice packets because MSs can access the shared channel at pre-scheduled time intervals without need for contention (this is the reason that DIFS and CW min  time are omitted from equations 2 and 3 above.) 
         [0033]    In this analysis, the possibility of packet loss and ACK loss and the need for voice packets retransmission is ignored. This means that the VoIP capacity derived is an upper bound on the actual capacity. 
         [0000]        T   DL   +T   UL =[2*(Audio Payload+ OH   hdr )/TransmissionRate]+ OH   AP   +OH   MS    (4) 
         [0000]      where 
         [0000]      Audio Payload= P time*CodecRate   (5) 
         [0034]    Here, it is assumed that both UL voice packets sent by the MS and DL voice packets received from the AP have the same size and are sent at the same rate. Next, it is assumed that for the i th  AP, AP i , there are n i  active VoIP sessions. These VoIP sessions are terminating at MSs that are associated with AP i . Hence, the normalized loading (i.e. utilization) of AP i  due to the n i  active VoIP sessions can be expressed as follows: 
         [0000]    
       
         
           
             
               
                 
                   
                     U 
                     i 
                   
                   = 
                   
                     
                       ∑ 
                       
                         j 
                         = 
                         1 
                       
                       
                         n 
                         i 
                       
                     
                      
                     
                       
                         ( 
                         
                           
                             T 
                             DLj 
                           
                           + 
                           
                             T 
                             ULj 
                           
                         
                         ) 
                       
                       × 
                       
                         N 
                         pj 
                       
                     
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where N pj  is the number of voice packets pairs sent by both the AP and MS (per second) for the j th  VoIP session and is dependent on the packetization interval of the codec used at the leg between the MS and AP i  for that call (Ptime j ) such that: 
         [0000]        N   pj =1 /P time j ;   (7) 
         [0035]    In general, for AP i  that has n i  admitted CBR VoIP calls, the maximum number of VoIP sessions that can be supported ‘N i ’ is inversely proportional to the actual capacity fraction needed to support ongoing n i  sessions: 
         [0000]      N i ∝1/U i    (8) 
         [0036]    To maximize the number of VoIP sessions that can be admitted by all the APs in the network, the optimization problem may be written as: 
         [0000]    
       
         
           
             max 
              
             
                 
             
              
             
               
                 ∑ 
                 
                   i 
                   = 
                   1 
                 
                 M 
               
                
               
                 N 
                 i 
               
             
           
         
       
     
         [0000]    where M is the number of APs in the WLAN enterprise. 
         [0037]    Because this is a convex problem, it can be rewritten as a minimization of the sum of the loading of all the APs in the enterprise (MaxNetworkCap formulation): 
         [0000]    
       
         
           
             
               
                 
                   
                     min 
                      
                     
                         
                     
                      
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           1 
                         
                         M 
                       
                        
                       
                         U 
                         i 
                       
                     
                   
                    
                   
                     
 
                   
                    
                   
                     
                       where 
                        
                       
                           
                       
                        
                       
                         U 
                         i 
                       
                     
                     = 
                     
                       
                         ∑ 
                         
                           j 
                           = 
                           1 
                         
                         
                           n 
                           i 
                         
                       
                        
                       
                         
                           
                             T 
                             DLj 
                           
                           + 
                           
                             T 
                             ULj 
                           
                         
                         
                           Ptime 
                           
                             j 
                             , 
                             1 
                           
                         
                       
                     
                   
                    
                   
                     
 
                   
                    
                   
                     subject 
                      
                     
                         
                     
                      
                     to 
                      
                     
                       : 
                     
                   
                    
                   
                     
 
                   
                    
                   
                     
                       MinPtime 
                       
                         j 
                         , 
                         1 
                       
                     
                     ≤ 
                     
                       Ptime 
                       
                         j 
                         , 
                         1 
                       
                     
                     ≤ 
                     
                       MaxPtime 
                       
                         j 
                         , 
                         1 
                       
                     
                   
                 
               
               
                 
                   ( 
                   12 
                   ) 
                 
               
             
             
               
                 
                   
                     
                       Ptime 
                       
                         j 
                         , 
                         1 
                       
                     
                     + 
                     
                       Ptime 
                       
                         
                           j 
                           , 
                           2 
                         
                          
                         
                             
                         
                       
                     
                     + 
                     
                       AD 
                        
                       
                         ( 
                         
                           
                             Ptime 
                             
                               j 
                               , 
                               1 
                             
                           
                           , 
                           
                             Ptime 
                             
                               j 
                               , 
                               2 
                             
                           
                         
                         ) 
                       
                     
                     + 
                     
                       D 
                       network 
                     
                   
                   ≤ 
                   
                     LM 
                     j 
                   
                 
               
               
                 
                   ( 
                   13 
                   ) 
                 
               
             
             
               
                 
                   where 
                    
                   
                      
                   
                    
                   
                     
                       AD 
                        
                       
                         ( 
                         
                           
                             Ptime 
                             
                               j 
                               , 
                               1 
                             
                           
                           , 
                           
                             Ptime 
                             
                               j 
                               , 
                               2 
                             
                           
                         
                         ) 
                       
                     
                     = 
                     
                       
                         ( 
                         
                           
                             ⌈ 
                             
                               
                                 max 
                                  
                                 
                                   ( 
                                   
                                     
                                       Ptime 
                                       
                                         j 
                                         , 
                                         1 
                                       
                                     
                                     , 
                                     
                                       Ptime 
                                       
                                         j 
                                         , 
                                         2 
                                       
                                     
                                   
                                   ) 
                                 
                               
                               
                                 min 
                                  
                                 
                                   ( 
                                   
                                     
                                       Ptime 
                                       
                                         j 
                                         , 
                                         1 
                                       
                                     
                                     , 
                                     
                                       Ptime 
                                       
                                         j 
                                         , 
                                         2 
                                       
                                     
                                   
                                   ) 
                                 
                               
                             
                             ⌉ 
                           
                           - 
                           1 
                         
                         ) 
                       
                       × 
                       
                         min 
                          
                         
                           ( 
                           
                             
                               Ptime 
                               
                                 j 
                                 , 
                                 1 
                               
                             
                             , 
                             
                               Ptime 
                               
                                 j 
                                 , 
                                 2 
                               
                             
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   14 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where Ptime j,1  and Ptime j,2  are the pair of packetization interval values corresponding to voice packets generated at the two end MSs of the j th  call, MinPtime j,1  and MaxPtime j,1  are the lower- and upper-bounds of the packetization interval values supported by the mobile station associated with the i th  AP and used for the j th  call. LM j  is the available round-trip latency margin for the j th  VoIP session. AD( ) is the VoIP packets adaptation delay incurred at AVP-RTG server for splitting/packing voice packets received at both legs of the j th  VoIP session as a result of using asymmetric Ptime j,1  and Ptime j,2  values. D network  is the network delay which includes all delay components, experienced by VoIP packets, other than those mentioned in the latency margin constraint 13 (e.g. propagation delay, channel access delay, . . . etc). The propagation delay in a typical WLAN enterprise setup is negligible compared with typical packetization interval periods since a wired distribution system (e.g., Ethernet) is used to transport traffic (including VoIP streams) between different AP&#39;s in the enterprise. 
         [0038]    In a special case of this optimization problem, one may consider the situation where all calls are between mobile stations that support the same vocoder and the same sampling rate. Moreover, it can be assumed that the underlying PHY layer of the IEEE 802.11 WLAN is the same for all APs in the network. In this case, the global optimum may be obtained by splitting the available latency margin “LM” on both sides of the call (i.e. Ptime 1 =Ptime 2 =LM/2). The algorithm “SplitLM” (listed below) may be used as a simple heuristic algorithm to solve the special case problem optimally. However, it provides a suboptimal solution for the more general MaxNetworkCap optimization problem. 
         [0000]    
       
         
               
             
               
               
             
           
               
                   
               
               
                 SplitLM: 
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                   
                 Begin 
               
               
                   
                 1:Ptime 1  = min(min(Max_Ptime 1 , Max_Ptime 2 ), LM/2); 
               
               
                   
                 2:Ptime 2  = Ptime 1 ; 
               
               
                   
                 End 
               
               
                   
                   
               
             
          
         
       
     
         [0039]    Maximizing VoIP Capacity at APs Experiencing Particularly Heavy Traffic: 
         [0040]    Alternatively, it is possible to maximize the VoIP capacity of the AP that has the maximum VoIP traffic load among all the “M” APs in the enterprise. An example of such an analysis follows (Min-Max AP Utilization ‘MMAU’ formulation):
       min{max U i }, i=1, 2, . . . , M
 
subject to:
       
 
         [0000]      MinPtime j,1 ≦Ptime j,1 ≦MaxPtime j,1    (15) 
         [0000]      MinPtime j,2 ≦Ptime j,2 ≦MaxPtime j,2    (16) 
         [0000]        P time j,1   +P time j,2   +AD ( P time j,1   , P time j,2 )+ D   network   ≦LM   j    (17) 
         [0000]    The min-max optimization above is global, i.e. is applied over all active calls in the WLAN enterprise at the same time. 
         [0042]    The non-linear “ceiling ┌┐” operator in AD( ) is adding a lot to the complexity of both combinatorial discrete integer problems MaxNetworkCap and Min-Max AP Utilization. Although the objective function in both problem formulations can be easily transformed into an equivalent convex optimization problem, unfortunately, it is very difficult to solve both problems optimally because of the non-linearity in the latency margin constraint. 
         [0043]    A possible solution for this problem is the use of greedy-based heuristic algorithms. Two such algorithms, “Heuristic MaxNetworkCap” or Heuristic-1 and “Heuristic Min-Max AP Utilization” or Heuristic-2 may be used for near-optimal solution of both formulations in [0028] and [0038]. 
         [0044]    Both heuristic algorithms deploy a local optimization technique rather than globally minimizing the cost function. The greedy-based solvers work in a way similar to a typical Call Admission Control scheme that initializes the packetization interval values for each new requested call with a feasible solution and then tries a limited number of neighbor “Ptime” values in order to obtain a near-optimal minimum utilization for end-APs. 
         [0045]    The “Heuristic Min-Max AP Utilization” algorithm employs a local optimization technique that searches for a suboptimal pair of Ptime 1  and Ptime 2  values of every newly requested VoIP call rather than trying to globally minimize the cost function. The solver works in a way similar to a typical call admission control scheme. For each newly requested call, the algorithm starts by determining the APs that the two voice MS s are associated with (i.e. AP 1  and AP 2 ). Then it initializes the packetization interval length of each MS involved in the new call (i.e. Ptime 1  and Ptime 2 ) with a feasible solution which is selected as the minimum of the maximum permissible packetization interval supported by the MS and half of the measured available round-trip latency margin between the two end MSs of the new connection. These initial values are the initial optimal (suboptimal in the context of heuristic algorithms) values for Ptime 1  and Ptime 2 , and are updated during the progress of the algorithm as better feasible solutions are found. 
         [0046]    After the initialization phase, the algorithm proceeds (lines 9, 10, and 11) by checking if initialization values for Ptime 1  and Ptime 2  are the same. If so, a near-optimal solution is found and the algorithm terminates since the use of the symmetric initial values of Ptime 1  and Ptime 2  satisfies the latency constraint in 17. If initial Ptime values are different, the algorithm (in line 12) checks if AP 1  is more heavily loaded than AP 2 . If this is the case, the algorithm searches for the largest possible value of Ptime 1  that would guarantee the admission of the new call while achieving the minimal loading of AP 1  (lines 13 through 20). This is done by starting with Ptime 1 =Initial Ptime 1  and iteratively decrementing Ptime 1  until it reaches Initial Ptime 2 . In each iteration of the for loop (line 13), the algorithm tries to find the largest possible value of Ptime 2  that (given the current value of Ptime 1  of the loop iteration) satisfies the latency constraint and would produce a better solution (i.e., lower utilization of AP 1  and AP 2 .) If none is found, Ptime 1  is decremented by the minimum frame size (e.g. 20 ms) and the same steps are repeated until either a better solution is found or Ptime 1  reaches the value of Initial Ptime 2 . On the other hand, if AP 2  is more heavily loaded than AP 1 , the algorithm searches for the largest possible value of Ptime 2  that would guarantee the admission of the new call while achieving the minimal utilization of AP 2  (lines 21 through 30). 
       Min-Max AP Utilization (MMAU): 
       [0047]      
         [0000]    
       
         
               
             
           
               
                   
               
             
             
               
                 Init 
               
               
                 /*Initialize Ptimes for both MSs with the maximum possible values based on available 
               
               
                 latency margin LM and vocoders constraints. 
               
               
                 1: AP 1  = ID of AP that MS 1  is associated with. 
               
               
                 2: AP 2  = ID of AP that MS 2  is associated with. 
               
               
                 3: Initial_Ptime 1  = min(LM/2, MaxPtime 1 ); 
               
               
                 4: Initial_Ptime 2  = min(LM/2, MaxPtime 2 ); 
               
               
                 5: Optimal_Ptime 1  = Initial_Ptime 1 ; 
               
               
                 6: Optimal_Ptime 2  = Initial_Ptime 2 ; 
               
               
                 7: Best solution found so far = infinity; 
               
               
                 8: Begin 
               
               
                 9: if (Initial_Ptime 1  == Initial_Ptime 2 ) { 
               
               
                 10: Update Utilizations of end APs; 
               
               
                 11: Exit; // Near optimal Ptimes are found. 
               
               
                 12: } else if ( Utilizations(AP 1 ) ≧ Utilizations(AP 2 ) ) { 
               
               
                 13:  for (Ptime 1  = Initial_Ptime 1 ; Ptime 1  &gt; Initial_Ptime 2 ; Ptime 1  − −) 
               
               
                 14:   { 
               
               
                 15:    Ptime 2  = Initial_Ptime 2 ; 
               
               
                 16:    while (Ptime 1  &amp; Ptime 2  do not satisfy LM constraint) 
               
               
                 17:        Ptime 2  = Ptime 2  − MinPtime 2 ; 
               
               
                 18:    if (Max(Utilizations(AP 1 ,AP 2 )) &lt; Best solution found so far) 
               
               
                 19:     Update best solution of Ptimes and best AP utilizations found so far; 
               
               
                 20:   } 
               
               
                 21:} else if ( Utilizations(AP 2 ) &gt; Utilizations(AP 1 ) ) { 
               
               
                 22:  for (Ptime 2  = Initial_Ptime 2 ; Ptime 2  &gt; Initial_Ptime 1 ; Ptime 2  − −) 
               
               
                 23:   { 
               
               
                 24:    Ptime 1  = Initial_Ptime 1 ; 
               
               
                 25:    while (Ptime 1  &amp; Ptime 2  do not satisfy LM constraint) 
               
               
                 26:        Ptime 1  = Ptime 1  − MinPtime 1 ; 
               
               
                 27:   if ( Max(Utilizations(AP 1 ,AP 2 )) &lt; Best solution found so far ) 
               
               
                 28:    Update best solution of Ptimes and best AP utilizations found so far; 
               
               
                 29:   } 
               
               
                 30:} 
               
               
                 31:End 
               
               
                   
               
             
          
         
       
     
         [0048]    The “Heuristic MaxNetworkCap” algorithm is a variant version of the “Heuristic Min-Max AP Utilization” algorithm. The “Heuristic MaxNetworkCap” algorithm deploys a local optimization technique that searches for a suboptimal pair of Ptime 1  and Ptime 2  of a newly requested VoIP call to minimize the sum of the one norm of the loading of all APs. The algorithm initialization part is identical to the one in the “Heuristic Min-Max AP Utilization” algorithm. After the initialization phase, the algorithm proceeds (lines 9, 10, and 11 in  FIG. 3 ) by checking if initialization values for Ptime 1  and Ptime 2  are the same. If so, a near-optimal solution is found and the algorithm terminates since the use of the symmetric initial values of Ptime 1  and Ptime 2  satisfies the latency constraint in 13. If initial Ptime values are different, the algorithm (line 12) checks if Initial Ptime 1  is less than Initial Ptime 2 . If this is the case, the algorithm searches for the largest possible values of Ptime 1  and Ptime 2  that would guarantee the admission of the new call while achieving the minimal sum of AP 1  and AP 2  utilizations (lines 13 through 20). This is done by fixing Ptime 1 =Initial Ptime 1  and setting Ptime 2 =Initial Ptime 2 . Then, the algorithm iteratively decrements Ptime 2  until it reaches Initial Ptime 1 . In each iteration of the for loop (line 14), the algorithm searches for the largest possible value of Ptime 2  that (given the value of Ptime 1 ) satisfies the latency constraint and would produce a better solution (i.e., lower sum of AP 1  and AP 2  utilizations.) 
         [0049]    On the other hand, if Initial Ptime 2  is less than Initial Ptime 1 , the algorithm fixes Ptime 2  to Initial Ptime 2  and sets Ptime 1 =Initial Ptime 1  and iteratively searches for the largest possible value of Ptime 1  that would guarantee the admission of the new call while achieving the minimal sum of AP 1  and AP 2  utilizations (lines 21 through 30.) 
       MaxNetworkCap: 
       [0050]      
         [0000]    
       
         
               
             
           
               
                   
               
             
             
               
                 Init 
               
               
                 /*Initialize Ptimes for both MSs with the maximum possible values based on available 
               
               
                 latency margin LM and vocoders constraints. 
               
               
                 1: AP 1  = ID of AP that MS 1  is associated with. 
               
               
                 2: AP 2  = ID of AP that MS 2  is associated with. 
               
               
                 3: Initial_Ptime 1  = min(LM/2, MaxPtime 1 ); 
               
               
                 4: Initial_Ptime 2  = min(LM/2, MaxPtime 2 ); 
               
               
                 5: Optimal_Ptime 1  = Initial_Ptime 1 ; 
               
               
                 6: Optimal_Ptime 2  = Initial_Ptime 2 ; 
               
               
                 7: Best solution found so far = infinity; 
               
               
                 8: Begin 
               
               
                 9: if (Initial_Ptime 1  == Initial_Ptime 2 ) { 
               
               
                 10: Update Utilizations of end APs; 
               
               
                 11: Exit; // Near optimal Ptimes are found. 
               
               
                 12: } else if (Initial_Ptime 1  &lt; Initial_Ptime 2 ) { 
               
               
                 13:  Ptime 1  = Initial_Ptime 1 ; 
               
               
                 14:  for (Ptime 2  = Initial_Ptime 2 ; Ptime 2  &gt; Initial_Ptime 1 ; Ptime 2  −−) 
               
               
                 15:    { 
               
               
                 16:     if (Ptime 1  &amp; Ptime 2  satisfy LM constraint) 
               
               
                 17:      if (Sum_of_Utilization(AP1, AP2) &lt; Best solution found so far) 
               
               
                 18:       Update optimal solution of Ptimes and optimal (i.e. minimum) AP utilizations 
               
               
                 19:       found so far; 
               
               
                 20:    } 
               
               
                 21: } else if (Initial_Ptime 1  &gt; Initial_Ptime 2 ) { 
               
               
                 22:   Ptime 2  = Initial_Ptime 2 ; 
               
               
                 23:   for (Ptime 1  = Initial_Ptime 1 ; Ptime 1  &gt; Initial_Ptime 2 ; Ptime 1  −−) 
               
               
                 24:    { 
               
               
                 25:     if (Ptime 1  &amp; Ptime 2  satisfy LM constraint) 
               
               
                 26:      if (Sum_of_Utilization(AP1, AP2) &lt; Best solution found so far) 
               
               
                 27:       Update optimal solution of Ptimes and optimal (i.e. minimum) AP utilizations 
               
               
                 28:       found so far; 
               
               
                 29:    } 
               
               
                 30: } 
               
               
                 31:End 
               
               
                   
               
             
          
         
       
     
         [0051]    Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.