Bandwidth Constrained Distributed Inter-domain Path Selection (DIPS)

摘要

In this paper, bandwidth constrained path selection technologies are reviewed, which may utilize distributed routing protocols with appropriate extensions or centralized mechanisms based on Software Defined Network (SDN) to calculate end-to- end bandwidth constrained paths over Internet without using links with depleted bandwidth. In these traditional schemes, the resource reservation may sometimes fail due to inadequate bandwidth over running network links. Because of the requirements of scalability and privacy for routing policies, SDN-based technologies, such as B4, KANDOO and Control eXchange Point (CXP), are not perfect to solve this problem faced by path selection. In addition, distributed routing protocols with extensions, e.g., OSPF-TE, can only help calculate paths inside one particular autonomous system, which cannot satisfy the need of end-to-end path selection over whole internet. Based on these observations, the Distributed Inter-domain Path Selection (DIPS) scheme is then proposed in this paper. In which, all links without enough bandwidth for allocation are excluded from the network resource reservation pool. This DIPS scheme can generate bandwidth constrained end-to-end paths, which serve as a distributed solution for inter-domain path calculation, considering centralized or distributed intra-domain technologies. Finally, the proposed scheme is compared with existing solutions on bandwidth utilization and computational complexity.