System and method of group calling in mobile communications

BACKGROUND OF THE INVENTION

P-0001[0001] 1. Field of the Invention

P-0002[0002] This invention relates to mobile communications and, more particularly, to a system and method of group calling in mobile communications.

P-0003[0003] 2. Discussion of Related Art

P-0004[0004] All modern mobile communication systems have a hierarchical arrangement, in which a geographical “coverage area” is partitioned into a number of smaller geographical areas called “cells.” Referring to FIG. 1, each cell is preferably served by a Base Transceiver Station (“BTS”) <b>102</b><i>a. </i>Several BTS <b>102</b><i>b</i>-n are aggregated via fixed links <b>104</b><i>a</i>-n into a Base Station Controller (“BSC”) <b>106</b><i>a. </i>The BTSs and BSC are sometimes collectively referred to as the Base Station Subsystem (“BS”) <b>107</b>. Several BSCs <b>106</b><i>b</i>-n may be aggregated into a Mobile Switching Center (“MSC”) <b>110</b> via fixed links <b>108</b><i>a</i>-n.

P-0005[0005] MSC <b>110</b> acts as a local switching exchange (with additional features to handle mobility management requirements, discussed below) and communicates with the phone network (“PSTN”) <b>120</b> through trunk groups. Under U.S. mobile networks, there is a concept of a home MSC and a Serving MSC. The home MSC is the MSC corresponding to the exchange associated with a Mobile Station (“MS”); this association is based on the phone number, e.g., area code, of the MS. (The home MSC is responsible for the HLR discussed below.) The Serving MSC, on the other hand, is the exchange used to connect the MS call to the PSTN (as the subscriber roams in the area covered by the service provider, different MSCs perform the function of the Serving MSC). Consequently, sometimes the home MSC and the Serving MSC are the same entity, but other times they are not (e.g., when the MS is roaming). Typically, a Visiting Location Register (“VLR”) <b>116</b> is co-located with the MSC <b>110</b> and a logically singular HLR is used in the mobile network. As will be explained below, the HLR and VLR are used for storing many types of subscriber information and profiles.

P-0006[0006] Briefly, one or more radio channels <b>112</b> are associated with the entire coverage area. The radio channels are partitioned into groups of channels allocated to individual cells. The channels are used to carry signaling information to establish call connections and the like, and to carry voice or data information once a call connection is established.

P-0007[0007] At a relatively high level of abstraction, mobile network signaling involves at least two main aspects. One aspect involves the signaling between an MS and the rest of the network. With 2G (“2G” is the industry term used for “second generation”) and later technology, this signaling concerns access methods used by the MS (e.g., time-division multiple access, or TDMA; code-division multiple access, or CDMA), assignment of radio channels, authentication, etc. A second aspect involves the signaling among the various entities in the mobile network, such as the signaling among MSCs, VLRs, HLRs, etc. This second part is sometimes referred to as the Mobile Application Part (“MAP”) especially when used in the context of Signaling System No. 7 (“SS7”).

P-0008[0008] The various forms of signaling (as well as the data and voice communication) are transmitted and received in accordance with various standards. For example, the Electronics Industries Association (“EIA”) and Telecommunications Industry Association (“TIA”) help define many U.S. standards, such as IS-41, which is a MAP standard. Analogously, the CCITT and ITU help define international standards, such as GSM-MAP, which is an international MAP standard. Information about these standards is well known and may be found from the relevant organizing bodies as well as in the literature, see, e.g., Bosse, SIGNALING IN TELECOMMUNICATIONS NETWORKS (Wiley 1998).

P-0009[0009] To deliver a call from an MS <b>114</b>, a user dials the number and presses “send” on a cell phone or other MS. The MS <b>114</b> sends the dialed number indicating the service requested to the MSC <b>110</b> via the BS <b>107</b>. The MSC <b>110</b> checks with an associated VLR <b>116</b> (more below) to determine if the MS <b>114</b> is allowed the requested service. The Serving MSC routes the call to the local exchange of the dialed user on the PSTN <b>120</b>. The local exchange alerts the called user terminal, and an answer back signal is routed back to the MS <b>114</b> through the serving MSC <b>10</b> which then completes the speech path to the MS. Once the setup is completed the call may proceed.

P-0010[0010] To deliver a call to a MS <b>114</b>, (assuming that the call originates from the PSTN <b>120</b>) the PSTN user dials the MS's associated phone number. At least according to U.S. standards, the PSTN <b>120</b> routes the call to the MS's home MSC (which may or may not be the one serving the MS). The MSC then interrogates the HLR <b>118</b> to determine which MSC is currently serving the MS. This also acts to inform the serving MSC that a call is forthcoming. The home MSC then routes the call to the Serving MSC. The serving MSC pages the MS via the appropriate BS. The MS responds and the appropriate signaling links are setup.

P-0011[0011] During a call, the BS <b>107</b> and MS <b>114</b> may cooperate to change channels or BTSs <b>102</b>, if needed, for example, because of signal conditions. These changes are known as “handoffs,” and they involve their own types of known messages and signaling.

P-0012[0012] One aspect of MAP involves “mobility management.” Briefly, different BSs and MSCs may be needed and used to serve an MS, as the MS <b>114</b> roams to different locations. Mobility management ensures that the Serving MSC has the subscriber profile and other information the MSC needs to service (and bill) calls correctly. To this end, MSCs use a Visiting Location Register (“VLR”) <b>116</b> and a Home Location Register (“HLR ”) <b>118</b>. The HLR is used to store and retrieve the mobile identification number (“MIN”), the electronic serial number (“ESN”), MS status, and the MS service profile, among other things. The VLR stores similar information in addition to storing an MSC identification that identifies the (Home) MSC. In addition, under appropriate MAP protocols, location update procedures (or registration notifications) are performed so that the home MSC of a mobile subscriber knows the location of its users. These procedures are used when a MS roams from one location to another or when a MS is powered on and registers itself to access the network. For example a location update procedure may proceed with the MS <b>114</b> sending a location update request to the VLR <b>116</b> via the BS <b>107</b> and MSC <b>110</b>. The VLR <b>1</b><b>16</b> sends a location update message to the HLR <b>118</b> serving the MS <b>114</b>, and the subscriber profile is downloaded from the HLR <b>118</b> to the VLR <b>116</b>. The MS <b>114</b> is sent an acknowledgement of a successful location update. The HLR <b>118</b> requests the VLR (if any) that previously held profile data to delete the data related to the relocated MS <b>114</b>.

P-0013[0013]FIG. 2 shows in more detail the signaling and user traffic interfaces between a BS <b>107</b> and an MSC <b>110</b> in a CDMA mobile network. The BS <b>107</b> communicates signaling information using the A<b>1</b> interface. The A<b>2</b> interface carries the user traffic (e.g., voice signals) between the switch component <b>204</b> of the MSC and the BS <b>107</b>. The A<b>5</b> interface is used to provide a path for user traffic for circuit-switched data calls (as opposed to voice calls) between the source BS and the MSC.

P-0014[0014] Moreover, subscribers are demanding newer services, e.g., “data calls” to the Internet. For some of these services MSCs are not cost effective because they were primarily designed for voice calls. Integration of new services into the MSC is complicated or infeasible because of the proprietary and closed designs used by many MSC software architectures. That is, the software logic necessary to provide the services is not easy to add to the MSC <b>110</b>. Often, a switch adjunct is used to provide such services. For example, an Inter-Working Function (“IWF”) is an adjunct to route a data call to the Internet. Either approach—integrating functionality into the MSC or adding a trunk-side adjunct—involves the MSC in the delivery of service. Since the new service is expected to spur demand, integrating new services via MSC design changes or through trunk-side adjuncts is likely to exacerbate network congestion at the MSC and require costly MSC resources.

P-0015[0015] With respect to the Internet, multicast communication refers to the transmission of identical data packets to selected, multiple destinations on an Internet protocol network. (In contrast, broadcast communication refers to the indiscriminate transmission of data packets to all destinations, and unicast communication refers to the transmission of data packets to a single destination.)

P-0016[0016] Each participant in a multicast receives information transmitted by any other participant in the multicast. Users connected to the network who are not participants in a particular multicast do not receive the information transmitted by the participants of the multicast. In this way, the multicast communication uses only the network components (e.g., switches and trunks) actually needed for the multicast transmission.

P-0017[0017] In multicast processing, when a potential participant (“host”) is directed to join a particular IP multicast group, the host sends a “request to join” message to the nearest multicast-capable router to request to join the multicast group and receive information sent to this group. For example, a host A sends a message to join multicast group Y, and a host B sends a message to join multicast group X. A router R propagates the request up to the multicast source if the data path is not already in place.

P-0018[0018] Upon receiving an IP packet for group X, for example, the router R maps an IP multicast group address into an Ethernet multicast address, and sends the resultant Ethernet packet to the appropriate switch or switches.

P-0019[0019] According to the current Internet Group Management Protocol (“IGMP”) a host's membership in a multicast group expires when the router does not receive a periodic membership report from the host.

P-0020[0020] With respect to interaction among MSs, a Nextel service (known as Nextel Direct Connect®, using Specialized Mobile Radio technology, and described at http: H /www.nextel.com/phone_services/directconnect.shtml) having two versions has been proposed for special connection calls among MSs. Both versions of the special connection calls require that all members be located in the same area served by one BSC. In the first version, a one to one conversation is allowed between two mobile telephone subscribers, e.g., A and B. When A wishes to have special connection communication with B, A enters B's private identification number, holds down a push to talk (“PTT”) button, waits for an audible alert signifying that B is ready to receive, and starts speaking. To listen, A releases the PTT button. If B wishes to speak, B holds down the PTT button and waits for an audible confirmation that A is ready to receive. The service allows a subscriber to choose private identification numbers from scrollable lists displayed on mobile telephone handsets or to search a list of pre-stored names of subscribers.

P-0021[0021] In the second version, conversations are allowed among members of a pre-defined group of subscribers, known as a Talkgroup, which is identified by a number. The mobile telephone handset allows Talkgroup numbers to be searched through the control surface of the handset. In order to place a group call, the initiating subscriber, e.g., A, locates a Talkgroup number in the handset, holds down the PTT button, and, upon receiving an audible confirmation such as a chirp, can start speaking. All of the other Talkgroup members on the group call can only listen while A is holding down the PTT button. If A releases the PTT button, another member on the group call may hold down the PTT button, acquire control signaled by the audible confirmation, and start speaking.

SUMMARY

P-0022[0022] The invention generally provides systems and methods of mobile communication and specifically provides a system and method for group calling. Information is retrieved from a list of members of a group call group. Based on the retrieved information, a group call is established between first and second mobile stations (MS). The first MS is served by a first base station controller (BSC) and the second MS is served by a second BSC. Voice data for the group call is transmitted in a multicast session. Based on a history of group calls between two points in a mobile communications network, a determination is made as to whether to establish a multicast session between the two points, e.g., in anticipation of a future group call.

P-0023[0023] By initiating a single call, a member of a group can cause a group call to be established among all members of the group who can be contacted. Group calls can be established among members that may be located in different areas served by different BSCs and perhaps by different access methods (e.g., TDMA or CDMA). The inter-BSC voice traffic among the members in a group call may be carried by an alternative communication network such as an Internet Protocol network.

BRIEF DESCRIPTION OF THE DRAWING

P-0024[0024] In the Drawing,

P-0025[0025]FIG. 1 is a system diagram of prior art mobile networks;

P-0026[0026]FIG. 2 illustrates a prior art interface between a BS and a mobile switching center in a prior art mobile network;

P-0027[0027]FIG. 3 illustrates a block diagram of a system including group call logic;

P-0028[0028] FIGS. <b>4</b>-<b>5</b> illustrate a proxy switch and certain deployments in a mobile network;

P-0029[0029]FIG. 6 illustrates an exemplary data plane of a proxy switch according to a preferred embodiment of the invention;

P-0030[0030]FIGS. 7, 9, <b>16</b>-<b>17</b> illustrate architectures of a group communication system;

P-0031[0031] FIGS. <b>8</b>A-<b>8</b>C, <b>11</b>-<b>15</b> are call flow diagrams of uses of a group communication system; and

P-0032[0032]FIG. 10 illustrates a flow diagram of group call logic.

DETAILED DESCRIPTION

P-0033[0033] With reference to FIG. 3, a system and method is provided for arranging calls among members of a predefined group of mobile telephone users. As described in more detail below, a proxy switch or other device implementing group call logic <b>1010</b> detects a group call initiation by a member <b>1012</b>A of a group <b>1014</b> and automatically attempts to connect all of the members <b>1012</b>A, <b>1012</b>B, <b>1012</b>C of the group in a group call. In a specific implementation, communication in the group call is half duplex (i.e., only one member may speak at a time), and the voice traffic for the group is carried over an Internet Protocol (“IP”) network in a multicast session.

P-0034[0034] With respect to the case in which the group call logic is implemented by a proxy switch, the proxy switch may operate as described in copending U.S. application Ser. No. 09/721329, entitled System and Method of Servicing Mobile Communications with a Proxy Switch, filed Nov. 22, 2000, which is incorporated herein by reference. As described in the copending application and illustrated in FIG. 4, switching <b>1034</b> operations are performed between at least one mobile switching center (“MSC”) <b>1030</b> and at least one base station subsystem (“BS”) <b>1032</b>. The switching allows communication traffic to be siphoned to or from an alternative network <b>1036</b> such as an IP network. The switching is transparent so that neither the MSC nor the BS needs any changes to work with the inventive switching.

P-0035[0035] The proxy switch described the copending application includes signaling message handling logic <b>1038</b> to receive signaling messages from the MSC and BS in accordance with a mobile signaling protocol. Message interception logic <b>1040</b> cooperates with the signaling message handling logic and sends an acknowledgment message to an MSC or BS that transmitted a signaling message. The message interception logic also prevents the signaling messages from being forwarded to the other of the BS and MSC respectively. Message conversion logic <b>1042</b> cooperates with the signaling message handling logic and converts a signaling message from one of the MSC and BS into a converted signaling message for transmission to the other of the BS and MSC, respectively. Message transmission logic <b>1044</b> cooperates with the signaling message handling logic and transmits signaling messages from one of the MSC and the BS to the other of the BS and MSC, respectively.

P-0036[0036] A set of bearer circuits <b>1046</b> from the BS are allocated to the proxy switch. Signaling messages between the MSC and the BS are received and are analyzed to determine whether they correspond to the allocated set of bearer circuits. If so, control information in the signaling messages is conveyed to the alternative communication network; and information carried on the set of bearer circuits is siphoned to the alternative network.

P-0037[0037]FIG. 5 shows one preferred deployment of a proxy switch <b>300</b>, in which the proxy switch <b>300</b> is positioned between the BS <b>107</b> and the MSC <b>110</b>. Only a subset of trunks <b>306</b> carrying user traffic needs to be terminated on the proxy switch; other trunks <b>308</b> may directly connect the MSC <b>110</b> and BS <b>107</b>. All control links <b>312</b> from BS <b>107</b> terminate at proxy switch <b>300</b>. The proxy switch includes a control plane <b>302</b> and a data plane <b>304</b> (also known as a “bearer plane”). The control plane <b>302</b> handles all the signaling traffic, and the data plane <b>304</b> handles all the user traffic for the trunks connected to the proxy switch.

P-0038[0038] Under certain embodiments, there is a one to one correspondence between an MSC and a proxy switch. Several BSs may work with a single proxy switch.

P-0039[0039] The proxy switch <b>300</b> includes software that accepts all signaling messages and, depending on the message and the state of the system, performs at least one of the following:

P-0040[0040] 1. passes the message unaltered to the MSC or BS addressed in the message;

P-0041[0041] 2. intercepts messages between the MSC and BS;

P-0042[0042] 3. for some intercepted messages, converts the intercepted messages to a different message and sends the converted message in place of the original, intercepted message to the MSC or BS addressed in the intercepted message;

P-0043[0043] 4. siphons the message from the mobile- and PSTN-based network to an alternative network such as an IP network.

P-0044[0044] The types of actions performed in each case along with the triggering events are described below.

P-0045[0045] In many instances, particularly when a message from an MS <b>114</b> is siphoned and the traffic is directed to an alternative network, the proxy switch <b>300</b> may act as an MSC <b>110</b>. In such a role, the proxy switch fulfills the responsibilities and roles that a traditional MSC would perform. Some of these functions and roles pertain to mobility management. Consider the case of a roaming MS; as it roams from one cell to another, it may roam to a cell served by a different MSC, thus necessitating a handoff between the source and target MSCs. If the proxy switch <b>300</b> has siphoned the message and the call/session has been directed to an alternative network, then the handoff is managed by the proxy switch analogously to the way a handoff would be managed by a conventional MSC. The proxy switch causes the appropriate databases to be updated with the new location of the MS.

P-0046[0046] Another function of the proxy switch pertains to the assignment of resources. In particular, when an MS initiates a message requesting a new call/session, appropriate circuits (channels) need to be assigned for this session. Depending on the configuration of the system and the system state, the proxy switch makes such assignments analogously to the way conventional MSC assigns circuits.

P-0047[0047]FIG. 6 shows an exemplary deployment in which the proxy switch <b>300</b> is connected to several alternative networks, such as an IP backbone <b>412</b> or an alternative circuit-based network <b>414</b>, e.g., a different carrier. These alternative networks may be used to carry voice and/or data traffic to desired destinations while avoiding in whole or in part the PSTN <b>120</b> along with the costly resources of MSC <b>110</b>. Alternatively, these arrangements may be used so that circuit traffic could be backhauled to a different network; for example, circuit traffic from Nashua, NH could be backhauled to an MSC in Waltham Mass. Or, they may be used to connect to other networks. For example, the IP backbone <b>412</b> may communicate with IP voice networks <b>418</b> or the Internet <b>416</b>. As explained in the copending application, when siphoning traffic to an alternative network both control information (e.g., from the signaling messages) and voice or data from the bearer circuits on links <b>306</b> may be sent via an alternative network.

P-0048[0048] In a specific implementation of the group communication system introduced above, mobile communications users (“users”) belonging to a closed user group (“group” or “CUG”) are provided with an ability to contact each other quickly and easily and thereby start conversing with each other. Each group includes two or more users (“members”), and a user may belong to multiple CUGs. Conversations may occur between two members of a group (“private mode”) or between all available members of a CUG (“public mode”). The group communication system uses conventional mobile communications equipment such as cellular telephones and mobile PDAs.

P-0049[0049] In a specific implementation, the group communication system implements group call logic in proxy switches logically disposed between MSCs and BSCs as described above to intercept group call initiations, bypass the MSCs and the PSTN, and implement the group calls as IP multicast sessions performing Voice over IP (“VoIP”). The users in a group may be served in disparate geographical locations by multiple MSCs spanning an aggregate network that relies one or more on wireless technologies such as CDMA, TDMA (including IS-136 and GSM), GPRS, and third generation technologies. For example, among the group members joined on any one group call, one or more users may be roaming in a GSM network simultaneously with one or more users roaming in a CDMA network. Control information pertaining to a group call can be made available for one or more users such as display participants in the group call while the group call is in progress. Group call lists may be dynamically created and modified by the group call user, using standard numbering schemes such as MIN, IMSI, and ESN.

P-0050[0050] The general architecture for an example embodiment of the group communication system is shown by example in FIG. 7. FIG. 7 shows four users in a group call using wireless devices <b>1060</b>A-<b>1060</b>D connected to different BTS systems <b>1062</b>A-<b>1062</b>D. For the purposes of the following description, it is assumed that the wireless devices have both audio and textual display capabilities. The BTSs are connected to Base Station Controllers (“BSCs”) <b>1064</b>A-<b>1064</b>D, which are connected to proxy switches implementing group call logic (“group call switches”) <b>1066</b>A-<b>1066</b>C. Each group call switch is connected to an MSC such as MSC <b>1068</b>A, <b>1068</b>B, or <b>1068</b>C. At least one group call switch is provided for every MSC in a group call service enabled network. With respect to signaling information, each group call switch is logically located between a corresponding BSC and a corresponding MSC. The group call switch receives signaling and data from the MSC and in the reverse direction from the wireless devices via the BTS and the BSC. Each group call switch operates such that neither the BSC nor the MSC is made aware of the group call switch that lies between the BSC and the MSC. The signaling and control information from the MSC and the BSC is intercepted by the group call switch and is seamlessly passed on to the concerned elements as necessary without any discernible change.

P-0051[0051] The MSCs connect to the Public Land Mobile Network (“PLMN”) <b>1070</b> and the group call switches connect to a backbone multicast enabled IP network (“backbone network”) <b>1072</b>, which provides access to a CUG Active Directory <b>1074</b> and an Enhanced Home Location Register (“HLR”) <b>1076</b>.

P-0052[0052] As described above with respect to the proxy switch of the copending application, the group call switch includes a control plane and a data plane. The functions at the control plane are the termination of the signaling messages from the BSC or the MSC or both. For example, in CDMA networks the signaling messages are defined by the IS-634 protocol specification. The control plane terminates the incoming signals and generates new signaling messages for onward transmission to the MSC or other elements. The control plane also supports a multicast function described below.

P-0053[0053] In one particular embodiment, the data plane of the group call switch receives TDM traffic from the BSC or the MSC or both and uses a TDM cross connect (“DACS”) (FIG. 5) to interface the incoming traffic to an outgoing destination. In other embodiments, the data plane may also receive incoming IP traffic from the Base Station complex (also known as the Radio Access Network, or “RAN”), and switch the incoming IP traffic to outgoing IP traffic. Programmatic control in the control plane determines cross connections between incoming TDM traffic and outgoing destinations, particularly the traditional MSC and/or destinations on an IP network.

P-0054[0054] In the case of the MSC serving as the outgoing destination from the DACS, the group call switch is essentially transparent to the network; traffic and control flows seamlessly from the BSC to the MSC and from the MSC to the BSC. When the outgoing destination is instead on an IP network, a Media Gateway (described in the copending application) in the data plane diverts selected parts of the incoming TDM traffic away from the MSC and converts incoming TDM traffic to RTP/UD/IP traffic and inserts the RTP/UD/IP traffic into the backbone IP network.

P-0055[0055] The CUG Active Directory (“CUG AD”) <b>1074</b>, also known as the Group Call Registry (“GCR”), is a database system containing the CUG data. In a specific implementation, CUG AD in FIG. 15 is implemented as a distributed database system for scalability. The CUG AD contains the definitions of all the CUGs in the group call network. An inquiry to the CUG AD specifies the identifier of a CUG, i.e., the inquiry asks for the definition of a specified CUG, and the result is a list of group user IDs for all the members of the specified CUG. For example, an inquiry specifying CUG ID <b>2347</b> may cause the CUG AD to produce a result that identifies Mobile Identification Numbers (“MINs”) xxx, yyy, zzz, and www for the four users in the CUG. In a specific implementation, MIN numbers are assigned to the users of the GIR service by the service provider.

P-0056[0056] Each CUG is identified to the system by a unique identifier ID derived from a CUG namespace which is partitioned such that different partitions are assigned to different, distributed parts of the CUG AD. A partitioning index of the partitioning scheme is made available to all the group call switches. When a group call switch needs to retrieve the definition of a CUG, the group call switch can use the index to determine the component of the CUG AD to be queried.

P-0057[0057] The Enhanced HLR <b>1076</b> is an enhanced version of the standard HLR database (“standard HLR ”) used in cellular telephony. A standard HLR fields location updates from roaming mobile users. The traditional path traversed by these updates is from the mobile telephone to the BTS, from the BTS to the BSC and then onto the MSC, which sends an update message to the HLR. In a specific implementation of the group call network, the group call switch is located between the BSC and the MSC, which renders all location updates visible to the group call switch. For users who have subscribed to the group call service, the group call switch intercepts location update messages and replicates them to the HLR′. In addition to thereby storing the cellular location of the group call users, HLR′ also stores a listing of all the CUGs to which each group call user belongs. A query to HLR′ specifies a MIN identifying a group call user and produces a response that includes is a list of the CUGs in which the group call user is a member.

P-0058[0058] In a specific implementation, HLR′ is a distributed database in which the distribution of the data is based on the MIN hierarchy. Alternatively, HLR′ could also be based on International Mobile Subscriber ID (“IMSI”) or Equipment Serial Number (“ESN”). An index similar to the partitioning index described above for the CUG namespace allows a group call switch to determine the HLR′ partition to be queried when an incoming request is to be processed.

P-0059[0059] In the following example for a family, a CUG may be defined as having users Dad, Mom, and Teenager, each of whom carries a cellular telephone. By pressing a special sequence of keys on his cellular telephone (or a special key if provided on the telephone), Dad can cause execution of a group call initiation process that locates Mom and Teenager and invites Mom and Teenager to join a group call. In the half duplex implementation described below, when the group communication system confirms that at least one member of the CUG has joined the group call, Dad as the initiating joined member is assigned speaking control and can start speaking while the other joined member or members listen. When Dad relinquishes speaking control, any of the other joined members of the CUG (e.g., Teenager if Teenager has joined the call) can gain speaking control and speak. Thus, in the half duplex implementation, only the joined member who has been assigned speaking control can speak; another joined member cannot speak until speaking control is relinquished and re-assigned. As described in detail below, to request speaking control, a user on a group call may press a standard number key on the telephone, may press a special key if provided by the telephone manufacturer, or may send a text message to the current speaker requesting to speak next, if the telephones have text messaging capability. If at some point during the call speaking control remains unassigned for a predetermined period of time (i.e., the conversation is done), the call is terminated.

P-0060[0060] A group call can be arranged when all members of a CUG are in the same switching area, i.e., in a geographical area controlled by a single MSC or proxy switch, or are in different switching areas. For example, in the case of a CUG having users A, B, C and D, A and B may currently be roaming in switching area S<b>1</b>, C in switching area S<b>2</b>, and D in switching area S<b>3</b>. If the S<b>1</b>, S<b>2</b>, S<b>3</b>, and S<b>4</b> switching areas are either all operated by the same service provider or are administered by operators who have agreed to cooperate with each other to offer group call service, a group call can be established that connects A, B, C and D. If so, the individuals may be widely dispersed with respect to physical location, e.g., A and B may be in Boston, C may be in Texas, and D may be in California.

P-0061[0061] The group communication system provides interoperability of calls across heterogeneous network technologies, i.e., allows a group call to be established regardless of whether members of a CUG are roaming across networks that are based on different technologies. For example, user A may be in Boston roaming in a Code Division Multiple Access (“CDMA”) based network while B is roaming in the United Kingdom (“UK”) in a Global System for Mobile Communications (“GSM”) based network (GSM uses Time Division Multiple Access (“TDMA”) technology). If A and B belong to the same CUG and the CDMA and GSM operators have agreed to cooperate in offering the group call service, a group call can be established between A and B.

P-0062[0062] The system may include one or more of the following enhancements, which are described in more detail below. As is apparent from the description above, a group call can be established regardless of whether all of the members of a CUG are joined to the call. If some members of a CUG cannot be joined on a group call, an exception list listing the missing members may be generated and recorded by the system. If one or more members of the CUG have telephones having display screens, the exception list may be displayed on the display screens. Further actions may be taken based on the exception list. For example, during or after the call, a voicemail message may be sent to the members listed in the exception list; for instance, the voicemail message may be recorded once by the call initiator and may be delivered by the group communication system to voicemail boxes at previously specified voicemail telephone numbers for the members on the exception list. Instead or in addition, the CUG members joined to a particular group call may be listed on the available display screens of the telephones of all the joined members during the call, to make each joined member aware of which other members are on the call. A visual indication may be provided on the available display screens to identify the member who currently has speaking control.

P-0063[0063] A private call may be established by a user of the group communication system with another user of the group communication system, so that the users can discuss confidential or personal information outside of a group call. Thus, two participants in an ongoing group call may temporarily engage in a private call and then return to the ongoing group call.

P-0064[0064] A user of the group communication system may request a listing of group calls in progress (“active group calls”) for CUGs in which the user is a member, and join one of such calls. A user of the group communication system may initiate or join a public group call, i.e., a group call for a CUG that includes every user of the group communication system. An operator may define any number of public user groups (“PUGs”). Each user of the group communication system is automatically made a member of all PUGs. To join an active public group call, the user requests a listing of active public group calls and selects a call in which to participate.

P-0065[0065] If a user of the group communication system has call waiting capability, the user can place a group call on hold and answer an incoming call signal. A user who does not want to accept any incoming call signals, including for group calls, may activate call forwarding or call blocking. A user may elect to block only incoming call signals for group calls, for private calls, or for both.

P-0066[0066] The group communication system may incorporate speech-to-text translations in group calls for the benefit of users who are in a noisy environment, users in public places where audible telephone use is restricted, and hearing impaired users, and may incorporate language translations (e.g., from English to French).

P-0067[0067] A user of the group communication system may be contacted using the user's mobile telephone number or a special group communication system identification number (“group user ID”) that the service provider may assign during group service sign-up based on contact information that is stored in the user's telephone phone directory. Group user IDs may be self set up (“self-provisioned”) instead or in addition using a Web-based provisioning system as described below.

P-0068[0068] As noted above, the group communication system provides three modes of operation: Closed User Group (“CUG”) mode, Private mode, and Public User Group (“PUG”) mode. Except in the case of user controlled calls as described below, the user presses a number key (or special telephone key if provided) to talk, and waits to hear a tone indicating that the user has been granted speaking control. When the user is finished talking, the user may press a key, which causes the other joined users to hear a tone indicating that speaking control is available. Another joined user may then press a key, hear a tone, and begin talking. The initiator starts with speaking control after at least one other user has joined the call as indicated by a tone. The call ends when all joined users have hung up or when no one has requested speaking control for a period of time, as noted above. The system resolves conflicts arbitrarily between simultaneous requests from users for speaking control. For example, a “human protocol” may be used if a full duplex mode for conversations is available. In such a case, control can be passed to multiple users, such that eventually all but one user become silent, and speaking control is transferred to that non-silent user.

P-0069[0069] In CUG mode, group call users form a Closed User Group by creating a unique group ID for a list and assigning members to the list using the members' group call IDs and their mobile telephone numbers. Inasmuch as the handsets are to be signaled by the Radio Access Network (“RAN”) under the direction of the proxy switch, and since the RAN uses mobile telephone numbers to effectuate such signaling, the CUG information includes mobile telephone numbers. Each CUG includes two or more users, optionally with a maximum size imposed by the service provider.

P-0070[0070] In a specific implementation, if the group call user wants to contact a group of users in the user's community (i.e., CUG mode), the user keys in (“enters”) a call initiation sequence, e.g., *4 followed by the CUG ID, and presses the send key. (The call initiation sequence may also be stored in and dialed from the speed dialing directory of the user's telephone.) A member of the CUG who is not able to join the call when first notified can join the call later, if the call is still active, by entering the call initiation sequence and pressing the send key.

P-0071[0071] In CUG mode, the call initiator has the option of requesting a user controlled call, which is a call having a “barge-in” capability. According to the barge-in capability, a listening user may send an alert message to the speaking user by pressing a service configurable DTMF sequence of keys, to indicate to the speaking user that the listening user would like to assume speaking control. At that point, the speaking user may press a key to relinquish speaking control, or may continue to talk. Accordingly, the barge-in capability provides the speaking user with an audible notification of a listening user's desire to speak, and, in the case of a telephone having a text display, may also provide a text message displaying the name of the listening user who sent the barge-in message. Thus, the speaking user is not forced to guess that a listening user would like to speak. When the speaking user wants no interruptions (e.g., during an announcement to a large group of people), the barge-in capability may be disabled.

P-0072[0072] As described above, CUG mode may also provide an attendance reporting with speaker identification capability and an attendance exception with broadcast capability.

P-0073[0073] Call transcription capability may be provided in CUG mode such that speech-to-text technology is used to transcribe a group call in real time. A group member who has a text display telephone and is notified of the group call can request to mute the call and receive a text transcription instead. In a specific embodiment, a non text display telephone sends and receives audio only and a text only device such as text pager receives text, and if the call transcription capability is not turned on, text only devices are not notified of the group call. A full transcription of the call may be available at the end of the call, and may be sent to all members of the CUG, CUG members who did not join the call (based on an attendance exception list), or the call originator. The capability may be extended to translation services, using the preferred language indicator available with IS-41-C. The preferred language indicator is an information element included in the profile of the subscriber and stored in the HLR database, to indicate a preference of the subscriber with respect to the language in which announcements and other reports should be presented. The switch uses the preferred language indicator when playing pre-stored announcements. Additional resources such as human or automated translator may be provided by the service provider.

P-0074[0074] Group call IDs and the associated list of members may be set up using a Web based provisioning application from a personal computer, or from a WAP enabled device. The user may also set up a list from the user's mobile telephone. The service provider specifies the limit to the number of members on a list, the network or networks to which the members belong, and the number of lists that a group call user may maintain.

P-0075[0075] In private mode, the group call user may quickly invoke a call to any member of the user's group that is connected to a group call enabled network by entering the group call initiation sequence, e.g., *4 followed by the group call ID of the intended recipient member, and pressing send. The intended recipient member is notified of a call from the user and, in a specific embodiment, the user hears a chirp when the intended recipient member has answered the call.

P-0076[0076] In PUG mode, the group call user may view a list of current chat groups and decide to join a chat group. The group call user may create a new chat group that is available to any group call user, by specifying a unique group call ID, and providing a brief text description of the subject of the group. The subscriber may optionally associate a text name with the group call ID, as long as the text name is unique across the current active chat groups.

P-0077[0077] The group call feature does not take precedence over existing mobile telephone features such as call forwarding, do not disturb, and call blocking. Callers on a group call are able to switch to an incoming call if call waiting is enabled. Three way calling, call conferencing, and call transfer are disabled during a group call for security reasons, and are re-enabled at the culmination of the group call.

P-0078[0078] The group call service supports conversation encryption using the IS-41-C Voice Privacy (“VP”) feature, as requested by the mobile telephone, if the corresponding base station supports VP.

P-0079[0079] In a specific implementation described in more detail below, the group call service operates in the IP network using IP multicast. As described above, IP multicast allows a source to send a single copy of a stream of VoIP packets which is received by multiple recipients who have explicitly registered to receive the stream. Multicast is a receiver-based concept such that receivers join a particular multicast session group and the stream is delivered to all members of that group by the network infrastructure. Only one copy of a multicast stream is passed over any link in the IP network, and copies are made only at IP multicast enabled media gateways as necessary.

P-0080[0080] In the wireless network, the service has some characteristics of any conventional wireless call. As described above, the group call initiator invokes a group call by sending a DTMF feature escape sequence followed by the ID of the group call list of users the initiator wants to contact (e.g., “*4” followed by the user group ID). The feature escape sequence is used by the proxy switch to detect that the call is a group call and queries the Global Call Registry (“GCR” or “CUG AD”) to retrieve the list of mobile telephones to contact and their current locations. The current location information determines which Media Gateways and BSCs are to be involved in the group call. Bearer channels are established between each such BSC and the corresponding Media Gateway via the group call switch data plane. The group call is presented to each BSC as having conventional point-to-point call set-up and tear down characteristics, and is not presented to the MSC.

P-0081[0081] An example call flow diagram for the basic service, within the wireless network, is shown in FIGS. <b>8</b>A-<b>8</b>C, wherein WCS-<b>1</b> and WCS-<b>2</b> represent group call switches. With reference to FIGS. <b>9</b>-<b>10</b> as well, the principal entities in the flow diagram are group call switches WCS-<b>1</b>, WCS-<b>2</b> having respective media gateways MG<b>1</b>, MG<b>2</b>; a GCR that is accessible by WCS-<b>2</b>; BSCs BSC-<b>1</b>, BSC-<b>2</b>; and mobile stations (e.g., telephones) MS-A, MS-B. In the example, MS-A and MS-B happen to be covered by the same group call switch WCS-<b>1</b>, but the procedure would be the same if MS-A and MS-B were covered by different group call switches.

P-0082[0082]FIG. 10 illustrates a group call logic flow diagram summarizing the call flow diagram of figures <b>10</b>A-<b>10</b>C for setting up a group call. The share of the logic handled by WCS-<b>1</b> is shown on the left and the share of the logic handled by WCS-<b>2</b> is shown on the right. WCS-<b>1</b> detects that MS-A has requested a group call (step <b>3010</b>) and so informs WCS-<b>2</b> (the group call coordinator) (step <b>3020</b>). WCS-<b>2</b> refers to the GCR to determine the other members of MS-A's CUG and their last known locations (step <b>3030</b>). (In this simple example, MS-B represents the only other member.) WCS-<b>2</b> creates a Media Gateway connection to WCS-<b>1</b> (the group call switch for MS-A) (step <b>3040</b>). WCS-<b>1</b> acquires a wireless channel for MS-A (step <b>3050</b>). WCS-<b>2</b> tells WCS-<b>1</b> (the group call switch for MS-B) to page MS-B (step <b>3060</b>). WCS-<b>1</b> pages MS-B (step <b>3070</b>) and then informs WCS-<b>2</b> that MS-B was found (step <b>3080</b>). WCS-<b>2</b> creates a Media Gateway connection to WCS-<b>1</b> (the group call switch for MS-B) (step <b>3090</b>). WCS-<b>1</b> acquires a wireless channel for MS-B (step <b>4000</b>) and informs WCS-<b>2</b> that the acquisition has been accomplished (step <b>4010</b>). WCS-<b>2</b> tells WCS-<b>1</b> to indicate to MS-A that MS-B has been reached (step <b>4020</b>) and then causes a tone to played to MS-A through the Media Gateways (step <b>4030</b>).

P-0083[0083] Further call flow examples are explained below in connection with FIGS. <b>12</b>-<b>15</b>.

P-0084[0084] As described above, in group calls, only one joined user is permitted to speak at a time; a joined user having speaking control can relinquish such control sending a predefined DTMF digit (e.g., “1”), and another joined user may then request speaking control by sending a DTMF digit (e.g., “8”). The joined user who has speaking control hears a success tone played when the send path is established as depicted in FIG. 11.

P-0085[0085] Prior to the group call, a group call user may elect to enable or disable one or more of the following features described above: attendance exception reporting, attendance reporting, call transcription, and barge-in capability.

P-0086[0086] In the Web based set up system that is available to end users to establish their GCR lists, the Web server connects to the GCR over an IP link to enable real time updates of users' group call lists. The set up system supports both the WAP protocol as well as standard industry browsers.

P-0087[0087] Call logs are collected for all participants in a group call, for accounting and network engineering purposes.

P-0088[0088]FIG. 12 illustrates an example, now described, of an application of the group call service. According to the example, CUG<b>1</b> is a CUG having four users A, B, C, and D. Users A and B are currently served by group call switch G<b>1</b>, C is served by group call switch G<b>2</b>, and D is served by group call switch G<b>3</b>. The users have been assigned unique MINs by the group call service provider. For simplicity, the unique MINs are referred to as A, B, C, and D here. CUG<b>1</b> has a unique identifier that is assigned by the service provider and that is represented here as CUG<b>1</b>. The definition of CUG<b>1</b>, i.e., the CUG<b>1</b> membership list, is maintained in a distributed component of the CUG AD called AD<b>1</b>.

P-0089[0089] In a first example exercise, a group call is originated by A to group CUG<b>1</b>, i.e., to B, C, and D. FIG. 12 is a call flow diagram of the group call.

P-0090[0090] A originates a group call request for closed user group CUG<b>1</b>. In the IS634 interface, the request is represented as a CM_service_request with CUG<b>1</b>. In the case of the Radio Access Network (“RAN”), the request is much like any other call request. The IS634 commands and information elements involved include, among other information items, the calling number and the called number (e.g., assumed to be CUG<b>1</b> in the current example). In at least some cases the RAN does not have the logic to distinguish valid numbering plans from invalid numbering plans, which logic may be implemented in the MSC. In such cases, the RAN forwards the number information as part of the IS634 message set to the MSC. Inasmuch as the proxy switch intercepts such messages, the number information becomes available to the proxy switch. Since the proxy switch can function in at least some ways as an MSC, the proxy switch can determine that an incoming call request is not a conventional call request, but rather a group call request for a closed user group. In such an instance, the proxy switch assumes the role of a group call switch and initiates procedures for a group call.

P-0091[0091] Group call switch G<b>1</b> issues a channel assignment request back to A. G<b>1</b> also initiates a directory transaction to retrieve the definition of group CUG<b>1</b> from the CUG AD component AD<b>1</b>. The response from AD<b>1</b> is expected to include the list of MINs corresponding to the members of group CUG<b>1</b>, i.e., B, C, and D. When the response is received, G<b>1</b> has obtained the following information:

P-0092[0092] CUG<b>1</b> includes of members B, C and D (in addition to A)

P-0093[0093] MIN B is the responsibility of switch G<b>1</b> (i.e., itself)

P-0094[0094] MIN C is the responsibility of switch G<b>2</b>

P-0095[0095] MIN D is the responsibility of switch G<b>3</b>

P-0096[0096] G<b>1</b> initiates a call set up request to B (which is the responsibility of G<b>1</b> itself), and sends call setup requests to G<b>2</b> and G<b>3</b> for C and D, respectively. Thus, G<b>2</b> and G<b>3</b> act as proxy switches for G<b>1</b> for this particular group call. G<b>1</b> also ensures that a new context is created in which TDM traffic is directed from the RAN to the Media Gateway, which converts the TDM traffic to RTP/UDP/IP packets and sends the RTP/UDP/IP packets to a multicast router. The multicast router is instructed to receive the packets, add A to the multicast group, and multicast the packets to the specified multicast group. In the call flow diagram of FIG. 18, the instructions are shown collectively as “Join Multicast Group (TDM A)”.

P-0097[0097] G<b>1</b> then awaits connect messages from B, G<b>2</b>, and G<b>3</b>. Any of these three messages could be received in any order, and it is possible that only a subset of them is received. In the example, G<b>1</b> first receives a connect message from B, followed by connect message from G<b>2</b> and G<b>3</b>. Upon receiving the connect message from B, G<b>1</b> sends a “Join Multicast Group (TDM B)” message which causes the Media Gateway to accept RTP/UDP/IP traffic from the multicast router, convert the RTP/UDP/IP traffic to TDM, and send the TDM to switch G<b>1</b> which will cause the TDM to be transmitted via the BSC and BTS to B. The multicast router is instructed to add B to the current multicast group. Thus, for purposes of the current group call, switch G<b>1</b> serves as a source of TDM traffic and switch G<b>2</b> serves as a sink for TDM traffic.

P-0098[0098] In the example, C sends a connect message to G<b>2</b> (i.e., the switch that is responsible for C) which in turn sends a connect message to G<b>1</b>. G<b>1</b> then sends a “Join Multicast Group (TDM C)” message causing C to be joined to the group call in RECEIVE mode. Similarly, the connect message from D to G<b>3</b> is relayed to G<b>1</b> which causes D to added to the multicast group.

P-0099[0099] The Media Gateway is instructed by the control plane to receive or send packets at certain RTP ports only in a particular context. Packets are multicast by the router to the members of the multicast group.

P-0100[0100] Since, at this juncture, G<b>1</b> has received at least one confirmation of a user that has joined the group call, G<b>1</b> sends a success tone to A indicating that the group call may now proceed. A is in SEND mode and B, C, and D are in RECEIVE mode, and the multicast router can perform a multicast to B, C and D.

P-0101[0101] In another example exercise, a transfer of speaking control is performed, as illustrated in the call flow diagram of FIG. 13. Specifically, A relinquishes speaking control which is acquired by C.

P-0102[0102] To relinquish speaking control, A signals G<b>1</b> which causes G<b>1</b> to put the current group call in INACTIVE mode. (As explained above, if no user acquires speaking control within a specified time as measured by a system timer, the group call is terminated.) C issues an Acquire Talk command to its responsible switch G<b>2</b>. Since, for the purposes of the current group call, switches G<b>2</b> and G<b>3</b> are proxies for G<b>1</b> which is the controlling switch, the Acquire Talk command is relayed to G<b>1</b>. G<b>1</b> issues a MODIFY CONTEXT command to the Media Gateway that causes the Media Gateway associated with switch G<b>2</b> to accept incoming TDM traffic from C, convert the TDM traffic to RTP/UDP/IP and send the RTP/UDP/IP to the multicast router. The Media Gateway is instructed to halt receiving TDM traffic from A. The multicast router is instructed to change the mode of A to RECEIVE and the mode of C to SEND. G<b>1</b> issues a Grant Talk message to G<b>2</b> which sends a success tone to C indicating that C can now proceed to speak. The multicast session can now proceed as shown with C as the speaker and A, B, and D as the listeners.

P-0103[0103] If B, for example, issues an Acquire Talk message while speaking control is with C, the message is sent to B's responsible switch G<b>1</b> which denies the request (because C has not relinquished speaking control) and sends a failure tone message to B.

P-0104[0104] In a further example, the situation is simplified so that the group call has two participants A and B, with A having speaking control. The network includes a single group call switch G<b>1</b> which includes a control plane CS and controls two Media Gateways MG<b>1</b> and MG<b>2</b>. Traffic to and from A travels via MG<b>1</b> and traffic to and from B travels via MG<b>2</b>, as illustrated in the call flow diagram of FIG. 14.

P-0105[0105] Since A has speaking control, the system responds to a Relinquish Control command only from A. The command is received by the control plane CS of the G<b>1</b> which issues a Modify Context command to MG<b>1</b> instructing MG<b>1</b> to modify the context of the call by disallowing TDM traffic from A. The system goes into an INACTIVE state awaiting an Acquire Control command. If no such command is received within a specified time period as measured by an inactivity timer, a Call Release request is sent from CS to A and MS B. In addition, destroy context commands are sent to MG<b>1</b> and MG<b>2</b>. The group call release sequence is complete when Release Complete messages are received from A and B and Destroy Context Complete messages are received from MG<b>1</b> and MG<b>2</b>.

P-0106[0106]FIG. 15 illustrates an example of call flow with respect to database record keeping in the case of roaming, i.e., location updates.

P-0107[0107] Three mobile stations A, B, and C are involved. A and B are the responsibility of a control plane CS<b>1</b> of a group call switch and C is the responsibility of a control plane CS<b>2</b> of another group call switch. A roams and issues a location update which is received by CS<b>1</b> via the BTS and BSC. CS<b>1</b> consults the index based on IMSI/MIN/ESN to determine the appropriate HLR′ for A, e.g., HLR′<b>1</b>, and issues a location update request to HLR′<b>1</b>. HLR′<b>1</b> determines by its database all of the CUGs to which A belongs. With this information, HLR′<b>1</b> issues a location update request to CUG AD. Accordingly, CUG AD includes the updated location of A in CUGs to which A belongs.

P-0108[0108] While roaming, B also issues a location update, which comes to CS<b>1</b>. Based on IMSI/MIN/ESN, CS<b>1</b> determines the appropriate HLR′ for B, namely, HLR′<b>2</b>. CS<b>1</b> issues a location update request to HLR′<b>2</b> that finds all CUGs to which B belongs. HLR′<b>2</b> issues a location update request to CUG AD asking CUG AD to update all CUGs to which B belongs to with the new location of B.

P-0109[0109] Location updates from C are received at CS<b>2</b>. CS<b>2</b> determines the appropriate HLR′, e.g., HLR′<b>2</b>, sends the location update to HLR′<b>2</b>, which asks the CUG AD to update the corresponding CUGs for C.

P-0110[0110] Variations

P-0111[0111] The above embodiments all facilitate the realization of inventive group calling. Subsets of the functionality, however, still provide advantages over the state of the art. For example, group calling using technology other than multicasting on the IP network may still offer many of the advantages discussed above. In particular, standard telephone connections using the PTSN may be inserted in place of IP multicast connections.

P-0112[0112] In another example, the group call switch may be deployed on the trunk (“the back”) side of the MSC. In such an embodiment, the group calling feature may operate as described below.

P-0113[0113]FIG. 16 illustrates a group call switch deployed on the back side of the MSC, with fixed links using standard ISDN User Part (“ISUP”) landline signaling. The MSC connects to the Home Location Register (“HLR”) using IS-41 (also known as MAP) protocol. The group call switch and the MSC are also inter-connected with bearer trunks that carry voice traffic between the two switches. The group call switch has a TDM connection to the PSTN and an IP connection to an IP network from its data plane (also known as Media Gateway). The group call switch may also query the HLR using IS-41. (FIG. 16 shows the two MSC switches independently connected to the PSTN, but both switches may be connected to the same PSTN.) Both group call switches have access to the Active Directory (CUG-AD) via the IP network.

P-0114[0114] The deployment shown in FIG. 16 may be used for group calling. For example, Mobile Station (MS) A may be connected to MSC-<b>1</b> via RAN-<b>1</b> and two Mobile Stations B and C may be connected to MSC-<b>2</b> via RAN-<b>2</b>. Subscriber A may have a CUG that includes B and C as members. As explained above, A may use a special group call initiating sequence to signal to the MSC that it wishes to make a group call. MSC-<b>1</b>'s logic determines that the incoming call request is a group call and diverts the call request to the group call switch GCS- <b>1</b> using the ISUP protocol. The group call switch GCS-<b>1</b> uses its internal logic to access the Active Directory CUG-AD to determine the members of the CUG being called.

P-0115[0115] In this example, the inquiry yields the MIN numbers of members B and C. In this case of deployment on the back side of the MSC, the group call switch does not have access to location updates; hence the HLR′ does not contain the current locations of the called mobile stations. However, the HLR contains this information. Thus, the group call switch GCS-<b>1</b> may make an IS-41 inquiry (“location request”) to the HLR inquiring for the location of the mobile stations B and C. For the purposes of the example, mobile stations B and C may be currently located in a switching area controlled by MSC-<b>2</b>. Following standard mobile telephony practice, this information is contained in the HLR database and the HLR now contacts MSC-<b>2</b> (via a “route request”). Inasmuch as MSC-<b>2</b> is using GCS-<b>2</b> on the trunk side, the route request from the HLR is received by GCS-<b>2</b>. GCS-<b>2</b> returns a Temporary Local Directory Number (“TLDN”) to the HLR which forwards this information to the sender (GCS-<b>1</b>) of the original location request. GCS-<b>1</b> determines that the TLDN belongs to GCS-<b>2</b> and notifies GCS-<b>2</b> about the group call. GCS-<b>2</b> instructs MSC-<b>2</b> to set up a group call to mobile stations B and C. Further interactions proceed as described above for the non back side case, with MSC-<b>1</b> and MSC-<b>2</b> becoming effectively transparent for the purposes of the group call.

P-0116[0116] The back side of the switch deployment for group calling has an attendant benefit that may be apparent from FIG. 16. In the case of such a deployment, conventional landline telephones such as telephone D shown in FIG. 16 can also be involved in a group call. Thus, a CUG member may register a landline telephone number as its “reach” number in the CUG Active Directory. If such a subscriber such as D needs to be included in a group call, the relevant group call switch may ask the Serving MSC to complete a PSTN call to D using the stored reach number of the subscriber.

P-0117[0117] As described above, IP multicast technology may be used as the basic transport technology for group calling. However, in at least some cases, standard implementations of IP multicast technology may prove inefficient for satisfying the needs of widely dispersed CUG members. The dynamic call-by-call setting up of multicast tunnels to carry traffic between multicast-enabled routers may take an excessively long time. Subscribers who experience long group call setup times may either hang up or re-try the call, which may result in unsatisfactory user experience. Long delays in call setup times may also lead to inefficient signaling network utilization.

P-0118[0118] For example, as shown in FIG. 17, a number of multicast-enabled routers, e.g., MCR-<b>1</b>, MCR-<b>2</b>, MCR-<b>3</b>, may be present in an IP network. In the example, the locations of these routers is fixed and is not subject to change. The multicast routers are connected to group call switches (either in front of the MSC or on the back side of the MSC as described above) and hence to mobile telephones via the corresponding Radio Access Networks (RANs). (Although FIG. 17 shows each multicast router connected to a single group call switch, multiple group call switches may be connected to a single router.) If a subscriber initiates a group call based on the members of the relevant CUG, one or more of the multicast routers can be involved in the call. In particular, tunnels are set up between the corresponding multicast routers as noted above. If the setting up of these tunnels is delayed excessively, the quality of the group call may suffer as a result.

P-0119[0119] As now described, the IP tunnels can be set up ahead of time in such a way that a number of group call initiation requests that arrive later can be serviced by these tunnels. Inasmuch as the tunnels are set up ahead of time, in anticipation of future group call requests, the post-initiation set up delay is thereby reduced or eliminated. The tasks involved include predicting the demand for group calls that are expected to arrive in the future, and determining the topology of the IP tunnels that need to be set up to satisfy the predicted demand.

P-0120[0120] Demand prediction relies on historical information in the form of group call logs. The history of group calls is divided into a series of windows, with each window being defined over a length of time, known as the “window size”, that may range from a couple of minutes to several dozen minutes and is proportional to average holding times of group calls. The actual window size used in demand prediction can be varied based on the desired accuracy of the predictions and the computing resources to be used in deriving the predictions. Generally, shorter window sizes yield more accurate predictions than larger window sizes but cause more wasteful consumption of computational resources. Also, shorter windows tend to be more responsive to bursty traffic and to be less likely to smooth out aberrations. Each window includes a number of group call requests along with the parameters describing the calls, i.e., the number of GIR calls between any two multicast routers. As used below, X(I,J,N) denotes the number of group calls between routers I and J in window N.

P-0121[0121] The following example illustrates predicting the future demand for group calls. In the example, the history of group calls is divided into 4 windows, with window <b>1</b> being the earliest in time and window <b>4</b> being the latest in time (i.e., the current window). To calculate the demand in the next (future) window, i.e., window <b>5</b>, the following smoothing formula is used:

<i>X</i>(<i>I,J,</i>5)=(1−α)*<i>X</i>(<i>I,J,</i>4)+α*(1−α)*<i>X</i>(<i>I,J,</i>3) +α*α*(1−α)*<i>X</i>(<i>I,J,</i>2)+α*α*α*(1−α)*<i>X</i>(<i>I,J,</i>1)

P-0122[0122] In the formula, α (alpha) is an empirically determined weight factor with a value between 0 and 1. As expressed in the formula, the prediction of traffic for the next window of time is based on giving more preference to more recent windows than to earlier windows. This preference is clearly apparent if the formula is re-written in its more general recurrence form, as follows:

<i>X</i>(<i>I,J,N</i>)=(1−α)*<i>X</i>(<i>I,J,N</i>-1)+α*<i>X′</i>(<i>I,J,N</i>-1)

P-0123[0123] where X′(I,J,N-<b>1</b>) is the smoothed estimate encapsulating the past history up to N-<b>1</b>.

P-0124[0124] In the formula, “Current” refers to the latest window in the time sequence. Based on this formula and given a history (windows <b>1</b> through N) of demands, as exemplified by the values of the parameter X(I,J,N), a table of values T(I,J) (“demand matrix”) can be calculated for the next window such that the value in row I and column J represents the number of predicted group calls in the upcoming window between multicast routers I and J.

P-0125[0125] With respect to determining the topology of the tunnels for satisfying the demand, the following information is used as inputs: the point to point demand matrix for group calls between any two multicast routers; a cost structure of the tunnels by the service provider, i.e., the cost for establishing a tunnel of a particular capacity between any two routers; the service provider's delay guarantees, i.e., the maximum delay in the IP transport network between any two particular multicast routers; and quality of service (“QoS”) constraints that need to be satisfied by the group calls.

P-0126[0126] In view of such inputs, the topology of the tunnels between the multicast routers, i.e., which tunnels with what capacity to connect which multicast routers, is determined in a way such that the topology accounts for the following constraints: the tunnels emanating from each multicast router do not exceed the total output capacity of the router (in bits per second), and the number of tunnels emanating from each multicast router does not exceed the internal limit on the number of tunnels of the router.

P-0127[0127] As described below, a mathematical optimization technique of Integer Linear Programming (“ILP”) is used in determining the least cost topology, in view of the following points as explained below: a recognition that the case is “NP-hard”; and a formulation of the task as a degree constrained multi-commodity flow that can be solved using ILP techniques.

P-0128[0128] According to the theory of NP-hardness, a case that can be shown to be NP-hard is not expected to have an efficient algorithmic solution. A given case, e.g., X, may be shown to be NP-hard by considering a case already regarded as NP-hard, e.g., Y, and showing that Y reduces to X in a polynomial time transformation. The tunnel topology design case can be shown to be NP-hard by observing that it is a generalization of the unsplittable multi-commodity flow problem (see J. Kleinberg, “Single source unsplittable flow,” Proc. of the 37th IEEE Symposium on Foundations of Computer Science, 1996.).

P-0129[0129] Thus, the tunnel topology case is recast in a form, shown below, that is suitable for application of ILP approximation techniques.

P-0130[0130] INPUT

P-0131[0131] Let N denote the number of multicast routers in the network.

P-0132[0132] Let D(max,I) denote the maximum number of tunnels that router I can set up.

P-0133[0133] Let p(t,l) denote the unit cost of tunnel l for trunk of type t. Here, “l” denotes a pair of nodes l=(i,j) for multicast-enabled routers (MCRs) i and j.

P-0134[0134] Let τ (Tau) denote the set of all possible types of trunks (DSO, DS<b>1</b>, OC<b>3</b>, etc.) Let T(I,J) denote the demand matrix, i.e., the predicted group call traffic between routers I and J for a given future time period.

P-0135[0135] Let C(I) denote the capacity of router I in bits per second.

P-0136[0136] Let R(I,J) be the set of all feasible routes for routing traffic between router I and J. (This is a pre-processing step that generates all feasible quality of service paths between MCRs I and J.)

P-0137[0137] OUTPUT DECISION VARIABLES

P-0138[0138] Y(t,l): number of units of type t trunks allocated on link l.

P-0139[0139] X(p): amount of traffic flow on path p.

P-0140[0140] z_I: a binary valued variable with value 1 if link “1” is allocated non-zero capacity; otherwise its value is 0.

P-0141[0141] ILP FORMULATION

P-0142[0142] Minimize <maths id="MATH-US-00001" num="1"><math overflow="scroll"><mrow><munder><mo>∑</mo><mn>1</mn></munder><mo></mo><mrow><munder><mo>∑</mo><mrow><mi>t</mi><mo>∈</mo><mi>τ</mi></mrow></munder><mo></mo><mrow><msubsup><mi>p</mi><mn>1</mn><mi>t</mi></msubsup><mo></mo><msubsup><mi>y</mi><mn>1</mn><mi>t</mi></msubsup></mrow></mrow></mrow></math><img file="US20030017836A1-20030123-M00001.TIF" id="EMI-M00001" he="19.93005" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00001" attachment-type="nb" file="US20030017836A1-20030123-M00001.NB" /></attachments></maths>

P-0143[0143] subject to

P-0144[0144] Demand Satisfaction (the tunnel topology satisfies the demand matrix): <maths id="MATH-US-00002" num="2"><math overflow="scroll"><mrow><mrow><munder><mo>∑</mo><mrow><mi>p</mi><mo>∈</mo><msub><mi>R</mi><mi>ij</mi></msub></mrow></munder><mo></mo><msub><mi>x</mi><mi>p</mi></msub></mrow><mo>≥</mo><mrow><msub><mi>T</mi><mi>ij</mi></msub><mo></mo><msub><mo>∀</mo><mrow><mi>i</mi><mo>,</mo><mi>j</mi></mrow></msub></mrow></mrow></math><img file="US20030017836A1-20030123-M00002.TIF" id="EMI-M00002" he="22.08465" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00002" attachment-type="nb" file="US20030017836A1-20030123-M00002.NB" /></attachments></maths>

P-0145[0145] Sufficient Tunnel Capacity (the total flow on all paths can be handled by the capacity of the chosen trunks): <maths id="MATH-US-00003" num="3"><math overflow="scroll"><mrow><mrow><munder><mo>∑</mo><mi>ij</mi></munder><mo></mo><mrow><munder><mo>∑</mo><mtable><mtr><mtd><mrow><mi>p</mi><mo>∈</mo><msub><mi>R</mi><mi>ij</mi></msub></mrow></mtd></mtr><mtr><mtd><mi>and</mi></mtd></mtr><mtr><mtd><mrow><mn>1</mn><mo>∈</mo><mi>p</mi></mrow></mtd></mtr></mtable></munder><mo></mo><msub><mi>x</mi><mi>p</mi></msub></mrow></mrow><mo>≤</mo><mrow><munder><mo>∑</mo><mrow><mi>t</mi><mo>∈</mo><mi>τ</mi></mrow></munder><mo></mo><mrow><msubsup><mi>y</mi><mn>1</mn><mi>t</mi></msubsup><mo></mo><mstyle><mtext> </mtext></mstyle><mo></mo><mrow><mo>∀</mo><mn>1</mn></mrow></mrow></mrow></mrow></math><img file="US20030017836A1-20030123-M00003.TIF" id="EMI-M00003" he="41.0508" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00003" attachment-type="nb" file="US20030017836A1-20030123-M00003.NB" /></attachments></maths>

P-0146[0146] Port Constraints (the number of tunnels emanating and terminating into a router do not exceed the router's internal set maximum): <maths id="MATH-US-00004" num="4"><math overflow="scroll"><mrow><mstyle><mtext> </mtext></mstyle><mo></mo><mtable><mtr><mtd><munder><mo>∑</mo><mrow><mrow><mn>1</mn><mo>:</mo><mrow><mo>(</mo><mrow><mi>i</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow><mo></mo><msup><mo>=</mo><mi>Δ</mi></msup><mo></mo><mn>1</mn></mrow></munder></mtd><mtd><mrow><msub><mi>Z</mi><mn>1</mn></msub><mo>≤</mo></mrow></mtd><mtd><mrow><msubsup><mi>D</mi><mi>i</mi><mi>max</mi></msubsup><mo></mo><msub><mo>∀</mo><mi>i</mi></msub></mrow></mtd></mtr><mtr><mtd><munder><mo>∑</mo><mrow><mrow><mn>1</mn><mo>:</mo><mrow><mo>(</mo><mrow><mi>i</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow><mo></mo><msup><mo>=</mo><mi>Δ</mi></msup><mo></mo><mn>1</mn></mrow></munder></mtd><mtd><mrow><msub><mi>Z</mi><mn>1</mn></msub><mo>≤</mo></mrow></mtd><mtd><mrow><msubsup><mi>D</mi><mi>j</mi><mi>max</mi></msubsup><mo></mo><msub><mo>∀</mo><mi>j</mi></msub></mrow></mtd></mtr></mtable><mo></mo><mstyle><mtext> </mtext></mstyle></mrow></math><img file="US20030017836A1-20030123-M00004.TIF" id="EMI-M00004" he="45.1332" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00004" attachment-type="nb" file="US20030017836A1-20030123-M00004.NB" /></attachments></maths>

P-0147[0147] The analysis above is formalized below. <tables id="TABLE-US-00001" num="1"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217PT" align="left" /><thead><row><entry /></row><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry>INPUT</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="1" colwidth="28PT" align="left" /><colspec colname="2" colwidth="189PT" align="left" /><tbody valign="top"><row><entry>N:</entry><entry>number of routers</entry></row><row><entry>D_i^max:</entry><entry>maximum number of tunnels that router i can set up</entry></row><row><entry>ρ_l^t:</entry><entry>unit cost of tunnel l for type t trunk</entry></row><row><entry>τ:</entry><entry>set of all possible types of trunks</entry></row><row><entry>T_{(I, J)}:</entry><entry>demand matrix T(I, J)</entry></row><row><entry>C₁:</entry><entry>capacity of router i (bits/sec)</entry></row><row><entry>R_ij:</entry><entry>set of all feasible routes to route traffic between router i and j</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217PT" align="left" /><tbody valign="top"><row><entry>OUTPUT DECISION VARIABLES</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="1" colwidth="28PT" align="left" /><colspec colname="2" colwidth="189PT" align="left" /><tbody valign="top"><row><entry>y_l^t:</entry><entry>number of units of trunks of type t allocated to link l</entry></row><row><entry>x_p:</entry><entry>amount of flow (traffic volume) on paths p</entry></row><row><entry>z_l:</entry><entry>=1 if link l is allocated non-zero capacity</entry></row><row><entry /><entry>=0 otherwise</entry></row><row><entry namest="1" nameend="2" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>

P-0148[0148] ILP Formulation

P-0149[0149] Minimize <maths id="MATH-US-00005" num="5"><math overflow="scroll"><mrow><munder><mo>∑</mo><mn>1</mn></munder><mo></mo><mrow><munder><mo>∑</mo><mrow><mi>t</mi><mo>∈</mo><mi>τ</mi></mrow></munder><mo></mo><mrow><msubsup><mi>p</mi><mn>1</mn><mi>t</mi></msubsup><mo></mo><msubsup><mi>y</mi><mn>1</mn><mi>t</mi></msubsup></mrow></mrow></mrow></math><img file="US20030017836A1-20030123-M00005.TIF" id="EMI-M00005" he="19.93005" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00005" attachment-type="nb" file="US20030017836A1-20030123-M00005.NB" /></attachments></maths>

P-0150[0150] subject to

P-0151[0151] Demand Satisfaction <maths id="MATH-US-00006" num="6"><math overflow="scroll"><mrow><mrow><munder><mo>∑</mo><mrow><mi>p</mi><mo>∈</mo><msub><mi>R</mi><mi>ij</mi></msub></mrow></munder><mo></mo><msub><mi>x</mi><mi>p</mi></msub></mrow><mo>≥</mo><mrow><msub><mi>T</mi><mi>ij</mi></msub><mo></mo><msub><mo>∀</mo><mrow><mi>i</mi><mo>,</mo><mi>j</mi></mrow></msub></mrow></mrow></math><img file="US20030017836A1-20030123-M00006.TIF" id="EMI-M00006" he="22.08465" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00006" attachment-type="nb" file="US20030017836A1-20030123-M00006.NB" /></attachments></maths>

P-0152[0152] Sufficient Tunnel Capacity <maths id="MATH-US-00007" num="7"><math overflow="scroll"><mrow><mrow><munder><mo>∑</mo><mi>ij</mi></munder><mo></mo><mrow><munder><mo>∑</mo><mtable><mtr><mtd><mrow><mi>p</mi><mo>∈</mo><msub><mi>R</mi><mi>ij</mi></msub></mrow></mtd></mtr><mtr><mtd><mi>and</mi></mtd></mtr><mtr><mtd><mrow><mn>1</mn><mo>∈</mo><mi>p</mi></mrow></mtd></mtr></mtable></munder><mo></mo><msub><mi>x</mi><mi>p</mi></msub></mrow></mrow><mo>≤</mo><mrow><munder><mo>∑</mo><mrow><mi>t</mi><mo>∈</mo><mi>τ</mi></mrow></munder><mo></mo><mrow><msubsup><mi>y</mi><mn>1</mn><mi>t</mi></msubsup><mo></mo><mstyle><mtext> </mtext></mstyle><mo></mo><mrow><mo>∀</mo><mn>1</mn></mrow></mrow></mrow></mrow></math><img file="US20030017836A1-20030123-M00007.TIF" id="EMI-M00007" he="41.0508" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00007" attachment-type="nb" file="US20030017836A1-20030123-M00007.NB" /></attachments></maths>

P-0153[0153] Port Constraints <maths id="MATH-US-00008" num="8"><math overflow="scroll"><mrow><mstyle><mtext> </mtext></mstyle><mo></mo><mtable><mtr><mtd><munder><mo>∑</mo><mrow><mrow><mn>1</mn><mo>:</mo><mrow><mo>(</mo><mrow><mi>i</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow><mo></mo><msup><mo>=</mo><mi>Δ</mi></msup><mo></mo><mn>1</mn></mrow></munder></mtd><mtd><mrow><msub><mi>Z</mi><mn>1</mn></msub><mo>≤</mo></mrow></mtd><mtd><mrow><msubsup><mi>D</mi><mi>i</mi><mi>max</mi></msubsup><mo></mo><msub><mo>∀</mo><mi>i</mi></msub></mrow></mtd></mtr><mtr><mtd><munder><mo>∑</mo><mrow><mrow><mn>1</mn><mo>:</mo><mrow><mo>(</mo><mrow><mi>i</mi><mo>,</mo><mi>j</mi></mrow><mo>)</mo></mrow></mrow><mo></mo><msup><mo>=</mo><mi>Δ</mi></msup><mo></mo><mn>1</mn></mrow></munder></mtd><mtd><mrow><msub><mi>Z</mi><mn>1</mn></msub><mo>≤</mo></mrow></mtd><mtd><mrow><msubsup><mi>D</mi><mi>j</mi><mi>max</mi></msubsup><mo></mo><msub><mo>∀</mo><mi>j</mi></msub></mrow></mtd></mtr></mtable></mrow></math><img file="US20030017836A1-20030123-M00008.TIF" id="EMI-M00008" he="45.1332" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00008" attachment-type="nb" file="US20030017836A1-20030123-M00008.NB" /></attachments></maths>

P-0154[0154] Tunnel Existence Constraint <maths id="MATH-US-00009" num="9"><math overflow="scroll"><mrow><mrow><mrow><msub><mi>Z</mi><mn>1</mn></msub><mo>≥</mo><mrow><mfrac><mrow><munder><mo>∑</mo><mrow><mi>t</mi><mo>∈</mo><mi>τ</mi></mrow></munder><mo></mo><mrow><msubsup><mi>y</mi><mn>1</mn><mi>t</mi></msubsup><mo></mo><mstyle><mtext> </mtext></mstyle><mo></mo><mrow><mo>∀</mo><mn>1</mn></mrow></mrow></mrow><mi>M</mi></mfrac><mo></mo><mstyle><mtext> </mtext></mstyle><mo></mo><mi>where</mi><mo></mo><mstyle><mtext> </mtext></mstyle><mo></mo><mi>M</mi></mrow></mrow><mo>=</mo><mrow><mrow><mo>(</mo><mrow><munder><mo>∑</mo><mi>i</mi></munder><mo></mo><mrow><munder><mo>∑</mo><mi>j</mi></munder><mo></mo><msub><mi>T</mi><mi>ij</mi></msub></mrow></mrow><mo>)</mo></mrow><mo>+</mo><mi>ɛ</mi></mrow></mrow><mo></mo><mstyle><mtext> </mtext></mstyle></mrow></math><img file="US20030017836A1-20030123-M00009.TIF" id="EMI-M00009" he="33.1128" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00009" attachment-type="nb" file="US20030017836A1-20030123-M00009.NB" /></attachments></maths>

P-0155[0155] where ε, a damping coefficient, is a user given parameter having a value is greater than zero.

P-0156[0156] In addition, to the extent the embodiments have been described in the context of particular wireless technologies such as TDMA or CDMA protocols, the embodiments may also be modified to work with wireless technologies including one or more of the following: TDMA, CDMA, GSM, IS-136, and other <b>2</b>G and <b>3</b>G protocols.

P-0157[0157] Having described an exemplary embodiment, it should be apparent to persons of ordinary skill in the art that changes may be made to the embodiment described without departing from the spirit and scope of the invention.