About: Text-based protocol is a research topic. Over the lifetime, 16 publications have been published within this topic receiving 248 citations. The topic is also known as: plain text protocol.
TL;DR: This tutorial presents an overview of the Global System for Mobile Communications Short Message Service from the viewpoint of implementing new telematic services and outlines a summary of current and future issues for further development and research in the light of novel features for submission protocols andtelematic services.
Abstract: This tutorial presents an overview of the Global System for Mobile Communications Short Message Service from the viewpoint of implementing new telematic services. The SMS offers the users of GSM networks the ability to exchange alphanumeric messages up to the limit of 160 characters. The tutorial is motivated by an acute absence of research publications in this field. The information gathered in the tutorial was required considering the increasing potential SMS offers for integration with existing messaging services and its ability to offer a successful replacement for the transmission control and Internet protocols as far as low-bandwidth-demanding applications are concerned. Initially, the tutorial gives an overview of the building blocks of GSM networks-the mobile station, base station, and network subsystem-and then emphasizes the SMS network and protocol architecture. The most widely used protocols for message submission are then introduced (text-based, SMS2000, ETSI 0705, TAP) and compared in terms of features provided and flexibility to handle extended alphabets or two-way messaging. Finally the tutorial outlines a summary of current and future issues for further development and research in the light of novel features for submission protocols and telematic services.
TL;DR: In this paper, a search engine for matching textual patterns in a traffic stream is proposed, consisting of a traffic control unit, a micro-code memory, a comparator and a report memory.
Abstract: A search engine for matching textual patterns in a traffic stream. The search engine comprises a traffic control unit, a micro-code memory, a comparator and a report memory. The traffic control unit is capable of managing the traffic stream. The micro-code memory is capable of storing and retrieving micro-code instructions. The comparator is capable of executing said micro-code instructions to match the textual patterns. The report memory is capable of storing and retrieving reports generated said comparator.
TL;DR: In this article, an efficient exchange of text-based protocol language information is described, which includes a compressor for compressing text based protocol language and a decompressor for decompressing the compressed text based Protocol language information.
Abstract: Systems for an efficient exchange of text based protocol language information include a compressor for compressing text based protocol language information, and a decompressor for decompressing the compressed text based protocol language information. The compressed and decompressed text based protocol language information is transmitted between processors that are adapted to process text based protocol language information. The system may also include an encryption processor to encrypt the compressed text based protocol language before transmitting the compressed text based protocol language information. A decryption processor decrypts the encrypted and compressed text based protocol language information for use by the processors. Other systems and methods are also provided.
TL;DR: A Java-based implementation of the SIP protocol stack is presented, based on a layered SW architecture, reusable object oriented software components and application programming interfaces (API), to realize the main network components necessary for SIP based call setup.
Abstract: Next to the binary-based H.323 signaling protocol for IP telephony developed by the telecommunication community (ITU-T), a more lightweight text-based protocol was deemed necessary to address the specific needs of the Internet community. The session initiation protocol (SIP) (see Handley, M. et al., IETF-RFC 2543, March 1999) was introduced in the IETF conference control working group and has meanwhile gained maturity and support. This paper presents a Java-based implementation of the SIP protocol stack, based on a layered SW architecture, reusable object oriented software components and application programming interfaces (API). This protocol stack has been used as a basis to realize the main network components necessary for SIP based call setup: user agent, proxy server, redirect server, and registration server. The interaction between these components is illustrated through a number of service scenarios, focusing on PC-to-PC communication within the context of a virtual private network (VPN) service.
TL;DR: VoIPFD, an anomaly detector for detecting VoIP flooding attacks on SIP is described, which identifies and generates Poisson distribution models for few SIP messages in order to detect specific flooding attacks.
Abstract: Session Initiation Protocol (SIP) is a popularly used signaling protocol to manage connections between different user agents of a Voice over IP (VoIP) communication. SIP being a text based protocol is vulnerable to flooding, one of the popularly known Denial of Service (DoS) attacks. This attack can render VoIP servers unusable with depletion of CPU and memory resources. Given the accessibility of tools to generate these attacks and the ease with which these attacks can be launched, it is important to detect them. In this paper, we describe VoIPFD, an anomaly detector for detecting VoIP flooding attacks on SIP. Like any other anomaly detector, VoIPFD generates the normal profile of SIP messages as a probability distribution. We identify and generate Poisson distribution models for few SIP messages in order to detect specific flooding attacks. We simulate an enterprise VoIP communication and experiment with varied rates of flooding and report the detection performance of VoIPFD.