Search
Search results for: PREEMPTION
-
Performance Evaluation of Preemption Algorithms in MPLS Networks
PublicationPreemption is a traffic engineering technique in Multiprotocol Switching Networks that enables creation of high priority paths when there is not enough free bandwidth left on the route. Challenging part of any preemption method is to select the best set of paths for removal. Several heuristic methods are available but no wider comparison had been published before. In this paper, we discuss the dilemmas in implementing preemption...
-
Comparison of centralized and decentralized preemption in MPLS networks
PublicationPreemption is one of the crucial parts of the traffic engineering in MPLS networks. It enables allocation of high-priority paths even if the bandwidth on the preferred route is exhausted. This is achieved by removing previously allocated low-priority traffic, so as enough free bandwidth becomes available. The preemption can be performed either as a centralized or a decentralized process. In this article we discuss the differences...
-
Performance of LSP preemption methods in different MPLS networks
PublicationPreemption in Multiprotocol Label Switching (MPLS) is an optional traffic engineering technique used to create a new path of high priority when there is not enough bandwidth available. In such case the path is admitted by removing one or more previously allocated paths of lower priority. As there are usually many possible sets of low priority paths which can be selected, a preemption algorithm is being started to select the best...
-
A New Heuristic Algorithm for Effective Preemption in MPLS Networks
PublicationW artykule opisano nowy algorytm wywłaszczania przeznaczony dla sieci MPLS. Umożliwia on alokację zasobów sieci dla nowej ścieżki uwzględniając koszt usuniętych jednej lub wielu istniejących już ścieżek. Proponowany heurystyczny algorytm wybiera ścieżki do wywłaszczenia wykorzystując informację o topologii sieci. Używa funkcji optymalizacji minimalizującej stratę pasma na poziomie sieci. Przedstawiono i omówiono wyniki badań symulacyjnych...
-
Normal-form preemption sequences for an open problem in scheduling theory
PublicationStructural properties of optimal preemptive schedules have been studied in a number of recent papers with a primary focus on two structural parameters: the minimum number of preemptions necessary, and a tight lower bound on shifts, i.e., the sizes of intervals bounded by the times created by preemptions, job starts, or completions. These two parameters have been investigated for a large class of preemptive scheduling problems,...
-
Burst loss probability for the combination of extended offset time based service differentiation scheme and PPS in optical burst switching network
PublicationIn the paper analytical model for calculating burst loss probabilities for the combination of two service differentiation schemes for OBS network namely: extended offset time based scheme and PPS (Preemption Priority Schemes) is revised. Moreover authors introduce analytical model for calculating burst loss probabilities for an optical path when OBS network employs both service differentiation schemes and JET signaling. The comparison...