Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.535901
K. Nahrstedt, Jonathan M. Smith
Multimedia feedback remote control applications use a control loop between devices such as robot manipulators and cameras and a human user. An application-to-application quality of service is required. Network and end-point resources must be controlled and integrated in a robust admission and scheduling process. We focus in this paper on a novel admission and scheduling process for the end-points. The algorithms were prototyped within our OMEGA architecture, which controls the end-point resources in full-feedback applications, such as telerobotics.
{"title":"New algorithms for admission control and scheduling to support multimedia feedback remote control applications","authors":"K. Nahrstedt, Jonathan M. Smith","doi":"10.1109/MMCS.1996.535901","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535901","url":null,"abstract":"Multimedia feedback remote control applications use a control loop between devices such as robot manipulators and cameras and a human user. An application-to-application quality of service is required. Network and end-point resources must be controlled and integrated in a robust admission and scheduling process. We focus in this paper on a novel admission and scheduling process for the end-points. The algorithms were prototyped within our OMEGA architecture, which controls the end-point resources in full-feedback applications, such as telerobotics.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115294412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.534973
Sreenivas Gollapudi, A. Zhang
Investigates the principles of buffer management for multimedia data presentations in object-oriented database environments. The primary goal is to minimize the response time of multimedia presentations while ensuring that all continuity and synchronization requirements are satisfied. Minimum buffering requirements to guarantee the continuity and synchrony of the presentation of multimedia data are proposed. These principles provide users with the full range of information required to develop a database environment for multimedia presentations.
{"title":"Buffer management in multimedia database systems","authors":"Sreenivas Gollapudi, A. Zhang","doi":"10.1109/MMCS.1996.534973","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534973","url":null,"abstract":"Investigates the principles of buffer management for multimedia data presentations in object-oriented database environments. The primary goal is to minimize the response time of multimedia presentations while ensuring that all continuity and synchronization requirements are satisfied. Minimum buffering requirements to guarantee the continuity and synchrony of the presentation of multimedia data are proposed. These principles provide users with the full range of information required to develop a database environment for multimedia presentations.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122290799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.534971
Banu Özden, R. Rastogi, A. Silberschatz
In a disk-based storage system, a buffer cache is used to reduce the number of disk I/Os. The buffer manager is responsible for buffer replacement to free memory in order to accommodate new data blocks from the disk. An optimal buffer replacement algorithm is one which yields the lowest number of cache misses and, as a result, the lowest number of disk I/Os. In general, optimal buffer replacement algorithms require future knowledge, and therefore cannot be realized. Thus, most storage systems use approximation algorithms such as the least-recently-used (LRU) and most-recently-used (MRU) buffer replacement algorithms. In this paper, we show that both of these algorithms yield poor performance when they are used in storage systems that provide support for continuous media data. We present two new buffer replacement algorithms-BASIC and DISTANCE-which reduce the cache misses by up to 30% as compared to LRU and MRU. Furthermore, in the simulation experiments we conducted, our new algorithms resulted in at most a 9.7% increase in cache misses as compared to the optimal algorithm when the videos are sufficiently long (i.e. longer than 30 minutes). Moreover, we show that the DISTANCE scheme incurs an overhead which is comparable to those of the LRU and MRU schemes. Our conclusion is that DISTANCE is a very suitable candidate for a buffer replacement scheme in storage systems that deal with continuous media data.
{"title":"Buffer replacement algorithms for multimedia storage systems","authors":"Banu Özden, R. Rastogi, A. Silberschatz","doi":"10.1109/MMCS.1996.534971","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534971","url":null,"abstract":"In a disk-based storage system, a buffer cache is used to reduce the number of disk I/Os. The buffer manager is responsible for buffer replacement to free memory in order to accommodate new data blocks from the disk. An optimal buffer replacement algorithm is one which yields the lowest number of cache misses and, as a result, the lowest number of disk I/Os. In general, optimal buffer replacement algorithms require future knowledge, and therefore cannot be realized. Thus, most storage systems use approximation algorithms such as the least-recently-used (LRU) and most-recently-used (MRU) buffer replacement algorithms. In this paper, we show that both of these algorithms yield poor performance when they are used in storage systems that provide support for continuous media data. We present two new buffer replacement algorithms-BASIC and DISTANCE-which reduce the cache misses by up to 30% as compared to LRU and MRU. Furthermore, in the simulation experiments we conducted, our new algorithms resulted in at most a 9.7% increase in cache misses as compared to the optimal algorithm when the videos are sufficiently long (i.e. longer than 30 minutes). Moreover, we show that the DISTANCE scheme incurs an overhead which is comparable to those of the LRU and MRU schemes. Our conclusion is that DISTANCE is a very suitable candidate for a buffer replacement scheme in storage systems that deal with continuous media data.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"18 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130915189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.534979
A. Hiroike, Y. Mori, A. Sakurai
"Integral features" are calculated by summing the local features over all the pixels, where the local features are determined by the state of the neighborhood of each pixel. The states are defined by using a two-dimensional series of mask functions on the polar coordinate system with the logarithmic scale of r-direction. This definition enables the efficient extraction of features from any arbitrary distant area. The features for shape discrimination are constructed from the short-range correlations of the gradients of the image data. For discrimination of image data we used the linear model as used in the multivariate analysis. We also developed nonlinear model learning by maximizing the discriminant efficiency. In the models, each pixel has the value that represents the validity of discrimination and weighted summations are performed when the integral features are calculated. The validity of the linear and nonlinear models is verified in experiments using the image data of real objects.
{"title":"Shape discrimination using integral features","authors":"A. Hiroike, Y. Mori, A. Sakurai","doi":"10.1109/MMCS.1996.534979","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534979","url":null,"abstract":"\"Integral features\" are calculated by summing the local features over all the pixels, where the local features are determined by the state of the neighborhood of each pixel. The states are defined by using a two-dimensional series of mask functions on the polar coordinate system with the logarithmic scale of r-direction. This definition enables the efficient extraction of features from any arbitrary distant area. The features for shape discrimination are constructed from the short-range correlations of the gradients of the image data. For discrimination of image data we used the linear model as used in the multivariate analysis. We also developed nonlinear model learning by maximizing the discriminant efficiency. In the models, each pixel has the value that represents the validity of discrimination and weighted summations are performed when the integral features are calculated. The validity of the linear and nonlinear models is verified in experiments using the image data of real objects.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130972575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.535027
R. Flynn, W. Tetzlaff
In multimedia systems, compressed video files are stored digitally on disks within a video server. Object placement and object replication on disks influence the cost, the availability, and the throughput of a video server. The choice of algorithm, along with the workload, determines the number of disks needed to support a given number of users. There is a need to duplex video objects in order to provide reliable access in the event of disk failures. Duplexing also provides an opportunity to optimize I/O and improve throughput by providing two potential sources for each block. The Individual Permutation Algorithm uses a different permutation of the disks for each movie. This paper studies the performance impact of different means of selecting permutations. The value of dynamic load balancing afforded by duplex is also studied. Part of the motivation of this study was to better understand the wide striping of the IBM Tiger Shark video server. Simulations show that the choice of algorithm leads to maximum practical device utilizations from 63 to 95 percent, resulting in significant differences in system cost.
{"title":"Disk striping and block replication algorithms for video file servers","authors":"R. Flynn, W. Tetzlaff","doi":"10.1109/MMCS.1996.535027","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535027","url":null,"abstract":"In multimedia systems, compressed video files are stored digitally on disks within a video server. Object placement and object replication on disks influence the cost, the availability, and the throughput of a video server. The choice of algorithm, along with the workload, determines the number of disks needed to support a given number of users. There is a need to duplex video objects in order to provide reliable access in the event of disk failures. Duplexing also provides an opportunity to optimize I/O and improve throughput by providing two potential sources for each block. The Individual Permutation Algorithm uses a different permutation of the disks for each movie. This paper studies the performance impact of different means of selecting permutations. The value of dynamic load balancing afforded by duplex is also studied. Part of the motivation of this study was to better understand the wide striping of the IBM Tiger Shark video server. Simulations show that the choice of algorithm leads to maximum practical device utilizations from 63 to 95 percent, resulting in significant differences in system cost.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129984661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.534956
A. Mathur, A. Prakash
This paper considers the problem of application-level QoS control in group collaboration systems. The QoS parameters considered: latency, jitter, packet-loss, and asynchrony, are controlled by the receiver. The QoS control is based on a novel protocol composition-based approach, wherein the protocol is modularized such that each module controls a single QoS parameter. Each module is then assigned a priority and the modules are composed such that the actions taken by a module do not violate a QoS parameter controlled by a higher priority module. This allows for more flexible QoS control. The performance of the approach is evaluated through experiments, which illustrate how the compositions are able to successfully tradeoff the QoS parameters in an appropriate manner.
{"title":"A protocol composition-based approach to QoS control in collaboration systems","authors":"A. Mathur, A. Prakash","doi":"10.1109/MMCS.1996.534956","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534956","url":null,"abstract":"This paper considers the problem of application-level QoS control in group collaboration systems. The QoS parameters considered: latency, jitter, packet-loss, and asynchrony, are controlled by the receiver. The QoS control is based on a novel protocol composition-based approach, wherein the protocol is modularized such that each module controls a single QoS parameter. Each module is then assigned a priority and the modules are composed such that the actions taken by a module do not violate a QoS parameter controlled by a higher priority module. This allows for more flexible QoS control. The performance of the approach is evaluated through experiments, which illustrate how the compositions are able to successfully tradeoff the QoS parameters in an appropriate manner.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127697435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.534958
K. Kawachiya, H. Tokuda
The most notable characteristic of continuous-media data is the existence of timing constraints. To handle such data appropriately some system support for resource management and QOS control is indispensable. For this reason, we are proposing a QOS-Ticker model, which combines resource reservation and adaptation. The QOS-Ticket model has been implemented on RT-Mach. In this prototype, a new thread mechanism named Q-Thread is provided. A Q-Thread allows a user to specify the tolerable range of the period and computation time for periodic invocations, and makes it easy to write a continuous-media session that can control the QOS dynamically. We show the effectiveness of the QOS-Ticket model based on a dynamic QOS-control experiment with our prototype.
{"title":"Dynamic QOS control based on the QOS-Ticket model","authors":"K. Kawachiya, H. Tokuda","doi":"10.1109/MMCS.1996.534958","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534958","url":null,"abstract":"The most notable characteristic of continuous-media data is the existence of timing constraints. To handle such data appropriately some system support for resource management and QOS control is indispensable. For this reason, we are proposing a QOS-Ticker model, which combines resource reservation and adaptation. The QOS-Ticket model has been implemented on RT-Mach. In this prototype, a new thread mechanism named Q-Thread is provided. A Q-Thread allows a user to specify the tolerable range of the period and computation time for periodic invocations, and makes it easy to write a continuous-media session that can control the QOS dynamically. We show the effectiveness of the QOS-Ticket model based on a dynamic QOS-control experiment with our prototype.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114139228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.534969
Yuewei Wang, Jonathan C. L. Liu, D. Du, J. Hsieh
A video-on-demand (VOD) server needs to store hundreds of movie titles and to support thousands of concurrent accesses. We define the 'access profile' as the number of concurrent accesses to each movie title that should be supported by a VOD server. A current high-end magnetic disk array can only support tens of MPEG-2 concurrent accesses, and it is necessary to replicate and/or stripe the hot movie files over multiple disk arrays. How to replicate, stripe and place the movie files over a minimum number of magnetic disk arrays such that a given access profile can be supported is an important problem. In this paper, we formulate and solve this problem. The result of this study can be applied to the design of the storage subsystem of a VOD server to economically minimize the cost or to maximize the utilization of disk arrays.
{"title":"Video file allocation over disk arrays for video-on-demand","authors":"Yuewei Wang, Jonathan C. L. Liu, D. Du, J. Hsieh","doi":"10.1109/MMCS.1996.534969","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534969","url":null,"abstract":"A video-on-demand (VOD) server needs to store hundreds of movie titles and to support thousands of concurrent accesses. We define the 'access profile' as the number of concurrent accesses to each movie title that should be supported by a VOD server. A current high-end magnetic disk array can only support tens of MPEG-2 concurrent accesses, and it is necessary to replicate and/or stripe the hot movie files over multiple disk arrays. How to replicate, stripe and place the movie files over a minimum number of magnetic disk arrays such that a given access profile can be supported is an important problem. In this paper, we formulate and solve this problem. The result of this study can be applied to the design of the storage subsystem of a VOD server to economically minimize the cost or to maximize the utilization of disk arrays.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126186724","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.535893
Seungyup Paek, Shih-Fu Chang
In advanced multimedia networks, video servers with real time operating systems and high performance storage architectures will deliver multiple concurrent video streams to clients. The video server has a limited disk I/O bandwidth. This research presents a new framework for optimally utilizing the on board memory to alleviate the disk bandwidth bottleneck. The optimal utilization of the memory resource is achieved by using an optimal retrieval schedule for video data across the disk memory interface. The optimal retrieval schedule is directly applicable to video servers that are based on general storage architectures (e.g. RAID). Performance evaluation using real MPEG2 trace data verifies that this approach can provide large increases in the number of supported video streams.
{"title":"Video server retrieval scheduling for variable bit rate scalable video","authors":"Seungyup Paek, Shih-Fu Chang","doi":"10.1109/MMCS.1996.535893","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535893","url":null,"abstract":"In advanced multimedia networks, video servers with real time operating systems and high performance storage architectures will deliver multiple concurrent video streams to clients. The video server has a limited disk I/O bandwidth. This research presents a new framework for optimally utilizing the on board memory to alleviate the disk bandwidth bottleneck. The optimal utilization of the memory resource is achieved by using an optimal retrieval schedule for video data across the disk memory interface. The optimal retrieval schedule is directly applicable to video servers that are based on general storage architectures (e.g. RAID). Performance evaluation using real MPEG2 trace data verifies that this approach can provide large increases in the number of supported video streams.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133447047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.535018
N. Terada, H. Ishii, T. Tachi, Y. Okumura, H. Kotera
Proposes a next-generation access network infrastructure from NTT (Nippon Telegraph and Telephone Corporation.) The solution for providing both broadband and narrowband multimedia services is the ATM-PON (ATM-passive optical network) based FTTH (fiber-to-the-home) access network. Additionally, an MPEG-ATM encoder has been developed in order to provide CATV (cable TV) and VOD (video-on-demand) services in a fully-digital residential network. This is a compact, economical and easily-maintained multi-channel MPEG2 encoder, which is designed with custom LSIs for MPEG2 encoding and single-board circuits for each channel. NTT has been examining these systems in residential broadband service trials since January 1996. An outline of the trials and major features of the systems are presented.
{"title":"An MPEG2-based digital CATV and VOD system using ATM-PON architecture","authors":"N. Terada, H. Ishii, T. Tachi, Y. Okumura, H. Kotera","doi":"10.1109/MMCS.1996.535018","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535018","url":null,"abstract":"Proposes a next-generation access network infrastructure from NTT (Nippon Telegraph and Telephone Corporation.) The solution for providing both broadband and narrowband multimedia services is the ATM-PON (ATM-passive optical network) based FTTH (fiber-to-the-home) access network. Additionally, an MPEG-ATM encoder has been developed in order to provide CATV (cable TV) and VOD (video-on-demand) services in a fully-digital residential network. This is a compact, economical and easily-maintained multi-channel MPEG2 encoder, which is designed with custom LSIs for MPEG2 encoding and single-board circuits for each channel. NTT has been examining these systems in residential broadband service trials since January 1996. An outline of the trials and major features of the systems are presented.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128666350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：