3 research outputs found

    A Traffic Engineering Algorithm for Provisioning Virtual Private Networks in the Enhanced Hose Model

    Get PDF
    Abstract: A Virtual Private Network is a logical network established on top of a public packet switched network. To guarantee that quality of service requirements, specified by customers, can be met, the network service provider needs to reserve enough resources on the network and allocate/manage them in an optimal way. Traffic engineering algorithms can be used by the Network Service Provider to establish multiple Virtual Private Networks in an optimal way, while meeting customers' Quality of Service requirements. For delay sensitive network applications, it is critical to meet both bandwidth and delay requirements. In contrast to traditional Virtual Private Network Quality of Service models (customer-pipe model and hose model), which focused only on bandwidth requirements, a new model called the enhanced hose model has been proposed, which considers both bandwidth and delay requirements. However, to the best of our knowledge, thus far, traffic engineering problems associated with establishing multiple enhanced hose model Virtual Private Networks have not been investigated. In this paper, we proposed a novel Virtual Private Network traffic engineering algorithm, called the minimum bandwidth-delay cost tree algorithm to address these problems. According to experimental simulations conducted and reported in our paper, the minimum bandwidth-delay cost tree algorithm can indeed achieved better performance (lower rejection ratios) compared to previous algorithms

    New architecture and algorithms for fast construction of hose-model VPNs

    No full text
    Hose-model virtual private networks (VPNs) provide customers with more flexibility in specifying bandwidth requirements than pipe-model VPNs. Many hose-model VPN provisioning algorithms have been proposed, and they focus on the bandwidth efficiency in the construction of a single hose-model VPN. In practice, however, VPNs come and go and the dynamics will affect the performance of these VPN provisioning algorithms. If the frequency of adding and deleting VPNs is high, these algorithms will have a scalability problem. We propose in this paper a new network architecture for dynamic VPN construction. In the proposed architecture, adding a new VPN is much simpler and faster, and all that is required is to check. if the edge routers have enough bandwidth. There is no need to check the bandwidth left on each internal link because the architecture guarantees that as long as the edge routers have enough capacities to accept the VPN, the internal links Will never experience overflow caused by adding the new VPN. We present a linear programming formulation for finding the optimal routing that maximizes the amount of admissible VPN traffic in the network. We then exploit the underlying network flow structure and convert the linear programming problem into a subgradient iterative search problem. The resulting solution is significantly faster than the linear programming approach
    corecore