Multimedia' nature of an application refers to the presence of several media streams in parallel. Whether it is receiving real-time data or retrieving stored data, there exists an end-to-end delay in data transfer from source to destination over the network. This delay experienced can be split into a fixed part and a variable part. Data processing time like coding and decoding at the source and destination are the fixed delays experienced. The variable delay occurs mainly due to queuing at the intermediate nodes during its flow through the network. The variable or unequal delays introduce gaps or discontinuities within a stream. In multi-stream applications where each stream may flow on different routes based on the bandwidth availability experiencing different delays, mismatch between them can also occur. These discontinuities and skews result in poor quality of playout. Clock drift and variations in drift rates between the source/s and destination/s, clock also lead to poor quality of play out. To eliminate these skews and discontinuities, there must be mechanisms, viz., and synchronisation services to convey, reintroduce and maintain the temporal relationship between the media streams for presentation throughout the playout, at the destination. The reintroduction of this lost temporal relationship within a stream and between various media streams for presentation at the destination is the object of multimedia synchronisation and is the subject matter of this thesis. In the presence of synchronised clocks, the main cause of asynchronies between media streams is the difference in delays experienced and the jitter. In this work, to convey the temporal relationship between streams of an application to the playout site, each stream is assigned a priority л, based on its importance to the user. The media streams are then divided into synchronisation units called 'Groups' based on that stream's characteristics which has the highest priority л. A group may therefore consist of one video frame and other data which were generated in that interval. Or may consist of silence and talk-spurt periods of the voice stream with data units of other streams generated in the same interval. Since the quality of playout of temporally related delay-sensitive streams depends upon the delay-experienced, the concept of QoS can be extended to describe the presentation requirements of uch data. Depending on the user perception and the delay experienced, an application can have a range of playout times, giving the best performance. The presentation of many real-time applications can be considered satisfactory even when the delay bound is exceeded by a small amount for a short period of time under varying network conditions. This property can be exploited by defining two sets of QoS parameters, namely QoS optimum and QoSlimit for each real-time application. As the delay and its variations increase, the optimum playout time range decreases. QoS optimum specifies the performance parameters required to perceive 'realtime'. Multimedia data can be played out at its QoSlimit with a deterioration in quality under poor network conditions still maintaining the synchronisation between streams. To control the playout at two levels of QoS, and maintain intra-media and inter-media synchronisation, stream controllers and super stream controllers have been used. The dynamic delay compensation algorithm and synchronisation services were simulated using network delay models and performances studied. It is shown that the proposed algorithm not only synchronised media streams and smoothened jitter but also optimised buffer space and buffer occupancy time while meeting the desired quality of service requirements

Message Sequence Charts are a visual representation of the system specification which shows how all the participating processes are interacting with each other. Message Sequence Graphs provide modularity by easily allowing combination of more than one Message Sequence Charts to show more complicated system behavior. Requirements modeled as Message Sequence Graphs give a global view of the system as interaction across all the participating processes can be viewed. Thus systems modeled as Message Sequence Graphs are like sequential composition of parallel process. This makes it very attractive during the requirements gathering and review phases as it needs inter-working between different stakeholders with varied domain knowledge and expertise – requirements engineers, system designers, end customers, test professionals etc. In this thesis we give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is fairly well-known in the literature there has been no precise description of such a transition system. Several analysis and verification problems concerning MSG specifications can be solved using this transition system. The transition system can be used to construct correct tools for problems like model-checking and detecting implied scenarios in MSG specifications. There are several contributions of this thesis. Firstly, we have provided a detailed construction of a transition system exactly implementing the message sequence graph. We have provided the detailed correctness arguments for this construction. Secondly, this construction works for general Message Sequence Graphs and not limited to com-connected graphs alone, although, we show that a finite model can be ensured only if the original graph is com-connected. Also, we show that the construction works for both synchronous and asynchronous messaging systems. Thirdly, we show how to find implied scenarios using the transition model we have generated. We also discuss some of the flaws in the existing approaches. Fourthly we provide a proof of undecidability argument for non com-connected MSG with synchronous messaging.