Pub Date : 1998-01-21DOI: 10.1109/ICOIN.1998.648415
K. Hasegawa, M. Takizawa
Distributed systems are composed of multiple objects. Each object supports more abstract operations than the low-level read and write operations. The objects are replicated to increase the performance, reliability, and availability. In this paper we discuss a synchronization method to make multiple replicas of objects mutually consistent. In the traditional optimistic two-phase locking (02PL), every replica is first locked in a read mode to write an object. Finally, all the replicas are locked in a write mode when the transaction commits. We propose a novel object-based locking (OBL) method based on the abstract operations. Here, the number of the replicas locked is decided based on the access frequency and the strength of the lock mode.
{"title":"Object-based locking protocol for replicated objects","authors":"K. Hasegawa, M. Takizawa","doi":"10.1109/ICOIN.1998.648415","DOIUrl":"https://doi.org/10.1109/ICOIN.1998.648415","url":null,"abstract":"Distributed systems are composed of multiple objects. Each object supports more abstract operations than the low-level read and write operations. The objects are replicated to increase the performance, reliability, and availability. In this paper we discuss a synchronization method to make multiple replicas of objects mutually consistent. In the traditional optimistic two-phase locking (02PL), every replica is first locked in a read mode to write an object. Finally, all the replicas are locked in a write mode when the transaction commits. We propose a novel object-based locking (OBL) method based on the abstract operations. Here, the number of the replicas locked is decided based on the access frequency and the strength of the lock mode.","PeriodicalId":239245,"journal":{"name":"Proceedings Twelfth International Conference on Information Networking (ICOIN-12)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116761820","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 : 1998-01-21DOI: 10.1109/ICOIN.1998.648414
S. Jang, Jong-Hyeong Lee
To keep pace with world-wide integrating trend of telecommunication and broadcasting service, we have developed a DAVIC (Digital Audio-Visual Council) compliant ATM-based VOD (Video On Demand) system. The resources and sessions required to provide video on demand service should be managed so, we have implemented DSM-CC UN (Digital Storage Media Command and Control User-to-Network) protocol. From the DSM-CC UN perspective, an ATM connection is merely one type of resource needed within a video on demand service session, but DSM-CC UN should use Q.2931 protocol to actually create the ATM connection. In this paper, we focus on how DSM-CC UN can be used to manage sessions and resources for video on demand service with Q.293I protocol in the ATM network.
{"title":"The IMPRESS system and its session and resource management with Q.2931","authors":"S. Jang, Jong-Hyeong Lee","doi":"10.1109/ICOIN.1998.648414","DOIUrl":"https://doi.org/10.1109/ICOIN.1998.648414","url":null,"abstract":"To keep pace with world-wide integrating trend of telecommunication and broadcasting service, we have developed a DAVIC (Digital Audio-Visual Council) compliant ATM-based VOD (Video On Demand) system. The resources and sessions required to provide video on demand service should be managed so, we have implemented DSM-CC UN (Digital Storage Media Command and Control User-to-Network) protocol. From the DSM-CC UN perspective, an ATM connection is merely one type of resource needed within a video on demand service session, but DSM-CC UN should use Q.2931 protocol to actually create the ATM connection. In this paper, we focus on how DSM-CC UN can be used to manage sessions and resources for video on demand service with Q.293I protocol in the ATM network.","PeriodicalId":239245,"journal":{"name":"Proceedings Twelfth International Conference on Information Networking (ICOIN-12)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124849109","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 : 1998-01-21DOI: 10.1109/ICOIN.1998.648451
S. Sugiura, J. Munemori, T. Kinoshita, N. Shiratori
We propose a new evaluation method IPL (Island formation using Pseudo Label), and show its efficiency. In IPL method, the effects of domain knowledge of each participant can be evaluated based on an intuitive classification task in a distributed and cooperative KJ method. Experiments using IPL method show the influences upon the island formation caused by the distribution of knowledge quantitatively. There exists a similar method called LCR method which provides an evaluation method for the logical classification tasks. However the proposed IPL method provides an evaluation method for the intuitive classification tasks by which the creation of new idea can be done easily and effectively.
本文提出了一种新的评价方法IPL (Island formation using Pseudo Label)，并验证了其有效性。在IPL方法中，采用分布式协作的KJ方法，通过一个直观的分类任务来评估每个参与者的领域知识的效果。利用IPL方法进行的实验定量地揭示了知识分布对岛屿形成的影响。存在一种类似的方法，称为LCR方法，它为逻辑分类任务提供了一种评价方法。而本文提出的IPL方法为直观分类任务提供了一种评价方法，可以方便有效地进行新思想的创造。
{"title":"A proposal of an evaluation method IPL for effects of individual quantity of domain knowledge on an intuitive classification in a distributed and cooperative KJ method and its application","authors":"S. Sugiura, J. Munemori, T. Kinoshita, N. Shiratori","doi":"10.1109/ICOIN.1998.648451","DOIUrl":"https://doi.org/10.1109/ICOIN.1998.648451","url":null,"abstract":"We propose a new evaluation method IPL (Island formation using Pseudo Label), and show its efficiency. In IPL method, the effects of domain knowledge of each participant can be evaluated based on an intuitive classification task in a distributed and cooperative KJ method. Experiments using IPL method show the influences upon the island formation caused by the distribution of knowledge quantitatively. There exists a similar method called LCR method which provides an evaluation method for the logical classification tasks. However the proposed IPL method provides an evaluation method for the intuitive classification tasks by which the creation of new idea can be done easily and effectively.","PeriodicalId":239245,"journal":{"name":"Proceedings Twelfth International Conference on Information Networking (ICOIN-12)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115512944","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 : 1998-01-21DOI: 10.1109/ICOIN.1998.648380
M. Katsumoto, S. Iisaku
We propose a distributed multimedia system based on client-agent-server architecture for next-generation distributed multimedia general-purpose platform, as well as define advanced multimedia presentation models. In order to realize the platform, we have designed and developed Video-on-Demand and Multimedia-on-Demand systems as prototype system for the platform. In this paper we will discuss design methods that are parameter and primitive for Quality-of-Services (QoS), and implementation methods of multimedia manager and hypermedia manager that are presentation management functions.
{"title":"Design of the presentation controller functions for distributed hypermedia system","authors":"M. Katsumoto, S. Iisaku","doi":"10.1109/ICOIN.1998.648380","DOIUrl":"https://doi.org/10.1109/ICOIN.1998.648380","url":null,"abstract":"We propose a distributed multimedia system based on client-agent-server architecture for next-generation distributed multimedia general-purpose platform, as well as define advanced multimedia presentation models. In order to realize the platform, we have designed and developed Video-on-Demand and Multimedia-on-Demand systems as prototype system for the platform. In this paper we will discuss design methods that are parameter and primitive for Quality-of-Services (QoS), and implementation methods of multimedia manager and hypermedia manager that are presentation management functions.","PeriodicalId":239245,"journal":{"name":"Proceedings Twelfth International Conference on Information Networking (ICOIN-12)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128432587","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 : 1998-01-21DOI: 10.1109/ICOIN.1998.648494
A. Fujii, T. Yamagata, Y. Nemoto
Multicast communication can support wide range of applications such as digital video distribution. In multicast communication, routing paths are established in terms of minimizing the total cost of the multicast tree or minimizing the distances of each connections from source to the destinations. In this paper, we also concern about the number of copies in one switching fabric and propose a new algorithm for multicast routing in which (1) it avoids concentration of copying at a specific exchange node and (2) it ensure the optimal path for longest connections among destinations. Time complexity and space complexity of the algorithm are discussed.
{"title":"Design of a multicast routing algorithm","authors":"A. Fujii, T. Yamagata, Y. Nemoto","doi":"10.1109/ICOIN.1998.648494","DOIUrl":"https://doi.org/10.1109/ICOIN.1998.648494","url":null,"abstract":"Multicast communication can support wide range of applications such as digital video distribution. In multicast communication, routing paths are established in terms of minimizing the total cost of the multicast tree or minimizing the distances of each connections from source to the destinations. In this paper, we also concern about the number of copies in one switching fabric and propose a new algorithm for multicast routing in which (1) it avoids concentration of copying at a specific exchange node and (2) it ensure the optimal path for longest connections among destinations. Time complexity and space complexity of the algorithm are discussed.","PeriodicalId":239245,"journal":{"name":"Proceedings Twelfth International Conference on Information Networking (ICOIN-12)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128455657","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 : 1998-01-21DOI: 10.1109/ICOIN.1998.648450
H. Koizumi, T. Dasai, S. Moriya, K. Abe, N. Shiratori
In this paper, we propose a methodology for distance learning lessons with the aim of stimulating pupil's desire to learn while enhancing their creative abilities. Based on this concept, we constructed the educational system hiring the modern technologies of CSCW (Computer Supported Cooperative Work) and multimedia communication, and conducted the verification experiments in some elementary schools in Japan with a result of confirming the efficacy of the proposed methodology.
{"title":"An advanced system architecture of CSCW for collaborative education system and its experimental results","authors":"H. Koizumi, T. Dasai, S. Moriya, K. Abe, N. Shiratori","doi":"10.1109/ICOIN.1998.648450","DOIUrl":"https://doi.org/10.1109/ICOIN.1998.648450","url":null,"abstract":"In this paper, we propose a methodology for distance learning lessons with the aim of stimulating pupil's desire to learn while enhancing their creative abilities. Based on this concept, we constructed the educational system hiring the modern technologies of CSCW (Computer Supported Cooperative Work) and multimedia communication, and conducted the verification experiments in some elementary schools in Japan with a result of confirming the efficacy of the proposed methodology.","PeriodicalId":239245,"journal":{"name":"Proceedings Twelfth International Conference on Information Networking (ICOIN-12)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128580753","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 : 1998-01-21DOI: 10.1109/ICOIN.1998.648429
T. Tachikawa, M. Takizawa
Automatic repeat request (ARQ) protocols are discussed so far to analyze the buffer size and the delay required for two peer processes. However, ARQ protocols in group communications are not discussed, where multiple senders send packets to multiple receivers. In the group communication protocols, acknowledgments of packets received are piggy-backed by packets. Hence, the forward and feedback channels are considered to be combined to one bi-directional channel. In addition, since each process has the buffer both for retransmitting and for resequencing packets sent and received, efficient buffer allocation schemes have to be adopted. In this paper, we analyze the throughput of the ARQ protocol for the group communications.
{"title":"ARQ protocols for bi-directional data transmission","authors":"T. Tachikawa, M. Takizawa","doi":"10.1109/ICOIN.1998.648429","DOIUrl":"https://doi.org/10.1109/ICOIN.1998.648429","url":null,"abstract":"Automatic repeat request (ARQ) protocols are discussed so far to analyze the buffer size and the delay required for two peer processes. However, ARQ protocols in group communications are not discussed, where multiple senders send packets to multiple receivers. In the group communication protocols, acknowledgments of packets received are piggy-backed by packets. Hence, the forward and feedback channels are considered to be combined to one bi-directional channel. In addition, since each process has the buffer both for retransmitting and for resequencing packets sent and received, efficient buffer allocation schemes have to be adopted. In this paper, we analyze the throughput of the ARQ protocol for the group communications.","PeriodicalId":239245,"journal":{"name":"Proceedings Twelfth International Conference on Information Networking (ICOIN-12)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128679464","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 : 1998-01-21DOI: 10.1109/ICOIN.1998.648384
Wang Xin, T. Mizuno
In multimedia network communication we should guarantee that the control information can be transmitted in time and as accurately as possible. First, we propose a parallel queueing model with precedence, which makes sure that the high priority packets are dealt with within constant time no matter how the traffic load is. On the other hand, it ensures that the lost probability of the high priority packets is also very low. Next, we use MMM (mathematic model method) to analyse the system and use SOR (successive over-relaxation method) to compute the state probability of the system. Then we compare the precedence queueing scheme and the conventional queueing scheme where all packets are serviced at the same priority level. Then a conclusion is drawn that the former one takes obvious advantage than the latter one in the fields of queue length distribution, average blocking probability, and average waiting time. We also give out how to realize this proposal in the real application and that is by looking up a table constructed before. Finally we provide simulation results to help verify the validity of analysis. It is shown that we can get very good performance of high priority packets while the performance of low priority packets will not be very bad.
{"title":"Analysis of a kind of 2 parallel queueings with precedence for multimedia network communication","authors":"Wang Xin, T. Mizuno","doi":"10.1109/ICOIN.1998.648384","DOIUrl":"https://doi.org/10.1109/ICOIN.1998.648384","url":null,"abstract":"In multimedia network communication we should guarantee that the control information can be transmitted in time and as accurately as possible. First, we propose a parallel queueing model with precedence, which makes sure that the high priority packets are dealt with within constant time no matter how the traffic load is. On the other hand, it ensures that the lost probability of the high priority packets is also very low. Next, we use MMM (mathematic model method) to analyse the system and use SOR (successive over-relaxation method) to compute the state probability of the system. Then we compare the precedence queueing scheme and the conventional queueing scheme where all packets are serviced at the same priority level. Then a conclusion is drawn that the former one takes obvious advantage than the latter one in the fields of queue length distribution, average blocking probability, and average waiting time. We also give out how to realize this proposal in the real application and that is by looking up a table constructed before. Finally we provide simulation results to help verify the validity of analysis. It is shown that we can get very good performance of high priority packets while the performance of low priority packets will not be very bad.","PeriodicalId":239245,"journal":{"name":"Proceedings Twelfth International Conference on Information Networking (ICOIN-12)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129261797","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 : 1998-01-21DOI: 10.1109/ICOIN.1998.648371
T. Hou, Chien-Chang Chen
The Jitter-EDD (Earliest-Due-Date) scheme designed for packet switching networks is noted for its capability to control the end-to-end delay jitter to be within the delay variation in the last switching node of the path. It, however, cannot be used in an ATM network directly due to the lack of space in the ATM cell header to carry the required PreAhead information. We propose a method to implement the J-EDD scheme in the ATM network and evaluate its performance in transporting MPEG-2 video streams.
{"title":"Jitter-EDD implementation for transporting MPEG-2 video streams on ATM networks","authors":"T. Hou, Chien-Chang Chen","doi":"10.1109/ICOIN.1998.648371","DOIUrl":"https://doi.org/10.1109/ICOIN.1998.648371","url":null,"abstract":"The Jitter-EDD (Earliest-Due-Date) scheme designed for packet switching networks is noted for its capability to control the end-to-end delay jitter to be within the delay variation in the last switching node of the path. It, however, cannot be used in an ATM network directly due to the lack of space in the ATM cell header to carry the required PreAhead information. We propose a method to implement the J-EDD scheme in the ATM network and evaluate its performance in transporting MPEG-2 video streams.","PeriodicalId":239245,"journal":{"name":"Proceedings Twelfth International Conference on Information Networking (ICOIN-12)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123830191","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 : 1998-01-21DOI: 10.1109/ICOIN.1998.648411
J. Sawamoto, H. Koizumi, H. Tsuji
Mobile computing environment is extending into various areas, such as education, transportation, retail business etc. We will be able to exchange information, "in anytime at anyplace, and with anyone", and solve problems in cooperation with many people in this environment. Providing software functions for the efficient use of this environment is becoming very important. In this paper, we discuss the functions for building cooperative decision support system in mobile environment in delivery scheduling domain. We consider the multiple agents system which has two major parts. One is the agents for delivery center with function, i.e., generating and integrating delivery schedule, acquiring and managing the information dispatching the selected information to delivery persons. The other is the agents for mobile terminal which a delivery person uses for exchanging information with the center.
{"title":"Distributed cooperative problem solving in a mobile environment","authors":"J. Sawamoto, H. Koizumi, H. Tsuji","doi":"10.1109/ICOIN.1998.648411","DOIUrl":"https://doi.org/10.1109/ICOIN.1998.648411","url":null,"abstract":"Mobile computing environment is extending into various areas, such as education, transportation, retail business etc. We will be able to exchange information, \"in anytime at anyplace, and with anyone\", and solve problems in cooperation with many people in this environment. Providing software functions for the efficient use of this environment is becoming very important. In this paper, we discuss the functions for building cooperative decision support system in mobile environment in delivery scheduling domain. We consider the multiple agents system which has two major parts. One is the agents for delivery center with function, i.e., generating and integrating delivery schedule, acquiring and managing the information dispatching the selected information to delivery persons. The other is the agents for mobile terminal which a delivery person uses for exchanging information with the center.","PeriodicalId":239245,"journal":{"name":"Proceedings Twelfth International Conference on Information Networking (ICOIN-12)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123213081","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
扫码关注我们
求助内容：
应助结果提醒方式：