{"title":"Reliable multicast under error conditions","authors":"G. S. Johnstone, G. Williams","doi":"10.1109/LCN.1997.631007","DOIUrl":"https://doi.org/10.1109/LCN.1997.631007","url":null,"abstract":"Reliable multicast protocols provide means to deliver data from one sender to many receivers with assurance. Reliable multicast is better suited than unicast for bandwidth restricted, high error rate, hostile communications environments found in the military's tactical arena. General purpose protocols ensure adaptability to the military's variety of communications suites. Acceptable multicast protocols must support varying assurance levels, from unreliable delivery to full reliability. This paper documents experimental results gathered on one implementation of the Xpress Transport Protocol, a transport protocol that provides reliable multicast as well as unicast service. The experiments observe unicast and multicast transmissions with varying numbers of induced errors. Performance measurements examine various challenges present in a communications medium subject to hostile conditions. The results demonstrate that use of reliable multicast in a tactical environment is possible. Suggestions are made for modification of the error recovery algorithm, making the protocol more responsive in a local environment.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130865924","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}
{"title":"Interconnecting fieldbuses through ATM","authors":"O. Kunert, M. Zitterbart","doi":"10.1109/LCN.1997.631024","DOIUrl":"https://doi.org/10.1109/LCN.1997.631024","url":null,"abstract":"Networks for factory automation, often named fieldbuses, have been developed to fulfill real time requirements. However, they can only cover geographical areas such as factory halls or buildings. The paper describes a model for internetworking fieldbuses via ATM networks. A remote bridge is used to span longer distances between fieldbus components in a separated fieldbus. Furthermore, a multiport bridge connecting several independent fieldbuses is investigated. The emphasis is laid on the investigation of quality of service requirements the transport channel provided by the ATM network has to meet. By means of the wide spread fieldbus PROFIBUS the implications for real time applications and the system behavior are considered.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128745570","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}
{"title":"Preserving cell sequence of handoff connections in wireless ATM networks","authors":"Hui-Tang Lin, H. Hughes","doi":"10.1109/LCN.1997.630940","DOIUrl":"https://doi.org/10.1109/LCN.1997.630940","url":null,"abstract":"Preserving ATM cell sequencing is an important issue in the future wireless ATM network. Out-of-sequence ATM cells will cause entire data frame to be discarded and causes either data retransmission or quality of service degradation. Currently there is no connection handoff scheme providing a schematic method to preserve ATM cell sequencing. In this paper, we investigate the issue of preserving ATM cell sequencing during connection handoff sessions. A proposed VP-based hierarchical network infrastructure and a handoff mechanism are used to support connection handoffs and preserve cell sequencing for both uplink and downlink handoffs in the wireless ATM network.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126779114","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}
{"title":"An ultra light weight CAC mechanism (UL-CAC) for soft guarantee in ATM networks","authors":"T. Yokotani, T. Ichihashi, M. Yabe","doi":"10.1109/LCN.1997.631012","DOIUrl":"https://doi.org/10.1109/LCN.1997.631012","url":null,"abstract":"CAC (connection admission control) is one of the most important functions in ATM networks to provide various requested QoS from end users. CAC mechanisms for a soft guarantee which assure the requested QoS statistically are classified with a non-parametric or a parametric approach. However, both approaches have disadvantages. The non-parametric approach needs the dedicated hardware to monitor actual traffic streams. Generally, the parametric approach must invoke complicated calculations to analyze mathematical models. The paper proposes a simplified CAC mechanism referred to as UL-CAC (ultra-lightweight CAC) for soft guarantee. Although this mechanism is included in a category of the parametric approach, it does not need complicated calculations. The paper presents its mechanism which is applied to VBR traffic streams characterized by the dual leaky bucket mechanism and is applied to CBR traffic streams. It also verifies suitability by some simulations.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114354936","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}
V. Balachandran, G. Bhat, S. Chakravarty, A. Zhang
{"title":"A network manager on Ethernets for distributed multimedia systems","authors":"V. Balachandran, G. Bhat, S. Chakravarty, A. Zhang","doi":"10.1109/LCN.1997.631010","DOIUrl":"https://doi.org/10.1109/LCN.1997.631010","url":null,"abstract":"Distributed multimedia systems require good quality of service for real-time data transmission. Ethernets, which use a non-deterministic protocol, cannot guarantee the requested bandwidth and there is a large variance in the data rate. A novel approach to supporting multimedia applications over Ethernets, where constant data rates and bandwidth requirements are guaranteed, is proposed. Unlike known solutions, the authors' approach does not require any changes either to the existing software or the Ethernet hardware.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123913095","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}
{"title":"Selective discarding with FEC for ATM-based internetworks","authors":"S. Chatterjee, Wen Xiao","doi":"10.1109/LCN.1997.630998","DOIUrl":"https://doi.org/10.1109/LCN.1997.630998","url":null,"abstract":"If the reliability provided by the network is lower than that requested by the application, the error and flow control systems in the end nodes must make up for the difference. While most applications use retransmission based schemes to recover lost data, ARQ based closed loop techniques may not be suitable for many new applications. Time sensitive information requiring no loss of data would constitute a major segment of the emerging traffic (interactive web, videophones, CSCW) that typically employ forward error correction (FEC) codes. Such codes send redundant information which help to recover lost data without retransmission. The paper shows that just plain FEC is not enough when one considers the fragmentation effects that take place when legacy networks interwork with ATM. Simple yet powerful buffer management techniques can yield higher throughput, thereby reducing block loss rates. A combination of a gatekeeping operation along with janitor routine that cleans up the buffer to preserve frames on an end to end basis is proposed. A simulation study demonstrates positive results. The proposed schemes even point towards efficient sizing of ATM switch buffers which guarantee no loss transport of real time information.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124099004","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}
{"title":"Fuzzy optimization model for routing in B-ISDN","authors":"E. Aboelela, C. Douligeris","doi":"10.1109/LCN.1997.630908","DOIUrl":"https://doi.org/10.1109/LCN.1997.630908","url":null,"abstract":"Broadband integrated services digital networks (B-ISDN) support a wide range of applications with diverse traffic characteristics. Routing algorithms are required to guarantee the quality of service (QoS) requested by these traffic classes. In this paper, the routing problem is formulated as a fuzzy multiobjective optimization model. The fuzzy approach allows for the inclusion and evaluation of several criteria simultaneously. The proposed model takes into consideration balancing the load in the network to avoid link saturation and hence the possibility of congestion. The model is tested with different loads and the effect on different measures of performance is analyzed.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124867732","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}
{"title":"Security and efficiency in authentication protocols resistant to password guessing attacks","authors":"Taekyoung Kwon, Joo-Seok Song","doi":"10.1109/LCN.1997.630994","DOIUrl":"https://doi.org/10.1109/LCN.1997.630994","url":null,"abstract":"Cryptographic protocols for authentication and key exchange are necessary for secure communications. Most protocols have assumed that a strong secret for authentication should be shared between communicating participants in the light of a threat of dictionary attacks. But a user-chosen weak secret, i.e. password, is typically used for authentication. Since most users want to use an easily memorizable password, which tends to be easy to guess, several authentication protocols that protect such a weak secret from password guessing attacks, have been developed. However, those security-oriented protocols are more expensive in terms of the number of random numbers, cipher operations, and protocol steps than the previous protocols which are not resistant to guessing attacks. The authors propose new authentication and key exchange protocols, which are efficient considerably in protecting a poorly-chosen weak secret from guessing attacks.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125067640","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}
{"title":"A comparative study of Simple Mail Transfer Protocol (SMTP), Post Office Protocol (POP) and X.400 Electronic Mail Protocols","authors":"P. Tzerefos, C. Smythe, I. Stergiou, S. Cvetkovic","doi":"10.1109/LCN.1997.631025","DOIUrl":"https://doi.org/10.1109/LCN.1997.631025","url":null,"abstract":"We present the main features and functionality of the three most widely used message transfer protocols. We study actual implementations and base our analysis on benchmarking. The performance of the protocols is compared in terms of end to end delay, volume of traffic and number of frames generated at the physical layer and frame length distribution. An analytical model is proposed for the approximation of the upper and lower bounds of volume generated by SMTP which can easily be extended for POP3. The model considers both explicit and piggyback acknowledgements at the TCP layer.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121178754","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}
{"title":"An enhanced communication protocol for flexible interconnection","authors":"H. Yamashita, Toshihiko Suguri, S. Kinoshita","doi":"10.1109/LCN.1997.631002","DOIUrl":"https://doi.org/10.1109/LCN.1997.631002","url":null,"abstract":"We developed an enhanced communication protocol that connects nodes in a logical ring configuration via a high speed network, circulates service request messages on the network, and controls the fulfillment of these requests and their capture to optimum nodes. This protocol is based on horizontal and vertical migration, from the cooperative processing conventionally enabled by communication between applications, to a lower layer communication protocol. The protocol uses the network as shared memory, and each node can autonomously refer to and modify data shared in communication messages. Such a flexible interconnection like this between clients and servers results in system wide load balancing and enables fault tolerance.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116425011","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}