A. Atlasis, E. Baltatzis, G. Stassinopoulos, I. Venieris
In this paper an efficient heuristic routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost metric, which achieves a successful trade-off between the use of the minimum-hop routes and the load balancing. Moreover, it employs the known trunk reservation concept according to probability that increases linearly as the traffic load increases. This results in an effective compromise of the performance of the algorithm between light and heavy loads. Finally its simplicity and its suitability for a real-time application render it as an efficient routing algorithm for ATM networks.
{"title":"A linear-based trunk reservation routing algorithm for ATM networks","authors":"A. Atlasis, E. Baltatzis, G. Stassinopoulos, I. Venieris","doi":"10.1109/LCN.1998.727650","DOIUrl":"https://doi.org/10.1109/LCN.1998.727650","url":null,"abstract":"In this paper an efficient heuristic routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost metric, which achieves a successful trade-off between the use of the minimum-hop routes and the load balancing. Moreover, it employs the known trunk reservation concept according to probability that increases linearly as the traffic load increases. This results in an effective compromise of the performance of the algorithm between light and heavy loads. Finally its simplicity and its suitability for a real-time application render it as an efficient routing algorithm for ATM networks.","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":"125376316","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 a typical network environment where TCP traffic is generated from a source connected to a LAN (e.g. Ethernet) aggregated through an IP edge router to an access network (e.g. ATM, frame relay). Congestion at the edge router occurs when the bandwidth available in the access network cannot support the aggregated traffic generated from the LAN. This paper presents a novel approach to reduce router congestion and improve TCP performance. In particular, we propose new techniques that regulate TCP acknowledgments at the edge router without changing existing TCP implementations at the end systems. Our techniques minimize buffer requirement at network edges while maximizing the throughput. Analytical and simulation results are presented in the's paper to substantiate our claims.
{"title":"New techniques for regulating TCP flow over heterogeneous networks","authors":"P. Narváez, Kai-Yeung Siu","doi":"10.1109/LCN.1998.727645","DOIUrl":"https://doi.org/10.1109/LCN.1998.727645","url":null,"abstract":"We study a typical network environment where TCP traffic is generated from a source connected to a LAN (e.g. Ethernet) aggregated through an IP edge router to an access network (e.g. ATM, frame relay). Congestion at the edge router occurs when the bandwidth available in the access network cannot support the aggregated traffic generated from the LAN. This paper presents a novel approach to reduce router congestion and improve TCP performance. In particular, we propose new techniques that regulate TCP acknowledgments at the edge router without changing existing TCP implementations at the end systems. Our techniques minimize buffer requirement at network edges while maximizing the throughput. Analytical and simulation results are presented in the's paper to substantiate our claims.","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":"124793867","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 describes an implementation of the general flexible interactive method of optimal network topology design with simultaneous calculation of network equipment parameters which depend on the network topology. The initial information on the projected network contains the following data: single and corporate users location, the structure and the quantity of their information flows to the different corporate users (as senders-receivers) and QoS of all users. The structure and the quantity of information flows must be presented in the form of probability characteristics of these flows applied to each traffic type. The algorithm of the proposed method is based on use of two complex potential functions and a solving of flow problems. The proposed method is integrated into the complex software tool for network design. There are numerical experiments.
{"title":"On optimal design of network topology","authors":"V. Kaminsky, Lev Kacnelson, I. Gerlovin, A. Zanis","doi":"10.1109/LCN.1998.727670","DOIUrl":"https://doi.org/10.1109/LCN.1998.727670","url":null,"abstract":"This paper describes an implementation of the general flexible interactive method of optimal network topology design with simultaneous calculation of network equipment parameters which depend on the network topology. The initial information on the projected network contains the following data: single and corporate users location, the structure and the quantity of their information flows to the different corporate users (as senders-receivers) and QoS of all users. The structure and the quantity of information flows must be presented in the form of probability characteristics of these flows applied to each traffic type. The algorithm of the proposed method is based on use of two complex potential functions and a solving of flow problems. The proposed method is integrated into the complex software tool for network design. There are numerical experiments.","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":"121546864","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}
Active networks allow protocol processing code to be loaded dynamically into network nodes at run-time. This code can perform tasks specific to a stream of packets or even a single packet. In this paper we compare two active network architectures: the active node transfer system (ANTS) and the messenger system (M0). We have implemented a robust audio multicast protocol and a layered video multicast protocol with both active network systems. We discuss the differences of the two systems, evaluate architectural strengths and weaknesses, compare the runtime performance, and report practical experience and lessons learned.
{"title":"Multicasting multimedia streams with active networks","authors":"A. Banchs, W. Effelsberg, C. Tschudin, V. Turau","doi":"10.1109/LCN.1998.727656","DOIUrl":"https://doi.org/10.1109/LCN.1998.727656","url":null,"abstract":"Active networks allow protocol processing code to be loaded dynamically into network nodes at run-time. This code can perform tasks specific to a stream of packets or even a single packet. In this paper we compare two active network architectures: the active node transfer system (ANTS) and the messenger system (M0). We have implemented a robust audio multicast protocol and a layered video multicast protocol with both active network systems. We discuss the differences of the two systems, evaluate architectural strengths and weaknesses, compare the runtime performance, and report practical experience and lessons learned.","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":"122846082","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}
Two explicit rate-based flow control schemes for congestion avoidance in ATM networks: explicit rate indication for congestion avoidance (ERICA) and a proposed adaptive stochastic (AS), are compared under heavy load conditions. Neither of the schemes dictates a particular switch architecture. The requirements tested include: utilization, queuing delay, delay variance and queue size. A simple network topology involves an ATM switching node which is modeled as a single server queuing system fed by a number of highly bursty traffic sources. Neither packet discarding, nor packet retransmission mechanisms are included. The controllable sources' allowed cell rates (ACR) have been dynamically shaped by the explicit feedback messages from the switch. The results of a simulation study are presented which suggest that the AS scheme can provide for higher priority traffic considerably shorter queuing delay, delay variance and average queue size, particularly on shorter links, with slightly lower utilization.
{"title":"ABR service in ATM networks: performance comparison between adaptive stochastic and ERICA flow control schemes with guaranteed minimum cell rate","authors":"S. Petrovic","doi":"10.1109/LCN.1998.727647","DOIUrl":"https://doi.org/10.1109/LCN.1998.727647","url":null,"abstract":"Two explicit rate-based flow control schemes for congestion avoidance in ATM networks: explicit rate indication for congestion avoidance (ERICA) and a proposed adaptive stochastic (AS), are compared under heavy load conditions. Neither of the schemes dictates a particular switch architecture. The requirements tested include: utilization, queuing delay, delay variance and queue size. A simple network topology involves an ATM switching node which is modeled as a single server queuing system fed by a number of highly bursty traffic sources. Neither packet discarding, nor packet retransmission mechanisms are included. The controllable sources' allowed cell rates (ACR) have been dynamically shaped by the explicit feedback messages from the switch. The results of a simulation study are presented which suggest that the AS scheme can provide for higher priority traffic considerably shorter queuing delay, delay variance and average queue size, particularly on shorter links, with slightly lower utilization.","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":"125321590","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}
EQuB is an overlay mechanism to Ethernet's MAC protocol that provides QoS guarantees to real-time applications. In its basic form, EQuB relies on the sensing and collision detection abilities of standard network interface cards and, in addition, requires only that those cards be capable of sending jam signals-so called black bursts-of pre-specified durations. EQuB gives access priority to real-time traffic, provides round-robin service among real-time hosts and guarantees a small, bounded delay to real-time packets. We also discuss enhancements to the basic EQuB mechanism that improve its performance. Simulation results are presented that assess the performance of 10 and 100 BASE-T Ethernet LANs with a mixed population of data and real-time hosts. We conclude that, in spite of the priority, attained by real-time traffic, data packer delays are not significantly affected as data load is traded for real-time load, and this is because EQuB dispatches packets to the channel much more efficiently than Ethernet's MAC protocol.
{"title":"EQuB-Ethernet quality of service using black bursts","authors":"J. Sobrinho, A. Krishnakumar","doi":"10.1109/LCN.1998.727669","DOIUrl":"https://doi.org/10.1109/LCN.1998.727669","url":null,"abstract":"EQuB is an overlay mechanism to Ethernet's MAC protocol that provides QoS guarantees to real-time applications. In its basic form, EQuB relies on the sensing and collision detection abilities of standard network interface cards and, in addition, requires only that those cards be capable of sending jam signals-so called black bursts-of pre-specified durations. EQuB gives access priority to real-time traffic, provides round-robin service among real-time hosts and guarantees a small, bounded delay to real-time packets. We also discuss enhancements to the basic EQuB mechanism that improve its performance. Simulation results are presented that assess the performance of 10 and 100 BASE-T Ethernet LANs with a mixed population of data and real-time hosts. We conclude that, in spite of the priority, attained by real-time traffic, data packer delays are not significantly affected as data load is traded for real-time load, and this is because EQuB dispatches packets to the channel much more efficiently than Ethernet's MAC protocol.","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":"120933531","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 variety and heterogeneity of different approaches for Quality of Service (QoS) support on different protocol layers result in the need of a solution with end-to-end overview and regulation of dataflows in a network. Previously we proposed the concept of ROBIN (regulation of bandwidth in intra-networks) to regulate the sending bandwidth of data flows in heterogeneous campus networks by determining bottlenecks and possible rate limitations with a global knowledge of the network state based on the end-to-end operation of the mechanism. This paper presents latest results of a simulation-based performance analysis studying the throughput fairness of an enhanced version of ROBIN and evaluating the impact of the bandwidth regulation on delays and packet losses in the network.
{"title":"Fairness and delay/loss study of an end-to-end bandwidth regulation scheme","authors":"M. Frank, P. Martini","doi":"10.1109/LCN.1998.727672","DOIUrl":"https://doi.org/10.1109/LCN.1998.727672","url":null,"abstract":"The variety and heterogeneity of different approaches for Quality of Service (QoS) support on different protocol layers result in the need of a solution with end-to-end overview and regulation of dataflows in a network. Previously we proposed the concept of ROBIN (regulation of bandwidth in intra-networks) to regulate the sending bandwidth of data flows in heterogeneous campus networks by determining bottlenecks and possible rate limitations with a global knowledge of the network state based on the end-to-end operation of the mechanism. This paper presents latest results of a simulation-based performance analysis studying the throughput fairness of an enhanced version of ROBIN and evaluating the impact of the bandwidth regulation on delays and packet losses in the network.","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":"124320871","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 design of the automated resource management tool (ARMT), a software-based network management tool that automates the potentially complex manual task of global resource management in a mission-oriented, intranet environment. It allows the network operator to specify high level policies defining the network quality of service (QoS) that must be offered to the different applications sharing the IP network, under each operating mode of the network. The tool automatically handles resource conflicts in accordance with the high-level QoS policies defined by the network operator. It also monitors the network to detect events that may lead to deviations from the specified service policy and automatically implements proactive actions to ensure that the network delivers the required QoS. ARMT implements an innovative policy-driven QoS control technique which ensures that multimedia intranet applications will have an adaptive environment that permits them to coexist with other mission applications. The paper presents our experience with the implementation of a rapid prototype of the ARMT in a laboratory testbed environment.
{"title":"An automated resource management tool for policy-driven QoS control within integrated services intranets","authors":"R. Ramanujan, Atiq Ahamad, K. Thurber","doi":"10.1109/LCN.1998.727671","DOIUrl":"https://doi.org/10.1109/LCN.1998.727671","url":null,"abstract":"This paper presents the design of the automated resource management tool (ARMT), a software-based network management tool that automates the potentially complex manual task of global resource management in a mission-oriented, intranet environment. It allows the network operator to specify high level policies defining the network quality of service (QoS) that must be offered to the different applications sharing the IP network, under each operating mode of the network. The tool automatically handles resource conflicts in accordance with the high-level QoS policies defined by the network operator. It also monitors the network to detect events that may lead to deviations from the specified service policy and automatically implements proactive actions to ensure that the network delivers the required QoS. ARMT implements an innovative policy-driven QoS control technique which ensures that multimedia intranet applications will have an adaptive environment that permits them to coexist with other mission applications. The paper presents our experience with the implementation of a rapid prototype of the ARMT in a laboratory testbed 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":"122650509","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 propose a new, efficient fast retransmission (EFR) scheme for wireless LANs. Wireless LANs are becoming popular and providing an efficient protocol over a wireless link is important. In our experiments with the 2.4 GHz WaveLAN, the poor TCP performance observed was attributed to frequent expiration of the retransmission timer. To avoid unnecessary expiration of the retransmission timer, we propose a scheme in which fast retransmission is performed efficiently. The proposed modification only affects a TCP sender, and our version of TCP where the change is interoperable with existing TCP implementations. The change is especially effective in wireless LAN environments, where we have demonstrated significant improvements in throughput, 10-15%, via experiments.
{"title":"EFR: a retransmit scheme for TCP in wireless LANs","authors":"Y. Tamura, Y. Tobe, H. Tokuda","doi":"10.1109/LCN.1998.727641","DOIUrl":"https://doi.org/10.1109/LCN.1998.727641","url":null,"abstract":"We propose a new, efficient fast retransmission (EFR) scheme for wireless LANs. Wireless LANs are becoming popular and providing an efficient protocol over a wireless link is important. In our experiments with the 2.4 GHz WaveLAN, the poor TCP performance observed was attributed to frequent expiration of the retransmission timer. To avoid unnecessary expiration of the retransmission timer, we propose a scheme in which fast retransmission is performed efficiently. The proposed modification only affects a TCP sender, and our version of TCP where the change is interoperable with existing TCP implementations. The change is especially effective in wireless LAN environments, where we have demonstrated significant improvements in throughput, 10-15%, via experiments.","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":"126774019","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}
Discrete service disciplines have been shown capable of emulating the ideal Generalized Processor Sharing discipline within one maximum-sized packet's transmission time. As a result, the accuracy of such schemes increases with improvements in link speed due to the corresponding reduction in packet transmission delay. However, the merits of such accuracy diminish with improvements in link speed as its impact on call admission decisions decreases. Meanwhile, overhead, in terms of the number of scheduling decisions to be made per unit time, increases with the number of packets transmitted. In response, this paper will present the DQFS service discipline which enables GPS emulation servers to dynamically "tune" their service quanta based upon the QoS requirements of their currently supported applications rather than the network's maximal packet size. It will also demonstrate how the overhead of a GPS emulation server can be reduced in high speed networks without jeopardizing QoS guarantees or adversely impacting fairness.
{"title":"DQFS service: a tunable scheme to reduce scheduling overhead in integrated services networks","authors":"Michael S. Boykin, T. Znati","doi":"10.1109/LCN.1998.727654","DOIUrl":"https://doi.org/10.1109/LCN.1998.727654","url":null,"abstract":"Discrete service disciplines have been shown capable of emulating the ideal Generalized Processor Sharing discipline within one maximum-sized packet's transmission time. As a result, the accuracy of such schemes increases with improvements in link speed due to the corresponding reduction in packet transmission delay. However, the merits of such accuracy diminish with improvements in link speed as its impact on call admission decisions decreases. Meanwhile, overhead, in terms of the number of scheduling decisions to be made per unit time, increases with the number of packets transmitted. In response, this paper will present the DQFS service discipline which enables GPS emulation servers to dynamically \"tune\" their service quanta based upon the QoS requirements of their currently supported applications rather than the network's maximal packet size. It will also demonstrate how the overhead of a GPS emulation server can be reduced in high speed networks without jeopardizing QoS guarantees or adversely impacting fairness.","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":"114539977","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
扫码关注我们
求助内容：
应助结果提醒方式：