Wyszukiwarka
Nie znaleźliśmy wyników w zadanych kryteriach!
Ale mamy wyniki w innych katalogach.Filtry
wszystkich: 2184
-
Katalog
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: K-SHORTEST PATH
-
Optimization of The Shortest-Path Routing with Equal-Cost Multi-Path Load Balancing
Publikacja -
k-Penalty: A Novel Approach to Find k-Disjoint Paths with Differentiated Path Costs
PublikacjaW artykule rozpatrywany jest problem ochrony dedykowanej na wypadek awarii wielokrotnej elementów sieci teleinformatycznej. Wspomniana ochrona jest możliwa do zapewnienia poprzez wyznaczenie i zainstalowanie zbioru k rozłącznych ścieżek dla każdego żądania. W szczególności rozpatrywany jest problem wyznaczenia k rozłącznych ścieżek w sieciach typu ''multi-cost'', w przypadku których koszt dowolnego łącza może być różny dla każdej...
-
Sylwester Kaczmarek dr hab. inż.
OsobySylwester Kaczmarek ukończył studia w 1972 roku jako mgr inż. Elektroniki, a doktorat i habilitację uzyskał z technik komutacyjnych i inżynierii ruchu telekomunikacyjnego w 1981 i 1994 roku na Politechnice Gdańskiej. Jego zainteresowania badawcze ukierunkowane są na: sieci IP QoS, sieci GMPLS, sieci SDN, komutację, ruting QoS, inżynierię ruchu telekomunikacyjnego, usługi multimedialne i jakość usług. Aktualnie jego badania skupiają...
-
Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios
PublikacjaDisjoint path routing approaches can be used to cope with multiple failure scenarios. This can be achieved using a set of k (k> 2) link- (or node-) disjoint path pairs (in single-cost and multi-cost networks). Alternatively, if Shared Risk Link Groups (SRLGs) information is available, the calculation of an SRLG-disjoint path pair (or of a set of such paths) can protect a connection against the joint failure of the set of links...
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublikacjaLet G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...
-
Dynamic unattended measurement based routing algorithm for diffServ architecture
PublikacjaDynamic routing is very important in terms of assuring QoS in today's packet networks especially for streaming and elastic services. Existing solutions dedicated to dynamic routing are often too complicated and seem to be not usable in real time traffic scenarios where transferred traffic may vary significantly. This was the main reason for research and new routing mechanism proposal which should apply to today's packet networks....
-
Simulation model for evaluation of QoS routing algorithm in large packet networks
PublikacjaThe variety of traffic transferred via current telecommunication networks includes also voice, which should meet quality requirements. One of mechanisms, which can support QoS in current packet networks, is routing. There exist many routing proposals which should introduce the QoS into the network but practically they don't. Following paper presents the realization of simulation model for evaluation of a new routing algorithm DUMBRA...
-
Generating optimal paths in dynamic environments using RiverFormation Dynamics algorithm
PublikacjaThe paper presents a comparison of four optimisation algorithms implemented for the purpose of finding the shortest path in static and dynamic environments with obstacles. Two classical graph algorithms –the Dijkstra complete algorithm and A* heuristic algorithm – were compared with metaheuristic River Formation Dynamics swarm algorithm and its newly introduced modified version. Moreover, another swarm algorithm has been compared...
-
Autonomous port management based AGV path planning and optimization via an ensemble reinforcement learning framework
PublikacjaThe rapid development of shipping trade pushes automated container terminals toward the direction of intelligence, safety and efficiency. In particular, the formulation of AGV scheduling tasks and the safety and stability of transportation path is an important part of port operation and management, and it is one of the basic tasks to build an intelligent port. Existing research mainly focuses on collaborative operation between...
-
Routing decisions independent of queuing delays in broadband leo networks
PublikacjaThis paper presents an analysis of queuing and propagation delays of Inter-Satellite Links (ISLs) in broadband Low-Earth Orbit (LEO) satellite networks. It is shown that queuing delays are negligible in all reasonable working conditions of the broadband ISL network. This fact makes it possible to simplify the routing protocols in such networks and permits using already known multi-commodity flow solutions for routing. The performance...