Wyszukiwarka
Wyniki wyszukiwania dla: ROUTING
-
MATHEMATICAL MODELING OF FLOOD MANAGEMENT SYSTEM IN THE CITY OF GDAŃSK, ORUŃSKI STREAM CASE STUDY
PublikacjaAim of the study This study analyses the efficiency of flood protection in a small urban catchment, based on a system of small reservoirs. Material and methods To assess the flood routing and surge reduction, a mathematical model of the river catchment was implemented. This was a lumped hydrological model, based on the SCS-CN method. Channel routing was performed, using kinematic wave equation. The sub-catchments have been determined...
-
A bound on the number of middle-stage crossbars in f-cast rearrangeable Clos networks
PublikacjaIn 2006 Chen and Hwang gave a necessary and sufficient condition under which a three-stage Clos network is rearrangeable for broadcast connections. Assuming that only crossbars of the first stage have no fan-out property, we give similar conditions for f-cast Clos networks, where f is an arbitrary but fixed invariant of the network. Such assumptions are valid for some practical switching systems, e.g. high-speed crossconnects....
-
Badanie wybranych algorytmów rutingu QoS w sieciach MPLS
PublikacjaW pracy dokonano przeglądu wybranych, opublikowanych algorytmów rutingu QoS dla sieci MPLS. Zrealizowano program "Ruting QoS" w środowisku MATLAB, w którym zaimplementowano trzy algorytmy: Profile-Based Routing, Kowalika-Colliera oraz Erbasa-Mathara. Przedstawiono i omówiono sieci, które zostały użyte do badań. Przebadano zaimplementowane algorytmy w przykładowych sieciach. Porównano badane algorytmy pod względem: procentu obsłużonych...
-
Water Resources Management 2022/2023
Kursy OnlineWater Resources Management as defined for purpose of this course includes both water use and water excess management. The fundamental water resources engineering processes are the hydrologic processes and the hydraulic processes. The common threads that relate to the explanation of these processes are the fundamentals of fluid mechanics. The hydrologic processes include rainfall, evaporation, infiltration, rainfall-runoff and routing,...
-
Bartosz Sawik
OsobyDr Bartosz Sawik is a Professor at the Department of Business Informatics and Engineering Management, AGH University of Science and Technology, Krakow, Poland and at the Institute of Smart Cities, GILT-OR Group, Department of Statistics, Computer Science and Mathematics, Public University of Navarre, Pamplona, Spain. He is a Visiting Researcher at the University of California, Berkeley, USA. He has a Ph.D. and a M.Sc. and Eng....
-
Future research directions in design of reliable communication systems
PublikacjaIn this position paper on reliable networks, we discuss new trends in the design of reliable communication systems. We focus on a wide range of research directions including protection against software failures as well as failures of communication systems equipment. In particular, we outline future research trends in software failure mitigation, reliability of wireless communications, robust optimization and network design, multilevel...
-
INFLUENCE OF A VERTEX REMOVING ON THE CONNECTED DOMINATION NUMBER – APPLICATION TO AD-HOC WIRELESS NETWORKS
PublikacjaA 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...
-
Towards the boundary between easy and hard control problems in multicast Clos networks
PublikacjaIn this article we study 3-stage Clos networks with multicast calls in general and 2-cast calls, in particular. We investigate various sizes of input and output switches and discuss some routing problems involved in blocking states. To express our results in a formal way we introduce a model of hypergraph edge-coloring. A new class of bipartite hypergraphs corresponding to Clos networks is studied. We identify some polynomially...
-
Model of control plane of ASON/GMPLS network
PublikacjaASON (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...
-
Decisional DNA based intelligent knowledge model for flexible manufacturing system
PublikacjaModeling an effective mechanism for design and control strategies for the implementation of a flexible manufacturing system (FMS) has been a challenge. Consequently, to overcome this issue various techniques have applied in the past but most of these models are effective only for some specific situation or an element of FMS. In this study, the knowledge representation technique of Decisional DNA (DDNA) is applied to FMS to develop...
-
A taxonomy of challenges to resilient message dissemination in VANETs
PublikacjaInter-vehicular communications is seen as a promising solution to a number of issues related with public road safety, road congestion management, and infotainment. However, Vehicular Ad-hoc NETworks (VANETs) characterized by high mobility of vehicles and facing a number of other issues related with high frequency wireless communications and network disconnections, encounter major challenges related with reliability of message delivery....
-
Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios
PublikacjaDisjoint path routing approaches can be used to cope with multiple failure scenarios. This can be achieved using a set of k (k> 2) link- (or node-) disjoint path pairs (in single-cost and multi-cost networks). Alternatively, if Shared Risk Link Groups (SRLGs) information is available, the calculation of an SRLG-disjoint path pair (or of a set of such paths) can protect a connection against the joint failure of the set of links...
-
Guessing Intrinsic Forwarding Trustworthiness of Wireless Ad Hoc Network Nodes
PublikacjaA novel node misbehavior detection system called GIFTED is proposed for a multihop wireless ad hoc network (WAHN) whose nodes may selfishly refuse to forward transit packets. The system guesses the nodes’ intrinsic forwarding trustworthiness (IFT) by analyzing end-to-end path performance rather than utilizing unreliable and incentive incompatible low-layer mechanisms. It can work with occasional IFT jumps, directional antennae,...
-
The Development of a Combined Method to Quickly Assess Ship Speed and Fuel Consumption at Different Powertrain Load and Sea Conditions
PublikacjaDecision support systems (DSS) recently have been increasingly in use during ships operation. They require realistic input data regarding different aspects of navigation. To address the optimal weather routing of a ship, which is one of the most promising field of DSS application, it is necessary to accurately predict an actually attainable speed of a ship and corresponding fuel consumption at given loading conditions and predicted...
-
Universal Augmentation Schemes for Network Navigability
PublikacjaRozważano problem uzupełniania grafu (reprezentującego np. sieci społeczne) poprzez dodanie w każdym węźle jednego dodatkowego skierowanego połączenia (długodystansowego). Dokładniej, dla każdego węzła definiuje się listę prawdopodobieństw istnienia połączenia wychodzącego z danego węzła do wszystkich pozostałych węzłów; wartości tych prawdopodobieństw muszą sumować się do jedności. Routing zachłanny w takiej sieci polega na przekazywaniu...
-
Service-based Resilience via Shared Protection in Mission-critical Embedded Networks
PublikacjaMission-critical networks, which for example can be found in autonomous cars and avionics, are complex systems with a multitude of interconnected embedded nodes and various service demands. Their resilience against failures and attacks is a crucial property and has to be already considered in their design phase. In this paper, we introduce a novel approach for optimal joint service allocation and routing, leveraging virtualized...
-
DST-Based Detection of Non-cooperative Forwarding Behavior of MANET and WSN Nodes
Publikacja. Selfish node behavior can diminish the reliability of a mobile ad hoc network (MANET) or a wireless sensor network (WSN). Efficient detection of such behavior is therefore essential. One approach is to construct a reputation scheme, which has network nodes determine and share reputation values associated with each node; these values can next be used as input to a routing algorithm to avoid end-to-end routes containing ill-reputed...
-
INTER-LAYER SHARING OF BACKUP PATH CAPACITIES PROVIDING FAST SERVICE RECOVERY IN IP-MPLS/WDM NETWORKS
PublikacjaIn this paper, we investigate the issue of providing the transmission continuity in IP-MPLS/WDM networks in the presence of failures of nodes/links. Special focus is put on assuring fast restoration of flows affected after a failure in a scenario assuming sharing the backup path capacities in order to decrease the overall bandwidth consumption. In particular, we propose a new approach to inter-layer sharing of link capacity reserved...
-
High-Power Jamming Attack Mitigation Techniques in Spectrally-Spatially Flexible Optical Networks
PublikacjaThis work presents efficient connection provisioning techniques mitigating high-power jamming attacks in spectrally-spatially flexible optical networks (SS-FONs) utilizing multicore fibers. High-power jamming attacks are modeled based on their impact on the lightpaths’ quality of transmission (QoT) through inter-core crosstalk. Based on a desired threshold on a lightpath’s QoT, the modulation format used, the length of the path,...
-
Enhancing Availability for Critical Services
PublikacjaTraditional approaches to provide classes of resilient service take the physical network availability as an input and then deploy redundancy and restoration techniques at various layers, often without full knowledge of mappings between layers. This makes it hard (and often inefficient) to ensure the high availability required by critical services which are typically a small fraction of the total traffic. Here, the innovative technique...