Learn More
In this paper we propose an efficient resource management technique for MPLS-based DiffServ networks. The service provider (SP) can predict sufficient bandwidth resources on the link for traffic caused by contracting of SLAs (service level agreement). It could be an important part of admission control in the SLA negotiation process (SLA-creation). Decisions(More)
This paper describes a centralized routing algorithm based on permutation of M traffic flows entering the network. The proposed approach is significantly less complex than combinatorial approach and can be used as load-balancing tool. The main advantage of such approach is that many non-perspective flow permutations could be eliminated from the calculation(More)
  • S. Krile
  • 2008
In optimal QoS provisioning all traffic flows are distributed among LSPs (label switching path) related to service classes. The congestion of concurrent flows (traversing the network simultaneously) can appear. For LSP creation the IGP (interior getaway protocol) uses simple on-line routing algorithms (e.g. OSPFS, IS-IS) based on shortest path methodology.(More)
In end-to-end QoS provisioning some bandwidth portions on the link may be reserved for certain traffic classes (and for particular set of users) so the congestion problem of concurrent flows (traversing the network simultaneously) can appear. It means that in overloaded and poorly connected MPLS/DS networks the CR (Constraint-based Routing) becomes(More)
Computational technique for lower bound on Two-dimensional Diamond-1 constrained channel capacity is presented in this paper. It is basically an amalgamation of Matrix Fractal Grow Method (MFGM) and a new Matrix Fractal Reduction Method both applicable to state transition matrices of the corresponding constrained channels and Rayleigh Quotient Iteration(More)
  • 1