Temat: routing - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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ł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: An Improved Greedy Forwarding Scheme in MANETs
Autorzy:: Mishra, P.
Gandhi, C.
Singh, B.
Powiązania:: https://bibliotekanauki.pl/articles/308279.pdf
Data publikacji:: 2017
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: MANET
distance-based routing
direction-based routing
greedy forwarding
Opis:: Position-based routing protocols are widely accepted efficient solution for routing in MANETs. The main feature of position-based routing protocols is to use greedy forwarding methods to route data. The greedy forwarding methods select a node, either having maximum progress towards destination (distance-based principle) or minimum deviation with line between source and destination (direction-based strategy). The first method minimizes the hopcount in a path and on the other hand, second method minimizes the spatial distance between source and destination. The distance-based routing has a great impact on the selection of reliable node and the direction based routing plays a major role to increase the stability of route towards destination. Therefore, in this paper authors propose a weighted forwarding method, which combines both the selection, schemes to select an optimal next forwarding node in a range. The simulation results show that the proposed scheme performs better than existing position-based routing protocols.
Źródło:: Journal of Telecommunications and Information Technology; 2017, 1; 50-55
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Multiobjective Design of Wireless Ad Hoc Networks: Security, Real-Time and Lifetime
Autorzy:: Zdravko, K.
Powiązania:: https://bibliotekanauki.pl/articles/308972.pdf
Data publikacji:: 2009
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: ad hoc networks
low-power routing
multihop communication
secure routing
Opis:: This paper deals with the tradeoffs between security, real-time and lifetime performance. Due to the multihop nature of communication wireless ad hoc networks are very vulnerable to attacks. Malicious nodes included in a routing path may misbehave and organize attacks such as black holes. Scaling the number of hops for a packet delivery we trade off energy efficiency against security and real-time communication. To study the multihop communication we propose a hierarchical communication model. The REWARD (receive, watch, redirect) algorithm for secure routing is employed as a main example for corrective actions. Symmetrical routing is a distinguish feature of protocols such as REWARD and we outline the threshold of conflict between power-efficient partitioning of communication links and symmetrical routing.
Źródło:: Journal of Telecommunications and Information Technology; 2009, 2; 13-21
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

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ł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: DiffServ Aware MPLS Traffic Engineering for ISP Networks: State of the Art and New Trends
Autorzy:: Toguyéni, A.
Korbaa, O.
Powiązania:: https://bibliotekanauki.pl/articles/308811.pdf
Data publikacji:: 2009
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: differentiated service
multipath routing
QoS routing
quality of service
traffic engineering
Opis:: In the recent ten years, with the development of new applications through Internet such as multimedia or networked control applications, users need more and more quality of service (QoS). However, the requested QoS is not the same depending on the application. Most of the new models to manage internet traffic are based on specific QoS criteria which should be optimized. This paper presents main multiprotocol label switching (MPLS) approaches such as MPLS adaptive traffic engineering (MATE), load distribution in MPLS (LDM) and load balancing over widest disjoints paths (LBWDP) that are new models for traffic engineering. It also introduces periodic multi-step (PEMS) algorithm that adapts the offered quality depending on the class of the routed traffic.
Źródło:: Journal of Telecommunications and Information Technology; 2009, 1; 5-13
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 6.

Tytuł:: Multicast Connections in Wireless Sensor Networks with Topology Control
Autorzy:: Piechowiak, M.
Stachowiak, K.
Bartczak, T.
Powiązania:: https://bibliotekanauki.pl/articles/307684.pdf
Data publikacji:: 2016
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: multicasting
routing
wireless sensor networks
Opis:: The article explores the quality of multicast trees constructed by heuristic routing algorithms in wireless sensor networks where topology control protocols operate. Network topology planning and performance analysis are crucial challenges for wire and wireless network designers. They are also involved in the research on routing algorithms, and protocols for these networks. In addition, it is worth to emphasize that the generation of realistic network topologies makes it possible to construct and study routing algorithms, protocols and traffic characteristics for WSN networks.
Źródło:: Journal of Telecommunications and Information Technology; 2016, 1; 61-67
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 7.

Tytuł:: Fuzzy Clustering with Multi-Constraint QoS Service Routing in Wireless Sensor Networks
Autorzy:: Agarkhed, Jayashree
Kadrolli, Vijayalaxmi
Patil, Siddarama R.
Powiązania:: https://bibliotekanauki.pl/articles/307716.pdf
Data publikacji:: 2019
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: fuzzy logic
QoS
routing
WSN
Opis:: This paper presents a fuzzy logic-based, service diﬀerentiated, QoS aware routing protocol (FMSR) oﬀering multipath routing for WSNs, with the purpose of providing a service diﬀerentiated path meant for communication between nodes, based on actual requirements. The proposed protocol initially forms a cluster by fuzzy c-means. Next, the building of a routing follows, so as to establish multiple paths between nodes through the modiﬁed QoS k-nearest neighborhood, based on diﬀerent QoS constraints and on optimum shortest paths. If one node in the path fails due to lack of residual energy, bandwidth, packet loss, delay, an alternate path leading through another neighborhood node is selected for communication. Simulation results show that the proposed protocol performs better in terms of packet delivery ratio, delay, packet drop ratio and throughput compared to other existing routing protocols.
Źródło:: Journal of Telecommunications and Information Technology; 2019, 1; 31-38
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 8.

Tytuł:: Percolation Driven Flooding for Energy Efficient Routing in Dense Sensor Networks
Autorzy:: Vakulya, G.
Simon, G.
Powiązania:: https://bibliotekanauki.pl/articles/308970.pdf
Data publikacji:: 2009
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: flood routing
percolation
sensor network
Opis:: Simple flooding algorithms are widely used in ad hoc sensor networks either for information dissemination or as building blocks of more sophisticated routing protocols. In this paper a percolation driven probabilistic flooding algorithm is proposed, which provides large message delivery ratio with small number of sent messages, compared to traditional flooding. To control the number of sent messages the proposed algorithm uses locally available information only, thus induces negligible overhead on network traffic. The performance of the algorithm is analyzed and the theoretical results are verified through simulation examples.
Źródło:: Journal of Telecommunications and Information Technology; 2009, 2; 5-12
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 9.

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ł

Zmień widok

na półce

Skocz do pozycji: 10.

Tytuł:: On Dimensioning and Routing in the IP QoS System
Autorzy:: Góralski, W.
Pyda, P.
Dalecki, T.
Mongay Batalla, J.
Śliwiński, J.
Latoszek, W.
Gut, H.
Powiązania:: https://bibliotekanauki.pl/articles/307866.pdf
Data publikacji:: 2011
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: IP QoS System
resource dimensioning
routing
Opis:: This article presents dimensioning and routing solutions in IP QoS System designed during the implementation of the PBZ project: "Next Generation Services and Networks - technical, application and market aspects: Traffic management - IP QoS System". The paper presents the functional architecture together to the description of the functions and methods implemented in the system.
Źródło:: Journal of Telecommunications and Information Technology; 2011, 3; 21-28
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 11.

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ł

Zmień widok

na półce

Skocz do pozycji: 12.

Tytuł:: Performance Analysis of a Bi-Objective Model for Routing and Wavelength Assignment in WDM Networks
Autorzy:: Simőes, C.
Gomes, T.
Craveirinha, J.
Climaco, J.
Powiązania:: https://bibliotekanauki.pl/articles/308459.pdf
Data publikacji:: 2010
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: multicriterial optimization
routing in WDM networks
Opis:: Establishing end-to-end connections on wavelength division multiplexing (WDM) networks requires setting up lightpaths, defining the sequence of optical fibres and the wavelength in each fibre (the routing and wavelength assignmentproblem) for traffic flow. This paper reviews a bicriteria model for obtaining a topological path (unidirectional or symmetric bidirectional) for each lightpath request in a WDM network, developed by the authors, and presents a performance analysis of the model by considering important network performance measures. An extensive performance analysis of the two bicriteria model is presented, comparing the performance metrics obtained with the monocriterion models using the same objective functions, in five different reference networks commonly used in literature.
Źródło:: Journal of Telecommunications and Information Technology; 2010, 3; 13-24
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 13.

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ł

Zmień widok

na półce

Skocz do pozycji: 14.

Tytuł:: An Algorithm for Enumerating SRLG Diverse Path Pairs
Autorzy:: Gomes, T.
Craveirinha, J.
Powiązania:: https://bibliotekanauki.pl/articles/308463.pdf
Data publikacji:: 2010
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: routing
SRLG disjoint shortest paths
telecommunication networks
Opis:: Telecommunication networks are intrinsically multi-layered, a single failure at a lower level usually corresponds to a multi-failure scenario at an upper layer. In this context, the concept of shared risk link group (SRLG) allows an upper layer to select, for a given active path (AP), a backup path (BP), which avoids every SRLG that may involve the selected AP, in the event of a failure. That is a SRLG diverse path set maybe defined as a set of paths, between an origin and a destination, such that no pair of paths can be simultaneously affected by any given failure (or risk) in a single failure scenario. Firstly we present the formulation of the SRLG di- verse path pair calculation problem in a directed network. An algorithm for enumerating SRLG diverse paths, by non decreasing cost of their total (additive) cost will be presented, which is based on an algorithm proposed for generating minimal cost node disjoint path pairs. The SRLG diverse path pairs may be node or arc disjoint, with or without length constraints. Computational results will be presented to show the efficiency of the proposed algorithm for obtaining node or arc disjoint SRLG diverse path pairs in undirected networks.
Źródło:: Journal of Telecommunications and Information Technology; 2010, 3; 5-12
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 15.

Tytuł:: Performance Analysis of a Bi-Objective Model for Routing with Protection in WDM Networks
Autorzy:: Simőes, C.
Gomes, T.
Craveirinha, J.
Clímaco, J.
Powiązania:: https://bibliotekanauki.pl/articles/308487.pdf
Data publikacji:: 2010
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: multicriterial optimization
protection
routing in WDM networks
Opis:: The operation of wavelength division multiplexing (WDM) networks involves not only the establishment of lightpaths, defining the sequence of optical fibres and the wavelength in each fibre for traffic flow, but also a fault management scheme in order to avoid the huge loss of data that can result from a single link failure. Dedicated path protection, which establishes two end-to-end disjoint routes between the source-destination node pair, is an effective scheme to preserve customers' connections. This paper reviews a bicriteria model for dedicated path protection, that obtains a topological path pair of node-disjoint routes for each lightpath request in a WDM network, developed by the authors. An extensive performance analysis of the bicriteria model is then presented, comparing the performance metrics obtained with the monocriterion models using the same objective functions, in four different reference networks commonly used in literature.
Źródło:: Journal of Telecommunications and Information Technology; 2010, 3; 25-35
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "routing" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język