Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253319
A. Banerjea, S. Keshav
The problem of finding the worst-case end-to-end delay and buffer occupancy bounds in asynchronous transfer mode (ATM) networks with rate-controlled, non-work-conserving servers is addressed. A theoretical framework is constructed to analyze such servers in isolation and in tandem. The analysis is based on a simple fluid model, but care is taken so that the computed delay and buffer occupancy values are upper bounds on actual values. A single algorithm is presented to perform these calculations in linear time. Simulation results are given in order to compare the computed worst-case delays with the actual delays obtained on some simple network topologies. The algorithm is found to predict node delays well for bursty input traffic, but poorly for smooth input traffic. Buffer requirements are predicted well in both cases.<>
{"title":"Queueing delays in rate controlled ATM networks","authors":"A. Banerjea, S. Keshav","doi":"10.1109/INFCOM.1993.253319","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253319","url":null,"abstract":"The problem of finding the worst-case end-to-end delay and buffer occupancy bounds in asynchronous transfer mode (ATM) networks with rate-controlled, non-work-conserving servers is addressed. A theoretical framework is constructed to analyze such servers in isolation and in tandem. The analysis is based on a simple fluid model, but care is taken so that the computed delay and buffer occupancy values are upper bounds on actual values. A single algorithm is presented to perform these calculations in linear time. Simulation results are given in order to compare the computed worst-case delays with the actual delays obtained on some simple network topologies. The algorithm is found to predict node delays well for bursty input traffic, but poorly for smooth input traffic. Buffer requirements are predicted well in both cases.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131101970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253381
Verna J. Friesen, J. Wong
A network model is developed for studying the effect of multiplexing and switching on broadband network performance. Emphasis is placed on the queuing behavior in the network and the impact of multiplexing and switching on the burstiness of the various traffic streams. The three parameters commonly used to characterize traffic (peak bit rate, mean bit rate, and mean burst length) are also considered, and the dependence of the queuing behavior on these parameters is investigated. The performance of three congestion control schemes based on the leaky bucket algorithm is evaluated. The results provide insight into how call acceptance, bandwidth allocation, and bandwidth enforcement should be implemented in a broadband integrated services digital network (BISDN).<>
{"title":"The effect of multiplexing, switching and other factors on the performance of broadband networks","authors":"Verna J. Friesen, J. Wong","doi":"10.1109/INFCOM.1993.253381","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253381","url":null,"abstract":"A network model is developed for studying the effect of multiplexing and switching on broadband network performance. Emphasis is placed on the queuing behavior in the network and the impact of multiplexing and switching on the burstiness of the various traffic streams. The three parameters commonly used to characterize traffic (peak bit rate, mean bit rate, and mean burst length) are also considered, and the dependence of the queuing behavior on these parameters is investigated. The performance of three congestion control schemes based on the leaky bucket algorithm is evaluated. The results provide insight into how call acceptance, bandwidth allocation, and bandwidth enforcement should be implemented in a broadband integrated services digital network (BISDN).<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126659958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253241
Wen-Huei Chen, C. Tang, H. Ural
A test sequence generation method is proposed for testing the conformance of a protocol implementation to its specification in a remote testing system, taking both external synchronization and input/output operation costs into consideration. The method consists of a set of transformation rules that constructs a duplexU digraph from a given finite state machine (FSM) representation of a protocol specification and a heuristic algorithm that finds a rural postman tour in the duplexU digraph to generate a synchronizable test sequence utilizing multiple UIO sequences. If the protocol satisfies a specific property, the heuristic algorithm yields a minimum-cost test sequence. The X.25 DTE and ISO Class 0 Transport protocols are proved to possess this specific property. otherwise, the heuristic algorithm yields a test sequence whose cost is within a bound from the cost of the minimum-cost test sequence. The bound for the test sequence generated from the Q.931 Network-side protocol is shown to be the cost sum of an input/output operation and an external synchronization operation.<>
提出了一种在远程测试系统中测试协议实现是否符合规范的测试序列生成方法，同时考虑了外部同步和输入/输出操作成本。该方法由一组转换规则组成，该转换规则根据协议规范的给定有限状态机(FSM)表示构造双向图，以及一种启发式算法，该算法在双向图中查找农村邮递员之旅，以利用多个UIO序列生成可同步的测试序列。如果协议满足特定属性，则启发式算法产生最小代价测试序列。X.25 DTE和ISO Class 0传输协议已被证明具有此特定属性。否则，启发式算法产生的测试序列的代价在最小代价测试序列代价的一个范围内。由Q.931网络端协议生成的测试序列的边界显示为输入/输出操作和外部同步操作的成本总和。
{"title":"Minimum-cost synchronizable test sequence generation via the duplexU digraph","authors":"Wen-Huei Chen, C. Tang, H. Ural","doi":"10.1109/INFCOM.1993.253241","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253241","url":null,"abstract":"A test sequence generation method is proposed for testing the conformance of a protocol implementation to its specification in a remote testing system, taking both external synchronization and input/output operation costs into consideration. The method consists of a set of transformation rules that constructs a duplexU digraph from a given finite state machine (FSM) representation of a protocol specification and a heuristic algorithm that finds a rural postman tour in the duplexU digraph to generate a synchronizable test sequence utilizing multiple UIO sequences. If the protocol satisfies a specific property, the heuristic algorithm yields a minimum-cost test sequence. The X.25 DTE and ISO Class 0 Transport protocols are proved to possess this specific property. otherwise, the heuristic algorithm yields a test sequence whose cost is within a bound from the cost of the minimum-cost test sequence. The bound for the test sequence generated from the Q.931 Network-side protocol is shown to be the cost sum of an input/output operation and an external synchronization operation.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117227181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253355
Hui Zhang, D. Ferrari
The authors propose a service discipline, called the rate-controlled static-priority (RCSP) queuing discipline, that provides throughput, delay, delay jitter, and loss free guarantees in a connection-oriented packet-switching network. The RCSP queuing discipline avoids both time-framing and sorted priority queues; it achieves flexibility in the allocation of delay and bandwidth, as well as simplicity of implementation. The key idea is to separate rate-control and delay-control functions in the design of the server. Applying this separation of functions results in a class of service disciplines of which RCSP is an instance.<>
{"title":"Rate-controlled static-priority queueing","authors":"Hui Zhang, D. Ferrari","doi":"10.1109/INFCOM.1993.253355","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253355","url":null,"abstract":"The authors propose a service discipline, called the rate-controlled static-priority (RCSP) queuing discipline, that provides throughput, delay, delay jitter, and loss free guarantees in a connection-oriented packet-switching network. The RCSP queuing discipline avoids both time-framing and sorted priority queues; it achieves flexibility in the allocation of delay and bandwidth, as well as simplicity of implementation. The key idea is to separate rate-control and delay-control functions in the design of the server. Applying this separation of functions results in a class of service disciplines of which RCSP is an instance.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125464735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253305
San-qi Li, S. Chong
The fundamental limits of input rate control by specific analysis in the frequency domain are explored. Both deterministic and stochastic analyses are developed. The simple deterministic analysis helps provide knowledge about the performance tradeoff for input rate control in a high-speed network.<>
{"title":"Fundamental limits of input rate control in high speed network","authors":"San-qi Li, S. Chong","doi":"10.1109/INFCOM.1993.253305","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253305","url":null,"abstract":"The fundamental limits of input rate control by specific analysis in the frequency domain are explored. Both deterministic and stochastic analyses are developed. The simple deterministic analysis helps provide knowledge about the performance tradeoff for input rate control in a high-speed network.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132481282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253406
C. Laih, Sung-Ming Yen
A design methodology for conference-key distribution systems (CKDSs) that is based on the threshold scheme for broadcasting networks is proposed. It is shown that if a conference chairman can share a secret key with each of the other conference participants, then any threshold scheme can be used to construct a CKDS. Since there already exist many identification (ID)-based key distribution systems for two users sharing a common secret key, ID-based CKDSs can easily be constructed for broadcasting networks.<>
{"title":"On the design of conference key distribution systems for the broadcasting networks","authors":"C. Laih, Sung-Ming Yen","doi":"10.1109/INFCOM.1993.253406","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253406","url":null,"abstract":"A design methodology for conference-key distribution systems (CKDSs) that is based on the threshold scheme for broadcasting networks is proposed. It is shown that if a conference chairman can share a secret key with each of the other conference participants, then any threshold scheme can be used to construct a CKDS. Since there already exist many identification (ID)-based key distribution systems for two users sharing a common secret key, ID-based CKDSs can easily be constructed for broadcasting networks.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130277768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253308
S. Crosby
An approximate model of an asynchronous transfer mode (ATM) multiplexer is constructed and used to compare the performances of static and dynamic resource allocation schemes. Static allocation parameterizes a source at connection setup only, whereas dynamic allocation requires a source to inform the multiplexer whenever its bandwidth requirements change. A simple dynamic renegotiation protocol is analyzed, and bounds on the performance of an optimal dynamic protocol are derived. Markovian source models parameterized from working applications are used to contrast the behavior of the three control schemes.<>
{"title":"In-call renegotiation of traffic parameters","authors":"S. Crosby","doi":"10.1109/INFCOM.1993.253308","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253308","url":null,"abstract":"An approximate model of an asynchronous transfer mode (ATM) multiplexer is constructed and used to compare the performances of static and dynamic resource allocation schemes. Static allocation parameterizes a source at connection setup only, whereas dynamic allocation requires a source to inform the multiplexer whenever its bandwidth requirements change. A simple dynamic renegotiation protocol is analyzed, and bounds on the performance of an optimal dynamic protocol are derived. Markovian source models parameterized from working applications are used to contrast the behavior of the three control schemes.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132242658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253325
Jih-Shyr Yih, Chung-Sheng Li, D. Kandlur, Michael S. Yang
A buffer insertion ring with network access fairness control for gigabit LANs is proposed. The basic buffer insertion ring has the maximum spatial reuse on the multiple ring segments by allowing concurrent traffic, but it suffers from the possibility of station starvation. To solve this problem, a notion of adjustable fairness based on mutual interference between pairs of stations in bandwidth usage is defined. The adjustable fairness definition serves as a basis for conditions to trigger backpressure signals. A cooperative backpressure mechanism is invented for flow regulation. The effectiveness of the proposed network access mechanism is demonstrated by comparisons with other buffer insertion rings based on simulations.<>
{"title":"Network access fairness control for concurrent traffic in gigabit LANs","authors":"Jih-Shyr Yih, Chung-Sheng Li, D. Kandlur, Michael S. Yang","doi":"10.1109/INFCOM.1993.253325","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253325","url":null,"abstract":"A buffer insertion ring with network access fairness control for gigabit LANs is proposed. The basic buffer insertion ring has the maximum spatial reuse on the multiple ring segments by allowing concurrent traffic, but it suffers from the possibility of station starvation. To solve this problem, a notion of adjustable fairness based on mutual interference between pairs of stations in bandwidth usage is defined. The adjustable fairness definition serves as a basis for conditions to trigger backpressure signals. A cooperative backpressure mechanism is invented for flow regulation. The effectiveness of the proposed network access mechanism is demonstrated by comparisons with other buffer insertion rings based on simulations.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125161062","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253321
G. Meempat, G. Ramamurthy, B. Sengupta
The notion of perceptible degradation of quality of the received signal seen by an individual user is introduced. It is proposed that the design of high-speed networks that support real-time traffic be carried out on the basis of a new performance measure, which is defined as the expected number of perceptible degradations that a customer is likely to encounter per unit of time. By using fluid-flow models, an analytical methodology is obtained for calculating the new performance measure. The method is illustrated by representative numerical examples from voice and video traffic for various link speeds and buffer sizes.<>
{"title":"A new performance measure for statistical multiplexing: perspective of the individual source","authors":"G. Meempat, G. Ramamurthy, B. Sengupta","doi":"10.1109/INFCOM.1993.253321","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253321","url":null,"abstract":"The notion of perceptible degradation of quality of the received signal seen by an individual user is introduced. It is proposed that the design of high-speed networks that support real-time traffic be carried out on the basis of a new performance measure, which is defined as the expected number of perceptible degradations that a customer is likely to encounter per unit of time. By using fluid-flow models, an analytical methodology is obtained for calculating the new performance measure. The method is illustrated by representative numerical examples from voice and video traffic for various link speeds and buffer sizes.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115439996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253338
I. Rubin, K. Lin
An input rate flow control mechanism, the burst level feedback scheme, is introduced and studied. Burst level information is used to gain performance improvement. An analytical methodology, based on queuing models, is presented for the analysis and performance evaluation of this scheme. Performance results are shown to illustrate the features of the analytical technique and to demonstrate the performance improvement obtained by the scheme. This input rate control method is shown to be effective for traffic regulation at the access to an asynchronous transfer mode (ATM) network loaded by highly bursty stations. The analytical tools developed allow the system designer to evaluate the proper level of input regulation that should be used to guarantee acceptable queue-size and delay levels at the source station's buffer and at the buffer of the shared network switch.<>
{"title":"A burst-level adaptive input-rate flow control scheme for ATM networks","authors":"I. Rubin, K. Lin","doi":"10.1109/INFCOM.1993.253338","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253338","url":null,"abstract":"An input rate flow control mechanism, the burst level feedback scheme, is introduced and studied. Burst level information is used to gain performance improvement. An analytical methodology, based on queuing models, is presented for the analysis and performance evaluation of this scheme. Performance results are shown to illustrate the features of the analytical technique and to demonstrate the performance improvement obtained by the scheme. This input rate control method is shown to be effective for traffic regulation at the access to an asynchronous transfer mode (ATM) network loaded by highly bursty stations. The analytical tools developed allow the system designer to evaluate the proper level of input regulation that should be used to guarantee acceptable queue-size and delay levels at the source station's buffer and at the buffer of the shared network switch.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116764935","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
扫码关注我们
求助内容：
应助结果提醒方式：