Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "routing" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 237
Tytuł:
A new multiple objective dynamic routing method using implied costs
Autorzy:
Craveirinha, J.
Martins, L.
Antunes, C.H.
Climaco, J.N.
Powiązania:
https://bibliotekanauki.pl/articles/307698.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
dynamic routing
multicriteria decision support systems
traffic management
Opis:
There are advantages in considering the routing problem in integrated communication networks as a multiobjective shortest path problem, having in mind to grasp eventual conflicts and trade-offs among distinct objectives and quality of services (QoS) constraints. On the other hand the utilisation of dynamic routing methods in various types of networks is well known to have significant impact on network performance and cost, namely in overload and failure conditions. This paper presents the detailed formulation of a proposal of a multiple objective dynamic routing method (MODR) of periodic state dependent routing type, enabling to represent distinct QoS related metrics and requirements in a consistent manner. The MODR method present formulation is based on a multiple objective shortest path model with constraints and is prepared to use implied costs as one of the metrics. Alternative paths tor each traffic flow are changed as a function of periodic updates of certain QoS related parameters estimated from real time measurements on the routes and trunks of the network. Such paths are computed by a specialised and efficient variant of a bi-objective shortest path constrained algorithm, developed for the MODR, enabling to incorporate flexible requirements on the QoS metrics. The architecture of the routing system is discussed together with the features of its main modules. An illustrative example of application of the MODR path calculation module to a circuit-switched type network using blocking probability and implied cost as metrics, is also presented, considering different overload conditions.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 3; 50-59
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Implementation and performance of a new multiple objective dynamic routing method for multiexchange networks
Autorzy:
Martins, L.
Craveirinha, J.
Climaco, J.N.
Gomez, T.
Powiązania:
https://bibliotekanauki.pl/articles/307696.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
dynamic routing
multiple objective routing
multiexchange telecommunication network performance
Opis:
The paper describes new developments of a multiple objective dynamic routing method (MODR) for circuit-switched networks previously presented, based on the periodic calculation of alternative paths for every node pair by a specialised bi-objective shortest path algorithm (MMRA). A model is presented that enables the numerical calculation of two global network performance parameters, when using MMRA. This model puts in evidence an instability problem in the synchronous path computation model which may lead to solutions with poor global network performance, measured in terms of network mean blocking probability and maximum node-to-node blocking probability. The essential requirements of a heuristic procedure enabling to overcome this problem and select "good" routing solutions in every path updating period, are also discussed.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 3; 60-66
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
LPAR: an adaptive routing strategy for MANETs
Autorzy:
Abolhasan, M.
Wysocki, T. A.
Dutkiewicz, E.
Powiązania:
https://bibliotekanauki.pl/articles/307737.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
LPAR
GPS-based routing protocol
mobile ad hoc networks
Opis:
This paper presents a new global positioning system (GPS)-based routing protocol, called location-based point-to-point adaptive routing (LPAR) for mobile ad hoc networks. This protocol utilises a 3-state route discovery strategy in a point-to-point manner to reduce routing overhead while maximising throughput in medium to large mobile ad hoc networks. In LPAR, data transmission is adaptable to changing network conditions. This is achieved by using a primary and a secondary data forwarding strategy to transfer data from the source to the destination when the condition of the route is changed during data transmission. A simulation study is performed to compare the performance of LPAR with a number of different exisiting routing algorithms. Our results indicate that LPAR produces less overhead than other simulated routing strategies, while maintains high levels of throughput.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 2; 28-37
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the connections between optimal control, regulation and dynamic network routing
Autorzy:
Karbowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/307694.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
stabilization
nonlinear control
optimal control
dynamic programming
data networks
routing algorithms
Opis:
The paper is devoted to studying general features of dynamic network routing problems. It is shown that these problems may be interpreted as receding horizon optimal control problems or simply regulation problems. In the basic formulation it is assumed, that the nodes have no dynamics and the only goal of the optimization mechanism is to find the shortest paths from the source to the destination nodes. In this problem the optimization mechanism (i.e. the Bellman-Ford algorithm) may be interpreted as a receding horizon optimal control routine. Moreover, there is one-toone correspondence between the Bellman optimal cost-to-go function in the shortest path problem and the Lyapunov function in the regulation problem. At the end some results of the application of the routing optimization algorithm to an inverted pendulum regulation problem are presented.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 3; 67-72
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance analysis of reactive shortest path and multi-path routing mechanism with load balance
Autorzy:
Pham, P.P.
Perreau, S.
Powiązania:
https://bibliotekanauki.pl/articles/307735.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
ad hoc networks
load balance
multi-path routing protocol
overheads
Opis:
Research on multi-path routing protocols to provide improved throughput and route resilience as compared with single-path routing has been explored in details in the context of wired networks. However, multi-path routing mechanism has not been explored thoroughly in the domain of ad hoc networks. In this paper, we analyze and compare reactive single-path and multi-path routing with load balance mechanisms in ad hoc networks, in terms of overhead, traffic distribution and connection throughput. The results reveals that in comparison with general single-path routing protocol, multi-path routing mechanism creates more overheads but provides better performance in congestion and capacity, provided that the route length is within a certain upper bound which is derivable. The analytical results are further confirmed by simulation.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 2; 38-47
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fairness considerations with algorithms for elastic traffic routing
Autorzy:
Cinkler, T.
Laborczi, P.
Pióro, M.
Powiązania:
https://bibliotekanauki.pl/articles/308189.pdf
Data publikacji:
2004
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
elastic traffic
routing
fairness
maximum throughput
algorithms
ILP
heuristics
Opis:
The bit rate of modern applications typically varies in time. We consider the traffic elastic if the rate of the sources can be controlled as a function of free resources along the route of that traffic. The objective is to route the demands optimally in sense of increasing the total network throughput while setting the rates of sources in a fair way. We propose a new fairness definition the relative fairness that handles lower and upper bounds on the traffic rate of each source and we compare it with two other known fairness definitions, namely, the max-min and the proportional rate fairness. We propose and compare different routing algorithms, all with three types of fairness definitions. The algorithms are all a tradeoff between network throughput, fairness and computational time.
Źródło:
Journal of Telecommunications and Information Technology; 2004, 2; 3-12
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the performance analysis of a heuristic approach dedicated to a multiobjective dynamic routing model
Autorzy:
Craveirinha, J.
Martins, L.
Climaco, J. N.
Jorge, L.
Powiązania:
https://bibliotekanauki.pl/articles/309018.pdf
Data publikacji:
2005
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
multiple criteria analysis
routing
heuristics
telecommunications
Opis:
In previous works the features and a complete formulation for circuit-switched networks of a multiple objective dynamic routing method (MODR) of periodic state dependent routing type were presented. The aim of the model is to resolve a very complex network bi-objective dynamic routing problem, by recurring to a heuristic for synchronous path selection enabling to obtain a good compromise solution in terms of two network performance measures. In this paper we present a study on the performance of variants of the MODR heuristic of synchronous path selection by using relaxations of the values previously calculated for the two network objective functions. This study permitted the development of an improved version of the initial heuristic. Also a comparison of the analytical values of the network objective functions obtained with selected variants of the initial heuristic with the corresponding results from a known reference method, the real time network routing (RTNR) method, given by a discrete-event simulator for single-service networks, is presented.
Źródło:
Journal of Telecommunications and Information Technology; 2005, 3; 14-23
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Swarm intelligence for network routing optimization
Autorzy:
Dempsey, P.
Schuster, A.
Powiązania:
https://bibliotekanauki.pl/articles/309012.pdf
Data publikacji:
2005
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
network routing
swarm intelligence
ant algorithms
Opis:
This paper presents the results of a comparative study of network routing approaches. Recent advances in the field suggest that swarm intelligence may offer a robust, high quality solution. The overall aim of the study was to develop a framework to facilitate the empirical evaluation of a swarm intelligence routing approach compared to a conventional static and dynamic routing approach. This paper presents a framework for the simulation of computer networks, collection of performance statistics, generation and reuse of network topologies and traffic patterns.
Źródło:
Journal of Telecommunications and Information Technology; 2005, 3; 24-28
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new algorithm for calculating the most reliable pair of disjoint paths in a network
Autorzy:
Gomes, T.
Craveirinha, J.
Violante, A.
Powiązania:
https://bibliotekanauki.pl/articles/308916.pdf
Data publikacji:
2006
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
reliability
OR in telecommunications
routing
Opis:
In various types telecommunication networks, namely mobile ad hoc networks, WDM networks and MPLS networks, there is the necessity of calculating disjoint paths for given node to node connections in order to increase the reliability of the services supported by these networks. This leads to the problem of calculating a pair of disjoint paths (or a set of disjoint paths) which optimises some measure of performance in those networks. In this paper we present an algorithm, designated as OptDP, for obtaining the most reliable pair of disjoint paths based on the loopless version of MPS, a very efficient k-shortest path algorithm, and on Dijkstra algorithm. Since to the best of our knowledge there is no other proposal of an algorithm capable of solving exactly the same problem we perform a comparison with the application to this problem of the DPSP algorithm which calculates a set of disjoint paths with high reliability. Also a comparison with a simplified version (designated as NopDP) of the proposed algorithm, which stops after a maximal number F of candidate pairs of paths have been found, is presented. The comparison also includes the percentage of cases in which both algorithms were not capable of finding the optimal pair.
Źródło:
Journal of Telecommunications and Information Technology; 2006, 4; 31-38
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
CLP solution for new variant of VRP
Rozwiązanie nowego wariantu problemu marszrutyzacji pojazdów metodą CLP
Autorzy:
Szklarczyk, R.
Powiązania:
https://bibliotekanauki.pl/articles/327214.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Polskie Towarzystwo Diagnostyki Technicznej PAN
Tematy:
marszrutyzacja pojazdów
VRP
MDMGVRP
CLP
CHIP
GNU-Prolog
vehicle routing
Opis:
In the paper a mathematical model of MDMGVRP is presented. The two CLP programs solving above are described and discussed. The new variant of VRP consider certain number of commodities (goods) transported. In classic VRP there is only one commodity. The second main difference to classic problem is limited stock in depots. This two aspects cause the problem more complicated and prevent from direct applying of common known algorithms for solving the MDMGVRP. Two CLP solver tools were used to formulate CLP programs. The first was Cosytec CHIP the other was GNU-Prolog. Finally a demonstration problem is presented and solution is discussed.
W artykule przedstawiono nowy wariant problemu marszrutyzacji pojazdów - MDMGVRP, czyli problem marszrutyzacji pojazdów z wieloma magazynami i wieloma asortymentami. Zagadnienie zostało opisane modelem matematycznym a następnie rozwiązane metodą CLP. Opisano dwa programy wykonane przy użyciu narzędzi CLP: Cosytec CHIP i GNU-Prolog. Na koniec przedstawiono przykładowe dane oraz rozwiązanie uzyskane przy pomocy opisanych programów.
Źródło:
Diagnostyka; 2006, 2(38); 11-15
1641-6414
2449-5220
Pojawia się w:
Diagnostyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dealing with Non-Convexity in Geographic Routing in Smart Dust Networks
Autorzy:
Kłopotek, M. A.
Ruciński, D.
Tchórzewski, J.
Powiązania:
https://bibliotekanauki.pl/articles/92924.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
smart dust
geographic routing
nonconvexity
sensor-covered areas areas
Opis:
The paper proposes a new approach to greedy geographic routing for sensor networks with non-convex covering structure.
Źródło:
Studia Informatica : systems and information technology; 2006, 1(7); 57-64
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Distributed, asynchronous algorithms for network control with contracted flow rates - a review
Autorzy:
Karbowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/308928.pdf
Data publikacji:
2006
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
computer networks
asynchronous algorithms
distributed optimization
routing
service level agreement
service quality
Opis:
The paper reviews current algorithms for distributed, asynchronous control of networks when the customer is guaranteed to get some predetermined (e.g., as a part of a service level agreement - SLA) values of flow. Two cases are considered - both with single and multiple commodity. It is assumed, that the flow cost functions are convex with special attention devoted to linear and strictly convex cases.
Źródło:
Journal of Telecommunications and Information Technology; 2006, 4; 46-52
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
End-to-end service survivability under attacks on networks
Autorzy:
Molisz, W.
Rak, J.
Powiązania:
https://bibliotekanauki.pl/articles/308000.pdf
Data publikacji:
2006
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
survivable data networks
attacks on networks
scale-free networks
routing
resource allocation
Opis:
Network survivability is a capability of a networked system to provide its services despite failures or attacks. Attacks, e.g., due to acts of war, being potentially damaging events, were basically considered in the historical definitions of a survivability phenomenon. The meaning of the term: "network survivability" evolved in the last decade. Recently, attacks replayed the important role again. Their nature, however, including intrusions, probes, denials of service, differs from the old one. Survivability is strongly related to other fields of study. In particular, quality of service depends on network survivability. We investigate these dependencies in scale-free networks. Many networks are scale-free, i.e., their node degree distribution follows the power law. Nodes of the highest degrees, called centers, are highly vulnerable to attacks. Elimination of these nodes seriously degrades the overall performance of network services. In this paper we propose a model, which, based on traffic parameters of a demand, like delay or bit rate, allows to establish the survivable and attack proof end-to-end connections. The key idea of this model is that for the significant traffic, it establishes paths, which omit centers. The important connections become more resistant to attacks. We show that in the best case, obtained for the highest class of service, the number of broken connections is reduced even by factor 3. Example results are compared to those for the standard distance metrics. Our model is applicable to many network architectures and many classes of service.
Źródło:
Journal of Telecommunications and Information Technology; 2006, 3; 19-26
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Load-balanced route discovery for mobile ad hoc networks
Autorzy:
Abolhasan, M.
Lipman, J.
Wysocki, T. A.
Powiązania:
https://bibliotekanauki.pl/articles/309094.pdf
Data publikacji:
2006
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
ad hoc routing
MANET
load balancing
on-demand routing
protocols
Opis:
This paper presents flow-aware routing protocol (FARP), a new routing strategy designed to improve load balancing and scalability in mobile ad hoc networks. FARP is a hop-by-hop routing protocol, which introduces a flow-aware route discovery strategy to reduce the number of control overheads propagating through the network and distributes the flow of data through least congested nodes to balance the network traffic. FARP was implemented in GloMoSim and compared with AODV. To investigate the load distribution capability of FARP new performance metrics were introduced to measure the data packet flow distribution capability of the each routing protocol. The simulation results obtained illustrate that FARP achieves high levels of throughput, reduces the level of control overheads during route discovery and distributes the network load more evenly between nodes when compared to AODV. This paper also describes a number of alternative strategies and improvements for the FARP.
Źródło:
Journal of Telecommunications and Information Technology; 2006, 1; 38-45
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multiobjective fuzzy approach to the vehicle routing problem with time windows
Wielokryterialny problem planowania tras z oknami czasowymi w wersji rozmytej
Autorzy:
Wesołek, P.
Kubiak, M.
Powiązania:
https://bibliotekanauki.pl/articles/327808.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Polskie Towarzystwo Diagnostyki Technicznej PAN
Tematy:
planowanie tras
ograniczenia elastyczne
optymalizacja wielokryterialna
fuzzy vehicle routing
flexible constraints
multiobjective optimization
Opis:
The paper presents a model of the vehicle routing problem with flexible (fuzzy) constraints. This kind of model allows a decision maker to explore a set of alternatives with diverse cost and constraint satisfaction levels. The model is tested on well-known instances of the vehicle routing problem with time windows adjusted to the fuzzy case. They are solved by a multiobjective Pareto Memetic Algorithm. The obtained results indicate that the introduction of fuzzy constraints leads to exploration of new alternatives which may be interesting to a decision maker.
Artykuł prezentuje model problemu planowania tras z elastycznymi (rozmytymi) ograniczeniami. Model takiego rodzaju pozwala decydentowi na wybór rozwiązania spośród zbioru alternatyw ze zróżnicowanym kosztem i stopniem spełnienia ograniczeń. Ten model został przetestowany na klasycznym zestawie instancji problemu planowania tras z oknami czasowymi dostosowanych do przypadku rozmytych ograniczeń. Rozwiązania są uzyskiwane przez użycie wielokryterialnego algorytmu memetycznego. Uzyskane wyniki wskazują na to, że wprowadzenie elastycznych ograniczeń prowadzi do odkrycia rozwiązań, które mogą być interesujące z punktu widzenia decydenta
Źródło:
Diagnostyka; 2006, 2(38); 21-24
1641-6414
2449-5220
Pojawia się w:
Diagnostyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 237

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies