Multipath routing and data retransmission cause data misordering. Although data could be reordered before processing, it is simpler and more efficient to process data as it arrives. Because existing protocol functions generally cannot process misordered data, we need new functions with minimal ordering constraints. For two example functions, CRC error detection and CBC mode encryption, we show that the functions have ordering constraints and we present new functions that provide similar functionality without ordering constraints. Keyword Codes: C.2.2 Keywords: Network Protocols 1 Introduction While developing a high-speed protocol processing host-network interface for the AURORA gigabit network, we came across an interesting problem associated with packet misordering. Some protocol functions cannot be computed on misordered data, and thus, the data must be reordered before processing. We demonstrate the problem using cyclic redundancy code (CRC) error detection and cipher block chain...

The problems of information overload from the growth of scholarly literature, and the need to use information technology to manage them, were identified by major writers and scientists over fifty years ago. Yet the main form of scholarly communication, the journal, is still circulated in paper form as it has been for over three hundred years. The economic arguments for using computer and communication technology to overcome these problems through a new form of scientific communication, the electronic or digital journal, were vigorously presented in the 1970s. Experimental trials of digital journals with the technologies of the 1970s and 1980s have not been successful. In the 1990s, the continuing value of current journal systems is again being questioned in terms of soaring library costs, the burden of the current refereeing system and the diminishing returns of journal publication brought about by information overload. This paper presents a fundamental examination of the prerequisites...

: This report describes the design and the prototyping of a compiling tool for the automated implementation of distributed applications: ALFred. This compiler starts from the formal specification of an application written in ESTEREL, and then integrates end-to-end communication functions tailored to the application characteristics (described in the specification) and produces a high performance implementation. The report describes tdescribes the communication architecture associated to our automated approach. The compiler is made of two main parts: a control compiler also called ALF compiler; and a data manipulation compiler (the ILP compiler) that combines data manipulation functions in an efficient way (the ILP loop). The ALFred compiler has been designed to allow the development and the analysis of non-layered high performance communication architectures based on ALF and ILP. Key-words: High Performance Protocol Architectures, Formal Description, Tailored Protocols, End...

STRUCTURING HOST COMMUNICATION SOFTWARE FOR QUALITY OF SERVICE GUARANTEES by Ashish Mehra Chair: Kang G. Shin This dissertation addresses several issues involved in structuring communication software at end hosts to provide per-connection quality of service (QoS) guarantees. Our primary thrust is on realizing deterministic QoS guarantees in an experimental setting. We design a novel QoS-sensitive communication subsystem architecture that provides components and mechanisms to manage communication resources in a QoS-sensitive fashion. This architecture is based on three key design principles: maintenance of QoS guarantees, overload protection via per-connection traffic enforcement, and fairness to best-effort traffic. We demonstrate the efficacy of the architecture via experiments using our x-kernel-based prototype implementation. We develop admission control extensions to capture important implementation-related aspects not considered by theoretical resource management policies p...

Traditional computer network protocols use packet switching to provide data transportation service to the user. We are developing a new connection oriented network service which separates control and data called Dynamic synchronous transfer mode, DTM. This paper presents the mechanisms and the control slots for the DTM protocol. It also describes the procedures of the protocol entity. Each node in the DTM network uses a broadcast channel to send all medium access information to the other nodes on the link. DTM-Protocol-specification 0 TRITA-IT-9302 1 Introduction..............................................................................................................1 1.1 Abbreviations.......................................................................................................................3 1.2 Types of DTM Protocol data units.......................................................................................3 1.3 DPDU Fields........................................