Packet delay and sequence number space in the radio link protocol layer

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.Includes bibliographical references (leaf 85).by Euree Y. Kim.S.B.and M.Eng

The Xpress Transfer Protocol (XTP): A tutorial (expanded version)

The Xpress Transfer Protocol (XTP) is a reliable, real-time, light weight transfer layer protocol. Current transport layer protocols such as DoD's Transmission Control Protocol (TCP) and ISO's Transport Protocol (TP) were not designed for the next generation of high speed, interconnected reliable networks such as fiber distributed data interface (FDDI) and the gigabit/second wide area networks. Unlike all previous transport layer protocols, XTP is being designed to be implemented in hardware as a VLSI chip set. By streamlining the protocol, combining the transport and network layers and utilizing the increased speed and parallelization possible with a VLSI implementation, XTP will be able to provide the end-to-end data transmission rates demanded in high speed networks without compromising reliability and functionality. This paper describes the operation of the XTP protocol and in particular, its error, flow and rate control; inter-networking addressing mechanisms; and multicast support features, as defined in the XTP Protocol Definition Revision 3.4

Designing a large scale switch interconnection architecture and a study of ATM scheduling algorithms.

by Yee Ka Chi.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Includes bibliographical references (leaves 101-[106]).Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Background --- p.1Chapter 1.1.1 --- Large Scale Switch Interconnections --- p.2Chapter 1.1.2 --- Multichannel Switching and Resequencing --- p.6Chapter 1.1.3 --- Scheduling --- p.7Chapter 2 --- Hierarchical Banyan Switch Interconnection --- p.12Chapter 2.1 --- Introduction --- p.12Chapter 2.2 --- Switch Architecture --- p.13Chapter 2.3 --- Switch Operation --- p.19Chapter 2.3.1 --- Call Setup --- p.19Chapter 2.3.2 --- Cell Routing --- p.21Chapter 2.3.3 --- Fault Tolerance --- p.27Chapter 2.4 --- Call Blocking Analysis --- p.28Chapter 2.4.1 --- Dilated Banyan --- p.29Chapter 2.4.2 --- Dilated Benes Network --- p.30Chapter 2.4.3 --- HBSI --- p.30Chapter 2.5 --- Results and Discussions --- p.31Chapter 2.6 --- Summary --- p.37Chapter 3 --- Multichannel Switching and Resequencing --- p.40Chapter 3.1 --- Introduction --- p.40Chapter 3.2 --- Channel Assignment --- p.41Chapter 3.2.1 --- VC-Based Channel Allocation Mechanism --- p.41Chapter 3.2.2 --- Port-Based Channel Allocation Mechanism --- p.45Chapter 3.2.3 --- Trunk-Based Channel Allocation Mechanism --- p.46Chapter 3.3 --- Resequencer --- p.50Chapter 3.3.1 --- Resequencing Algorithm --- p.50Chapter 3.4 --- Results and Discussion --- p.55Chapter 3.5 --- Summary --- p.60Chapter 4 --- Scheduling --- p.62Chapter 4.1 --- Introduction --- p.62Chapter 4.2 --- Virtual Clock Scheduling (VCS) --- p.62Chapter 4.3 --- Gated Virtual Clock Scheduling (GVCS) --- p.70Chapter 4.4 --- Time-Priority Model --- p.75Chapter 4.5 --- Programmable Rate-based Scheduler (PRS) --- p.80Chapter 4.6 --- Integration with Resequencer --- p.83Chapter 4.7 --- Results and Discussions --- p.86Chapter 4.8 --- Summary --- p.96Chapter 5 --- Conclusion --- p.99Bibliography --- p.10

Resource Management in Multimedia Networked Systems

Error-free multimedia data processing and communication includes providing guaranteed services such as the colloquial telephone. A set of problems have to be solved and handled in the control-management level of the host and underlying network architectures. We discuss in this paper \u27resource management\u27 at the host and network level, and their cooperation to achieve global guaranteed transmission and presentation services, which means end-to-end guarantees. The emphasize is on \u27network resources\u27 (e.g., bandwidth, buffer space) and \u27host resources\u27 (e.g., CPU processing time) which need to be controlled in order to satisfy the Quality of Service (QoS) requirements set by the users of the multimedia networked system. The control of the specified resources involves three actions: (1) properly allocate resources (end-to-end) during the multimedia call establishment, so that traffic can flow according to the QoS specification; (2) control resource allocation during the multimedia transmission; (3) adapt to changes when degradation of system components occurs. These actions imply the necessity of: (a) new services, such as admission services, at the hosts and intermediate network nodes; (b) new protocols for establishing connections which satisfy QoS requirements along the path from send to receiver(s), such as resource reservation protocol; (c) new control algorithms for delay, rate and error control; (d) new resource monitoring protocols for reporting system changes, such as resource administration protocol; (e) new adaptive schemes for dynamic resource allocation to respond to system changes; and (f) new architectures at the hosts and switches to accommodate the resource management entities. This article gives an overview of services, mechanisms and protocols for resource management as outlined above

Overview on: sequencing in mixed model flowshop production line with static and dynamic context

In the present work a literature overview was given on solution techniques considering basic as well as more advanced and consequently more complex arrangements of mixed model flowshops. We first analyzed the occurrence of setup time/cost; existing solution techniques are mainly focused on permutation sequences. Thereafter we discussed objectives resulting in the introduction of variety of methods allowing resequencing of jobs within the line. The possibility of resequencing within the line ranges from 1) offline or intermittent buffers, 2) parallel stations, namely flexible, hybrid or compound flowshops, 3) merging and splitting of parallel lines, 4) re-entrant flowshops, to 5) change job attributes without physically interchanging the position. In continuation the differences in the consideration of static and dynamic demand was studied. Also intermittent setups are possible, depending on the horizon and including the possibility of resequencing, four problem cases were highlighted: static, semi dynamic, nearly dynamic and dynamic case. Finally a general overview was given on existing solution methods, including exact and approximation methods. The approximation methods are furthermore divided in two cases, know as heuristics and methaheuristic

Scheduling soft real-time jobs over dual non-real-time servers

In this paper, we consider soft real-time systems with redundant off-the-shelf processing components (e.g., CPU, disk, network), and show how applications can exploit the redundancy to improve the system's ability of meeting response time goals (soft deadlines). We consider two scheduling policies, one that evenly distributes load (Balance), and one that partitions load according to job slackness (Chop). We evaluate the effectiveness of these policies through analysis and simulation. Our results show that by intelligently distributing jobs by their slackness amount the servers, Chop can significantly improve real-time performance. ©1996 IEEE.published_or_final_versio