Thematische Bibliographien / Computer network protocols

Auswahl der wissenschaftlichen Literatur zum Thema „Computer network protocols“

Autor: Grafiati

Veröffentlicht am 4. Juni 2021

Zuletzt aktualisiert am 30. Juli 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Computer network protocols" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Computer network protocols"

Hasan, Ammar, Tarik A. Rashid, Birzo Ismael und Nawzad K. AL-Salihi. „Transmission Control Protocol Performance Monitoring for Simulated Wired University Computer Network using OPNET“. UKH Journal of Science and Engineering 3, Nr. 1 (22.05.2019): 18–28. http://dx.doi.org/10.25079/ukhjse.v3n1y2019.pp18-28.

Der volle Inhalt der Quelle

Annotation:

Computer networks need protocols to govern all transmission and presentation processes. The transmission control protocol (TCP) is one of the most important protocols that have the compatibility to work with all types of computer networks, overcoming all architectural and operating system differences. Nowadays, networks depend on the TCP protocol to control data flow between all types of connected computers, whether it is client or server, over any type of media whether it is wired or wireless networks, for all network topologies. A simulation of a university campus network has been conducted to determine TCP protocol features; those features are taken into consideration as one of the most important network parameters. In all digital networks, the data transmission is not a continuous transmission – instead, it is a discreet transmission, presenting itself as packets. These packets transfer and propagate within the network between computers, and network nodes using the TCP protocol depending on the address, which is embedded in its header. TCP has a great influence on the network speed. The network simulator OPNET provides an easy way of campus design, predicting, and estimating the performance of networks in a university campus environment. In this research, wiredconnections reach all computer network users at fixed points to maintain higher Mbps and ensure reliable communications between all the campus network nodes, as well as to increase the overall network performance taking into account the future expansions for the university campus network design.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Keller, Ariane, Daniel Borkmann, Stephan Neuhaus und Markus Happe. „Self-Awareness in Computer Networks“. International Journal of Reconfigurable Computing 2014 (2014): 1–16. http://dx.doi.org/10.1155/2014/692076.

Der volle Inhalt der Quelle

Annotation:

The Internet architecture works well for a wide variety of communication scenarios. However, its flexibility is limited because it was initially designed to provide communication links between a few static nodes in a homogeneous network and did not attempt to solve the challenges of today’s dynamic network environments. Although the Internet has evolved to a global system of interconnected computer networks, which links together billions of heterogeneous compute nodes, its static architecture remained more or less the same. Nowadays the diversity in networked devices, communication requirements, and network conditions vary heavily, which makes it difficult for a static set of protocols to provide the required functionality. Therefore, we propose a self-aware network architecture in which protocol stacks can be built dynamically. Those protocol stacks can be optimized continuously during communication according to the current requirements. For this network architecture we propose an FPGA-based execution environment called EmbedNet that allows for a dynamic mapping of network protocols to either hardware or software. We show that our architecture can reduce the communication overhead significantly by adapting the protocol stack and that the dynamic hardware/software mapping of protocols considerably reduces the CPU load introduced by packet processing.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Neeru Kumari und Dr. Tilak Raj. „OSPF Metric Convergence and Variation Analysis During Redistribution with Routing Information Protocol“. International Research Journal on Advanced Engineering and Management (IRJAEM) 2, Nr. 06 (22.06.2024): 1985–91. http://dx.doi.org/10.47392/irjaem.2024.0293.

Der volle Inhalt der Quelle

Annotation:

Open Shortest Path First networking protocol falls under the category of Interior gateway routing protocols and is multi-vendor supported. The task of OSPF like any other routing protocol is to calculate the best path between source IP address and destination IP address within the organisation computer network. There are various other routing protocols like Routing Information Protocol, Border Gateway Protocol, Intermediate System - Intermediate System (IS-IS), Enhanced Interior Gateway Routing Protocol, etc. which are used in computer network. Routing protocols have different algorithms through which they compute the best path selection criteria. OSPF because of its flexible design is often used with other routing protocol over the large network. This research focuses on the working of OSPF metric value variation and convergence for best path selection using network simulation tool like Cisco Packet Tracer tool for getting similar outcome just like a real networking device like router working in a real production environment. This research would use multiple combinations of OSPF metric calculation for routes learned from other routing protocols like Routing Information Protocol (RIP). Being able to correctly identify metric values obtain by testing with OSPF and other routing protocols and analysis them for best path selection.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Alfaresa, Yuansa, Bongga Arifwidodo und Fauza Khair. „Automate IGP and EGP Routing Protocol Configuration using a Network Automation Library“. Jurnal Online Informatika 8, Nr. 2 (28.12.2023): 222–31. http://dx.doi.org/10.15575/join.v8i2.1157.

Der volle Inhalt der Quelle

Annotation:

Data communication is sending data from client to client through a computer network. The increasing use of data communication makes computer networks more complex. Complex computer networks make it difficult for network administrators to configure them, especially routing protocol configuration. Network administrators are in charge of configuring routing protocols and managing networks. In addition, the more devices on the network, the greater the chance of human error from the administrator. Therefore, network automation is one solution that helps network administrators overcome this. This study focuses on analyzing the performance of network automation using the Paramiko and Telnetlib libraries. The routing protocol used by OSPF for IGP and BGP for EGP. The scenario in this study involves configuring IP addresses and configuring OSPF and BGP routing. Based on the test results, the Telnetlib library is better than the Paramiko library in terms of script delivery time, convergence time, and delay by 19.237% when applied to the IGP and EGP routing protocols.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mardedi, Lalu Zazuli Azhar, und Khairan Marzuki. „Network Rancang Bangun Jaringan Komputer LAN Berdasarkan Perbandingan Kinerja Routing Protokol EIGRP dan Routing Protokol OSPF“. MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer 18, Nr. 2 (29.05.2019): 202–10. http://dx.doi.org/10.30812/matrik.v18i2.372.

Der volle Inhalt der Quelle

Annotation:

Nowadays computer networks are growing rapidly and internet usage is increasing everyday. The need to design an internet network cannot be separated from the routing protocol which functions to integrate all computers with the highest flexibility. Routing is one part that provides effective performance in the network. In comparing the performance of EIGRP and OSPF routing protocols, the implementation of EIGRP and OSPF must be implemented when building a network, so administrators easily know the difference in the performance values of the two routing protocols. The discussion in this study is to compare the performance of the EIGRP routing protocol and OSPF routing protocol that is on the network using the hybird topology. Overcoming problems with high-scale network access, we will analyze and compare performance between EIGRP routing protocol and OSPF routing protocol. In obtaining the value and to verify the results of the implementation, the simulation software uses a Packet Tracer simulator.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Borisov, Ruslan K., Sergey S. Zhulikov, Maksim N. Smirnov, Yuliya S. Turchaninova, Sergey I. Khrenov, Roman P. Besedin und Aleksandr V. Dubinin. „Power Equipment Interaction with Network Devices Supporting Internet Application-level Protocols“. Vestnik MEI, Nr. 6 (2021): 59–65. http://dx.doi.org/10.24160/1993-6982-2021-6-59-65.

Der volle Inhalt der Quelle

Annotation:

The implementation of interaction between high-voltage power equipment with computer network devices in monitoring systems involves the use of proprietary Internet protocols that do not meet the criteria of free software and are not always compatible with the Internet protocols of personal computers. To solve this problem, it is proposed to use an intermediate link between the industrial and computer networks. This link is a network bridge built using the PPP protocol, which unites automatic devices equipped with UART interfaces with a computer network of the 802.11n (Wi-Fi) standard. The article presents several models for organizing bridges: a centralized network bridge on the side of a router and client computer, a distributed bridging system, and a dedicated bridge. Based on the accomplished analysis, it is recommended to use a centralized model for a network that has to comply with more stringent reliability requirements. If there is a need to have simultaneous access to several automation devices and high data exchange rates, a distributed model should be used. A dedicated bridge is used only in special cases, for example, when a high compactness is required in implementing a monitoring system.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Romaniuc, Alexandru-Gabriel, Vlad-Cosmin Vasile und Elena-Monica Borda. „Study of Methods and Techniques for Manipulating the Time Synchronization Component of NTP Servers in Computer Networks“. International conference KNOWLEDGE-BASED ORGANIZATION 29, Nr. 3 (01.06.2023): 71–77. http://dx.doi.org/10.2478/kbo-2023-0078.

Der volle Inhalt der Quelle

Annotation:

Abstract In computer networks as well as in many other domains, time synchronization is carried out by some dedicated devices called time servers that uses network protocols, such as NTP (Network Time Protocol), PTP (Precision Time Protocol) or SNTP (Simple Network Time Protocol). Many domains and applications, such as, computer networks, security protocols, telecommunications, network services, and many others, depend on accurate time synchronization. According to the CVE (Common Vulnerabilities and Exposures) databases, between 2001-2022, more than 150 time synchronization protocols vulnerabilities have been reported. One of the most dangerous threats is the manipulation of the time synchronization information. Thus, the existence of such a vulnerability can generate serious security problems. Considering these aspects, in this article we aim to use some methods and techniques for the manipulation of the time component and use them to test some synchronization systems. This will require real-life scenarios of the use of time synchronization systems in which some methods and techniques are applied to exploit their vulnerabilities. Following these scenarios, we will be able to assess the risk to which these systems are exposed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Muhammad Shahzaib Saeed. „Survey of Network Protocols“. Lahore Garrison University Research Journal of Computer Science and Information Technology 3, Nr. 2 (28.06.2019): 15–19. http://dx.doi.org/10.54692/lgurjcsit.2019.030273.

Der volle Inhalt der Quelle

Annotation:

IPv4 is the network protocols of the present Internet, which is characterized by the Internet Engineering Task Force (IETF). Network protocols characterize guidelines, polices and traditions for communication between system devices. Every advanced protocol for computer organization utilizer a packet switching system to send and get the message. The protocols are intended to conquer the activities of any enemy that can lose the sent message, discretionarily change the fields of the sent message, and replay old messages. In the web, the colossal measure of information and the immense number of various protocols makes it perfect as a high-bandwidth speed vehicle for undercover communication. This article is an overview of the current methods for making the covert channels. Weadditionally gave a diagram of wide kinds of network protocol.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Deepak Malik und Dr. Bijendra Singh. „Optimizing OSPF Cost Value for Best Path Selection Using Metric-Type Variation“. International Research Journal on Advanced Engineering Hub (IRJAEH) 2, Nr. 06 (25.06.2024): 1845–54. http://dx.doi.org/10.47392/irjaeh.2024.0254.

Der volle Inhalt der Quelle

Annotation:

Open Shortest Path First (OSPF) is a multi-vendor routing standard. Any routing protocol's goal is to discover the optimum path between source and destination addresses inside a computer network. Other routing protocols include Routing Information Protocol (RIP), Border Gateway Protocol (BGP), Enhanced Interior Gateway Routing Protocol (EIGRP), and IS-IS. which are also used in computer networking. Each routing protocol has different set of rules through which they calculate the best path selection. OSPF is often used with the combination of these routing protocol because of its flexible design. This research focuses on the implementation of OSPF network cost (metric) value for best path calculation using network simulation tool like GNS3 for getting correct outcome just like a real networking device working in a live production environment. This research would use the different combinations of OSPF cost calculation using metric-types for external routes learned from different routing protocols like RIP. Being able to accurately identify cost (metric) values obtain by testing for OSPF when used with other routing protocols, just like a real-world environment.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Majid, Nuur Wachid Abdul, und Syifaul Fuada. „RIP VS. OSPF ROUTING PROTOCOLS: WHICH ONE IS THE BEST FOR A REAL-TIME COMPUTER NETWORK?“ Simetris: Jurnal Teknik Mesin, Elektro dan Ilmu Komputer 11, Nr. 1 (30.04.2020): 249–56. http://dx.doi.org/10.24176/simet.v11i1.3796.

Der volle Inhalt der Quelle

Annotation:

The development of modern computer networks for internet access makes routing protocols needed, and it has an essential role in a real-time system. Therefore, the best and most effective routes can be reached. In this short article, we discuss the comparison of two popular routing protocols, i.e., Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) using two network simulators, i.e., Graphical Network Simulator-3 (GNS3) and Enterprise Network Simulation Platform (ENSP). Both of OSPF and RIP routing protocols can be used in the same topology and have differences in the connection time required to connect communication between routers. Thru GNS3 and ENSP, we obtained the comparison result at ideal condition; we found that the OSPF routing protocol (83 ms) has a faster time or efficient in connection than RIP (177 ms). Besides, we found that compared to GNS3 network simulators (329 ms), the ENSP has a relatively more rapid average time (94 ms). This work suggests that a Huawei router with ENSP is faster than a Cisco router which is used by GNS3. Hopefully, this information can be refereed by internet network administrators to build real-time computer networks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Computer network protocols"

alyanbaawi, ashraf. „DESIGN OF EFFICIENT MULTICAST ROUTING PROTOCOLS FOR COMPUTER NETWORKS“. OpenSIUC, 2020. https://opensiuc.lib.siu.edu/dissertations/1775.

Der volle Inhalt der Quelle

Annotation:

Multicasting can be done in two different ways: source based tree approach andshared tree approach. Shared tree approach is preferred over source-based treeapproach because in the later construction of minimum cost tree per source is neededunlike a single shared tree in the former approach. However, in shared tree approach asingle core needs to handle the entire traffic load resulting in degraded multicastperformance. Besides, it also suffers from „single point failure‟. Multicast is acommunication between one or multiple senders and multiple receivers, which used asa way of sending IP datagrams to a group of interested receivers in one transmission.Core-based trees major concerns are core selection and core as single point of failure.The problem of core selection is to choose the best core or cores in the network toimprove the network performance.In this dissertation we propose 1) a multiple core selection approach for core-based tree multicasting, senders can select different cores to have an efficient loadbalanced multicore multicasting. It will overcome any core failure as well. 2) Novel andefficient schemes for load shared multicore multicasting are presented. Multiple coresare selected statically, that is, independent of any existing multicast groups and also theselection process is independent of any underlying unicast protocol. Some of theselected cores can be used for fault- tolerant purpose also to guard against any possible core failures. 3) We have presented two novel and efficient schemes forgroup-based load shared multicore multicasting in which members of a multicast groupuse the same core tree for their multicasting. 4) We also presented two schemes aim atachieving low latency multicasting along with load sharing for delay sensitive multicastapplications. Besides, we have presented a unique approach for core migration, whichuses two very important parameters, namely, depth of a core tree and pseudo diameterof a core. One noteworthy point from the viewpoint of fault tolerance is that the degreeof fault-tolerance can be enhanced from covering single point-failure to any number ofcore failures.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lu, Ching-sung. „Automated validation of communication protocols /“. The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu148726702499786.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zissopoulos, Athanassios. „On buffer allocation in transport protocols“. Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66245.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dahlgren, Jeremy. „Efficient failure detection protocols for point-to-point communication networks /“. Online version of thesis, 2004. https://ritdml.rit.edu/dspace/handle/1850/2752.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sundaresan, Latha. „Simple network management protocol /“. Online version of thesis, 1995. http://hdl.handle.net/1850/12254.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jayakeerthy, Arunkumar Thippur Lim Alvin S. „Query-localized route repair mechanism for ad-hoc on-demand distance vector routing algorithm“. Auburn, Ala, 2009. http://hdl.handle.net/10415/1608.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ford, Daniel Alexander. „Semi-automatic implementation of network protocols“. Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/24665.

Der volle Inhalt der Quelle

Annotation:

A compiler which achieves automatic implementation of network protocols by transforming specifications written in FDT into C programs is presented. A brief introduction to the the fundamentals of FDT, a standard language developed by ISO/TC97/SC 16/WG 1 Subgroup B for specifying network protocols, is given. We then present an overview of the compiler and discuss the problem of PASCAL to C translation. Transformation of a FDT specification into code is explained and illustrated by two implementation examples. The first example illustrates the implementation strategy by tracing the processing of a simple protocol. The second example demonstrates the validity of using automatically generated implementations by showing how a communication path was established between two hosts using code generated for the alternating bit protocol.
Science, Faculty of
Computer Science, Department of
Graduate

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berglund, Anders. „On the understanding of computer network protocols“. Licentiate thesis, Uppsala universitet, Avdelningen för datorteknik, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-86076.

Der volle Inhalt der Quelle

Annotation:

How students learn about network protocols is studied in a project-centred, internationally distributed, university course in computer systems taught jointly by two universities. Insights into students' understanding of basic concepts within computer networks are gained through an empirical phenomenographic research approach. The use of phenomenography as a research approach makes it possible to learn about computer science, as it is experienced by the students. The context in which the research is carried out and issues concerning by whom the context is experienced, are investigated and form a part of the methodological basis. Students' understanding of some protocols that are used within the project, as well as their experience of the general concept of network protocols are investigated, and different ways of experiencing the protocols are discerned. Some aspects that indicate good learning outcomes are identified, such as being capable of understanding a protocol in different ways and of making relevant choices between the ways it could be experienced according to the context in which it appears. Based on these results a discussion on learning and teaching is developed. It is argued that a variation in the context in which the protocol is experienced promotes good learning, since different ways of experiencing a protocol are useful with different tasks to hand. A student with a good understanding of network protocols can choose in a situationally relevant way between different ways of experiencing a protocol.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Alexander, David. „A Network Metadata Infrastructure for Locating Network Devices“. Ohio University / OhioLINK, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1088176648.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baronikian, Haig. „Modelling and analysis of a computer conferencing system“. Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63756.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Computer network protocols"

G, Naugle Matthew, Hrsg. Network protocols. New York: McGraw-Hill, 1999.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Spiropoulos, George. Computer network protocols and protocol proving. Birmingham: University of Birmingham, 1988.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

A, Sunshine Carl, Hrsg. Computer network architecturesand protocols. 2. Aufl. New York: Plenum, 1989.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Marsden, Brian W. Communication network protocols. 2. Aufl. Bromley, Kent, England: Chartwell-Bratt, 1986.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Marsden, Brian W. Communication network protocols. [Bromley]: Chartwell-Bratt, 1985.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sunshine, Carl A., Hrsg. Computer Network Architectures and Protocols. Boston, MA: Springer US, 1989. http://dx.doi.org/10.1007/978-1-4613-0809-6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

A, Sunshine Carl, Hrsg. Computer network architectures and protocols. 2. Aufl. New York: Plenum Press, 1989.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Naugle, Matthew G. Network protocol handbook. New York: McGraw-Hill, 1994.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hartpence, Bruce. Packet guide to core network protocols. Sebastopol, Calif: O'Reilly Media, 2011.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Black, Uyless D. TCP/IP and related protocols. 2. Aufl. New York: McGraw-Hill, 1995.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Computer network protocols"

Kizza, Joseph Migga. „Computer Network Security Protocols“. In Guide to Computer Network Security, 359–89. London: Springer London, 2015. http://dx.doi.org/10.1007/978-1-4471-6654-2_17.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kizza, Joseph Migga. „Computer Network Security Protocols“. In Texts in Computer Science, 367–98. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-38141-7_17.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kizza, Joseph Migga. „Computer Network Security Protocols“. In Guide to Computer Network Security, 357–86. London: Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-4543-1_17.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kizza, Joseph Migga. „Computer Network Security Protocols“. In Guide to Computer Network Security, 365–96. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55606-2_17.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kizza, Joseph Migga. „Computer Network Security Protocols“. In Texts in Computer Science, 409–41. Cham: Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-47549-8_18.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Harrim, Muhannad, Mohamed El-Wakil und Ala Al-Fuqaha. „Network Layer Protocols“. In Handbook of Computer Networks, 40–62. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2011. http://dx.doi.org/10.1002/9781118256053.ch4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Schwartz, Mischa, und Thomas E. Stern. „Routing Protocols“. In Computer Network Architectures and Protocols, 239–71. Boston, MA: Springer US, 1989. http://dx.doi.org/10.1007/978-1-4613-0809-6_9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gerla, Mario, und Leonard Kleinrock. „Flow Control Protocols“. In Computer Network Architectures and Protocols, 273–328. Boston, MA: Springer US, 1989. http://dx.doi.org/10.1007/978-1-4613-0809-6_10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ciubotaru, Bogdan, und Gabriel-Miro Muntean. „Network Communications Protocols and Services“. In Computer Communications and Networks, 29–52. London: Springer London, 2013. http://dx.doi.org/10.1007/978-1-4471-5292-7_3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bertine, H. V. „Physical Interfaces and Protocols“. In Computer Network Architectures and Protocols, 39–80. Boston, MA: Springer US, 1989. http://dx.doi.org/10.1007/978-1-4613-0809-6_3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Computer network protocols"

Geromel, Paulo A., und Sergio T. Kofuji. „Avaliação do U-Net em Clusters com Rede Myrinet“. In Simpósio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho. Sociedade Brasileira de Computação, 1998. http://dx.doi.org/10.5753/sbac-pad.1998.22667.

Der volle Inhalt der Quelle

Annotation:

Clusters of computers and workstations interconnected by high speed networks are widely used in high performance computing. Although high speed networks have the best latency and throughput, these features are not properly used by conventional communication protocol implementations. A possible solution for such a problem is found in Light-Weight Protocols. These protocols are stated in a User-Level aproach, where the communication tasks are directly processed in user space, instead of being processed inside operating system kernel, using a communication library. This paper evaluates the perfonnance of the U-Net protocol. Using computer platforms with Intel Pentium processors interconnected by a Myrinet Network, features like latency, throughput and concurrency support are evaluated. The results from lhese evaluations indicate that applying light-weight protocols is a proper way to use features available in new network technologies.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Youssef, M. W. „Securing computer networks communication by modifying computer network communication protocols“. In 2011 11th International Conference on ITS Telecommunications (ITST). IEEE, 2011. http://dx.doi.org/10.1109/itst.2011.6060130.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vakaliuk, Tetiana, Oleksii Chyzhmotria, Olena Chyzhmotria, Dmytro Antoniuk, Valerii Kontsedailo und Viacheslav Kryvohyzha. „Simulator of Computer Networks and Basic Network Protocols“. In 5th Workshop for Young Scientists in Computer Science & Software Engineering. SCITEPRESS - Science and Technology Publications, 2022. http://dx.doi.org/10.5220/0012009800003561.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kalai, Yael Tauman, Xin Li, Anup Rao und David Zuckerman. „Network Extractor Protocols“. In 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 2008. http://dx.doi.org/10.1109/focs.2008.73.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Afek, Yehuda, Baruch Awerbuch und Eli Gafni. „Applying static network protocols to dynamic networks“. In 28th Annual Symposium on Foundations of Computer Science. IEEE, 1987. http://dx.doi.org/10.1109/sfcs.1987.7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Teymourlouei, Haydar, und Vareva E. Harris. „Neural Networks and Network Protocols to Predict Network Behavior“. In 2022 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME). IEEE, 2022. http://dx.doi.org/10.1109/iceccme55909.2022.9988685.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Li, Kuang-Yu J., und B. Keith Jenkins. „A Collisionless Wavelength-Division Multiple Access Protocol for Free-Space Cellular Hypercube Parallel Computer Systems“. In Optical Computing. Washington, D.C.: Optica Publishing Group, 1995. http://dx.doi.org/10.1364/optcomp.1995.otha3.

Der volle Inhalt der Quelle

Annotation:

The performance of a MIMD parallel computer is critically impacted by the interconnection network performance, which in turn is determined by the network topology, implementation hardware, and communication protocol. Cellular hypercube (CH) interconnection networks, with emphasis on a symmetric cellular hypercube (SCH) network, were studied for the system discussed in this paper because they can exploit the communication locality observed in parallel applications [1], are reasonably scalable due to their O(logN) connectivities, and can be implemented with moderate requirements on the number of wavelength channels needed. While free-space optics can realize highly parallel CH networks [2], little progress has been made in designing an efficient protocol for optical data communication. In this paper a CH interconnection system based on a collisionless wavelength-division multiple access with reroute (WDMA-R) protocol is proposed. This system incorporates space-, time-, and wavelength-multiplexing to achieve dense communication, simple control, and multiple access. Analytic models based on semi-Markov processes were employed to analyze this protocol. The performance of the protocol in terms of network throughput and data packet delay is evaluated and compared to other protocols.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Aslanyan, Levon, Hasmik Sahakyan, Vladimir Romanov, Georges Da Costa und Rahim Kacimi. „Large Network Target Coverage Protocols“. In 2019 Computer Science and Information Technologies (CSIT). IEEE, 2019. http://dx.doi.org/10.1109/csitechnol.2019.8895058.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Godfrey, Brighten. „Session details: Network protocols“. In SIGMETRICS '11: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems. New York, NY, USA: ACM, 2011. http://dx.doi.org/10.1145/3253098.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vinodh Kumar, B., und J. Ramesh. „Automotive in vehicle network protocols“. In 2014 International Conference on Computer Communication and Informatics (ICCCI). IEEE, 2014. http://dx.doi.org/10.1109/iccci.2014.6921836.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Computer network protocols"

Allende López, Marcos, Diego López, Sergio Cerón, Antonio Leal, Adrián Pareja, Marcelo Da Silva, Alejandro Pardo et al. Quantum-Resistance in Blockchain Networks. Inter-American Development Bank, Juni 2021. http://dx.doi.org/10.18235/0003313.

Der volle Inhalt der Quelle

Annotation:

This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Cambridge Quantum Computing (CQC), and Tecnológico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time. Similarly, Grover's algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work. Today, there are hundreds of billions of dollars denominated in cryptocurrencies that rely on blockchain ledgers as well as the thousands of blockchain-based applications storing value in blockchain networks. Cryptocurrencies and blockchain-based applications require solutions that guarantee quantum resistance in order to preserve the integrity of data and assets in their public and immutable ledgers. We have designed and developed a layer-two solution to secure the exchange of information between blockchain nodes over the internet and introduced a second signature in transactions using post-quantum keys. Our versatile solution can be applied to any blockchain network. In our implementation, quantum entropy was provided via the IronBridge Platform from CQC and we used LACChain Besu as the blockchain network.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

LI, Zhendong, Hangjian Qiu, xiaoqian Wang, chengcheng Zhang und Yuejuan Zhang. Comparative Efficacy of 5 non-pharmaceutical Therapies For Adults With Post-stroke Cognitive Impairment: Protocol For A Bayesian Network Analysis Based on 55 Randomized Controlled Trials. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, Juni 2022. http://dx.doi.org/10.37766/inplasy2022.6.0036.

Der volle Inhalt der Quelle

Annotation:

Review question / Objective: This study will provide evidence-based references for the efficacy of 5 different non-pharmaceutical therapies in the treatment of post-stroke cognitive impairment(PSCI). 1. Types of studies. Only randomized controlled trials (RCTs) of Transcranial Magnetic Stimulation(TMS), Transcranial Direct Current Stimulation(tDCS), Acupuncture, Virtual Reality Exposure Therapy(VR) and Computer-assisted cognitive rehabilitation(CA) for PSCI will be recruited. Additionally, Studies should be available in full papers as well as peer reviewed and the original data should be clear and adequate. 2. Types of participants. All adults with a recent or previous history of ischaemic or hemorrhagic stroke and diagnosed according to clearly defined or internationally recognized diagnostic criteria, regardless of nationality, race, sex, age, or educational background. 3.Types of interventions and controls. The control group takes non-acupuncture treatment, including conventional rehabilitation or in combination with symptomatic support therapy. The experimental group should be treated with acupuncture on basis of the control group. 4.The interventions of the experimental groups were Transcranial Magnetic Stimulation(TMS), Transcranial Direct Current Stimulation(tDCS), Acupuncture, Virtual Reality Exposure Therapy(VR) or Computer-assisted cognitive rehabilitation(CA), and the interventions of the control group takes routine rehabilitation and cognition training or other therapies mentioned above that were different from the intervention group. 5.Types of outcomes. The primary outcomes are measured with The Mini-Mental State Examination (MMSE) and/or The Montreal Cognitive Assessment Scale (MoCA), which have been widely used to evaluate the cognitive abilities. The secondary outcome indicator was the Barthel Index (BI) to assess independence in activities of daily living (ADLs).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!