3 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 3 / 3
Yayın A priority based packet scheduler with deadline considerations(IEEE Computer Soc, 2006) Dağ, Tamer; Gökgöl, OralQoS issues have become a focal point of research on Next Generation Networks (NGNs). In order to supply the various QoS requirement for different kinds of applications, new scheduling policies need to be developed and evaluated. This paper introduces a new kind of packet scheduler which tries to integrate an important QoS parameter (the delay) with the classical schedulers. The two sets of algorithms introduced; Static Priority with Deadline Considerations (SPD) and Dynamic Priority with Deadline Considerations (DPD); not only simplify the complexity and overhead of a classical Earliest Deadline First (EDF) or Static Priority (SP) algorithm, but also provide a better QoS based on the results of the simulations conducted.Yayın Improving the calibration time of traffic simulation models using parallel computing technique(Institute of Electrical and Electronics Engineers Inc., 2019-06) Dadashzadeh, Nima; Ergün, Murat; Kesten, Ali Sercan; Zura, MarijanThe calibration procedure for traffic simulation models can be a very time-consuming process in the case of a large-scale and complex network. In the application of Evolutionary Algorithms (EA) such as Genetic Algorithms (GA) and Particle Swarm Optimization (PSO) for calibration of traffic simulation models, objective function evaluation is the most time-consuming step in such calibration problems, because EA has to run a traffic simulation and calculate its corresponding objective function value once for each set of parameters. The main contribution of this study has been to develop a quick calibration procedure for the parameters of driving behavior models using EA and parallel computing techniques (PCTs). The proposed method was coded and implemented in a microscopic traffic simulation software. Two scenarios with/without PCT were analyzed using the developed methodology. The results of scenario analysis show that using an integrated calibration and PCT can reduce the total computational time of the optimization process significantly-in our experiments by 50%-and improve the optimization algorithm's performance in a complex optimization problem. The proposed method is useful for overcoming the limitation of computational time of the existing calibration methods and can be applied to various EAs and traffic simulation software.Yayın Constraint-based routing in traffic engineering(IEEE, 2006) Karaman, AyşeTraffic engineering (TE) describes a domain-wide perspective for traffic control as opposed to application-specific concerns of QoS. MPLS is today's most powerful architecture for TE. Constraint-based routing refers to the process of path assignment to flows to fulfill the TE objective which has been defined in a number of multi-constraint ways, and is the most significant component of TE. In this paper, we review constraint-based routing algorithms. We first provide an overview of MPLS/TE and place constraint-based routing within this approach. We then look into the potential path attributes and the underlying platform to characterize these algorithms before we present our review. Our study provides a comprehensive reference to the operational structure and specifications of constraint-based routing algorithms.
