An Approach to Optimal Peering Between Autonomous Systems in the Internet
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Optimizing interconnection policies
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
A BGP-based mechanism for lowest-cost routing
Distributed Computing - Special issue: PODC 02
Inter-autonomous system provisioning for end-to-end bandwidth guarantees
Computer Communications
Distributed schemes for diverse path computation in multidomain MPLS networks
IEEE Communications Magazine
Hi-index | 0.00 |
Due to the development of Next Generation Networks, leading to a multiservice transport layer with a multidomain environment, the importance of interconnection issues keeps growing. As the number of possible partners increases, operators face different routing options with regard to service quality and cost. We present the extension of the Least Cost Routing (LCR) concept which takes into account the reliability issues. As for a large number of variables the LCR problem is unsolvable, some heuristic algorithms to find the problem solution are proposed and evaluated. The solution helps to optimize connections among telecommunication operators by minimizing costs for served demands and protecting against network failures.