Encontrados 5 documentos, a visualizar página 1 de 1
Finding non-dominated bicriteria shortest pairs of disjoint simple paths
Clímaco, João C. N.; Pascoal, Marta M. B.http://www.sciencedirect.com/science/article/B6VC5-4VBDKNX-1/2/b7e59602a9fb4eb885f498b0d8c779cc
Internet packet routing: Application of a K-quickest path algorithm
Clímaco, João C. N.; Pascoal, Marta M. B.; Craveirinha, José M. F.; Captivo, M. Eugénia V.This paper describes a study on the application of an algorithm to rank the K-quickest paths to the routing of data packets in Internet networks. For this purpose an experimental framework was developed by considering two types of random generated networks. To simulate values of the IP packet sizes, a truncated Pareto distribution was defined, having in mind to reflect a key feature of Internet traffic, namely ...
An algorithm for ranking quickest simple paths
Pascoal, Marta M. B.; Captivo, M. Eugénia V.; Clímaco, João C. N.In this paper, an algorithm for ranking loopless paths in undirected networks, according to the transmission time, is presented. It is shown that the worst-case computational time complexity of the algorithm presented is , which is also the best-known complexity to solve this problem. The worst-case memory complexity is , which improves the existing algorithms. Finally, comparative computational results, with o...
A new implementation of Yen’s ranking loopless paths algorithm
Martins, Ernesto Q. V.; Pascoal, Marta M. B.Yen’s algorithm is a classical algorithm for ranking the K shortest loopless paths between a pair of nodes in a network. In this paper an implementation of Yen’s algorithm is presented. Both the original algorithm and this implementation present $\cal O(Kn(m + n\log n))$ computational complexity order when considering a worst-case analysis. However, computational experiments are reported, which allow to conclud...
A bicriterion approach for routing problems in multimedia networks
Clímaco, João C. N.; Craveirinha, José M. F.; Pascoal, Marta M. B.Routing problems in communication networks supporting multiple services, namely, multimedia applications, involve the selection of paths satisfying multiple constraints (of a technical nature) and seeking simultaneously to ldquooptimizerdquo the associated metrics. Although traditional models in this area are single-objective, in many situations, it is important to consider different, eventually conflicting, ob...
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||