The full-duplex repeater (FDR) has previously been proposed as an alternative to half-duplex operation using CSMA/CD for controlling shared access to Gigabit Ethernet. In this paper, the basic FDR architecture is described and two extensions for traffic control are introduced. Using simulation methods, the performance of the Gigabit FDR is studied under different topologies and population sizes for a range of offered load. It is shown that the FDR provides a dramatic performance improvement over CSMA/CD (using both BEB and BLAM arbitration) at high load. The Gigabit FDR is also compared with switched Ethernet in the context of medical image retrieval. It is shown that for medical image retrieval, the performance of the Gigabit FDR is much better than 100/100 or 1000/100-Mbps switched Ethernet, and equivalent to 1000/1000-Mbps switched Ethernet for low levels of non-image background traffic.
{"title":"Comparison of the Gigabit Ethernet full-duplex repeater, CSMA/CD, and 1000/100-Mbps switched Ethernet","authors":"Kenneth J. Christensen, M. Molle, Sifang Li","doi":"10.1109/LCN.1998.727674","DOIUrl":"https://doi.org/10.1109/LCN.1998.727674","url":null,"abstract":"The full-duplex repeater (FDR) has previously been proposed as an alternative to half-duplex operation using CSMA/CD for controlling shared access to Gigabit Ethernet. In this paper, the basic FDR architecture is described and two extensions for traffic control are introduced. Using simulation methods, the performance of the Gigabit FDR is studied under different topologies and population sizes for a range of offered load. It is shown that the FDR provides a dramatic performance improvement over CSMA/CD (using both BEB and BLAM arbitration) at high load. The Gigabit FDR is also compared with switched Ethernet in the context of medical image retrieval. It is shown that for medical image retrieval, the performance of the Gigabit FDR is much better than 100/100 or 1000/100-Mbps switched Ethernet, and equivalent to 1000/1000-Mbps switched Ethernet for low levels of non-image background traffic.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115300091","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}
Conventional routing protocols used in wireline and wireless networks are not designed to operate in an autonomous (or ad hoc) wireless local area network (AWLAN) environment with asymmetric (i.e. unidirectional) links. This paper presents the design of a routing protocol called source-initiated adaptive routing algorithm (SARA), for AWLAN environments that may contain asymmetric links. To allow efficient operation in a symmetric network while ensuring correct operation in asymmetric networks, SARA supports two different modes of protocol operation: one optimized for symmetric networks and the other providing additional capabilities needed for operation in asymmetric networks at a higher cost. The ability of SARA to adapt its mode of operation and optimize its execution for each network environment is one of its major advantages and distinguishes it from existing routing protocols for, wireless networks. Furthermore, within each of its operating modes, SARA supports best-effort as well as policy-based routing.
{"title":"Source-initiated adaptive routing algorithm (SARA) for autonomous wireless local area networks","authors":"R. Ramanujan, S. Takkella, J. Bonney, K. Thurber","doi":"10.1109/LCN.1998.727652","DOIUrl":"https://doi.org/10.1109/LCN.1998.727652","url":null,"abstract":"Conventional routing protocols used in wireline and wireless networks are not designed to operate in an autonomous (or ad hoc) wireless local area network (AWLAN) environment with asymmetric (i.e. unidirectional) links. This paper presents the design of a routing protocol called source-initiated adaptive routing algorithm (SARA), for AWLAN environments that may contain asymmetric links. To allow efficient operation in a symmetric network while ensuring correct operation in asymmetric networks, SARA supports two different modes of protocol operation: one optimized for symmetric networks and the other providing additional capabilities needed for operation in asymmetric networks at a higher cost. The ability of SARA to adapt its mode of operation and optimize its execution for each network environment is one of its major advantages and distinguishes it from existing routing protocols for, wireless networks. Furthermore, within each of its operating modes, SARA supports best-effort as well as policy-based routing.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122405085","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}
Reliable multicast protocols on top of the MBone are presently subject to intensive research. In the past, numerous protocols have been developed and their respective performance been analysed. Little progress has been made, though, to compare different approaches. We use the network simulator ns-2 to evaluate the performance of three protocols, namely scalable reliable multicast (SRM), multicast file transfer protocol (MFTP) and an enhanced version of the latter, called multicast file transfer protocol with erasure correction (MFTP/EC). We also compare the results to each other and test the suitability for multicast file distribution.
{"title":"Performance comparison of reliable multicast protocols using the network simulator ns-2","authors":"C. Hänle, M. Hofmann","doi":"10.1109/LCN.1998.727663","DOIUrl":"https://doi.org/10.1109/LCN.1998.727663","url":null,"abstract":"Reliable multicast protocols on top of the MBone are presently subject to intensive research. In the past, numerous protocols have been developed and their respective performance been analysed. Little progress has been made, though, to compare different approaches. We use the network simulator ns-2 to evaluate the performance of three protocols, namely scalable reliable multicast (SRM), multicast file transfer protocol (MFTP) and an enhanced version of the latter, called multicast file transfer protocol with erasure correction (MFTP/EC). We also compare the results to each other and test the suitability for multicast file distribution.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130503594","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}
In this paper, we describe the design and implementation of OTCA (ownership-tagged cell allocation) MAC protocol for a unidirectional slotted ring network with a distributed fair medium access. A point-to-point (p2p) interconnection network in a ring topology with a high-speed serial link and the sharing of network bandwidth among multiple communicating nodes offers a very promising low cost solution in the growing gigabit communication system, where it is a challenge to run high quality real-time multimedia. Some services have explicit timing requirements. The OTCA MAC protocol provides the deterministic network behavior guaranteeing the worst latency bound and the minimum bandwidth availability. On a 1.063 Gpbs p2p ring network comprising 4 nodes, the OTCA MAC protocol ensures a bandwidth of 265 Mbps for synchronous data, 232 Mbps for asynchronous data (thus a total of 497 Mbps for a mode), and the worst medium access latency is bounded with 17.46 us.
{"title":"Design and implementation of OTCA MAC protocol for high-speed point-to-point ring network","authors":"Yeshik Shin, Jin-su Ahn, Hyung-Rok Lee, D. Jeong","doi":"10.1109/LCN.1998.727675","DOIUrl":"https://doi.org/10.1109/LCN.1998.727675","url":null,"abstract":"In this paper, we describe the design and implementation of OTCA (ownership-tagged cell allocation) MAC protocol for a unidirectional slotted ring network with a distributed fair medium access. A point-to-point (p2p) interconnection network in a ring topology with a high-speed serial link and the sharing of network bandwidth among multiple communicating nodes offers a very promising low cost solution in the growing gigabit communication system, where it is a challenge to run high quality real-time multimedia. Some services have explicit timing requirements. The OTCA MAC protocol provides the deterministic network behavior guaranteeing the worst latency bound and the minimum bandwidth availability. On a 1.063 Gpbs p2p ring network comprising 4 nodes, the OTCA MAC protocol ensures a bandwidth of 265 Mbps for synchronous data, 232 Mbps for asynchronous data (thus a total of 497 Mbps for a mode), and the worst medium access latency is bounded with 17.46 us.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134006564","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}
In this paper, we assume that there will be two networks, the next-generation public network and the Internet, as the future information network infrastructure, and we propose the interworking architecture that allows users to utilize services on the next-generation public network from the Internet environment. The proposed architecture is constructed on the open distributed processing environment, based on TINA. We also constructed a platform, PLUS-TINA, especially for making use of services on the TINA-based public network from any Internet environment.
{"title":"Service architecture for utilizing TINA-based public network services from the Internet environment","authors":"Y. Koga, K. Shiomi, Y. Matsushita","doi":"10.1109/LCN.1998.727657","DOIUrl":"https://doi.org/10.1109/LCN.1998.727657","url":null,"abstract":"In this paper, we assume that there will be two networks, the next-generation public network and the Internet, as the future information network infrastructure, and we propose the interworking architecture that allows users to utilize services on the next-generation public network from the Internet environment. The proposed architecture is constructed on the open distributed processing environment, based on TINA. We also constructed a platform, PLUS-TINA, especially for making use of services on the TINA-based public network from any Internet environment.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123553199","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}
Applications deploying distributed database updates, distributed simulations, shared whiteboards, and forthcoming distributed interactive multi-user games have communication needs not satisfied by most available protocols or communication subsystems. These applications are different from classical applications in that they have potentially many senders and receivers. Although there has been a lot of research on unicast and multicast protocols, only little work has been done in the area of multipeer communication, i.e. communication realizing an M:N communication service. Even fewer results are available for such a service on connection oriented technologies like ATM (asynchronous transfer mode). This paper describes the current situation, proposes a novel two-layer architecture especially suitable for ADSL and cable networks, which bridge the gap between LANs and the WAN, gives a first analysis, and presents open issues.
{"title":"ATM multipeer communication using a two-layer architecture","authors":"Stefan Dresler","doi":"10.1109/LCN.1998.727659","DOIUrl":"https://doi.org/10.1109/LCN.1998.727659","url":null,"abstract":"Applications deploying distributed database updates, distributed simulations, shared whiteboards, and forthcoming distributed interactive multi-user games have communication needs not satisfied by most available protocols or communication subsystems. These applications are different from classical applications in that they have potentially many senders and receivers. Although there has been a lot of research on unicast and multicast protocols, only little work has been done in the area of multipeer communication, i.e. communication realizing an M:N communication service. Even fewer results are available for such a service on connection oriented technologies like ATM (asynchronous transfer mode). This paper describes the current situation, proposes a novel two-layer architecture especially suitable for ADSL and cable networks, which bridge the gap between LANs and the WAN, gives a first analysis, and presents open issues.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127253641","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 evolution of communication technology makes possible distributed real-time multimedia applications. Unlike traditional data traffic, real-time multimedia traffic requires that temporal relationships among media units must be maintained, and needs that all sites impose a consistent causal order to receive the same media at a given time. Yet delay jitter, the absence of a global clock, and a crash failure may disrupt these temporal relationships. This paper proposes new hierarchical architecture of k-local groups, where k represents the number of local groups composing the group communication system. This architecture ensures real-time causal ordering and guarantees an automatic reconfiguration, in presence of a crash failure, by ensuring at least a partial real-time communication between active local groups, while keeping the amount of control information within a reasonable size.
{"title":"Hierarchical architecture for real time causal delivery","authors":"A. Abouaissa, A. Benslimane","doi":"10.1109/LCN.1998.727678","DOIUrl":"https://doi.org/10.1109/LCN.1998.727678","url":null,"abstract":"The evolution of communication technology makes possible distributed real-time multimedia applications. Unlike traditional data traffic, real-time multimedia traffic requires that temporal relationships among media units must be maintained, and needs that all sites impose a consistent causal order to receive the same media at a given time. Yet delay jitter, the absence of a global clock, and a crash failure may disrupt these temporal relationships. This paper proposes new hierarchical architecture of k-local groups, where k represents the number of local groups composing the group communication system. This architecture ensures real-time causal ordering and guarantees an automatic reconfiguration, in presence of a crash failure, by ensuring at least a partial real-time communication between active local groups, while keeping the amount of control information within a reasonable size.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123276522","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}
Asynchronous transfer mode (ATM) is designed to support various traffic classes. It is necessary to select a proper traffic class to support a specific application. Voice traffic in its inherent nature is time-sensitive and variable. Therefore, it is natural to consider voice as real-time VBR traffic. Human speech has a voice activity factor of about 42% on an average, which makes it possible to multiplex a lot of voice sources together. The study of cell loss is of great importance to the design of an ATM multiplexer whose input consists of voice sources. With a maximum delay allowed in the network, it is the behavior of cell loss, rather than the variation of network delay, that determines the quality of reconstructed voice at receivers. This paper analyzes the cell loss performance and multiplexing gain of an ATM multiplexer loaded with VBR voice sources, where multiple voice streams, utilizing compression and silence detection, are multiplexed into a fixed bandwidth circuit such as T1 or T3 ATU trunk. This paper shows that the cell loss ratio and multiplexing gain depend on the voice activity factor, the mean talk spurt length, the mean silence period, the link capacity, the compression ratio, and the buffer size of the ATM multiplexer.
{"title":"Cell loss ratio and multiplexing gain of an ATM multiplexer for VBR voice sources","authors":"Seong-Ho Jeong, J. Copeland","doi":"10.1109/LCN.1998.727679","DOIUrl":"https://doi.org/10.1109/LCN.1998.727679","url":null,"abstract":"Asynchronous transfer mode (ATM) is designed to support various traffic classes. It is necessary to select a proper traffic class to support a specific application. Voice traffic in its inherent nature is time-sensitive and variable. Therefore, it is natural to consider voice as real-time VBR traffic. Human speech has a voice activity factor of about 42% on an average, which makes it possible to multiplex a lot of voice sources together. The study of cell loss is of great importance to the design of an ATM multiplexer whose input consists of voice sources. With a maximum delay allowed in the network, it is the behavior of cell loss, rather than the variation of network delay, that determines the quality of reconstructed voice at receivers. This paper analyzes the cell loss performance and multiplexing gain of an ATM multiplexer loaded with VBR voice sources, where multiple voice streams, utilizing compression and silence detection, are multiplexed into a fixed bandwidth circuit such as T1 or T3 ATU trunk. This paper shows that the cell loss ratio and multiplexing gain depend on the voice activity factor, the mean talk spurt length, the mean silence period, the link capacity, the compression ratio, and the buffer size of the ATM multiplexer.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121157098","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}
After two decades of research, reliable computing remains a property of specialized systems and too costly to implement in many applications. We present an object oriented, and fault tolerant distributed system. This system is based on open standards and hides programming complexities. Our technique for delivering replication to programmers is based on typed objects, inheritance and protocol composition. Additionally, this technique uses reliable unordered communication for message delivery.
{"title":"Replication in an object-oriented system","authors":"M. Sabbouh, K. Prasad, W. Thompson","doi":"10.1109/LCN.1998.727665","DOIUrl":"https://doi.org/10.1109/LCN.1998.727665","url":null,"abstract":"After two decades of research, reliable computing remains a property of specialized systems and too costly to implement in many applications. We present an object oriented, and fault tolerant distributed system. This system is based on open standards and hides programming complexities. Our technique for delivering replication to programmers is based on typed objects, inheritance and protocol composition. Additionally, this technique uses reliable unordered communication for message delivery.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123082335","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 transmission control protocol (TCP) adopts some techniques that use network resources efficiently by estimating the characteristics and condition of the network. The slow-start algorithm is the primary technique for effective resource usage. The goal of slow-start is to establish a TCP connection in an optimum state for the network path quickly unless giving an excessive load to the network. However, in large-bandwidth with long-delay links such as satellite links, the slow-start algorithm does not work properly and causes substantial performance degradation. In this paper, we describe the problem of the current slow-start algorithm in large-bandwidth with long-delay networks. We propose a new slow-start algorithm that can increase network transfer performance for large bandwidth with long delay networks. We also implemented this algorithm on a network simulator for evaluation and it resulted in over a 60% efficiency compared to a normal slow start algorithm.
TCP (transmission control protocol，传输控制协议)通过估计网络的特性和条件，采用了一些有效利用网络资源的技术。慢启动算法是有效利用资源的主要技术。慢启动的目标是快速地为网络路径建立一个最佳状态的TCP连接，除非给网络带来过多的负载。但在卫星链路等大带宽、长时延链路中，慢启动算法不能正常工作，导致性能大幅下降。本文讨论了大带宽、长时延网络中当前慢启动算法存在的问题。提出了一种新的慢启动算法，可以提高大带宽、长时延网络的网络传输性能。我们还在网络模拟器上实现了该算法进行评估，与普通慢启动算法相比，它的效率超过60%。
{"title":"Smooth slow-start: refining TCP slow-start for large-bandwidth with long-delay networks","authors":"Y. Nishida","doi":"10.1109/LCN.1998.727646","DOIUrl":"https://doi.org/10.1109/LCN.1998.727646","url":null,"abstract":"The transmission control protocol (TCP) adopts some techniques that use network resources efficiently by estimating the characteristics and condition of the network. The slow-start algorithm is the primary technique for effective resource usage. The goal of slow-start is to establish a TCP connection in an optimum state for the network path quickly unless giving an excessive load to the network. However, in large-bandwidth with long-delay links such as satellite links, the slow-start algorithm does not work properly and causes substantial performance degradation. In this paper, we describe the problem of the current slow-start algorithm in large-bandwidth with long-delay networks. We propose a new slow-start algorithm that can increase network transfer performance for large bandwidth with long delay networks. We also implemented this algorithm on a network simulator for evaluation and it resulted in over a 60% efficiency compared to a normal slow start algorithm.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122898332","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
扫码关注我们
求助内容：
应助结果提醒方式：