This paper proposes a media synchronization scheme with causality control for distributed multimedia applications in which the temporal and causal relationships exist among media streams such as computer data, voice and video. In the scheme, the /spl Delta/-causality control is performed for causality, and the virtual-time rendering (VTR) algorithm, which the authors previously proposed, is used for media synchronization. The paper deals with a networked shooting game as an example of such applications and demonstrates the effectiveness of the scheme by experiment.
{"title":"A media synchronization scheme with causality control in network environments","authors":"Y. Ishibashi, S. Tasaka, Yoshiro Tachibana","doi":"10.1109/LCN.1999.802048","DOIUrl":"https://doi.org/10.1109/LCN.1999.802048","url":null,"abstract":"This paper proposes a media synchronization scheme with causality control for distributed multimedia applications in which the temporal and causal relationships exist among media streams such as computer data, voice and video. In the scheme, the /spl Delta/-causality control is performed for causality, and the virtual-time rendering (VTR) algorithm, which the authors previously proposed, is used for media synchronization. The paper deals with a networked shooting game as an example of such applications and demonstrates the effectiveness of the scheme by experiment.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129269557","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}
Maintaining the integrity of large-scale networks is becoming an increasingly daunting task as networks expand at an unprecedented rate. The majority of present network monitoring and maintenance tools require a substantial investment in human resources to sift through vast quantities of information, to detect problems, and manually resolve them. Computer immunology is the solution to ever-increasing network maintenance overhead. This paper seeks to define computer normality through a policy-driven process and provide a framework for conserving network health. The goal is to automate network management as much as possible. This methodology combines the benefits of two existing systems as well as incorporates other critical elements to provide an integrated, flexible, versatile system.
{"title":"An integrated software immune system: a framework for automated network management, system health, and security","authors":"Michael Gilfix","doi":"10.1109/LCN.1999.802065","DOIUrl":"https://doi.org/10.1109/LCN.1999.802065","url":null,"abstract":"Maintaining the integrity of large-scale networks is becoming an increasingly daunting task as networks expand at an unprecedented rate. The majority of present network monitoring and maintenance tools require a substantial investment in human resources to sift through vast quantities of information, to detect problems, and manually resolve them. Computer immunology is the solution to ever-increasing network maintenance overhead. This paper seeks to define computer normality through a policy-driven process and provide a framework for conserving network health. The goal is to automate network management as much as possible. This methodology combines the benefits of two existing systems as well as incorporates other critical elements to provide an integrated, flexible, versatile system.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121922198","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}
When ensuring that an implementation of a computer communications protocol satisfies both conformance with the specification and conformance with the intent/expectations of the designers, it is useful to write a formal specification, and derive the implementation directly from it. This permits the use of validation techniques that are expressed using concepts meaningful to the protocol designer. This technique has been applied to the testing and validation of the ATM higher layer signaling protocol (Q.2931) and the service specific connection oriented protocol (Q.2110), using the Estelle formal description language, and the observers of the Estelle Development Toolset.
{"title":"Using formal specification and observers to specify and validate the ATM signaling protocols","authors":"J. Atwood, M. Ghodrat, D. Tasak","doi":"10.1109/LCN.1999.802005","DOIUrl":"https://doi.org/10.1109/LCN.1999.802005","url":null,"abstract":"When ensuring that an implementation of a computer communications protocol satisfies both conformance with the specification and conformance with the intent/expectations of the designers, it is useful to write a formal specification, and derive the implementation directly from it. This permits the use of validation techniques that are expressed using concepts meaningful to the protocol designer. This technique has been applied to the testing and validation of the ATM higher layer signaling protocol (Q.2931) and the service specific connection oriented protocol (Q.2110), using the Estelle formal description language, and the observers of the Estelle Development Toolset.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129198298","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}
We study the problem of guaranteeing deadlines of synchronous messages with their deadlines no more than periods in an FDDI network. In order to guarantee the transmission of a synchronous message before its deadline, a precise knowledge of the worst-case situation for such transmission is required. This paper studies the worst-case scenario for transmission of a synchronous message in an FDDI network, in which the time elapsed between arrival of the message and completion of its transmission will reach its maximum (i.e., the longest possible interval). A few conditions under which the worst-case situation can happen are formally derived.
{"title":"The worst-case scenario for transmission of synchronous traffic in an FDDI network","authors":"Sijing Zhang, E. S. Lee","doi":"10.1109/LCN.1999.802016","DOIUrl":"https://doi.org/10.1109/LCN.1999.802016","url":null,"abstract":"We study the problem of guaranteeing deadlines of synchronous messages with their deadlines no more than periods in an FDDI network. In order to guarantee the transmission of a synchronous message before its deadline, a precise knowledge of the worst-case situation for such transmission is required. This paper studies the worst-case scenario for transmission of a synchronous message in an FDDI network, in which the time elapsed between arrival of the message and completion of its transmission will reach its maximum (i.e., the longest possible interval). A few conditions under which the worst-case situation can happen are formally derived.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116373020","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}
The Internet is increasingly being called upon to provide different levels of service to different applications and users. A practical problem in doing so is that although Ethernet is one of the hops for nearby all communication in the Internet, it does not provide any QoS guarantees. A natural question, therefore, is the effect of offered load on Ethernet throughput and delay. In this paper, we present several techniques for accurately and efficiently modeling the behavior of a heavily loaded Ethernet link. We propose an efficient distributed simulation model, called Fast Ethernet Simulation, that empirically models an Ethernet link to quickly and accurately simulate it. By eliminating the implementation of the CSMA/CD protocol, our approach reduces computational complexity drastically while still maintaining desirable accuracy. Performance results show that our techniques not only add very little overhead (less than 5% in our tests) to the basic cost of simulating an Ethernet link, but also closely match real-world measurements. We also present efficient techniques for compressing cumulative distributions using hyperbolic curves and for monitoring the load on a heavily loaded link. Finally, we show applications to illustrate the potential usage of the Fast Ethernet Simulation.
{"title":"Efficient and accurate Ethernet simulation","authors":"Jia Wang, S. Keshav","doi":"10.1109/LCN.1999.802015","DOIUrl":"https://doi.org/10.1109/LCN.1999.802015","url":null,"abstract":"The Internet is increasingly being called upon to provide different levels of service to different applications and users. A practical problem in doing so is that although Ethernet is one of the hops for nearby all communication in the Internet, it does not provide any QoS guarantees. A natural question, therefore, is the effect of offered load on Ethernet throughput and delay. In this paper, we present several techniques for accurately and efficiently modeling the behavior of a heavily loaded Ethernet link. We propose an efficient distributed simulation model, called Fast Ethernet Simulation, that empirically models an Ethernet link to quickly and accurately simulate it. By eliminating the implementation of the CSMA/CD protocol, our approach reduces computational complexity drastically while still maintaining desirable accuracy. Performance results show that our techniques not only add very little overhead (less than 5% in our tests) to the basic cost of simulating an Ethernet link, but also closely match real-world measurements. We also present efficient techniques for compressing cumulative distributions using hyperbolic curves and for monitoring the load on a heavily loaded link. Finally, we show applications to illustrate the potential usage of the Fast Ethernet Simulation.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127584311","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}
This paper presents the new shortest best path tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the bandwidth to be shared by multiple receivers and simultaneously guarantee the shortest paths for each receiver node. The SBPT algorithm is a distributed algorithm with cost in the same order as the sum of the shortest path tree (SPT) and Greedy algorithms. The SBPT algorithm reduces bandwidth consumption by utilizing partial paths already established for other multicast receiver nodes. The SBPT algorithm finds such partial paths when multiple shortest paths exist. Simulation experiments comparing the SBPT and SPT algorithms show that the SBPT algorithm reduces bandwidth consumption by 5% to 17% when node utilization is greater than approximately 25% and always achieves the same shortest path lengths.
{"title":"The new shortest best path tree (SBPT) algorithm for dynamic multicast trees","authors":"H. Fujinoki, Kenneth J. Christensen","doi":"10.1109/LCN.1999.802017","DOIUrl":"https://doi.org/10.1109/LCN.1999.802017","url":null,"abstract":"This paper presents the new shortest best path tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the bandwidth to be shared by multiple receivers and simultaneously guarantee the shortest paths for each receiver node. The SBPT algorithm is a distributed algorithm with cost in the same order as the sum of the shortest path tree (SPT) and Greedy algorithms. The SBPT algorithm reduces bandwidth consumption by utilizing partial paths already established for other multicast receiver nodes. The SBPT algorithm finds such partial paths when multiple shortest paths exist. Simulation experiments comparing the SBPT and SPT algorithms show that the SBPT algorithm reduces bandwidth consumption by 5% to 17% when node utilization is greater than approximately 25% and always achieves the same shortest path lengths.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115838106","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}
Fault management is used to detect, isolate, and repair problems in communication networks. Alarms are considered an external manifestation of faults occurring inside the managed network. These faults may affect the network's hardware and software components. Alarm correlation identifies the relationships between reported alarms to produce a new, smaller list of alarms. This allows operators to quickly and more accurately to identify the root cause of problems and resolve them faster. Temporal reasoning, reasoning about time, plays a critical role in monitoring network alarms. In this paper, a fuzzy-logic model is proposed for finding the temporal relation between events for correlation purposes. A fuzzy-inference rule base is used to integrate fuzzy membership functions to determine the "best" temporal relation between events. The proposed model is compared to the traditional crisp temporal reasoning.
{"title":"Fuzzy temporal reasoning model for event correlation in network management","authors":"E. Aboelela, C. Douligeris","doi":"10.1109/LCN.1999.802010","DOIUrl":"https://doi.org/10.1109/LCN.1999.802010","url":null,"abstract":"Fault management is used to detect, isolate, and repair problems in communication networks. Alarms are considered an external manifestation of faults occurring inside the managed network. These faults may affect the network's hardware and software components. Alarm correlation identifies the relationships between reported alarms to produce a new, smaller list of alarms. This allows operators to quickly and more accurately to identify the root cause of problems and resolve them faster. Temporal reasoning, reasoning about time, plays a critical role in monitoring network alarms. In this paper, a fuzzy-logic model is proposed for finding the temporal relation between events for correlation purposes. A fuzzy-inference rule base is used to integrate fuzzy membership functions to determine the \"best\" temporal relation between events. The proposed model is compared to the traditional crisp temporal reasoning.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127544785","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}
The growing interest in wireless systems and networks has led to the first wireless LAN (WLAN) protocols. The medium access control (MAC) layer protocols of such protocol suites are of key importance. The Radio Equipment and Systems (RES) Technical Committee of the European Telecommunications Standards Institute has proposed the High PErformance Radio LAN (HIPERLAN) protocol suite. We present study, analyze and evaluate the performance of the MAC layer of the HIPERLAN protocol suite for asynchronous data transfer. Analytical models that take into account the phenomena of hidden nodes and capture are presented during the analysis. Numerical results from both analysis and simulation are presented, so that the issues involved are better understood.
{"title":"Evaluating performance of the HIPERLAN CAC layer protocol for asynchronous traffic","authors":"C. Coutras, P. Wan","doi":"10.1109/LCN.1999.801992","DOIUrl":"https://doi.org/10.1109/LCN.1999.801992","url":null,"abstract":"The growing interest in wireless systems and networks has led to the first wireless LAN (WLAN) protocols. The medium access control (MAC) layer protocols of such protocol suites are of key importance. The Radio Equipment and Systems (RES) Technical Committee of the European Telecommunications Standards Institute has proposed the High PErformance Radio LAN (HIPERLAN) protocol suite. We present study, analyze and evaluate the performance of the MAC layer of the HIPERLAN protocol suite for asynchronous data transfer. Analytical models that take into account the phenomena of hidden nodes and capture are presented during the analysis. Numerical results from both analysis and simulation are presented, so that the issues involved are better understood.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116223734","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}
This paper proposes to facilitate the inter-gatekeeper communications with distributed gatekeeper architecture through acquiring knowledge of the destinations served by other GKs dynamically, of cache management, and of extension of the existing H.323 signaling messages. The only new field that needs to be added to extend the signaling message set is hopCount in order to avoid looping, especially in distributive environment similar to messages of Recommendation H.225.0 Annex G. The existing two fields defined in H.323v2 that need to be added to all signaling message sets are endpointType and gatekeeperIdentifier. This simple extension in the H.323 signaling message set will satisfy the needs for inter-gatekeeper communications.
{"title":"Distributed gatekeeper architecture for H.323-based multimedia telephony","authors":"R. Roy","doi":"10.1109/LCN.1999.801999","DOIUrl":"https://doi.org/10.1109/LCN.1999.801999","url":null,"abstract":"This paper proposes to facilitate the inter-gatekeeper communications with distributed gatekeeper architecture through acquiring knowledge of the destinations served by other GKs dynamically, of cache management, and of extension of the existing H.323 signaling messages. The only new field that needs to be added to extend the signaling message set is hopCount in order to avoid looping, especially in distributive environment similar to messages of Recommendation H.225.0 Annex G. The existing two fields defined in H.323v2 that need to be added to all signaling message sets are endpointType and gatekeeperIdentifier. This simple extension in the H.323 signaling message set will satisfy the needs for inter-gatekeeper communications.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123238376","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}
The integrated technology of a novel prediction system with a high prediction accuracy for indoor wireless LAN is proposed. Different from conventional methods, the genetic algorithm and neural network are employed to compute the environmental parameters and enhance the prediction accuracy, respectively.
{"title":"A novel prediction system for wireless LAN based on the genetic algorithm and neural network","authors":"Wen-Ching Chang, Chih-Hui Ko, Yang-Han Lee, Shiann-Tsong Sheu, Yu-Jie Zheng","doi":"10.1109/LCN.1999.802072","DOIUrl":"https://doi.org/10.1109/LCN.1999.802072","url":null,"abstract":"The integrated technology of a novel prediction system with a high prediction accuracy for indoor wireless LAN is proposed. Different from conventional methods, the genetic algorithm and neural network are employed to compute the environmental parameters and enhance the prediction accuracy, respectively.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122482217","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
扫码关注我们
求助内容：
应助结果提醒方式：