Methods and apparatus are disclosed for reducing wireless telecommunication costs for enterprises having a plurality of PBX-equipped sites, connected by either a public network (e.g., the PSTN, the Internet, etc.), a private network (e.g., leased lines, a virtual private network [VPN] over the Internet, etc.), or some combination of public and private networks. In particular, the illustrative embodiments of the present invention attempt to reduce telecommunication costs by advantageously routing calls from an off-premises wireless terminal belonging to the enterprise via one or more of the enterprise's private branch exchanges. The present invention is especially advantageous in that it can reduce telecommunication costs for calls from an off-premises wireless terminal to any type of destination: another cell phone, a wireline terminal, a private branch exchange, etc.

There is provided herein a system and method for automatic configuration of data routings for use with electronic data such as phone calls, faxes, etc. In the preferred embodiment, when more than one carrier might potentially terminate the transmission, the carriers are ordered based on some screening criterion (e.g., transmission price). Data transmissions are then assigned to the carriers based on the sorting order, with the second place and lower carriers (e.g., the higher priced carriers) not being selected unless the first carrier cannot complete the transaction. The switch instructions necessary to implement this scheme are generated automatically.

Various embodiments relate to a method and apparatus for computing a minimum segment labeling of a given path on a segment cover graph, the method including receiving a connection request for a connection between a source node and a destination node, generating a Shortest Path Directed Acyclic Graph (SPDAG) from the source node to the destination node by running a shortest path algorithm from the source node, determining an end node, between the source node and the destination node, at which the SPDAG deviates from the given path, determining whether the end node is the end of an Equal Cost Multipath (ECMP) and terminating the shortest path algorithm at a predecessor node to the end node if the end node is the end of an ECMP and making the predecessor node to the end node the source node.

Various embodiments relate to a method and apparatus for computing a minimum segment labeling of a given path on a segment cover graph, the method including receiving a connection request for a connection between a source node and a destination node, generating a Shortest Path Directed Acyclic Graph (SPDAG) from the source node to the destination node by running a shortest path algorithm from the source node, determining an end node, between the source node and the destination node, at which the SPDAG deviates from the given path, determining whether the end node is the end of an Equal Cost Multipath (ECMP) and terminating the shortest path algorithm at a predecessor node to the end node if the end node is the end of an ECMP and making the predecessor node to the end node the source node.

There is provided herein a system and method for automatic configuration of data routings for use with electronic data such as phone calls, faxes, etc. In the preferred embodiment, when more than one carrier might potentially terminate the transmission, the carriers are ordered based on some screening criterion (e.g., transmission price). Data transmissions are then assigned to the carriers based on the sorting order, with the second place and lower carriers (e.g., the higher priced carriers) not being selected unless the first carrier cannot complete the transaction. The switch instructions necessary to implement this scheme are generated automatically.