Pub Date : 2001-04-16DOI: 10.1109/CDCS.2001.918682
Kate Jenkins, K. Hopkinson, K. Birman
Gossip-based multicast can be an effective tool for providing highly reliable and scalable message dissemination. We consider the problem of gossiping within overlapping process groups. If each subgroup independently runs a uniform gossip protocol, then the total gossip overhead could be high for a process that is a member of many subgroups. We present a novel gossip protocol that allows individual subgroup members to trade-off update quality for gossip overhead, enabling processes to belong to several subgroups while maintaining a low total gossip overhead. Our results include a mathematical model for message dissemination under this modified gossip protocol, and an algorithm that computes gossip parameters such that all processes within a subgroup achieve their desired update quality.
{"title":"A gossip protocol for subgroup multicast","authors":"Kate Jenkins, K. Hopkinson, K. Birman","doi":"10.1109/CDCS.2001.918682","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918682","url":null,"abstract":"Gossip-based multicast can be an effective tool for providing highly reliable and scalable message dissemination. We consider the problem of gossiping within overlapping process groups. If each subgroup independently runs a uniform gossip protocol, then the total gossip overhead could be high for a process that is a member of many subgroups. We present a novel gossip protocol that allows individual subgroup members to trade-off update quality for gossip overhead, enabling processes to belong to several subgroups while maintaining a low total gossip overhead. Our results include a mathematical model for message dissemination under this modified gossip protocol, and an algorithm that computes gossip parameters such that all processes within a subgroup achieve their desired update quality.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127659033","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918719
H. Chao, C. Hung, Y. Chang, Jiann-Liang Chen
Recently, the Internet bandwidth has increased rapidly. Currently available network traffic includes not only text but also graphics, such as JPEG and GIF images. Many multimedia applications are emerging, such as video on demand (VoD) and distance learning. These services involve complicated network connections between servers and clients. To simplify this system, we propose an effective and efficient traffic-smoothing algorithm, which is called ECVBA (Efficient Changes and Variability Bandwidth Allocation). This algorithm not only minimizes the peak rate of a stream but also increases the likelihood of successful variable bit-rate (VBR) stream transmission. The main benefit is that this algorithm can immediately release bandwidth to other demanding sites in the network.
近年来，互联网带宽增长迅速。目前可用的网络流量不仅包括文本，还包括图形，如JPEG和GIF图像。许多多媒体应用正在兴起，如视频点播(VoD)和远程学习。这些服务涉及服务器和客户端之间复杂的网络连接。为了简化该系统，我们提出了一种高效的流量平滑算法，称为ECVBA (efficient Changes and Variability Bandwidth Allocation)。该算法不仅使流的峰值速率最小化，而且提高了可变比特率流传输成功的可能性。主要的好处是，该算法可以立即释放带宽给网络中其他需要带宽的站点。
{"title":"Efficient changes and variability bandwidth allocation for VBR media streams","authors":"H. Chao, C. Hung, Y. Chang, Jiann-Liang Chen","doi":"10.1109/CDCS.2001.918719","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918719","url":null,"abstract":"Recently, the Internet bandwidth has increased rapidly. Currently available network traffic includes not only text but also graphics, such as JPEG and GIF images. Many multimedia applications are emerging, such as video on demand (VoD) and distance learning. These services involve complicated network connections between servers and clients. To simplify this system, we propose an effective and efficient traffic-smoothing algorithm, which is called ECVBA (Efficient Changes and Variability Bandwidth Allocation). This algorithm not only minimizes the peak rate of a stream but also increases the likelihood of successful variable bit-rate (VBR) stream transmission. The main benefit is that this algorithm can immediately release bandwidth to other demanding sites in the network.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"23 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120818545","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918713
A.M. Al-Bar, I. Wakeman
Mobile computing is gaining wide acceptance due to the rapid enhancement in wireless communications technologies. This has led to an increase in the demand for mobile information access. However, most mobile computing environments are very limited in resources, hence introducing new requirements and challenges for the software developer and engineer. To address these challenges applications have to be adaptive. We describe mobile computing and its constraints. We describe adaptation spaces as a common framework for understanding the state-of-the-art in adaptive applications. A number of projects are reviewed and discussed. Then, a new rising paradigm in building adaptive applications is introduced based on a component-based architecture. We believe this new approach will provide a more flexible environment for building mobile applications.
{"title":"A survey of adaptive applications in mobile computing","authors":"A.M. Al-Bar, I. Wakeman","doi":"10.1109/CDCS.2001.918713","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918713","url":null,"abstract":"Mobile computing is gaining wide acceptance due to the rapid enhancement in wireless communications technologies. This has led to an increase in the demand for mobile information access. However, most mobile computing environments are very limited in resources, hence introducing new requirements and challenges for the software developer and engineer. To address these challenges applications have to be adaptive. We describe mobile computing and its constraints. We describe adaptation spaces as a common framework for understanding the state-of-the-art in adaptive applications. A number of projects are reviewed and discussed. Then, a new rising paradigm in building adaptive applications is introduced based on a component-based architecture. We believe this new approach will provide a more flexible environment for building mobile applications.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131844638","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918722
Lei Huang, Sunil Kumar, C.-C. Jay Kuo
Next-generation wireless communication networks aim at supporting multimedia services. It is a challenging problem to efficiently allocate limited and varying network resources in the wireless communication networks to a variety of multimedia services with different characteristics and requirements. In this paper, we extensively investigate the adaptive resource allocation for multimedia services in a wireless network environment. Both user mobility and the nature of multimedia traffic are taken into consideration to design our adaptive resource allocation scheme, which consists of call admission control, resource reservation and bandwidth adaptation for real-time video/audio applications, as well as scheduling for non-real-time data services. Simulation results show the strength of our proposed adaptive scheme.
{"title":"Adaptive resource allocation for multimedia services in wireless communication networks","authors":"Lei Huang, Sunil Kumar, C.-C. Jay Kuo","doi":"10.1109/CDCS.2001.918722","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918722","url":null,"abstract":"Next-generation wireless communication networks aim at supporting multimedia services. It is a challenging problem to efficiently allocate limited and varying network resources in the wireless communication networks to a variety of multimedia services with different characteristics and requirements. In this paper, we extensively investigate the adaptive resource allocation for multimedia services in a wireless network environment. Both user mobility and the nature of multimedia traffic are taken into consideration to design our adaptive resource allocation scheme, which consists of call admission control, resource reservation and bandwidth adaptation for real-time video/audio applications, as well as scheduling for non-real-time data services. Simulation results show the strength of our proposed adaptive scheme.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114609642","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918708
A. Kusumoto, J. Nakazawa, Y. Tobe, H. Tokuda
The paper presents a new way of constructing a Virtual Networked Appliance (VNA) middleware using location information. In the VNA architecture which we proposed in our previous work (J. Nakazawa et al., 2000), adaptation to the location of a user has not been clearly specified. We call such a location adaptive VNA "L-VNA". In L-VNA, location management is encapsulated in the runtime of VNA, thereby eliminating a user's explicit decision for location adaptation. We have implemented L-VNA over JDK1.2 and demonstrated its validity.
提出了一种利用位置信息构建虚拟网络设备中间件的新方法。在我们之前的工作(J. Nakazawa et al.， 2000)中提出的VNA架构中，没有明确规定对用户位置的适应。我们称这种位置自适应VNA为“L-VNA”。在L-VNA中，位置管理被封装在VNA的运行时中，从而消除了用户对位置适应的显式决策。我们已经在JDK1.2上实现了L-VNA，并证明了它的有效性。
{"title":"A location-adaptive virtual networked appliance","authors":"A. Kusumoto, J. Nakazawa, Y. Tobe, H. Tokuda","doi":"10.1109/CDCS.2001.918708","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918708","url":null,"abstract":"The paper presents a new way of constructing a Virtual Networked Appliance (VNA) middleware using location information. In the VNA architecture which we proposed in our previous work (J. Nakazawa et al., 2000), adaptation to the location of a user has not been clearly specified. We call such a location adaptive VNA \"L-VNA\". In L-VNA, location management is encapsulated in the runtime of VNA, thereby eliminating a user's explicit decision for location adaptation. We have implemented L-VNA over JDK1.2 and demonstrated its validity.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"91 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123172567","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918727
T. Shih, L. Deng, Yi-Chun Liao, Chun-Hung Huang, Rong-Chi Chang
Establishing a Web-based distributed multimedia presentation system environment is technical challenge. In this paper, we describe how to present different multimedia objects indispensably on a Web presentation system with a floor control mechanism, to be used in a distance learning environment. The distributed approach is based on an extended timed Petri net model. Using the characterization of extended timed Petri nets, we express the temporal behavior of multimedia objects. Then we introduce the concepts of user interaction. The main goal of our system is to provide a feasible method to represent a schedule and navigate different multimedia objects with user interaction. In addition, users can dynamically modify and verify different kinds of conditions during the presentation. To verify the structural mechanism, we implement an algorithm using the Petri net diagram, analyzing the model by a time schedule of multimedia objects, and we produce a synchronous set of multimedia objects with respect to the time duration. In particular, we consider the interactive facilities needed to support the distance learning requirements. We propose a floor control mechanism which provides four types of control (free access, equal control, group discussion and direct contact). These control mechanisms are sufficient for use in a distance learning environment.
{"title":"Using the floor control mechanism in distributed multimedia presentation system","authors":"T. Shih, L. Deng, Yi-Chun Liao, Chun-Hung Huang, Rong-Chi Chang","doi":"10.1109/CDCS.2001.918727","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918727","url":null,"abstract":"Establishing a Web-based distributed multimedia presentation system environment is technical challenge. In this paper, we describe how to present different multimedia objects indispensably on a Web presentation system with a floor control mechanism, to be used in a distance learning environment. The distributed approach is based on an extended timed Petri net model. Using the characterization of extended timed Petri nets, we express the temporal behavior of multimedia objects. Then we introduce the concepts of user interaction. The main goal of our system is to provide a feasible method to represent a schedule and navigate different multimedia objects with user interaction. In addition, users can dynamically modify and verify different kinds of conditions during the presentation. To verify the structural mechanism, we implement an algorithm using the Petri net diagram, analyzing the model by a time schedule of multimedia objects, and we produce a synchronous set of multimedia objects with respect to the time duration. In particular, we consider the interactive facilities needed to support the distance learning requirements. We propose a floor control mechanism which provides four types of control (free access, equal control, group discussion and direct contact). These control mechanisms are sufficient for use in a distance learning environment.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123663726","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918689
A. Montresor, R. Davoli, Özalp Babaoglu
Reliable group communication has proven to be an important technology for building fault-tolerant applications, yet many frameworks for distributed application development (e.g. DCOM, Jini and Enterprise JavaBeans) do not support it. The only notable exception to this situation is CORBA, which has been recently extended to include a replication service. We claim that lack of group communication support in other development frameworks constitutes a major obstacle for their wider diffusion in the industry. In this paper, we discuss issues related to integrating reliable group communication and Jini technologies.
{"title":"Enhancing Jini with group communication","authors":"A. Montresor, R. Davoli, Özalp Babaoglu","doi":"10.1109/CDCS.2001.918689","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918689","url":null,"abstract":"Reliable group communication has proven to be an important technology for building fault-tolerant applications, yet many frameworks for distributed application development (e.g. DCOM, Jini and Enterprise JavaBeans) do not support it. The only notable exception to this situation is CORBA, which has been recently extended to include a replication service. We claim that lack of group communication support in other development frameworks constitutes a major obstacle for their wider diffusion in the industry. In this paper, we discuss issues related to integrating reliable group communication and Jini technologies.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129517032","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918729
N. Nemoto, Katsuya Tanaka, M. Takizawa
It is critical for applications to obtain enough quality of service (QoS) from multimedia objects. Not only states but also QoS of objects are changed if methods are performed on the objects. The objects are required to be consistent in the presence of multiple transactions issuing requests to the objects. We discuss new types of equivalent and conflicting relations among methods with respect to QoS. We introduce novel types of locking modes, to synchronize concurrent accesses to objects based on the conflicting relations. We also discuss how to convert the lock modes.
{"title":"Quality-based approach to locking multimedia objects","authors":"N. Nemoto, Katsuya Tanaka, M. Takizawa","doi":"10.1109/CDCS.2001.918729","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918729","url":null,"abstract":"It is critical for applications to obtain enough quality of service (QoS) from multimedia objects. Not only states but also QoS of objects are changed if methods are performed on the objects. The objects are required to be consistent in the presence of multiple transactions issuing requests to the objects. We discuss new types of equivalent and conflicting relations among methods with respect to QoS. We introduce novel types of locking modes, to synchronize concurrent accesses to objects based on the conflicting relations. We also discuss how to convert the lock modes.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"378 1-3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120898899","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918695
C. Becker, K. Geihs
Quality of service (QoS) is an important requirement of today's distribution infrastructures. The popularity of object-oriented middleware makes QoS provision in those infrastructures desirable. The system-dependent nature of QoS necessitates a clear separation of concerns and insulation from the application objects. In this paper, QoS integration is investigated from two viewpoints. First, based on the aspect-oriented programming, the integration of QoS mechanisms into the application objects is presented, and second, the hierarchical structure of QoS mechanisms is addressed in a reflection-based approach.
{"title":"Quality of service and object-oriented middleware - multiple concerns and their separation","authors":"C. Becker, K. Geihs","doi":"10.1109/CDCS.2001.918695","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918695","url":null,"abstract":"Quality of service (QoS) is an important requirement of today's distribution infrastructures. The popularity of object-oriented middleware makes QoS provision in those infrastructures desirable. The system-dependent nature of QoS necessitates a clear separation of concerns and insulation from the application objects. In this paper, QoS integration is investigated from two viewpoints. First, based on the aspect-oriented programming, the integration of QoS mechanisms into the application objects is presented, and second, the hierarchical structure of QoS mechanisms is addressed in a reflection-based approach.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121357065","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918718
L. Barolli, Takako Yamada, Shoichi Yokoyama, A. Koyama, N. Shiratori
The dynamic nature of high-speed networks poses difficult traffic control problems when trying to achieve efficient use of network resources. To cope with rapidly changing network conditions, traffic control methods for high-speed networks must be adaptive, flexible and intelligent for efficient network management. The use of intelligent methods based on fuzzy logic, neural networks and genetic algorithms can prove to be efficient for such traffic control. In this paper, we propose a fuzzy equivalent capacity estimator for bandwidth allocation in high-speed networks. Performance evaluation via simulation shows that the proposed fuzzy estimator has a good equivalent capacity estimation compared with fluid flow and stationary approximations.
{"title":"Application of fuzzy logic for estimation of equivalent capacity in high-speed networks","authors":"L. Barolli, Takako Yamada, Shoichi Yokoyama, A. Koyama, N. Shiratori","doi":"10.1109/CDCS.2001.918718","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918718","url":null,"abstract":"The dynamic nature of high-speed networks poses difficult traffic control problems when trying to achieve efficient use of network resources. To cope with rapidly changing network conditions, traffic control methods for high-speed networks must be adaptive, flexible and intelligent for efficient network management. The use of intelligent methods based on fuzzy logic, neural networks and genetic algorithms can prove to be efficient for such traffic control. In this paper, we propose a fuzzy equivalent capacity estimator for bandwidth allocation in high-speed networks. Performance evaluation via simulation shows that the proposed fuzzy estimator has a good equivalent capacity estimation compared with fluid flow and stationary approximations.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122213383","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
扫码关注我们
求助内容：
应助结果提醒方式：