نتایج جستجو برای: shortest path with resource constraints

تعداد نتایج: 9378517  

2012

For utilizing distributed resources in optical grid environment advanced reservations play a very crucial role. For applications like the co-allocation of distributed resources and deadline driven applications advance reservations are essential. Also for enhancing capabilities of resource brokers advance reservations play a major role. The objective is to determine a scheduling algorithm that m...

2002
Youngseok Lee Yongho Seok Yanghee Choi Changhoon Kim

A traffic engineering problem consists of setting up paths between the edge nodes of the network to meet traffic demands while optimizing the network performance. It is known that total traffic throughput in a network, hence the resource utilization, can be maximized if the traffic demand is split over multiple paths. However, the problem formulation and practical algorithms, which calculate th...

Journal: :CoRR 2008
Changyong Zhang

Link weights are the principal parameters of shortest path routing protocols, the most commonly used protocols for IP networks. The problem of optimally setting link weights for unique shortest path routing is addressed. Due to the complexity of the constraints involved, there exist challenges to formulate the problem properly, so that a solution algorithm may be developed which could prove to ...

2008
Changyong Zhang

Link weights are the principal parameters of shortest path routing protocols, the most commonly used protocols for IP networks. The problem of optimally setting link weights for unique shortest path routing is addressed. Due to the complexity of the constraints involved, there exist challenges to formulate the problem properly, such that a more efficient solution algorithm may be developed acco...

2004
Ramtin Khosravi Mohammad Ghodsi

This paper studies the problem of finding a shortest path between two points in presence of single-point visibility constraints. In this type of constraints, there should be at least one point on the output path from which a fixed viewpoint is visible. The problem is studied in various domains including simple polygons, polygonal domains, and polyhedral surfaces. The method is based on partitio...

2017
Zengliang Han Dongqing Wang Feng Liu Zhiyong Zhao

This paper investigates an improved genetic algorithm on multiple automated guided vehicle (multi-AGV) path planning. The innovations embody in two aspects. First, three-exchange crossover heuristic operators are used to produce more optimal offsprings for getting more information than with the traditional two-exchange crossover heuristic operators in the improved genetic algorithm. Second, dou...

1999
Martin van der Zee Geert Heijenk

The device for providing consolidation of preferential resource quality of service constraints specified by a source user and adestination user in a communication network has two quality of service translators receiving preferential resource constraintsinput from the source and destination users respectively. The translators translate input QOS requirements, for each of thesourc...

Journal: :IEEE Transactions on Knowledge and Data Engineering 2014

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید