An object oriented toolkit for implementation oriented modeling of real-time multimedia communications
IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)
l Introduction time framing strategy, to provide multiple delay bounds in each node. However, time fram-A comparative performance evaluation of these ing strategies suffer from the dependencies they protocols and architectures necessitates theoret-introduce between the queuing delay and the ically evaluating and experimentally comparing granularity of bandwidth d h a t i o n [31. RCSP different architectures, protocols, topologies and queuing  overcomes this by separating the rate
... s of networks under the same operat. control and delay control functions. We have ing A toolkit providing this facility adopted the inter and intra class bandwidth regwork a framework of traffic control to accommo. per, no lower bound has been specified for the date collnections in a network has connections. The toolkit has been designed on been proposed. An approach based on Resource ~,~~~~~~~i~ protocol bas been implemented to these works no admission control mechanism has reserve resources. It follows many novel debeen provided. sign principles such as receiver initiated reservation, separating reservation from packet filtering, maintaining soft states in, the network, modularity, etc. may therefore be of great importance, In this ulation Principle from [SI. However, in that Pathe lines Of the work given in [6, 71. However, in The rest of the paper i s organized as follows. Section 2 describes about the suggested schemes and protocols. Section 3 discisses the proposed toolkit. Simulation and results have been given in section 4. Finally, we make our conclusions in Corresponding to different traffic models and performance measures many scheduling poli-section 5 . cies as well as admission control schemes have 2 Suggested Schemes and Protocols used in the toolkit been proposed. Ferrari and Verma proposed a scheme for establishing multimedia connections [l]. When a connection is to be established. suitable delay upper bounds are assigned t o intermediate nodes of the routing path. If the endto-end cell delay does not go beyond the upper bound of the connection, the connection is accepted. Chen and Liu in r2] suggested a Round-Robin/Priority Scheduling algorithm, involving We, here, briefly describe the following protocols and schemes used in the proposed toolki. 1. T h e R e s o u r c e Reservation Architect ure 0-7803-4984-9/98/$10.00 0 1998 IEEE.