Abst?act- Multimedia applications comprise several media streams, which are semantically synchronized at different time instants. The application kehavior is stored along with the multimedia database using representation mechanisms such as OCPN (object composition Petri nets) or dynamic timed Petri nets (DTPN). It is imperative that one translates the application behavior to the corresponding schedulable entities, such as packets, so that the performance engineering of any system can be done, using the traffic model arising out of the (media related) application behavior as opposed to individual media level behavior. This requires that a function be defined, which takes the stored temporal representation as input and produces packets as output, preserving the semantic relationships among the streams. We propose a methodology based on probabilistic, attributed context free grammar (PACFG) to address this issue. We demonstrate the appropriateness of this methodology by applying it to the OCPNDTPN representation of a typical multimedia application vis-his orchestrated presentation.
[1]
Peter Radford,et al.
Petri Net Theory and the Modeling of Systems
,
1982
.
[2]
James F. Allen.
Maintaining knowledge about temporal intervals
,
1983,
CACM.
[3]
Jean-Bernard Stefani,et al.
Computational model for distributed multimedia applications based on a synchronous programming language
,
1992,
Comput. Commun..
[4]
King-Sun Fu,et al.
Syntactic Pattern Recognition And Applications
,
1968
.
[5]
Thomas Dunham Conant Little.
Synchronization for distributed multimedia database systems
,
1992
.
[6]
Günter Haring,et al.
Generative networkload models for a single server environment
,
1994,
SIGMETRICS.
[7]
Simon J. Gibbs,et al.
Composite multimedia and active objects
,
1991,
OOPSLA '91.