摘要
This paper investigates the routing among autonomous systems (ASs) with quality of service (QoS) requirements. To avoid the intractability of the problem, abstract QoS capability must be informed among ASs, because the routhing which constrained QoS has been proved to be nondeterministic polynomial-time (NP) hard even inside an AS. This paper employs the modified Dijkstra algorithm to compute the maximum bottleneck bandwidth inside an AS. This approach lays a basis for the AS-level switching capability on which interdomain advertisement can be performed. Furthermore, the paper models the aggregated traffic in backbone network with fractional Brownian motion (FBM), and by integrating along the time axis in short intervals, a good estimation of the distribution of queue length in the next short intervals can be obtained. The proposed advertisement mechanism can be easily implemented with the current interdomain routing protocols. Numerical study indicates that the presented scheme is effective and feasible.
This paper investigates the routing among autonomous systems （ASs） with quality of service （QoS） requirements. To avoid the intractability of the problem, abstract QoS capability must be informed among ASs, because the routhing which constrained QoS has been proved to be nondeterministic polynomial-time （NP） hard even inside an AS. This paper employs the modified Dijkstra algorithm to compute the maximum bottleneck bandwidth inside an AS. This approach lays a basis for the AS-level switching capability on which interdomain advertisement can be performed. Furthermore, the paper models the aggregated traffic in backbone network with fractional Brownian motion （FBM）, and by integrating along the time axis in short intervals, a good estimation of the distribution of queue length in the next short intervals can be obtained. The proposed advertisement mechanism can be easily implemented with the current interdomain routing protocols. Numerical study indicates that the presented scheme is effective and feasible.
