http://www.sciencedirect.com/science/article/B6VC5-4VBDKNX-1/2/b7e59602a9fb4eb885f498b0d8c779cc
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 ...
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 discussion and critique of the ideological framework that led to the preponderance of the concepts of utility and optimum as critical referents of decision in the modern age. The result of this critique is an appreciation of the limits of classical operational research, which can only be overcome by adopting a constructivist perspective. In the author's view, this is the approach that will viabilise a contrib...
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 | |||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |