Wyniki wyszukiwania - BazTech

1

Supply chain design: a case study in a pulp and paper company

Fava Lucas Cedroni, Fugihara Marcelo Koiti, Sampaio Mauro

Transport Problems

|

2023

|

T. 18, z. 4

189--200

EN

This paper comprehensively analyzes a company’s supply chain design process in the pulp and paper industry. It focuses on the company’s supply chain strategy, structure, operations, and performance and highlights the challenges and opportunities specific to the industry. The purpose of this case study is to show how effective supply chain design can improve a company’s competitiveness and success. This paper also offers recommendations for improving supply chain design in the pulp and paper industry and other similar industries.

2

Design of water supply networks for water transfer to the urban area Case study : Balikpapan city

Huy Dinh T.N., Dwijendra Ngakan K.A., Poltarykhin Andrey, Suksatan Wanich, Nahi Nooraldeen S., Mahmudiono Trias, Hai Nguyen T., Kadhim Mustafa M., Singh Krishanveer, Ahmed Alim A.A.

Journal of Water and Land Development

|

2022

|

no. 54

251--254

EN

The growing population and the development of industries in all countries of the world have created a very important and complex issue for water supply to cities. Today, many parts of the world are facing the problem of water shortage and this problem cannot be easily solved. In addition to the proper use of water resources and preventing the loss of natural water, the establishment of regional water supply networks is effective in meeting the future needs of the people. A water distribution network (water supply network) is a set of interconnected pipelines used to transport and distribute water in a complex. In designing the water distribution network, factors such as the type of water distribution network, water pressure, water velocity, design flow, minimum pipe diameter, pipe material and many other factors should be considered. In this study, we have tried to design the water supply network of a part of Balikpapan city in Indonesia. The design method led to the determination of pressure values in the connection nodes, pipe diameters, flow rate and velocity in the pipes. All the existing criteria are considered in the design of the water supply network. Although this study has been implemented for a specific study area, it can be of great help to designers in designing the water supply network.

3

Design a Mathematical Planning Approach to Optimize the Supply Chain Taking Into Account Uncertainties In Distributors

Chetthamrongchai Paitoon, Dayupay Johnry, Alshiqi Sevdie, Alghazali Tawfeeq Abdulameer Hashim, Iswanto A. Heri, Cavaliere Luigi Pio Leonardo, Al-Nussairi Ahmed Kateb Jumaah, Mohmmed Karrar Hatif, Kadhim Mustafa M.

Foundations of Computing and Decision Sciences

|

2022

|

Vol. 47, No. 4

409--420

EN

With the globalization of markets and increasing competition in global markets, the attempts of organizations to survive in this market has increased and has resulted in the emergence of the philosophy of Supply Chain Management. There is uncertainty in the reliability of supply chain facilities for reasons such as natural disasters, terrorist attacks, labor errors, and weather conditions. Therefore, when making strategic decisions, the system will continue to operate with minimal damage. Over the course of this study, the uncertainty of supplier layers in the supply chain has been modeled. To meet that aim, the issue of supply chain, including producers, warehouses, suppliers and consumers are considered. To calculate the cost of breakdowns due to the non-functioning of distributors, the scenario-building method has been utilized. Finally, the desired model is solved with Gomez software and the results are presented. The result of the study demonstrate the efficiency of this model in the facility location decision-making in supply chains.

4

On Combining the Methods of Link Residual and Domination in Networks

Turacı Tufan

Fundamenta Informaticae

|

2020

|

Vol. 174, nr 1

43--59

EN

The concept of vulnerability is very important in network analysis. Several existing parameters have been proposed in the literature to measure network vulnerability, such as domination number, average lower domination number, residual domination number, average lower residual domination number, residual closeness and link residual closeness. In this paper, incorporating the concept of the domination number and link residual closeness number, as well as the idea of the average lower domination number, we introduce new graph vulnerability parameters called the link residual domination number, denoted by γLR(G), and the average lower link residual domination number, denoted by γLRaν(G) , for any given graph G. Furthermore, the exact values and the upper and lower bounds for any graph G are given, and the exact results of well-known graph families are computed.

5

Combining the Concepts of Residual and Domination in Graphs

Turacı Tufan, Aytaç Aysun

Fundamenta Informaticae

|

2019

|

Vol. 166, nr 4

379--392

EN

Let G = (V (G), E(G)) be a simple undirected graph. The domination and average lower domination numbers are vulnerability parameters of a graph. We have investigated a refinement that involves the residual domination and average lower residual domination numbers of these parameters. The lower residual domination number, denoted by γvkR(G), is the minimum cardinality of dominating set in G that received from the graph G where the vertex vk and all links of the vertex vk are deleted. The residual domination number of graphs G is defined as [formula]. The average lower residual domination number of G is defined by [formula]. In this paper, we define the residual domination and the average lower residual domination numbers of a graph and we present the exact values, upper and lower bounds for some graph families.

6

Impact analysis of observation coupling on reliability indices in a geodetic network

Nowak E., Odziemczyk W.

Reports on Geodesy and Geoinformatics

|

2018

|

Vol. 106

1--7

EN

An optimally designed geodetic network is characterised by an appropriate level of precision and the lowest possible setup cost. Reliability, translating into the ability to detect blunders in the observations and higher certainty of the obtained point positions, is an important network characteristic. The principal way to provide appropriate network reliability is to acquire a suitably large number of redundant observations. This approach, however, faces limitations resulting from the extra cost. This paper analyses the possibility of providing appropriate reliability parameters for networks with moderate redundancy. A common problem in such cases are dependencies between observations preventing the acquisition of the required reliability index for each of the individual observation. The authors propose a methodology to analyse dependencies between observations aiming to determine the possibility of acquiring the optimal reliability indices for each individual observation or groups of observations. The suggested network structure analysis procedures were illustrated with numerical examples.

7

Zagrożenia związane z ochroną odgromową stadionu piłkarskiego : wyzwania naukowe w procesie projektowania sieci i instalacji elektrycznych

Koźbiał T.

Elektro Info

|

2017

|

nr 3

60--63

PL

W pracy przedstawiono zagadnienia problematyczne ochrony odgromowej pojawiające się w trakcie procesu projektowania. Zwrócono uwagę na zagadnienia, które poprzez wyliczenia matematyczne nie dają jednoznacznych rozwiązań. Wówczas należy posiłkować się empirycznym rozwiązaniem problemu. W pracy streszczono zatem problematykę projektową wraz z wynikami badań przeprowadzonych w laboratorium.

EN

The paper presents issues problematic lightning protection arise during the design process. Attention was paid to the issues, which, through mathematical calculations do not provide clear solutions. Then you should make use empirical solution to the problem. The paper summarized therefore the problems of design, together with the results of research carried out in the laboratory.

8

Nowoczesna platforma projektowa i integracyjna systemów IT w komunikacji miejskiej

Kisielewski P.

Transport Miejski i Regionalny

|

2016

|

nr 5

17--22

PL

Rozkład jazdy stanowi podstawę logistyki i fundamentalny systemem informacyjny w publicznym transporcie zbiorowym. Obecnie oprogramowanie do projektowania rozkładów jazdy stanowią zaawansowane technologicznie systemy informatyczne oferujące możliwości szczegółowego projektowania sieci komunikacyjnych, automatycznego generowania kursów, zadań dla pojazdów i kierowców, symulacji ruchu pojazdów w sieci i analityki kosztów operacyjnych systemu transportowego. Systemy rozkładowe zasilają w niezbędne dane inne systemy miejskie m.in. systemy informacji pasażerskiej, dystrybucji biletów, systemy sterowania i kontroli ruchu, systemy ITS i wiele innych. W pracy przedstawiono istotne cechy nowoczesnego systemu projektowania rozkładów, stanowiącego jednocześnie platformę integracyjną systemów informatycznych komunikacji miejskiej.

EN

Time table is the basis for the logistics and the fundamental IT system in an urban public transport. Nowadays the software for time table design are the advanced technology IT systems which offer possibilities of detail transit network design, automatic generation of vehicle trips, vehicle and driver tasks, simulation of vehicle traffic in the network and analysis of operational cost of transport system. Actually time table systems provide necessary data to other urban systems as passenger information systems, ticketing, traffic monitoring and control, ITS and others. In the article an important functionalities of modern timetabling system, forming simultaneously integration platform of IT systems in city public transit have been presented.

9

F2Tx - system optymalizacji światłowodowych sieci dostępowych

Tomaszewski A., Mycek M., Pióro M., Żotkiewicz M.

Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne

|

2015

|

nr 2-3

87--90

PL

F2Tx to komputerowy system planowania strategicznego oraz projektowania konfiguracji i wyposażenia światłowodowych sieci dostępowych o architekturze FTTH, FTTB i FTTC realizowanych w technice PON Zaimplementowany przy użyciu współczesnych narzędzi z dziedziny programowania matematycznego i baz danych F2Tx jest oparty na zaawansowanych algorytmach optymalizacji sieci, wykorzystujących modele i metody programowania liniowego całkowitoliczbowego i teorii grafów. Komercyjna wersja systemu została wdrożona pod nazwą RNOS w Orange Polska i posłużyła min, do zaprojektowania sieci FTTH dla Warszawy.

EN

F2Tx is a computer system for strategic network planning and designing the configuration and equipment of PON technique-based fibre access networks that utilize FTTH. FTTB and FTTC architectures. Implemented with contemporary mathematical programming and database management tools, F2Tx employs advanced network optimisation algorithms based on mixed-integer linear programming and graph theory. A commercial version of the system named FiNOS has been deployed at Orange Poland and used for designing, e.g. an FTTH network for Warsaw.

10

Projektowanie sieci teleinformatycznych

Hudański P.

Problemy Nauk Stosowanych

|

2015

|

T. 3

33--42

PL

Wstęp i cel: Praca przedstawia budowę przewodowych i bezprzewodowych sieci komputerowych. Są w niej opisane etapy projektowania dostępu do Internetu oraz zasoby sprzętowe niezbędne podczas budowy infrastruktury sieciowej. Omówiono sposoby łączenia komputerów w sieć i przedstawiono urządzenia wykorzystywane w tym procesie. W pracy można zauważyć szczególny nacisk na funkcjonalność i bezawaryjność sieci LAN oraz WLAN. Celem pracy jest ukazanie obecnych standardów i możliwości przydatnych podczas projektowania sieci teleinformatycznych. Materiał i metody: Materiał stanowią dane z literatury dotyczącej sieci komputerowych. Zastosowano metodę analizy. Wyniki: Wyjaśnione zostały pojęcia związane z topologią oraz aktualnymi standardami. Zostały wyjaśnione pojęcia z zakresu Informatyki i technologii sieciowych. Ukazano, na co należy zwrócić uwagę podczas projektowania i analizy sieci teleinformatycznych. Wnioski: Opisanie zasad projektowania sieci teleinformatycznej w niniejszej pracy może stanowić poradnik dla początkujących projektantów sieci z tego względu, że znajdziemy tutaj przegląd technologii związanych z dziedziną Informatyki i sieci komputerowych. Praca może być traktowana, jako pomoc podczas projektowania sieci komputerowych.

EN

Introduction and aim: The paper presents the construction of wired and wireless networks. In the paper are described some design stages of Internet access and the necessary hardware resources during the construction of the network infrastructure. Discussed ways to connect computers in a network and shows the device used in this process. In the paper can be seen emphasis on functionality and reliability LAN and WLAN. The main aim of this study is to show the current standards and capabilities useful in the design of networks. Material and methods: The material is data from the literature on computer networks. Has been used the method of analysis. Results: In the paper have been explained some concepts of topology and current standards. Also have been described concepts of Computer Science and networking technologies. It shows what you should pay attention to the design and analysis of networks. Conclusions: Describe the data communications network design principles in this work could be a guide for novice web designers, therefore, that we find here an overview of technologies related to the field of Information Technology and computer networks. The work can be regarded as an aid in the design of computer networks.

11

Projektowanie sieci komunikacji miejskiej w oparciu o kompleksowe badania ruchu

Kisielewski P., Ulman B.

Logistyka

|

2015

|

nr 4

4053--4064, CD2

PL

W pracy został omówiony problem optymalnego projektowania sieci komunikacji miejskiej w oparciu o wyniki kompleksowego badania ruchu. Przedstawiono i objaśniono podstawowe pojęcia i poszczególne etapy projektowania. Praca zawiera dokładny opis kompleksowego badania ruchu, oraz wybrane wyniki wraz z ich interpretacją i analizą. Zawarty jest również opis wybranych innowacji w transporcie miejskim, które przyczyniają się do ochrony środowiska, a także poprawy ruchu ulicznego.

EN

In the paper the problem of optimal network design of city public transit has been presented based on results of complex traffic investigations. Basic terminology and certain stages of the design have been presented and discussed. The paper contains detailed description of complex traffic investigation and selected results together with their interpretation and analysis. Description of certain innovations in city transit which enables environment protection and traffic improvement is also included in the paper.

12

Projektowanie i wykonywanie systemów wodociągowych

Jóźwiak T., Filipkowska U., Szymczyk P., Mielcarek A.

Logistyka

|

2015

|

nr 4

9049--9054, CD3

PL

W pracy przedstawiono ogólne zasady projektowania i wykonywania systemów wodociągowych. Opisano oraz porównano różne rodzaje sieci wodociągowych. Scharakteryzowano także materiały stosowane w sieciach wodociągowych oraz wskazano ich wady i zalety. Praca zawiera także informacje na temat czynności związanych z odbiorem sieci i przekazania jej do użytku (próby szczelności oraz dezynfekcja).

EN

The paper presents general principles for design and construction of water supply systems. Describes and compares the different types of water supply networks. Also describes the materials used in water networks and identifies their advantages and disadvantages. Work also includes information on activities related to the acceptance network and transfer it to use (leak test and disinfection).

13

Optimisation of telecommunications transport networks

Tomaszewski A.

Prace Naukowe Politechniki Warszawskiej. Elektronika

|

2013

|

z. 189

9-190

EN

This monograph is devoted to optimisation models and algorithms for designing contemporary telecommunications transport networks. The particular focus is on the conceptual framework of transport network design and on the decomposition of the design problem and the design process. The presented conceptual framework is based on an original layered model of network resources, which is consistent with the functional architecture of transport networks contained in the ITU-T standards as well as can be directly expressed using mathematical models of multicommodity flow networks. The framework introduces an abstract generic model of the transport network design problem, its decomposition with respect to network layers and States, and an abstract generic network design procedure of solving the problem. The framework encompasses the models of the physical architecture and the organisational structure of the transport network. and the model of the network planning process. The presented work introduces an original complete mathematical description of the transport network based on the multicommodity network flow model complemented with elements pertaining to the notions of layers and states. Also, an original extension of the classical necessary and sufficient conditions of the existence of a multicommodity flow to the case of multiple layers and multiple slates is described. It is shown how the basic network model can be extended and generalised to consistently tackle fundamental phenomena and mechanisms of transport network operations related to traffic routing, network resilience to failures, quality of service and equitable allocation of network resources, variations and uncertainty of traffic demands, and network evolution. Applications of the basic methods of mathematical programming that are commonly used for network design are analysed in detail. In particular, the work analyses the branch-and-bound approach, the cutting plane method, the column generation and the constraint generation techniques of mixed integer linear programming, problem decomposition methods based on Benders' decomposition and Lagrangian relaxation, and the lesicographic maximization and max-min fair optimisation methods of multiple criteria decision making, The usage of the methods is analysed by means of original studies of difficult network optimization problems such as shortest-path routing design, connection restoration design in GMPLS networks, inter-domain traffic routing optimisation, and minimisation of label usage in GMPLS networks. A particularly important theoretical element of this work is a comprehensive analysis and classification of the complexity of designing transport networks resilient to failures. Original proofs of the NP-hardness of the resilient network design are presented that pertain to all major variants of the problem, in particular, providing a final answer to a number of so-far unresolved questions.

PL

Przedmiotem pracy są modele i algorytmy projektowania współczesnych telekomunikacyjnych sieci transportowych. Szczególną uwagę poświecono kwestii modelu pojęciowego problemu projektowania sieci oraz zagadnieniom dekompozycji problemu i procesu projektowania. Zaproponowany w pracy model pojęciowy jest oparty na oryginalnym warstwowym modelu zasobów sieci transportowej, który jest zgodny z podstawową architekturą funkcjonalną sieci transportowej zawartą w standardach 1TU-T poświęconych zagadnieniom sterowania i zarządzania sieciami, a jednocześnie może być wyrażony wprost poprzez modele optymalizacyjne sieci przepływów wielotowarowych. Elementami modelu pojęciowego są również model abstrakcyjnego generycznego problemu projektowania sieci transportowej dekomponowalnego wzglądem warstw i stanów sieci oraz abstrakcyjna generyczna procedura projektowania wielowarstwowej wielostanowej sieci transportowej. Uzupełnieniem modelu pojęciowego są modele architektury fizycznej i struktury organizacyjnej sieci transportowej, oraz model procesu planowania sieci. W pracy przedstawiono oryginalny kompletny opis matematyczny sieci transportowych oparty na modelu sieci przepływów wielotowarowych, uzupełnionym o pojęcia wielowarstwowości i wielostanowości. Zaprezentowano oryginalne rozszerzenie klasycznych warunków koniecznych i dostatecznych istnienia przepływu wielotowarowego na przypadek wielu warstw i wielu stanów sieci. Pokazano jak poprzez ograniczone rozszerzenia lub uogólnienia podstawego matematycznego opisu siec: jest możliwe jednolite zamodelowanie podstawowych zjawisk i mechanizmów działania sieci transportowej, związanych w szczególności z kierowaniem ruchu, zabezpieczeniem sieci przed awariami, zapewnieniem jakości obsługi ruchu i sprawiedliwym wykorzystaniem zasobów, zmiennością i niepewnością zapotrzebowani ruchowych oraz ewolucją sieci w czasie. Praca analizuje sposoby wykorzystania najważniejszych metod programowania matematycznego, w szczególności optymalizacji dyskretnej, stosowanych w projektowaniu sieci transportowych: metod programowania liniowego całkowitoliczbowego - metody podziałów i ograniczeń, metody płaszczyzn odcinających; metod dekompozycji - metody dekompozycji Bendersa, metody relaksacji Lagrange'a; metod optymalizacji wielokryterialnej – metod maksymalizacji leksykograficznej t optymalizacji sprawiedliwej. Przedstawiono oryginalne wykorzystanie tych metod w trudnych problemach projektowania sieci, takich jak problem kierowania ruchu po najkrótszych ścieżkach, problem projektowania sieci GMPLS zabezpieczonych mechanizmem Fast Reroute, problem kierowania ruchu międzydomenowego czy problem minimalizacji liczby etykiet w sieci GMPLS. Szczególnym elementem teoretycznym pracy jest wyczerpująca analiza i klasyfikacja złożoności problemów projektowania sieci zabezpieczonych przed awariami, której wynikiem jest zbiór oryginalnych dowodów NP-zupełność i wszystkich podstawowych wariantów problemu projektowania, w szczególności w części do niedawna nierozstrzygniętych.

14

A new planning model to support logistics service providers in selecting mode, route, and terminal location

Huynh N., Fotuhi F.

Polish Maritime Research

|

2013

|

S 1

67--73

EN

In this paper, we address thefreight network design problem. A mixed integer linear program is formulated to help logistics service providers jointlyselect the best terminal locations among a set of candidate locations, shipping modes, and route for shipping different types of commodities. The developed model isapplied to two different networksto show its applicability. Results obtained from CPLEX for the case studiesare presented, and the benefit of the proposed model is discussed.

15

Minimizing cost of network upgrade for overlay multicast – heuristic approach

Szostak M., Walkowiak K.

Journal of Telecommunications and Information Technology

|

2013

|

nr 3

66--73

EN

A rapid increase of the Internet users and traffic at the rate of 31% in years 2011–2016 contributes to emerging of new approaches to the content distribution. Among other approaches, the overlay multicasting seems to be one of the most interesting concepts according to relatively low deployment costs and large scalability. In this paper, the authors formulate a new incremental multicast overlay design problem. In particular, authors assumed that the overlay network is to be upgraded due to an increase of the number of participating users and the need to improve the streaming quality. However, the existing multicast tree structure is assumed to remain fixed. The goal was to minimize the cost of the upgrade, represented in euro/month. To achieve it, for each peer participating in the transmission, a link type offered by one of the ISPs was selected and overlay trees were constructed, rooted at the source of the content. The authors also present a new heuristic algorithm to efficiently solve this problem. According to experiments, the biggest factor influencing the upgrade cost and determining possible streaming quality values that the system can be upgraded to is the initial tree structure.

16

Two Approaches to Network Design Problem for Overlay Multicast with Limited Tree Delay : Model and Optimal Results

Szostak M., Walkowiak K.

International Journal of Electronics and Telecommunications

|

2011

|

Vol. 57, No. 3

335-340

EN

Live multimedia streaming and on-demand streaming applications (such as Internet radio or Internet TV) have been gaining more popularity in recent years. They require significant amount of bandwidth from media streaming servers and can easily saturate network infrastructure when the number of participant or bit rate of streaming content increases. Overlay multicast is an effective approach to the problem of streaming distribution. It combines flexibility of application layer multicast with efficiency of network layer multicast. Since overlay networks are built on the top of existing infrastructure, the cost of maintenance and deployment of this solution is relatively low compared to traditional Content Distribution Networks (CDN). Based on our previous works, we focus on solving the overlay network design problem to economically distribute content among the participants using overlay multicast. The optimization goal is to minimize the overlay network cost expressed by the cost of access links. Additionally, we assume that the maximum total delay of a streaming tree is upper bounded to provide QoS (Quality of Service) guarantees. We present two approaches to this problem and construct model using Levels and Flow Conservation Constraints. We show how various constraints following from real overlay systems influence the behavior of the distributing system. In numerical experiments we use real ISPs' price lists. To illustrate our approach we present optimal results obtained from the CPLEX solver.

17

Utilizing Modern Network Technologies in a Campus Network

Goetzen P., Makuch J., Skowrońska-Kapusta A., Marchlewska A., Zachlod R

Journal of Applied Computer Science Methods

|

2010

|

Vol. 2 No. 2

171--189

EN

The purpose of this paper is to outline concepts and examples of reliable and ef-ficient communication systems for all parts involved in the modern education model. As proven in the presented paper, designing an academic-size network is a real challenge to a team of designers. The outcome vastly depends on the skill and experience of the design team.

18

Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows

Gładysz J., Walkowiak K.

International Journal of Electronics and Telecommunications

|

2010

|

Vol. 56, No. 1

41-47

EN

In this work we focus on the problem of survivable network design for simultaneous unicast and anycast flows. This problem follows from the growing popularity of network services applying the anycast paradigm. The anycasting is defined as one-to-one-of-many transmission and is applied in Domain Name Service (DNS), peer-to-peer (P2P) systems, Content Delivery Networks (CDN). In this work we formulate two models that enables joint optimization of network capacity, working and backup connections for both unicast and anycast flows. The goal is to minimize the network cost required to protect the network against failures using the single backup path approach. In the first model we consider modular link cost, in the second we are given a set of link proposal and we must select only one of them. Because these problems are NP-hard, therefore optimal solutions of branch-and-bounds or branch-and-cut methods can be generated for relatively small networks. Consequently, we propose a new heuristic algorithm based on Tabu Search method. We present results showing the effectiveness the proposed heuristic compared against optimal results. Moreover, we report results showing that the use of anycast paradigm can reduce the network cost.

19

Wspomaganie projektowania sieci WLAN

Maciaszczyk R., Bembnista K.

Metody Informatyki Stosowanej

|

2009

|

nr 4 (21)

63-71

EN

The paper describes the application to support design the WLAN wireless networks. The system that was worked out enables to taking measurements with Wi-Fi card use and determining position using GPS receiver or doing it manually. Gathered data can be subjected to Krige 's interpolation. Thanks to it a map of network 's coverage can be created. Moreover, this program allows to making simulations of microwaves propagation using Free Space Path Loss model or Multi Wall model which considers obstacles' influence, being on a direct propagation path connecting access point with a station, on signal strength. Comparison of Free Space Path Lass model and Multi Wall model calculations with measurement's results was collated.

20

Hints and kinks for CANopen system designer

Zeltwanger H.

Pomiary Automatyka Kontrola

|

2008

|

R. 54, nr 11

747-749

EN

Although the CANopen application layer is well specified, the system designer could make failures or misuse the services and protocols. This is not only possible for the application layer, but also for the data link and the physical layer. This paper provides some hints and kinks designing CANopen network system.

PL

Chociaż magistrala CANopen jest dobrze wyspecyfikowana, to jednak projektant systemu może popełnić pomyłki lub błędnie zastosować usługi i protokoły. Może się to zdarzyć nie tylko w warstwie aplikacji, ale także w łączu danych i w warstwie fizycznej. W artykule przedstawiono niektóre porady i ostrzeżenia przydatne w projektowaniu systemu sieciowego CANopen.