China
Africa
Explore chapters and articles related to this topic
Ports and Protocols
Published in Kevin E. Foltz, William R. Simpson, Enterprise Level Security 2, 2020
Kevin E. Foltz, William R. Simpson
Many organizations are involved in setting standards for networking. The most important organizations for the web are: ISO – A federation of more than 100 standards organizations from throughout the world. IETF – The organization responsible for the protocols that drive the Internet. These standards are cited by reference to their Request for Comments (RFC). World Wide Web Consortium (W3C) – An international organization that handles the development of standards for the World Wide Web.
Patents and Standards
Published in Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone, Handbook of Applied Cryptography, 2018
Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone
Documents called Requests for Comments (RFCs) are official working notes of the Internet research and development community. A subset of these are specifications which are candidates for standardization within the community as Internet Standards.
Minimum and maximum packets’ delays determination for communication flows’ delays jitters computation
Published in Australian Journal of Electrical and Electronics Engineering, 2023
To calculate the maximum and minimum delays of a PDU in a node using the model as represented by Equation (5), we need L, the maximum length in bits of a PDU; Cout, the bit rate (in bps) of an output port; and σ, the maximum size of traffic in bits that can arrive in a burst to an input port. Utilising the extended Ethernet frame which is illustrated in Figure 4 as our PDU, L = 7 +1 +6 +6 +4 +2 +1500 +4 = 1530 bytes = 1530 × 8 bits = 12,240 bits. Similarly, we choose Cout = 10 ×106 bps (the basic Ethernet rate). A value for σ is, however, not yet available in literature, as there is no general agreement on how bursty traffic should be characterised and quantified (that is, how a numerical value should be assigned to σ) (Yoshida et al. 2021). In this context, Sven, Ales, and Stanislav (2008) have averred that traffic burstiness metrics have not yet been defined and that schemes to monitor traffic burstiness are not yet well comprehended; hence, there has been no general agreement in literature on a quantifiable definition of data traffic burstiness (Ryousei et al. 2006; Shan et al. 2020). Therefore, we resorted to utilising the recommendations that are contained in IETF’s (Internet Engineering Task Force’s) RFC 2544 (Requests for Comments 2544) (Request For Comments 2544, 2018) with regard to burstibility tests of nodal devices. This particular RFC recommends burst sizes of 1024, 256, 64 and 16 frames when testing the burstibility of nodal devices.
Aggregation of clans to speed-up solving linear systems on parallel architectures
Published in International Journal of Parallel, Emergent and Distributed Systems, 2022
Dmitry A. Zaitsev, Tatiana R. Shmeleva, Piotr Luszczek
In this section, we consider examples of clans' aggregation for Petri net models of the studied real-life networking protocols [4,34]. We proceed from rather modestly complex models to more elaborate ones and thus illustrating the process with graphs and mathematical calculations to explain the sophisticated process of decomposition into clans, solving systems for clans, solving the composition system, and emphasising changes to the solution process which the clans aggregation brings in. Note that the domain of investigation is well known: the transmission control protocol (TCP) and internet open trade protocol (IOTP) are specified by the corresponding Request for Comments (RFCs) [35,36] from internet engineering task force. We would also like to mention that both models and also hypertorus grid model have been approved and added to the MCC repository [7].