Protocol Entity Research Articles

Network_Protocol_Entity_Extraction_Based_on_Few_shot_Learning

Knowledge Graph is a new way of knowledge collections, and building a protocol knowledge graph on RFCs can help us study and analyse network protocol better. Protocol entity extraction is one of the keys to constructing the network protocol knowledge graph.Because RFC (Request For Comments) contains detailed descriptions of basic Internet communication protocols, the protocol entities of the network can be obtained from it. However, the document format and wording are not uniform, which leads to the inability to complete the extraction task of network protocol entities based on traditional rule information extraction methods. Therefore, this paper proposes a network protocol entity extraction method based on Few-Shot Learning. This method can use a very small amount of labeled samples to extract network protocol entities from a large number of unlabeled samples and maintain high recognition accuracy. This method firstly mines as many potential network protocol entities as possible in the RFC document, and secondly performs accurate re-identification of the identified potential network protocol entities. Experiments show that using 5 manually annotated RFC documents to train our model, the accuracy of network protocol entity extraction reaches 88.4%. Compared with the existing methods, this method has higher accuracy and better robustness in terms of network protocol entity extraction, and it also has better identification ability for network protocol entities that have not appeared in the training set.

A Joint Model of Entity Linking for RFC Protocols Knowledge Graph Construction

Applying knowledge representation and reasoning to downstream tasks has been considered a promising research direction, as it enables semantic analysis of network protocols. Knowledge Graph is a new way of collecting knowledge, and building a protocol knowledge graph based on RFCs can help us study and analyze network protocols more effectively. However, automatically constructing a protocol knowledge graph from RFCs poses a major challenge, particularly in terms of extracting and linking protocol entities, due to the semi-structured nature of RFC documents. In this paper, we propose a model that combines a fine-tuned language model with an RFC Domain Model to link entities in RFCs to categories in the protocol knowledge base. Firstly, we design a protocol knowledge base as the schema for protocol entity linking. Secondly, we use heuristic methods to identify protocol entities and infer their descriptions from the nearby contexts of their header fields. Finally, we conduct comprehensive experiments on the RFC dataset using our joint model and baseline methods for protocol entity linking. Experimental results demonstrate that our model achieves state-of-the-art performance in entity linking on the RFC dataset, outperforming all baseline methods. In addition, we release a protocol knowledge graph, RFC-KG1.

SATFuzz: A Stateful Network Protocol Fuzzing Framework from a Novel Perspective

Stateful network protocol fuzzing is one of the essential means for ensuring network communication security. However, the existing methods have problems, including frequent auxiliary message interaction, no in-depth state-space exploration, and high shares of invalid interaction time. To this end, we propose SATFuzz, a stateful network protocol fuzzing framework. SATFuzz first prioritizes the states identified by the status codes in response messages, then randomly selects a state to test among the high-priority states, and determines its corresponding optimal test sequence, which is composed of the minimum pre-lead sequence, the test case, and the fittest post-end sequence. Finally, SATFuzz uses a quasi-recurrent neural network (QRNN) to filter the test cases before performing interaction, and only the optimal test sequence, including the valid test case, can be fed to the protocol entity. To verify the proposed framework, we conduct extensive experiments with the state-of-the-art fuzzer on two popular protocols. The results show that the vulnerability discovery efficiency of the proposed approach increases by at least 1.48 times (at most by 3.06 times), making it superior to the rival methods. This not only confirms the effectiveness of SATFuzz in terms of improving the vulnerability discovery efficiency but also shows that SATFuzz has significant advantages.

Implementation framework of cross-platform MANET routing protocol

In order to reduce repetition and ensure the accuracy and consistency in implementing Mobile Ad Hoc Network (MANET) routing protocol on different platforms,an implementation framework of MANET routing protocols running on Windows,Linux and NS-2 was designed and validated by implementing Ad Hoc On-Demand Distance Vector (AODV),a classic MANET reactive routing protocol based on it.The method by abstraction for separating protocol entity from environments is of generability in designing the framework.It can also be applied to other MANET routing protocols or other network protocols (e.g.TCP),and can also be extended to support other operating systems.

WE-SAM - BRB-02: DICOM- an Overview with an Emphasis on Therapy

In recent years, there has been a large increase in the amount of data required to deliver a radiotherapytreatment due to advances in IMRT, modulated arc delivery,IGRT, and 4D imaging. This has also resulted in an increased reliance on the Digital Imaging and Communications in Medicine (DICOM) standard in radiation oncology in order to move treatment and verification data from imaging to planning to treatment. This session will go over the fundamentals of the DICOM standard, with an emphasis on radiotherapy. Topics to be covered include the DICOM communications protocol, DICOM workstations and application entity configurations, content and structure of a part 10 file, RT‐Plan Information Object Definition (IOD), free ware and shareware applications, and clinical examples of troubleshooting data transfers and extracting associated information found in DICOM headers. Learning Objectives: 1. Understand the communication amongst DICOM Application Entities. 2. Learn the content and structure of a DICOM part 10 file. 3. Understand the DICOM RT‐Plan IOD. 4. Review DICOM software applications and their uses in clinical radiotherapy processes.

An Enhancement of FMIPv6 for the Packet Radio Networks which supports the QoS provisioning on the MIPv6

An important element estimating a good seamless handover scheme is that how rapidly and accurately can anticipate the imminent Layer 3 handover. The FMIPv6 may be the best scheme for it because the anticipation is made by collaboration with Layer 2. However, the FMIPv6 has a few issues which should be tackled: various Layer 2 implementations, various moving speeds of nodes and supporting the QoSrelated protocols on the Internet. Especially, it seems that it could not always ensure the QoS on the Internet for the highly moving users. In this paper, we propose a pseudo fast handover mode for the QoS-related protocols when nodes are moving fast. For the proposed pseudo fast handover mode, we have modified the fast binding-update and defined a new protocol entity called edge cell.

A conceptual model of service customization and its implementation

With the development of Internet and next generation networks in telecommunications, more and more new services are required to be introduced into networks. Introducing new services into traditional network is always associated with standardizing new protocols. The progress of protocol standardization usually takes several years, which cannot meet the increasing demands of the applications in Internet and next generation networks. Service customization in network systems may be one possible solution to cope with this problem. Based on the principle that network service is provided by interactions among protocol entities, this paper proposes a conceptual model of service customization (SECUM) by separating the service logic from protocol interactive logic within existing network architecture. The theory of Communicating Sequential Processes (CSP) is used to formalize the SECUM in order to locate exactly the service logic and to define precisely the SECUM. For validating the SECUM's usability in practical network systems, this paper also proposes an implementation model for SECUM: a component-based protocol implementation model (CPIM). CPIM discomposes protocol entity into application component, service component, message component and communication component. Service component associates application component with message component. Users or network managers can customize network services by configuring service component. The paper shows respectively the applications of SECUM and CPIM by proposing a customizable IP service model based on SECUM and describing an implementation of Session Initiation Protocol (SIP) based on CPIM. Compared with the existing service-customization techniques, SECUM is a service customization model internal to network system and may provide more powerful capabilities of service customization.

A generic network management architecture targeted to support home automation networks and home Internet connectivity

This paper proposes a generic network management architecture, targeted to support home automation networks (HAN) and home Internet connectivity. The main objective of the proposed architectural model and implied protocol is the acquisition of control and monitoring information of a HAN, as well as the handling of such information remotely by means of an Internet connection. The proposed protocol, being an application service element (ASE), is fully compatible with the notation and functionality of the emerging "convergence" protocol targeted to be a European standard for home automation systems. The core of the proposed architecture is a new management protocol entity residing at the OSI application layer. We have followed an approach similar to the well-known simple network management protocol (SNMP) of the TCP/IP protocol suite. Information is acquired either on request by the management device or on event reporting initiated by a managed device. Furthermore, the acquired information can be diffused to the Internet, through a HAN-to-TCP gateway unit. Finally, a prototype system based on the European Home Systems (EHS) specification is described.

MACSE: A generic connection establishment protocol for multimedia communication residing at the OSI application layer

AbstractThe multiple association control service element (MACSE) described in this work is a new connection establishment protocol for the application layer of the OSI reference model (OSIRM). The objective of the protocol is efficient establishment and control of multimedia associations among multiple spatially dispersed users. MACSE defines a new OSI service to support the communication requirements of multimedia applications so as to shift the burden of setting‐up a complex call to a protocol entity, instead of the application developer. The MACSE protocol enhances the OSIRM by introducing careful service definition, service primitives and relevant parameters, as well as a non‐monolithic protocol specification. The protocol defines procedures for the negotiation and confirmation of quality of service (QoS) per association while it forms the core of a proposed architectural model which provides a coherent treatment of QoS across all layers of the OSIRM and reduces the complexity of it. Out‐of‐band, rather than in‐band, signalling at the application layer and multi‐target associations are introduced and analysed, in contrast to the structure of the well‐known OSI association control service element (ACSE) protocol. Moreover, ACSE can be considered a particular case of MACSE.

Protocol synthesis from rule-based communications service specifications

This paper aims at the automatic generation of software from communication service specifications. A method for protocol synthesis is proposed, where the specifications for the protocol entity that maintains the local state for the terminal are derived from communication service specifications. The latter are described as a set of the global state transition rules concerning the terminal. The communication service specifications are represented as a set of rules for rewriting a directed graph. Specifications for the protocol entity are derived that execute communication to search for the rule satisfying the application condition. Each protocol entity realizes the distributed algorithm that searches isomorphic subgraphs contained in the directed graph representing the entire communication system. A graph that represents the condition for a rule application can be an arbitrary connected directed graph. A protocol has the same performance in regard to the number of communications as the protocol obtained by imposing the condition that there exists a directed path that passes through every vertex once. The generated protocol can be converted finally to a program that can operate on the communication system, and the result can be applied to communication software development. The method is applied to the development of PBX software in order to demonstrate that software generated from the communication service software based on the proposed protocol synthesis has practical performance. © 1998 Scripta Technica. Electron Comm Jpn Pt 1, 81(3): 22–35, 1998

Deriving protocol specifications from service specifications written in LOTOS

A complete communication system is broken down into a number of protocol layers each of which provides services to the layer above it and uses services provided by its underlying layer. A service specification defines a particular ordering of the operations that a given layer provides to the layer above it. The active elements in each layer are called entities and they use a protocol in order to implement their service definition. On the basis of this relation between the service and protocol concepts we have developed algorithms for deriving protocol entity specifications from a formal service specification. The derived protocol entities ensure the correct ordering of the service primitives by exchanging synchronization messages through an underlying communication medium. This paper presents an extended version of our earlier derivation algorithms. This version of the algorithm can handle all operators and unrestricted process invocation and recursion as defined by basis LOTOS. The correctness of this derivation algorithm is formally proved.

Probabilistic fuzzy timed protocol verification

Communication protocols always have some embedded timed properties (e.g. timeout and transmission delay). To specify and analyse the timed properties, a new formal model is presented in this paper. The new protocol specification model is called the Fuzzy Timed Communicating State Machine (FTCSM) model. Since it is very hard to precisely specify time bounds as constants, the fuzzy time concept is applied to specify time bounds, i.e. each time bound is specified as a time interval. In the FTCSM model, each protocol entity and each communication channel is specified as an FTCSM, respectively. To analyse various properties of protocols specified in the FTCSM model, a fuzzy timed protocol verification method is proposed. To deal with the state space explosion problem, we adopt the probability-based partial timed verification approach. The corresponding probabilistic fuzzy timed verification scheme for the FTCSM model is also presented in detail. Using the FTCSM model and the associated probabilistic fuzzy timed protocol verification method, an Estelle-like Probabilistic Fuzzy Timed Protocol Verification System (EPFTPVS) has been developed on SUN SPARC workstations. In this way, a subset of Estelle-specified protocols with fuzzy time specifications can be automatically verified using EPFTPVS.

An Estelle translator for incremental protocol verification

Abstract Formal Description Techniques (FDTs) provide formal support for each phase of protocol development. Estelle is one of the FDTs proposed by the International Organization for Standardization (ISO) to formally specify distributed systems, especially for communication protocols. In this paper, we present the development of an Estelle translator which allows protocol designers to interactively add/delete transitions at the run time of protocol verification. The Estelle translator can translate Estelle‐specified protocols into the internal extended finite state machine tables, which have corresponding information of each protocol entity. The main feature of the Estelle translator is its capacity to support incremental protocol verification. The incremental translating components in our Estelle translator allow protocol designers to modify protocols at the run time and continue the verification at the modification point incrementally. That is, our Estelle translator allows protocol designers interactiv...

A collision problem in OSI standard formal specifications

Abstract A collision problem is presented which can occur between two adjacent protocol entities, a user and its local provider. We consider synchronous and asynchronous communication mechanisms at the Service Access Point between the entities; this is normally an implementation choice. It is shown that even if the problem is limited by using a synchronous communication mechanism, instead of an asynchronous one, it still occurs. We suggest that whenever this case is found, the service provided by the protocol entity must be interpreted differently by its user, ignoring some primitives. When an asynchronous communication mechanism is used, care must be taken to verify that those primitives to be ignored cannot be misinterpreted as new primitives; finally, we point out that the protocol specification could be redesigned to handle these collision cases properly.

Automatic protocol generation based on x.409 specifications

In recommendation x-409 the CCITT presents a standardised presentation and representation technique to define the data units that constitute the different x.400 protocols. Apparently, the x.409 recommendation will have a much broader field of application and will be used for a large number of application layer protocols. The machine processable nature of the x-409 specification language clearly demands for a software development environment. This paper introduces the tools developed at the Bell Telephone Mfg Co Research Centre to support the implementation of protocols based on an x.409 specification. The key of the protocol development environment is the generation of a PASCAL data structure as the internal representation of an x.409 protocol. A protocol specified in x.409 will yield an equivalent instantiation of such a datastructure. Based on this protocol representation, part of the protocol entity can be implemented automatically.

Waiting times in a transport protocol entity scheduler

article Free Access Share on Waiting times in a transport protocol entity scheduler Authors: J Vinyes-Sanz View Profile , J Riera-Garcia View Profile Authors Info & Claims ACM SIGCOMM Computer Communication ReviewVolume 16Issue 5Oct./Nov. 1986 pp 4–12https://doi.org/10.1145/15706.15707Online:01 November 1986Publication History 0citation70DownloadsMetricsTotal Citations0Total Downloads70Last 12 Months0Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

An interactive test sequence generator

The interactive test sequence generator (ITSG) is a software tool which provides the capability of generating test sequences from logic specifications in an interactive manner. A logic specification is a collection of Horn clauses coded in Prolog describing the externally observable behaviour of a system. ITSG facilitates a controlled traversal of the execution paths described by a logic specification and is written in C_Prolog running under UNIX 4.2 on Vax 750. In this paper, first the form of logic specifications is described and an outline of a logic specification for a protocol entity (i.e., protocol specification) is presented. Then, ITSG is introduced and its functionality is explained. As well, the possible usage of ITSG in constructing conformance test suites for protocol implementation testing is discussed and a simple scenario for developing a conformance test suite is presented.

A grammar-based methodology for protocol specification and implementation

A new methodology for specifying and implementing communication protocols is presented. This methodology is based on a formalism called “Real-Time Asynchronous Grammars” (RTAG), which uses a syntax similar to that of attribute grammars to specify allowable message sequences. In addition RTAG provides mechanisms for specifying data-dependent protocol activities, real-time constraints, and concurrent activities within a protocol entity. RTAG encourages a top-down approach to protocol design that can be of significant benefit in expressing and reasoning about highly complex protocols. As an example, an RTAG specification is given for part of the Class 4 ISO Transport Protocol (TP-4). Because RTAG allows protocols to be specified at a highly detailed level, major parts of an implementation can be automatically generated from a specification. An RTAG parser can be written which, when combined with an RTAG specification of a protocol and a set of interface and utility routines, constitutes an implementation of the protocol. To demonstrate the viability of RTAG for implementation generation, an RTAG parser has been integrated into the kernel of the 4.2 BSD UNIX operating system, and has been used in conjunction with the RTAG TP-4 specification to obtain an RTAG-based TP-4 implementation in the DoD Internet domain.

A new technique for generating protocol test

A novel procedure presented here generates test sequences for checking the conformity of protocol implementations to their specifications. The test sequences generated by this procedure only detect the presence of many faults, but they do not locate the faults. It can always detect the problem in an implementation with a single fault. A protocol entity is specified as a finite state machine (FSM). It typically has two interfaces: an interface with the user and with the lower-layer protocol. The inputs from both interfaces are merged into a single set I and the outputs from both interfaces are merged into a single set O. The implementation is assumed to be a black box. The key idea in this procedure is to tour all states and state transitions and to check a unique signature for each state, called the Unique Input/Output (UIO) sequence. A UIO sequence for a state is an I/O behavior that is not exhibited by any other state.

Relationship between performance parameters for transport and network services

Various performance parameters are defined which characterize the quality of service offered by a layer of the OSI model. In particular the parameters for the Transport and Network are considered. The set of parameters are classified into: i) Connection related parameters; and ii) Access point related parameter; We further make an analysis of the relation between the parameters of the service provided by the Transport layer and the parameters of the Network service used by the Transport protocol, depending on the class of Transport protocol used. This is an example of a hierarchical approach to the evaluation of performance measures for the N-layer service in terms of performance measures of the (N-1)-layer service in conjunction with the performance measures of the N-layer protocol entity.