OAMP for distributed mobile architecture

Information

  • Patent Grant
  • 9198020
  • Patent Number
    9,198,020
  • Date Filed
    Thursday, December 22, 2011
    12 years ago
  • Date Issued
    Tuesday, November 24, 2015
    9 years ago
  • Inventors
  • Original Assignees
  • Examiners
    • Mian; Omer S
    Agents
    • Toler Law Group, P.C.
Abstract
A method includes receiving a first call to a mobile station at a first distributed mobile architecture gateway (dMAG). The mobile station is accessible via the first dMAG. The method includes determining a routing path for the first call based on register data associated with the mobile station. The routing path includes one or more components of the first dMAG, a first distributed mobile architecture (dMA) node, and a private Internet Protocol (IP) network. The method includes sending one or more command messages to reserve the one or more components of the first dMAG, the first dMA node, and the private IP network and receiving one or more confirmation messages indicating that the one or more components are reserved to route the first call. The method further includes connecting the first call to the mobile station via the one or more reserved components.
Description
TECHNICAL FIELD

The present disclosure relates generally to distributed mobile architecture (dMA) systems. More specifically, example embodiments are directed to operations, administration, maintenance and provisioning (OAMP) in a dMA system.


BACKGROUND

Distributed mobile architecture (dMA) enables multiple dMA nodes (e.g., each dMA node including a dMA server and one or more base transceiver stations (BTSs) that service one or more mobile stations to be interconnected via Internet Protocol (IP) connections.


This interconnectivity defines a dMA network in which voice and data calls to and from the one or more mobile stations may be switched at the edge of the dMA network (e.g., via the dMA nodes). This interconnectivity reduces a need for backhaul of traffic to a mobile switching center (MSC) over a backhaul infrastructure that is ubiquitous in and a major contributor to high costs of the existing mobile networks.


Multiple dMA gateways (dMAGs) may be employed in the dMA network to provide switching of voice and data calls to and from one or more of the plural legacy networks, including public switch telephone networks (PSTNs), IP networks, other wireless systems, and the like, while keeping the edge-switching efficiencies of the dMA network.


Each of the dMAGs may be associated with one or more of the multiple dMA nodes. Some or all of the dMA nodes may roam between different dMAGs. The OAMP services should be capable of servicing the changing topology of the dMA network.





BRIEF DESCRIPTION OF THE DRAWINGS

Some embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings in which:



FIG. 1 is a block diagram of an example distributed mobile architecture (dMA) network that includes a dMA gateway (dMAG), which provides one or more of plural dMA nodes with service to one or more of plural legacy networks;



FIG. 2 is a block diagram of an example embodiment of a dMA network that includes plural dMAGs;



FIG. 3 is a block diagram of an example dMAG in accordance with FIGS. 1 and 2;



FIG. 4 is a block diagram of an example dMA node in accordance with FIGS. 1 and 2;



FIG. 5 illustrates a table showing example data associated with a dMAG, in accordance with FIGS. 1-3;



FIG. 6 is a flowchart of an example method to connect a call in the dMA networks of FIGS. 1 and 2;



FIG. 7 is a flowchart of an example method to connect a call in the dMA networks of FIGS. 1 and 2; and



FIG. 8 is a block diagram illustrating an example computer system within which a set of instructions, for causing the computer system to perform any one or more of the methodologies disclosed in FIGS. 1-7, may be executed.





DETAILED DESCRIPTION

Example embodiments are directed to operations, administration, maintenance and provisioning (OAMP) in a dMA system.


In accordance with an embodiment, there is provided a method of routing calls via a communications network, the method comprising: receiving a first call at a first distributed mobile architecture gateway (dMAG) from a legacy communication network, the first call placed to a mobile station accessible via the first dMAG; determining a routing path for the first call based on register data associated with the mobile station, the routing path including at least one component of the first dMAG, at least one component of a first dMA node, and at least one component of a private Internet Protocol (IP) network; sending one or more command messages to reserve the at least one component of the first dMAG, the at least one component of the first dMA node, and the at least one component of a private Internet Protocol (IP) network along the routing path; receiving one or more confirmation messages indicating that the at least one component of the first dMAG, the at least one component of the first dMA node, and the at least one component of the private IP network are reserved to route the first call; and connecting the first call to the mobile station the reserved at least one component of the first dMAG, the reserved at least one component of the first dMA node, and the reserved at least one component of the private IP network.


In accordance with another embodiment, there is provided a distributed mobile architecture gateway (dMAG), comprising: a data storage device; a legacy network interface adapted to communicate with a legacy communication network; a home distributed mobile architecture (dMA) register including a list of a first group of dMA nodes, wherein the dMAG is designated to route calls directed to one or more mobile stations served by the first group of dMA nodes and to store performance data associated with each dMA node of the first group of dMA nodes; a visitor dMA register including a list of a second group of dMA nodes, wherein each dMA node of the second group of dMA nodes is roaming with respect to the dMAG and the dMAG is adapted to temporarily route calls directed to one or more mobile stations served by the second group of dMA nodes; a master agent adapted to receive performance data from each dMA node of the first group of dMA nodes and each dMA node of the second group of dMA nodes; and an operations module adapted to: store the performance data from each dMA node of the first group of dMA nodes in the data storage device; and send the performance data from each dMA node of the second group of dMA nodes to one or more additional dMAGs via a private IP network; wherein at least a portion of the calls routed by the dMAG are communicated via the legacy network interface.


In accordance with a further embodiment, there is provided a method of routing calls via a communications network, the method comprising: receiving a resource allocation query command message at a first distributed mobile architecture (dMA) node from a first distributed mobile architecture gateway (dMAG), the first dMA node roaming with respect to the first dMAG and the resource allocation query being related to a call directed to a mobile station adapted to communicate via the first dMA node; sending a response message to the first dMAG from the first dMA node, response message indicating that one or more components of the first dMA node are reserved for the call; receiving one or more packets related to the call at the first dMA node from the first dMAG via a private Internet Protocol (IP) network; sending one or more signals associated with the one or more packets related to the call to the mobile stations via a wireless transceiver integrated with the first dMA node.


In accordance with yet another embodiment, there is provided a distributed mobile architecture (dMA) node, comprising: a data network connection adapted to communicate with a private Internet protocol (IP) network; and a performance module adapted to: send first performance data to a first distributed mobile architecture gateway (dMAG) via the private IP network when the dMA node is in a first communication range of the first dMAG, the first performance data related to components of the dMA node and related to first calls routed via the dMA node when the dMA node is in the first communication range; and send second performance data to a second dMAG via the private IP network when the dMA node is in a second communication range of the second dMAG, the second performance data related to components of the dMA node and related to second calls routed via the dMA node when the dMA node is in the second communication range; wherein the dMA node is included in a home dMA register of the first dMAG when the dMA node is in the first communication range and when the dMA node is in the second communication range and wherein the dMA node is included in a visitor dMA register of the second dMAG when the dMA node is in the second communication range.



FIG. 1 is a block diagram of an example distributed mobile architecture (dMA) network 100 that includes a dMA gateway (dMAG) 102, which provides one or more of plural dMA nodes 104, 106 and 108 with service to one or more of plural legacy networks 112. Each of the dMA nodes 104, 106, 108 may include a dMA server and one or more base transceiver stations (BTSs), which are not shown for clarity and brevity, to provide cellular coverage site(s) to one or more mobile stations 120, 122, 124, 126, 128, 130. The dMA node 104 (via its included dMA server) may hand-off of and switch calls between BTSs that are associated with the dMA node 104. The dMA node 104 (via its included dMA server) may further provide hand-off of calls and switch calls made between a BTS associated with dMA 104 and a BTS associated with another dMA node, such as dMA nodes 106, 108. Other dMA nodes 106, 108 may operate similarly to dMA node 104 described above to provide switching and hand-offs. It should be noted that the number of dMA nodes 104, 106, 108 shown in FIG. 1 represents only one example and the number of dMA nodes may be varied depending on the requirements of the dMA network 100.


The dMA nodes 104, 106, 108 are interconnected to each other via a private IP network 110, such as via peer-to-peer connections, to provide for the switching and hand-off efficiencies between the dMA nodes 104, 106, 108 in the dMA network 100. The connections of dMA nodes 104, 106, 108 to a private IP network 100 may be a wired or wireless. The dMA nodes 104, 106, 108 are also interconnected to and registered with the dMAG 102 via the private IP network 110 to provide switching of calls between the legacy networks 112 and the dMA nodes 104, 106, 108. In turn the legacy networks are interconnected to the dMAG 102 via a dMAG interface 128. The dMAG interface 128 directs call traffic between the legacy networks 112 and the dMAG 102. The connection of the dMAG 102 to the dMAG interface 128 may also be wired or wireless.


Although only one dMAG 102 is shown for brevity and clarity, the dMA nodes 104, 106, 108 may be mobile and may roam between different dMAGs in the dMA network 100. For example, dMA nodes 104 and 106 are home dMA nodes that are associated with and considered local to dMAG 102, while dMA node 108 is a visitor dMA that has roamed via the private IP network 110, registering with the dMAG 102. In addition, one or more mobile stations may be associated with and be considered local to a particular dMA node, while other one or more mobile stations may roam via the particular dMA node. For example, the mobile stations 120 and 122 may be local to the home dMA node 104, while mobile station 124 may be associated with the home dMA node 106 and may further be roaming via the home dMA node 104. As another example, mobile stations 128, 130 and may be associated with the home dMA nodes 104, 106, respectively, while mobile station 126 may be associated with the visitor dMA node 108 and may further be roaming via the home dMA node 106.


The dMAG 102 is associated with plural dMA nodes 104, 106, 108 that register with the dMAG 102 and the dMAG 102 controls switching of calls between the legacy networks 112 and the dMA nodes 104, 106, 108 to provide the one or more mobile stations associated with the respective dMA nodes service to and from the legacy networks 112. The legacy networks 112 may include a public switch telephone network (PSTN), an Internet Protocol (IP) network, one or more wireless networks, and the like. As an example, call between the dMA network 100 and the PSTN network may utilize Signaling System #7 (SS7) 114, calls between the dMA network and the IP network may utilize VoIP (H.323) 116 to set up calls, and calls between the dMA network 100 and the one or more wireless networks may utilize MAP/CAMEL (GSM and WCDMA), ANSI-41 (AMPS, IS-136 (TDMA) and CDMA), and the like 118.



FIG. 2 is a block diagram of an example embodiment of a dMA network 200 that includes plural dMAGs 202, 204, 206. The dMA nodes of each dMA node group 208 (208A, 208B), 210, 212, are interconnected to each other via respective private IP networks 214, 216, 218, such as via peer-to-peer connections, and the private IP networks 214, 216, 218 are also interconnected via wired or wireless IP connections. The interconnections provide for the switching and hand-off efficiencies between the dMA nodes of the dMA node groups 208, 210, 212 in the dMA network 200.


The connections of the dMA nodes in the dMA node groups 208 (208A, 208B), 210, 212 to the respective private IP networks 214, 216, 218 may likewise be a wired or wireless. Each of the dMA node groups 208, 210, 212 may include one or more home dMA nodes and/or one or more visitor dMA nodes. For example, dMA node group 208 is shown to include one or more home dMA nodes 208A that are local to and registered with the home dMAG 202 and one or more visitor dMA nodes 208B that are roaming via the private IP network 214 and are registered with the dMAG 202.


Each of the dMAGs 202, 204, 206 is associated with and interconnected to the dMA nodes of a respective dMA node group 208 (208A, 208B), 210, 212 via a respective private IP network 214, 216, 218 to provide switching of calls between the legacy networks 220 and the dMA nodes of the respective dMA node group 208, 210, 212. The legacy networks 220 are interconnected to the dMAGs 202, 204, 206 via a dMAG interface 222. The dMAG interface 222 directs call traffic between the legacy networks 220 and the dMAGs 202, 204, 206. The connection of the dMAGs 202, 204, 206 to the dMAG interface 222 may also be wired or wireless.


Each dMAG 202, 204, 206 may maintain or access necessary information from a remote source (e.g., a remote database) to enable the respective dMAG 202, 204, 206 to switch (connect) calls between the legacy networks 220 and the dMA nodes of the respective dMA node group 208, 210, 212. Example information that may be maintained or accessed remotely may include a home dMA node register for each dMAG 202, 204, 206, a visitor dMA node register for each dMAG 202, 204, 206, a home location register (HLR) and a visitor location register (VLR) for each home dMA node and visitor dMA node, and the like. Example information maintained or accessed remotely will be described in greater detail below with reference to FIG. 5.



FIG. 3 is a block diagram 300 of an example dMAG 302 in accordance with FIGS. 1 and 2. The dMAG 302 includes a network interface 306 that interconnects the dMAG 302 to a private IP network 304 (e.g., private IP network 110, 214, 216, 218). The dMAG 302 also includes a legacy networks interface 310 that interconnects the dMAG 302 to one or more legacy networks 312 (e.g., legacy networks 112, 220). Further, the dMAG 302 includes a processor 308 that executes one or more of the various modules 316-334 stored on a memory device 314 to provide telephony service between the private IP network 304 (e.g., IP network 110, 214, 216, 218) and the legacy networks 312 (e.g., legacy networks 112, 220). The memory device 314 includes a gateway module 316, a conversion module 318, a routing module 320, a graphical user interface (GUI) module 322, a master agent module 324, one or more dMAG sub-agent modules 326, a dMA registration module 328 and OAMP service modules 330-336 that include an operations module 330, an administration module 332, a maintenance module 334 and a provisioning module 336.


Further with reference to FIG. 3, the gateway module 316 directs or controls call traffic from the private IP network 304 to the legacy networks 312 (e.g., legacy networks 112, 220) via the legacy networks interface 310. The conversion module 318 performs any conversion between Internet Protocol (IP) and the protocols associated with the legacy networks 312. The routing module 320 uses the registers of FIG. 5 to route call traffic from the legacy network 312 to the private IP network 304 via the network interface 306. The GUI module 322 generates one or more graphical user interfaces associated with the dMA network 100, 200 for setting up user accounts, billing, call tracking and the like. The dMA registration module 328 may register a home or a visitor dMA with the dMAG 302. The master agent 324 collects or monitors the performance of one or more components of the dMAG 302 and one or more components of the registered or associated dMA nodes via one or more sub-agents, and the master agent 324 may store monitored data in the data storage device 338 for later retrieval and use. More specifically, one or more dMAG sub-agents 326 may monitor the operation of one or more components of the dMAG 302. For example, a dMAG sub-agent 326 may be provided to monitor the connection to the private IP network 304 via the network interface 306, e.g., periodically or continuously measuring throughput via network interface 306. A dMAG sub-agent 326 may be provided to monitor the processing speed or operation of the processor 308. Yet another dMAG sub-agent 326 may be responsible for monitoring the remaining capacity of the data storage device 338. A dMAG sub-agent 326 may also be provided to monitor the connection to the legacy networks 312 via the legacy networks interface 310, e.g., periodically or continuously measuring throughput via network interface 310. As yet another example, a dMAG sub-agent 326 may be provided to monitor one or more dMA nodes (e.g., dMA nodes 104, 106, 108, dMA nodes of dMA node groups 208, 210, 212) registered with the dMAG 302.


Yet further with reference to FIG. 3, the operations module 330 may analyze the collected monitored data stored in data storage device 338 to detect and report faults in the operation of the various components in the dMAG 302 and the dMA nodes registered or associated with the dMAG 302, e.g., determining whether any component is not working optimally or has otherwise failed. The operations module 330 may also store or maintain fault reporting in the data storage device 338. The operations module 330 may store performance data in the management information base 340 for later retrieval and use. The administration module 332 may collect accounting and billing data, e.g., managing billing data for home and roaming accounts, generating and maintaining billing history and call history, and the like. The maintenance module 334 is responsible for distributing software updates for upgrades, fixes and new feature enablement to the registered or associated dMA nodes and mobiles stations associated with the dMA nodes registered with the dMAG 302. The provisioning module 336 is responsible for provisioning resources to a particular call, such as reserving or dedicating one or more components of the dMAG 302, dMA node and private IP network 304 for a routing path that connects a call from the legacy network 312 to the dMA node associated with a receiving mobile station.



FIG. 4 is a block diagram 400 of an example dMA node 402 in accordance with FIGS. 1 and 2. The dMA node 402 includes a network interface 406 that interconnects the dMA node 402 to a private IP network 404 (e.g., private IP network 110, 214, 216, 218). The dMA node 402 also includes a wireless transceiver interface 410 that interconnects the dMA node 402 to one or more wireless transceivers 412, 414, 416, each of which may connect one or more mobile stations (e.g., mobile stations 120-130) to the dMA node 402 to enable wireless calls to and from the mobile stations. Further, the dMA node 402 includes a processor 408 that executes one or more of the various modules 420-432 stored on a memory device 418 to provide telephony service between the private IP network 404 (e.g., IP network 110, 214, 216, 218) and the wireless transceivers 412, 414, 416 to one or more mobile stations. The memory device 418 includes one or more dMA sub-agents 420, a conversion module 422, a routing module 424, a performance collection module 426, a dMAG registration module 428, a resource allocation module 430, and a maintenance module 432.


Further with reference to FIG. 4, one or more dMA sub-agents 420 may monitor the operation of one or more components of the dMA 402. For example, a dMA sub-agent maybe provided to monitor the connection to the private IP network 404 via the network interface 406, e.g., periodically or continuously measuring throughput via network interface 406. A dMA sub-agent 420 may be provided to monitor the processing speed or operation of the processor 408. Yet another dMA sub-agent 420 may be responsible for monitoring the remaining capacity of the data storage device 434. As yet another example, a dMA sub-agent 420 may also be provided to monitor the connection to the wireless transceivers 412, 414, 416 via the wireless transceiver interface 410, e.g., periodically or continuously measuring throughput via network interface 410. The conversion module 422 performs any conversion between Internet Protocol (IP) and the protocols associated with the mobile stations connecting to the dMA 402 via the wireless transceivers 412, 414, 416 (e.g., CDMA, GSM and the like). The routing module 424 uses the registers of FIG. 5 to route call traffic from mobile stations received via the wireless transceivers 412, 414, 416 to the private IP network 404 via the network interface 406.


Yet further with reference to FIG. 4, the performance collection module 426 may collect and store performance data in the storage device 436, which performance data may transmitted to the dMAG 302 periodically, continuously or on-request by the dMAG 302. The registration module 428 may automatically register the dMA node 402 to a dMAG 302 when the dMA roams via a private network associated with the dMAG 302. For example, visitor dMA node 108 may automatically register with dMAG 102 when the visitor dMA node 108 roams via the private IP network 110 associated with the dMAG 102. As another example, a visitor dMA node of the visitor dMA node group 208B may automatically register with the dMAG 202 when that visitor dMA node roams via the private IP network 214 associated with the dMAG 202. The dMAG with which the visitor dMA node registers may obtain that dMA node's home location register and visitor location register from the dMA node or the dMA node's home dMAG.


Still further with reference to FIG. 4, the resource allocation module 430 of the dMA 402 may receive a request from a dMAG 302 to connect a call to a mobile station via wireless transceiver 412, 414 or 416. In receiving the request, the resource allocation module 430 may determine whether it has sufficient resources to connect the call by determining whether there is sufficient throughput via the wireless transceiver 410, whether the processor is not overloaded, as well determining whether there are other pertinent constraints on the operation of the dMA node 402. If the resource allocation module 430 can connect the call, it allocates resources or components for the call and informs the dMAG 302 to connect the call. If the allocation module 430 cannot connect the call due to the foregoing constrains (e.g., a large number of calls currently connected via the dMA node 402), the allocation module 430 informs the dMAG that it cannot connect the call. The maintenance module 432 is responsible for receiving software or maintenance updates from the dMAG 302 for the dMA node and updating the memory 418 of the dMA node 402 with the updates, and further responsible for receiving mobile station software or maintenance updates and distributing these updates to the mobile stations.



FIG. 5 illustrates a table 500 showing example data associated with a dMAG, in accordance with FIGS. 1-3. More specifically, the table 500 illustrates in a graphical format the different databases of data that may be utilized by the dMAGs of FIGS. 1-3 to provide switching or connection of calls between the legacy networks and the dMA nodes (mobile stations) of FIGS. 1-3. Depending on the size of the dMA network 200, 300 in FIGS. 1-3, the number of dMAGs for which data is shown in FIG. 5 may increase or decrease accordingly. The table 500 illustrates different databases 508-518 each including one or more tables for a local or 1st dMAG 502 (e.g., dMAG 102, 202), a 2nd dMAG 504 (e.g., dMAG 204), and 3rd dMAG 506 (e.g., dMAG 206).


The dMA node register database 508 includes a home dMA node register (e.g., one or more database tables) that identifies the dMA nodes (e.g., 104, 106, dMA nodes of dMA node group 208) which are associated with the local or 1St dMAG 502 (e.g., dMAG 102, 202); a dMA node register (e.g., one or more database tables) of the 2nd dMAG 504 (e.g., dMAG 204) identifies the dMA nodes (e.g., dMA nodes of the dMA node group 210) associated with the 2nd dMAG 504; and a dMA node register (e.g., one or more database tables) of the 3rd dMAG 506 (e.g., dMAG 206) identifies the dMA nodes (e.g., dMA nodes of the dMA node group 212) associated with the 3rd dMAG 506.


The dMA node community location register (CLR) database 510 includes the home location register (e.g., database tables) for each of the local or 1st dMAG 502 (e.g., dMAG 102, 202), the 2nd dMAG 504 (e.g., dMAG 204) and the 3rd dMAG 506 (e.g., dMAG 206). Each home location register of the dMA node CLR database 510 includes calling information for the home mobile stations that are associated respectively with the local or 1st dMAG 502 (e.g., dMAG 102, 202), the 2nd dMAG 504 (e.g., dMAG 204) and the 3rd dMAG 506 (e.g., dMAG 206).


The dMA node VLR database 512 includes the visitor location registers (e.g., database tables) for the local or 1st dMAG 502 (e.g., dMAG 102, 202), the 2nd dMAG 504 (e.g., dMAG 204) and the 3rd dMAG 506 (e.g., dMAG 206). Each visitor location register of the dMA node VLR database 512 includes calling information for the visitor mobile stations that are associated respectively with the local ore dMAG 502 (e.g., dMAG 102, 202), the 2nd dMAG 504 (e.g., dMAG 204) and the 3rd dMAG 506 (e.g., dMAG 206).


The visitor dMA node register database 514 includes a visitor dMA node register (e.g., database table) that identifies visitor dMA nodes which are associated with the local or 1st dMAG 502 (e.g., dMAG 102, 202); a visitor dMA node register (e.g., a database table) of the 2nd dMAG 504 (e.g., dMAG 204) identifies visitor dMA nodes associated with the 2nd dMAG 504; and a dMA node register of the 3rd dMAG 506 (e.g., dMAG 206) identifies visitor dMA nodes associated with the 3rd dMAG 506.


The visitor dMA node HLR database 516 includes the home location register (e.g., database tables) for each visitor dMA node of the local or 1st dMAG 502 (e.g., dMAG 102, 202), the 2nd dMAG 504 (e.g., dMAG 204) and the 3rd dMAG 506 (e.g., dMAG 206). The home location register includes calling information for the mobile stations of each visitor dMA node that are associated respectively with the local or 1st dMAG 502 (e.g., dMAG 102, 202), the 2nd dMAG 504 (e.g., dMAG 204) and the 3rd dMAG 506 (e.g., dMAG 206).


The visitor dMA node VLR database 518 includes a visitor location register (e.g., database tables) for each visitor dMA node of the local or 1st dMAG 502 (e.g., dMAG 102, 202), the 2nd dMAG 504 (e.g., dMAG 204) and the 3rd dMAG 506 (e.g., dMAG 206). Each visitor location register includes calling information for the visitor mobile stations of each visitor dMA node that are associated respectively with the local or 1st dMAG 502 (e.g., dMAG 102, 202), the 2nd dMAG 504 (e.g., dMAG 204) and the 3rd dMAG 506 (e.g., dMAG 206).



FIG. 6 is a flowchart 600 of an example method to connect a call in the dMA network 100, 200. The example method begins at operation 602. At operation 604, a dMAG receives a connection request from a legacy network to connect a call to a mobile station. At operation 606, the dMAG determines a routing path based on register data associated with the mobile station. More specifically, the dMAG may access the databases illustrated in FIG. 5 to determine an IP address of the mobile station that is to receive the call and an IP addresses of a dMA node that is to connect the call to the mobile station, as well IP addresses of routers, switches and the like to be used to connect the call between the dMAG, dMA node and the mobile station. At operation 608, the dMAG transmits one or more command messages to reserve one or more components (e.g., dMA, routers, switches, etc.) along the determined path to connect the call. At operation 610, the dMAG receives one or more confirmation messages indicating that one or more components along the routing path have been reserved. Thereafter, at operation 612, the dMAG connects the call between the legacy network and the mobile station via the one or more reserved components along the routing path. The example method ends at operation 614.



FIG. 7 is a flowchart 700 of an example method to connect a call in the dMA network 100, 200. The example method begins at operation 702. At operation 704, a dMA receives a resource allocation query command message from a dMAG related to a call to a mobile station form a legacy network. At operation 706, the dMA determines whether there are sufficient resources to connect the call. If there are not sufficient resources, at operation 708, the dMA transmits a response message to the dMAG indicating that the call cannot be connected to the mobile station via the dMA, and at operation 718, the method 700 ends. Alternatively, if it is determined at operation 706 that there are sufficient resources, then at operation 710, the dMA transmits a response message to the dMAG indicating that the dMA node has reserved the one or more components of the dMA to connect the call. At operation 712, the dMA received one or more data packets related to the call from the dMAG, and at operation 714, the dMA converts the one or more received data packets to one or more signals associated with the mobile station. Thereafter, at operation 716, the dMA wirelessly transmits the one or more signals from the dMA node to the mobile station via a transceiver to connect the call from the legacy network to the mobile station. The example method ends at operation 718.



FIG. 8 is a block diagram illustrating an example machine in the example form of a computer system 800 within which a set of instructions, for causing the computer system to perform any one or more of the methodologies disclosed in FIGS. 1-7, may be executed. In alternative embodiments, the machine operates as a standalone device or may be connected (e.g., networked) to other machines. In a networked deployment, the machine may operate in the capacity of a server or a client machine in server-client network environment, or as a peer machine in a peer-to-peer (or distributed) network environment. The machine may be a personal computer (PC), a tablet PC, a Personal Digital Assistant (PDA), a cellular telephone, a web appliance, a network router, switch or bridge, or any machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that machine. Further, while only a single machine is illustrated, the term “machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein.


The example computer system 800 includes a processor 802 (e.g., a central processing unit (CPU), a graphics processing unit (GPU) or both), a main memory 804 and a static memory 806, which communicate with each other via a bus 820. The computer system 800 may further include a video display unit 810 (e.g., a liquid crystal display (LCD) or a cathode ray tube (CRT)). The computer system 800 also includes an alphanumeric input device 812 (e.g., a keyboard), a user interface (UI) navigation device 814 (e.g., a mouse), a disk drive unit 816, a signal generation device 818 (e.g., a speaker) and a network interface device 808.


The disk drive unit 816 includes a machine-readable medium 822 on which is stored one or more sets of instructions and data structures (e.g., software 824) embodying or utilized by any one or more of the methodologies or functions described herein. The software 824 may also reside, completely or at least partially, within the main memory 804 and/or within the processor 802 during execution thereof by the computer system 800, the main memory 804 and the processor 802 also constituting machine-readable media.


The software 824 may further be transmitted or received over a network 826 via the network interface device 808 utilizing any one of a number of well-known transfer protocols (e.g., HTTP).


While the machine-readable medium 822 is shown in an example embodiment to be a single medium, the term “machine-readable medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more sets of instructions. The term “machine-readable medium” shall also be taken to include any medium that is capable of storing, encoding or carrying a set of instructions for execution by the machine and that cause the machine to perform any one or more of the methodologies of the present invention, or that is capable of storing, encoding or carrying data structures utilized by or associated with such a set of instructions. The term “machine-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories, optical and magnetic media, and carrier wave signals.


Although an embodiment of the present invention has been described with reference to specific example embodiments, it will be evident that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the invention. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense. The accompanying drawings that form a part hereof, show by way of illustration, and not of limitation, specific embodiments in which the subject matter may be practiced. The embodiments illustrated are described in sufficient detail to enable those skilled in the art to practice the teachings disclosed herein. Other embodiments may be utilized and derived therefrom, such that structural and logical substitutions and changes may be made without departing from the scope of this disclosure. This Detailed Description, therefore, is not to be taken in a limiting sense, and the scope of various embodiments is defined only by the appended claims, along with the full range of equivalents to which such claims are entitled.


Such embodiments of the inventive subject matter may be referred to herein, individually and/or collectively, by the term “invention” merely for convenience and without intending to voluntarily limit the scope of this application to any single invention or inventive concept if more than one is in fact disclosed. Thus, although specific embodiments have been illustrated and described herein, it should be appreciated that any arrangement calculated to achieve the same purpose may be substituted for the specific embodiments shown. This disclosure is intended to cover any and all adaptations or variations of various embodiments. Combinations of the above embodiments, and other embodiments not specifically described herein, will be apparent to those of skill in the art upon reviewing the above description


In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of an embodiment of the present invention. It will be evident, however, to one skilled in the art that the present invention may be practiced without these specific details.


The above-disclosed subject matter is to be considered illustrative, and not restrictive, and the appended claims are intended to cover all such modifications, enhancements, and other embodiments, which fall within the true spirit and scope of the present invention. Thus, to the maximum extent allowed by law, the scope of the present invention is to be determined by the broadest permissible interpretation of the following claims and their equivalents, and shall not be restricted or limited by the foregoing detailed description.

Claims
  • 1. A method of routing calls via a communications network, the method comprising: receiving a first call at a first distributed mobile architecture gateway (dMAG) of a plurality of dMAGs, each of the plurality of dMAGs coupled to a dMAG interface of a legacy network, wherein the first call is placed to a called mobile station that is accessible by the dMAG interface via the first dMAG;determining, at the first dMAG, a routing path for the first call based on register data of the first dMAG, wherein the routing path includes at least one component of the first dMAG, at least one component of a first distributed mobile architecture (dMA) node of a first group of a plurality of groups of dMA nodes, each of the plurality of groups of dMA nodes coupled to the legacy network via a different one of the plurality of dMAGs, and at least one component of a private Internet Protocol (IP) network;sending one or more command messages to reserve the at least one component of the first dMAG, the at least one component of the first dMA node, and the at least one component of the private Internet Protocol (IP) network;receiving one or more confirmation messages indicating that the at least one component of the first dMAG, the at least one component of the first dMA node, and the at least one component of the private IP network are reserved to route the first call; andconnecting the first call to the called mobile station via the reserved at least one component of the first dMAG, the reserved at least one component of the first dMA node, and the reserved at least one component of the private IP network;wherein the register data includes first data identifying dMA nodes local to the first dMAG, second data identifying dMA nodes visiting the first dMAG, third data including calling information for each mobile station local to one of the dMA nodes identified by the second data, and fourth data including calling information for each mobile station visiting one of the dMA nodes identified by the second data, wherein the first dMA node is indicated by the second data and calling information for the called mobile station is indicated by the third data or the fourth data, and wherein the routing path is determined based in part on the calling information for the called mobile station.
  • 2. The method of claim 1, wherein the register data indicates that the first dMA node is identified by a home dMA register of a second dMAG.
  • 3. The method of claim 1, wherein the routing path is established based on call traffic data associated with the private IP network, the call traffic data indicating at least a second routing path associated with a second call routed via the private IP network, and wherein the second call is routed from the first dMAG to a second dMA node via the private IP network.
  • 4. The method of claim 3, further comprising providing a plurality of graphical user interfaces (GUIs) to display the first routing path, the second routing path, or any combination thereof.
  • 5. The method of claim 1, wherein a master agent of the first dMAG sends a first resource allocation query to the at least one component of the first dMAG, a second resource allocation query to the at least one component of the private IP network, and a third resource allocation query to the at least one component of the first dMA node, and wherein the first resource allocation query is related to requesting to route the first call via the at least one component of the first dMAG, the second resource allocation query is related to requesting to route the first call via the at least one component of the private IP network, and the third resource allocation query is related to requesting to route the first call via the at least one component of the first dMA node.
  • 6. The method of claim 5, wherein the master agent of the first dMAG receives first resource allocation data after sending the first resource allocation query, second resource allocation data after sending the second resource allocation query, and third resource allocation data after sending the third resource allocation query and wherein the first resource allocation data indicates the availability of the at least one component of the first dMAG to route the first call, the second resource allocation data indicates the availability of the at least one component of the private IP network to route the first call, and the third resource allocation data indicates the availability of the at least one component of the first dMA node to route the first call.
  • 7. The method of claim 5, wherein the first resource allocation query, the second resource allocation query, and the third resource allocation query are sent by the master agent before the first call is received at the first dMAG.
  • 8. The method of claim 1, further comprising sending first configuration data to the at least one component of the first dMAG, second configuration data to the at least one component of the private IP network, and third configuration data to the at least one component of the first dMA node, wherein the first configuration data, the second configuration data, and the third configuration data are sent before the first call is received at the first dMAG.
  • 9. A non-transitory computer-readable storage medium comprising instructions that, when executed by a processor, cause the processor to: receive a first call at a first distributed mobile architecture gateway (dMAG) of a plurality of dMAGs, each of the plurality of dMAGs coupled to a dMAG interface of a legacy network, wherein the first call is placed to a called mobile station that is accessible by the dMAG interface via the first dMAG;determine, at the first dMAG, a routing path for the first call based on register data of the first dMAG, wherein the routing path includes at least one component of the first dMAG, at least one component of a first distributed mobile architecture (dMA) node of a first group of a plurality of groups of dMA nodes, each of the plurality of groups of dMA nodes coupled to the legacy network via a different one of the plurality of dMAGs, and at least one component of a private Internet Protocol (IP network)send one or more command messages to reserve the at least one component of the first dMAG, the at least one component of the first dMA node, and the at least one component of the private Internet Protocol (IP) network;receive one or more confirmation messages indicating that the at least one component of the first dMAG, the at least one component of the first dMA node, and the at leastone component of the private IP network are reserved to route the first call; and connect the first call to the called mobile station via the reserved at least one componentof the first dMAG, the reserved at least one component of the first dMA node, and the reserved at least one component of the private IP network;wherein the register data includes first data identifying dMA nodes local to the first dMAG, second data identifying dMA nodes visiting the first dMAG, third data including calling information for each mobile station local to one of the dMA nodes identified by the second data, and fourth data including calling information for each mobile station visiting one of the dMA nodes identified by the second data, wherein the first dMA node is indicated by the second data and information for each mobile station visiting one of the dMA nodes identified by the second data, wherein the first dMA node is indicated by the second data and calling information for the called mobile station is indicated by the third data or the fourth data, and wherein the routing path is determined based in part on the calling information for the called mobile station.
  • 10. The non-transitory computer-readable storage medium of claim 9, wherein the register data indicates that the first dMA node is identified by a home dMA register of a second dMAG.
  • 11. The method of claim 1, wherein the register data is stored at the first dMAG.
  • 12. The method of claim 1, wherein the register data includes a first IP address of the called mobile station, a second IP address of the first dMA node, and a third IP address of the at least one component of the private IP network.
  • 13. An apparatus comprising: a processor; anda memory storing instructions that, when executed by the processor, cause the processor to perform operations including: receiving a first call at a first distributed mobile architecture gateway (dMAG) of a plurality of dMAGs, each of the plurality of dMAGs coupled to a dMAG interface of a legacy network, wherein the first call is placed to a called mobile station that is accessible by the dMAG interface via the first dMAG;determining, at the first dMAG, a routing path for the first call based on register data of the first dMAG, wherein the routing path includes at least one component of the first dMAG, at least one component of a first distributed mobile architecture (dMA) node of a first group of a plurality of groups of dMA nodes, each of the plurality of groups of dMA nodes coupled to the legacy network via a different one of the plurality of dMAGs, and at least one component of a private Internet Protocol (IP network);sending one or more command messages to reserve the at least one component of the first dMAG, the at least one component of the first dMA node, and the at least one component of the private Internet Protocol (IP) network;receiving one or more confirmation messages indicating that the at least one component of the first dMAG, the at least one component of the first dMA node, and the at least one component of the private IP network are reserved to route the first call; andconnecting the first call to the called mobile station via the reserved at least one component of the first dMAG, the reserved at least one component of the first dMA node, and the reserved at least one component of the private IP network;wherein the register data includes first data identifying dMA nodes local to the first dMAG, second data identifying dMA nodes visiting the first dMAG, third data including calling information for each mobile station local to one of the dMA nodes identified by the second data, and fourth data including calling information for each mobile station visiting one of the dMA nodes identified by the second data, wherein the first dMA node is indicated by the second data and calling information for the called mobile station is indicated by the third data or the fourth data, and wherein the routing path is determined based in part on the calling information for the called mobile station.
  • 14. The apparatus of claim 13, wherein the register data indicates that the first dMA node is identified by a home dMA register of a second dMAG.
  • 15. The apparatus of claim 13, wherein the register data is stored at the first dMAG.
  • 16. The apparatus of claim 13, wherein the register data includes a first IP address of the called mobile station, a second IP address of the first dMA node, and a third IP address of the at least one component of the private IP network.
CLAIM OF PRIORITY

The present application claims priority from and is a divisional application of U.S. patent application Ser. No. 12/171,840 filed on Jul. 11, 2008 and entitled “OAMP FOR DISTRIBUTED MOBILE ARCHITECTURE,” the contents of which are expressly incorporated herein by reference in their entirety.

US Referenced Citations (247)
Number Name Date Kind
4284848 Frost Aug 1981 A
5590175 Gallant et al. Dec 1996 A
5623495 Eng et al. Apr 1997 A
5623532 Houde et al. Apr 1997 A
5713073 Warsta Jan 1998 A
5734979 Lu et al. Mar 1998 A
5890064 Widergen et al. Mar 1999 A
5933784 Gallagher et al. Aug 1999 A
5991639 Rautiola et al. Nov 1999 A
6122499 Magnusson Sep 2000 A
6131038 Sekine et al. Oct 2000 A
6141564 Bruner et al. Oct 2000 A
H1918 Hoffpauir et al. Nov 2000 H
6160804 Ahmed et al. Dec 2000 A
6411825 Csapo et al. Jun 2002 B1
6418308 Heinonen et al. Jul 2002 B1
6421325 Kikinis Jul 2002 B1
6515985 Shmulevich et al. Feb 2003 B2
6539237 Sayers et al. Mar 2003 B1
6542497 Curry et al. Apr 2003 B1
6549937 Auerbach et al. Apr 2003 B1
6584098 Dutnall Jun 2003 B1
6611533 Liao et al. Aug 2003 B1
6614784 Glitho et al. Sep 2003 B1
6631260 Carey et al. Oct 2003 B1
6647426 Mohammed Nov 2003 B2
6678155 Bresniker Jan 2004 B1
6694134 Lu et al. Feb 2004 B1
6697355 Lim Feb 2004 B1
6704409 Dilip et al. Mar 2004 B1
6731932 Rune et al. May 2004 B1
6735184 Davidson et al. May 2004 B1
6751207 Lee et al. Jun 2004 B1
6760325 Hameleers et al. Jul 2004 B1
6763226 McZeal, Jr. Jul 2004 B1
6763233 Bharatia Jul 2004 B2
6791988 Hameleers Sep 2004 B1
6795444 Vo et al. Sep 2004 B1
6807431 Sayers et al. Oct 2004 B2
6807432 Hwang Oct 2004 B2
6816706 Hohnstein et al. Nov 2004 B1
6819652 Ahktar et al. Nov 2004 B1
6829473 Raman et al. Dec 2004 B2
6831903 Kang Dec 2004 B2
6839356 Barany et al. Jan 2005 B2
6859652 Karabinis et al. Feb 2005 B2
6871072 Meche Mar 2005 B1
6879582 Dhara Apr 2005 B1
6879677 Trandal et al. Apr 2005 B2
6917813 Elizondo Jul 2005 B2
6937708 Hirose Aug 2005 B2
6958983 Musikka et al. Oct 2005 B2
6985454 Wiedeman et al. Jan 2006 B1
7003286 Brown et al. Feb 2006 B2
7050414 Lin May 2006 B2
7054307 Papadimitriou et al. May 2006 B2
7054322 D'Annunzio et al. May 2006 B2
7072650 Stanforth Jul 2006 B2
7117015 Scheinert et al. Oct 2006 B2
7120435 Usher et al. Oct 2006 B2
7120436 Kim Oct 2006 B2
7133670 Moll et al. Nov 2006 B1
7133923 MeLampy et al. Nov 2006 B2
7136651 Kalavade Nov 2006 B2
7154901 Chava et al. Dec 2006 B2
7158621 Bayne Jan 2007 B2
7171216 Choksi Jan 2007 B1
7299039 Lee et al. Nov 2007 B2
7313399 Rhee et al. Dec 2007 B2
7324478 Park et al. Jan 2008 B2
7328268 Foltak et al. Feb 2008 B1
7345997 Kim Mar 2008 B2
7346334 Gaeta et al. Mar 2008 B2
7349412 Jones et al. Mar 2008 B1
7359700 Swensen et al. Apr 2008 B2
7383042 Lamb et al. Jun 2008 B2
7385947 Wu et al. Jun 2008 B2
7406069 Yashar et al. Jul 2008 B2
7424313 Ham et al. Sep 2008 B2
7486967 Pan et al. Feb 2009 B2
7490132 Lyle et al. Feb 2009 B1
7522632 La Porta et al. Apr 2009 B2
7536170 Goldman et al. May 2009 B2
7539158 Pan May 2009 B2
7548763 Pan Jun 2009 B2
7552670 Goldman et al. Jun 2009 B2
7606594 Jesse et al. Oct 2009 B2
7653414 Pan Jan 2010 B2
7738488 Marsico et al. Jun 2010 B2
7760695 Gopalakrishnan et al. Jul 2010 B2
7787879 Philips et al. Aug 2010 B1
7840230 Pan Nov 2010 B2
7855988 Pan Dec 2010 B2
7856233 Pan Dec 2010 B2
7979066 Pan Jul 2011 B2
8018907 Kubler et al. Sep 2011 B2
8036158 Pan et al. Oct 2011 B2
8046420 Pan Oct 2011 B2
8086536 Dublish et al. Dec 2011 B2
8089920 Pan Jan 2012 B2
8107409 Pan Jan 2012 B2
8213909 Lee et al. Jul 2012 B2
8224322 Pan Jul 2012 B2
8310990 Pan Nov 2012 B2
8340667 Pan Dec 2012 B2
8351420 Linkola et al. Jan 2013 B2
8359029 Pan Jan 2013 B2
8676155 Fan et al. Mar 2014 B2
8717009 Tu May 2014 B2
20010013050 Shah Aug 2001 A1
20010036173 Shmulevich et al. Nov 2001 A1
20010046859 Kil Nov 2001 A1
20010055298 Baker et al. Dec 2001 A1
20020009060 Gross Jan 2002 A1
20020015392 Musikka et al. Feb 2002 A1
20020016180 Derosier et al. Feb 2002 A1
20020045444 Usher et al. Apr 2002 A1
20020051518 Bondy et al. May 2002 A1
20020058502 Stanforth May 2002 A1
20020061746 Jo et al. May 2002 A1
20020160772 Gailey et al. Oct 2002 A1
20020169887 MeLampy et al. Nov 2002 A1
20030048766 D'Annunzio et al. Mar 2003 A1
20030063721 Hirose Apr 2003 A1
20030088698 Singh et al. May 2003 A1
20030092441 Taha et al. May 2003 A1
20030096628 Bar-On et al. May 2003 A1
20030100302 Armbruster et al. May 2003 A1
20030100342 Ham et al. May 2003 A1
20030112748 Puppa et al. Jun 2003 A1
20030153343 Crockett et al. Aug 2003 A1
20030154306 Perry Aug 2003 A1
20030186694 Sayers et al. Oct 2003 A1
20030198325 Bayne Oct 2003 A1
20040014466 Jesse et al. Jan 2004 A1
20040018829 Raman et al. Jan 2004 A1
20040019539 Raman et al. Jan 2004 A1
20040156495 Chava et al. Aug 2004 A1
20040203621 Brown et al. Oct 2004 A1
20040203677 Brown et al. Oct 2004 A1
20040204097 Scheinert et al. Oct 2004 A1
20040253949 Swensen et al. Dec 2004 A1
20040253984 Csapo et al. Dec 2004 A1
20040259556 Czys Dec 2004 A1
20050044152 Hardy et al. Feb 2005 A1
20050064922 Owens et al. Mar 2005 A1
20050070278 Jiang Mar 2005 A1
20050075106 Jiang Apr 2005 A1
20050091392 Gesswein et al. Apr 2005 A1
20050176413 Lee et al. Aug 2005 A1
20050220054 Meier et al. Oct 2005 A1
20050249176 O'Neill et al. Nov 2005 A1
20050250491 Roy et al. Nov 2005 A1
20060026252 Caspi et al. Feb 2006 A1
20060046714 Kalavade Mar 2006 A1
20060046760 Bertino et al. Mar 2006 A1
20060047836 Rao et al. Mar 2006 A1
20060052113 Ophir et al. Mar 2006 A1
20060063544 Zhao et al. Mar 2006 A1
20060098661 Pan May 2006 A1
20060114934 Shin et al. Jun 2006 A1
20060141984 Taglienti et al. Jun 2006 A1
20060142011 Kallio Jun 2006 A1
20060148465 Perdomo et al. Jul 2006 A1
20060159039 Jung et al. Jul 2006 A1
20060203746 Maggenti et al. Sep 2006 A1
20060217121 Soliman et al. Sep 2006 A1
20060221912 Olivier et al. Oct 2006 A1
20060234747 Pan Oct 2006 A1
20060234774 Pan et al. Oct 2006 A1
20060258358 Kallio Nov 2006 A1
20070008968 Baker et al. Jan 2007 A1
20070010245 Levitan Jan 2007 A1
20070021097 Gaeta et al. Jan 2007 A1
20070021118 Ophir Jan 2007 A1
20070060124 Kalavade Mar 2007 A1
20070076697 Huotari et al. Apr 2007 A1
20070082684 Rozenstrauch et al. Apr 2007 A1
20070087738 Melkesetian Apr 2007 A1
20070127423 Ho Jun 2007 A1
20070147598 Somes et al. Jun 2007 A1
20070197215 Ben-Yehuda et al. Aug 2007 A1
20070202847 Pan Aug 2007 A1
20070213075 Jiang Sep 2007 A1
20070230352 Kokku et al. Oct 2007 A1
20070232267 Pan Oct 2007 A1
20070232304 Goldman et al. Oct 2007 A1
20070234892 Goldman et al. Oct 2007 A1
20070243891 Civanlar et al. Oct 2007 A1
20070271606 Amann et al. Nov 2007 A1
20070287452 Pan Dec 2007 A1
20070291910 Bucchieri et al. Dec 2007 A1
20070293216 Jiang Dec 2007 A1
20080013531 Elliott et al. Jan 2008 A1
20080039144 Pan et al. Feb 2008 A1
20080080438 Gopalakrishnan et al. Apr 2008 A1
20080101314 Bachmutsky May 2008 A1
20080101410 Barkley et al. May 2008 A1
20080134295 Bailey et al. Jun 2008 A1
20080146158 Pan et al. Jun 2008 A1
20080160997 Kim Jul 2008 A1
20080168523 Ansari et al. Jul 2008 A1
20080244014 Britton et al. Oct 2008 A1
20080261580 Wallentin et al. Oct 2008 A1
20090003269 Kumazawa et al. Jan 2009 A1
20090022155 Rosenberg et al. Jan 2009 A1
20090031244 Brezina et al. Jan 2009 A1
20090067441 Ansari et al. Mar 2009 A1
20090156213 Spinelli et al. Jun 2009 A1
20090186626 Raghothaman Jul 2009 A1
20090215449 Avner Aug 2009 A1
20090227230 Camilleri et al. Sep 2009 A1
20090227235 Pan Sep 2009 A1
20090228555 Joviak et al. Sep 2009 A1
20090270097 Gallagher et al. Oct 2009 A1
20090271491 Pan Oct 2009 A1
20090292785 Leedberg et al. Nov 2009 A1
20090325584 Pan Dec 2009 A1
20090327819 Pan Dec 2009 A1
20100008306 Pan Jan 2010 A1
20100008369 Pan Jan 2010 A1
20100048197 Jiang Feb 2010 A1
20100048208 Gunaratnam et al. Feb 2010 A9
20100057485 Luft Mar 2010 A1
20100057732 O'Sullivan et al. Mar 2010 A1
20100075668 Pan Mar 2010 A1
20100080214 Li et al. Apr 2010 A1
20100094878 Soroca et al. Apr 2010 A1
20100199340 Jonas et al. Aug 2010 A1
20100217809 Vymenets et al. Aug 2010 A1
20100217837 Ansari et al. Aug 2010 A1
20110059740 Pan Mar 2011 A1
20110060853 Pan Mar 2011 A1
20110223921 Pan Sep 2011 A1
20110320576 Lauer et al. Dec 2011 A1
20120002607 Pan Jan 2012 A1
20120020293 Nix, Jr. et al. Jan 2012 A1
20120044908 Spinelli et al. Feb 2012 A1
20120106454 Pan May 2012 A1
20120224586 Nag et al. Sep 2012 A1
20120252444 Pan Oct 2012 A1
20120324041 Gerber et al. Dec 2012 A1
20130039279 Pan Feb 2013 A1
20130065583 Pan Mar 2013 A1
20130130677 Pan May 2013 A1
20130148578 Pan Jun 2013 A1
20150081812 Davies et al. Mar 2015 A1
Foreign Referenced Citations (3)
Number Date Country
1427637 Jul 2003 CN
0365885 May 1990 EP
2007102003 Sep 2007 WO
Non-Patent Literature Citations (26)
Entry
Hoffpauir et al., United States Statutory Invention Registration No. H1,918; Entitled “Integrated Authentication Center and Method for Authentication in a Wireless Telecommunications Network”; Filed Feb. 19, 1998; Published Nov. 7, 2000; 19 Pages.
B.G. Evans and K. Baughan; “Visions of 4G”; Electronics & Communication Engineering Journal; Dec. 2000; pp. 293-303.
Shirshanka Das, Alok Nandan & Giovanni Pau (University of CA, Los Angeles, CA, USA); “Spawn: A Swarming Protocol for Vehicular Ad-Hoc Wireless Networks”; VANET'04, Oct. 1, 2004, Philadelphia, PA, USA; ACM 1-58113-922-5/04/0010; 2 pgs.
Yu-Chee Tseng, Chia-Ching Shen (National Chiao Tung University) & Wen-Tsuen Chen (National Tsing Hua University); “Integrating Mobile IP with AD Hoc Networks”; IEEE Computer Society; 0018-9162/03; 2003 IEEE; May 2003; pp. 48-55.
Halim Yanikomeroglu, David D. Falconer & Van M. Sreng; “Coverage Enhancement Through Two-Hop Peer-to-Peer Relaying in Cellular Radio Networks”; Broadband Communications and Wireless Systems (BCWS) Centre Department of Systems & Computer Engineering, Carleton University, Ottawa, Canada, WWRF Meeting #7. Eindhoven, the Netherlands, Dec. 3-4, 2002, WG4: Spectrum, New Air Interfaces and Ad-Hoc Networking Multi-Hop Wireless Systems; 10 pages.
Bur Goode; “Voice Over Internet Protocol (VoIP)”; 0018-9219/02 2002 IEEE; Proceedings of the IEEE; vol. 90, No. 9, Sep. 2002; pp. 1495-1517.
Kyung-Hyu Lee, Kyu-Ok Lee & Kwon-Chul Park (Network Research Laboratory ETRI Korea) Jong-Ok Lee and Yoon-Hak Bang (Network Planning Team KT Korea); “Architecture To be Deployed on Strategies of Next-Generation Networks”; 0-7803-7802-4/03 2003 IEEE; pp. 819-822.
Wolfgang Kellerer, Christian Bettstetter, Christian Schwingenschlögl & Peter Sties (Technische Universität Munchen) Karl-Ernst Steinberg (BMW) & Hans-Jörg Vögel (the Fantastic Corp); “(Auto) Mobile Communication in a Heterogeneous and Converged World”; IEEE Personal Communications; Dec. 2001; 1070-9916/01; 2001 IEEE pp. 41-47.
Nilanjan Banerjee & Sajal K. Das (University of Texas, Arlington) & Arup Acharya (IBM T.J. Watson Research Center)' “Peer-to-peer SIP-based Services over Wireless Ad Hoc Networks”; BROADWIM: Broadband Wireless Multimedia Workshop; Oct. 29, 2004—broadnets.org; *This work was supported by NSF under the ORBIT testbed project, grant # NSF NRT Project #ANI-0335244 and by NSF ITR grant IIS-0326505; 8 pages.
Hung-Yu Wei (Columbia University) & Richard D. Gitlin (NEC Laboratories America); “Two-Hop-Relay Architecture for Next-Generation WWAN/WLAN Integration”; 4G Mobile Communications: Toward Open Wireless Architecture; 1536-1284/04 2004 IEEE; IEEE Wireless Communications; Apr. 2004; pp. 2-9.
Wolfgang Kellerer (LKN, Munich University of Technology), Hans-Jörg Vögel (the Fantastic Corp.) & Karl-Ernst Steinberg (BMW); “A Communication Gateway for Infrastructure Independent Wireless Access”; IEEE Communications Magazine; Mar. 2002; vol. 9; No. 3; 6 pages.
Willie W. Lu & Jenny Hu (U.S. Center for Wireless Communications, Stanford University, CA); “Open Wireless Architecture—The Core to 4G Mobile Communications”; China Communications; Apr. 2006; pp. 32-39.
E Ralf Pabst, Bernard H. Walke & Daniel C. Schultz (RWTH Aachen University) Patrick Herhold & Gerhard P. Fettweis (Technical University of Dresden) Halim Yanikomeroglu & David D. Falconer (Carleton University) Sayandev Mukherjee & Harish Viswanathan (Lucent Technologies) Matthias Lott & Wolfgang Zirwas (Siemens ICM) Mischa Dohler & Hamid Aghvami (Kings College); “Relay-Based Deployment Concepts for Wireless and Mobile Broadband Radio”; 0163-6804/04; 2004 IEEE; IEEE Communications Magazine; Sep. 2004; pp. 80-89.
Simone Frattasi, Hanane Fathi, Frank H.P. Fitzek & Ramjee Prasad (Aalborg University) Marcos D. Katz (Samsung Electronics); “Defining 4G Technology from the User's Perspective”; IEEE Network; Jan./Feb. 2006; 0890-8044/06; 2006 IEEE; pp. 35-41
Ian F. Akyildiz (Broadband and Wireless Networking BWN Lab, Georgia Institute of Technology) Xudong Wang & Weilin Wang (Kiyon, Inc. La Jolla, CA); “Wireless Mesh Networks: A Survey”; Computer Networks 47; Jan. 1, 2005; pp. 445-487; 1389-1286 2004 Elsevier B.V.
Brian Woerner (Virginia Tech, Blacksburg, VA) & Mostofa Howlader (University of Tennessee, Knoxville, TN); “Research Directions for Fourth Generation Wireless”; Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE 2001); Jun. 20-22, 2001; Cambridge, MA, USA; IEEE Computer Society 2001; ISBN 0-7695-1269-0; 2 pages.
“Framework and Overall Objectives of the Future Development of IMT-2000 and Systems Beyond IMT-2000”; International Telecommunication Union; ITU-R Radiocommunication Sector of ITU; Recommendation ITU-R M.1645 (Jun. 2003); M Series; Mobile, Radiodetermination, Amateur and Related Satellite Services; 26 pages.
Extended European Search Report for European Application No. 05801092.7-1525/1810465, PCT/US05/035648 mailed Jan. 31, 2011, 72 pages.
Notification of the First Office Action for United Kingdom Application No. GB0706179.9 mailed Sep. 18, 2008, 3 pages.
First Examination Report for Indian Application No. 469/MUMNP/2007, dated Mar. 30, 2013, 3 pages.
International Report on Patentability and Written Opinion of the International Search Authority for International Application No. PCT/US05/35648 from the International Searching Authority, mailed on Aug. 24, 2006, 8 pages.
International Search Report and Written Opinion of the International Search Authority for International Application No. PCT/US09/045951 from the International Searching Authority, mailed on Dec. 30, 2009, 8 pages.
International Search Report and Written Opinion of the International Search Authority for International Application No. PCT/US09/045957 from the International Searching Authority, mailed on Jan. 14, 2010, 8 pages.
International Search Report and Written Opinion of the International Search Authority for International Application No. PCT/US09/045973 from the International Searching Authority, mailed on Jan. 18, 2010, 10 pages.
Yu, W. et al., Abstract of “Reverse Link Capacity Analysis on Distributed Wireless Communication System”, Journal of Beijing University of Posts and Telecommunications, 2004, Issue 3, Retrieved from <<http://en.cnki.com/article—en/Cjfdtotal-BJYD200403020.htm>>, 3 pages.
International Search Report and Written Opinion received in corresponding PCT Application No. PCT/US2009/045968 from the International Searching Authority (KR) mailed Jan. 21, 2010, 13 pages.
Related Publications (1)
Number Date Country
20120094659 A1 Apr 2012 US
Divisions (1)
Number Date Country
Parent 12171840 Jul 2008 US
Child 13334753 US