Wyniki wyszukiwania dla: NETWORK TOPOLOGY - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: NETWORK TOPOLOGY

Wyniki wyszukiwania dla: NETWORK TOPOLOGY

  • Impact of WDM Network Topology Characteristics on the Extent of Failure Losses

    Publikacja

    - Rok 2010

    W artykule dokonano oceny wpływu charakterystyk topologicznych sieci na rozmiar strat po awarii węzła/łącza będącej następstwem ataku. W tym celu wprowadzono współczynnik ATRF. Wyniki badań pokazały, że wykorzystanie standardowej metryki odległości do wyznaczania tras podstawowych prowadzi do istotnego zwiększenia liczby połączeń uszkodzonych w wyniku ataku w porównaniu ze skutkami awarii losowej.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Topology recognition and leader election in colored networks

    Publikacja

    Topology recognition and leader election are fundamental tasks in distributed computing in networks. The first of them requires each node to find a labeled isomorphic copy of the network, while the result of the second one consists in a single node adopting the label 1 (leader), with all other nodes adopting the label 0 and learning a path to the leader. We consider both these problems in networks whose nodes are equipped with...

    Pełny tekst do pobrania w portalu

  • Collision-free network exploration

    Publikacja
    • J. Czyzowicz
    • D. Dereniowski
    • L. Gąsieniec
    • R. Klasing
    • A. Kosowski
    • D. Pająk

    - JOURNAL OF COMPUTER AND SYSTEM SCIENCES - Rok 2017

    Mobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...

    Pełny tekst do pobrania w portalu

  • Topology Discovery of Hierarchical Ethernet LANs without SNMP support

    Publikacja

    - Rok 2015

    This paper presents an algorithm that allows for discovery of layer-2 hierarchical Ethernet network topology using agents running on selected end nodes. No SNMP, MIB, hardware, firmware, or operating system-level software modification is required. The method is based on transmission of customized Ethernet frames among installed software agents. It can be used to discover the topology of LAN or one VLAN segment as long as no MAC...

  • CRVG - a new model for wireless networks topology generation

    Publikacja

    This paper presents a new model of wireless network topology generator. Its main advantage is the possibility of relatively sparse networks generation. Because no iteration is needed, the model can be used for massive generation of networks for testing. The topological properties of produced graphs place them in the class of scale free networks, resembling real ones.

  • Application tool for IP QoS network design

    Publikacja

    - Rok 2010

    Despite the fact that differentiated-service-aware network implementation has been a widely discussed topic for quite some time, network design still proofs nontrivial. Well developed software could put an end to network designer's problems. This chapter describes work, which has been aimed at creating a comprehensive network design tool, offering a fair range of functionality and high reliability. The presented tool is able to...

  • Model of control plane of ASON/GMPLS network

    ASON (Automatic Switched Optical Network) is a concept of optical network recommended in G.8080/Y.1304 by ITU-T. Control Plane of this network could be based on GMPLS (Generalized Multi-Protocol Label Switching) protocols. This solution, an ASON control plane built on GMPLS protocols is named ASON/GMPLS. In the paper, we decompose the control plane problem and show the main concepts of ASON network. We propose a hierarchical architecture...

  • Network Graph Transformation Providing Fast Calculation of Paths for Resilient Routing

    Publikacja

    Protection of transmission against failures can be appropriately dealt with by alternative paths. However, common schemes (e.g., Bhandaris scheme) are characterized by a remarkable delay while determining the transmission paths. This in turn may have a serious impact on serving dynamic demands (characterized by relatively short duration time). As a remedy to this problem, we introduce an approach to pre-compute the sets of disjoint...

  • Improving the Survivability of Carrier Networks to Large-Scale Disasters

    Publikacja
    • A. de Sousa
    • J. Rak
    • F. Barbosa
    • D. Santos
    • D. Mehta

    - Rok 2020

    This chapter is dedicated to the description of methods aiming to improve the survivability of carrier networks to large-scale disasters. First, a disaster classification and associated risk analysis is described, and the disaster-aware submarine fibre-optic cable deployment is addressed aiming to minimize the expected costs in case of natural disasters. Then, the chapter addresses the improvement of the network connectivity resilience...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Geospatial Coverage and Signal Quality Measurements of Terrestrial DAB+ Network in Northern Poland

    Modern signal coverage maps are prepared based on industry-standard radio propagation models, which take into account a number of parameters, including: type of antenna, distance from the transmitter, type of terrain, etc. However, such simulations are prone to location-specific inaccuracies, and should be verified with in-situ measurements. This paper presents results of a field test of a terrestrial DAB+ (Digital Audio Broadcasting...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Toward Fast Calculation of Communication Paths for Resilient Routing

    Publikacja

    - NETWORKS - Rok 2017

    Utilization of alternate communication paths is a common technique to provide protection of transmission against failures of network nodes/links. However, a noticeable delay is encountered when calculating the relevant sets of disjoint paths using the available algorithms (e.g., using Bhandari’s approach). This, in turn, may have a serious impact on the ability of a network to serve dynamic demands...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • INFLUENCE OF A VERTEX REMOVING ON THE CONNECTED DOMINATION NUMBER – APPLICATION TO AD-HOC WIRELESS NETWORKS

    Publikacja

    - Rok 2015

    A minimum connected dominating set (MCDS) can be used as virtual backbone in ad-hoc wireless networks for efficient routing and broadcasting tasks. To find the MCDS is an NP- complete problem even in unit disk graphs. Many suboptimal algorithms are reported in the literature to find the MCDS using local information instead to use global network knowledge, achieving an important reduction in complexity. Since a wireless network...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Performance of LSP preemption methods in different MPLS networks

    Publikacja

    - Rok 2008

    Preemption in Multiprotocol Label Switching (MPLS) is an optional traffic engineering technique used to create a new path of high priority when there is not enough bandwidth available. In such case the path is admitted by removing one or more previously allocated paths of lower priority. As there are usually many possible sets of low priority paths which can be selected, a preemption algorithm is being started to select the best...

  • Decontaminating Arbitrary Graphs by Mobile Agents: a Survey

    Publikacja

    A team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Computational Topology Workshop

    Konferencje

  • Dynamic Route Discovery Using Modified Grasshopper Optimization Algorithm in Wireless Ad-Hoc Visible Light Communication Network

    Publikacja
    • S. Vadivel
    • S. Konda
    • K. R. Balmuri
    • A. Stateczny
    • B. D. Parameshachari

    - Electronics - Rok 2021

    In recent times, visible light communication is an emerging technology that supports high speed data communication for wireless communication systems. However, the performance of the visible light communication system is impaired by inter symbol interference, the time dispersive nature of the channel, and nonlinear features of the light emitting diode that significantly reduces the bit error rate performance. To address these problems,...

    Pełny tekst do pobrania w portalu

  • Leakage detection and localisation in drinking water distributionnetworks by MultiRegional PCA

    Publikacja

    Monitoring is one of the most important steps in advanced control of complex dynamic systems. Precise information about systems behaviour, including faults indicating, enables for efficient control. The paper describes an approach to detection and localisation of pipe leakage in Drinking Water Distribution Systems (DWDS) representing complex and distributed dynamic system of large scale. Proposed MultiRegional Principal Component...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Methodology of research on the impact of ITS services on the safety and efficiency of road traffic using transport models

    The current assessment of the impact of Intelligent Transport System (ITS) services on the level of traffic safety and efficiency is based mainly on expert assessments, statistical surveys or several traffic safety models requiring development. There is no structured, uniform assessment method that would give the opportunity to compare the impact of ITS services and their different configurations. The paper presents the methodology...

    Pełny tekst do pobrania w portalu

  • Practical Approach to IP Scheduled Throughput Measurements in Dual Connectivity Systems

    IP scheduled throughput defined according to 3GPP TS 36.314 reflects user throughput regardless of traffic characteristics, and therefore has become one of the most important indicators for monitoring Quality of Service (QoS) of the end user in Evolved Universal Terrestrial Radio Access Network (E-UTRAN). However, networks built on a distributed architecture make the above definition impossible to be applied directly due to the...

    Pełny tekst do pobrania w portalu

  • Assessment of Connectivity-based Resilience to Attacks Against Multiple Nodes in SDNs

    Publikacja
    • D. Santos
    • A. de Sousa
    • C. Mas-Machuca
    • J. Rak

    - IEEE Access - Rok 2021

    In Software Defined Networks (SDNs), the control plane of a network is decoupled from its data plane. For scalability and robustness, the logically centralized control plane is implemented by physically placing different controllers throughout the network. The determination of the number and placement of controllers is known as the Controller Placement Problem (CPP). In the regular (i.e., failure-free) state, the control plane...

    Pełny tekst do pobrania w portalu