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.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.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.253380
N. Taft, P. Varaiya
A system which uses multiple asynchronous transfer mode (ATM) virtual circuits operating in parallel in order to control two WAN hosts at gigabit speeds is studied. Packets in parallel channels can bypass each other, so reordering of packets before delivery to the host is required. Performance parameters of this system, including ATM channel delay, packet loss, and resequencing delay, are analyzed, using a model for an ATM channel that multiplexes ATM virtual circuits carrying bursty and nonbursty traffic. It is found that the mean and variance of packet delay through an ATM switch grow linearly with burst size, and that the delay distribution can be closely approximated by a normal distribution. It is shown that packet loss is log-linear in the ratio of buffer size to burst size, and for maximum bursts larger than 50 cells, a buffer size of twice the maximum burst size is sufficient to achieve packet loss probabilities less than 10/sup -9/. Resequencing delay is shown to be insensitive to burst size, but the variance is large and grows linearly with burst size.<>
{"title":"Performance analysis of parallel ATM connections for gigabit speed applications","authors":"N. Taft, P. Varaiya","doi":"10.1109/INFCOM.1993.253380","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253380","url":null,"abstract":"A system which uses multiple asynchronous transfer mode (ATM) virtual circuits operating in parallel in order to control two WAN hosts at gigabit speeds is studied. Packets in parallel channels can bypass each other, so reordering of packets before delivery to the host is required. Performance parameters of this system, including ATM channel delay, packet loss, and resequencing delay, are analyzed, using a model for an ATM channel that multiplexes ATM virtual circuits carrying bursty and nonbursty traffic. It is found that the mean and variance of packet delay through an ATM switch grow linearly with burst size, and that the delay distribution can be closely approximated by a normal distribution. It is shown that packet loss is log-linear in the ratio of buffer size to burst size, and for maximum bursts larger than 50 cells, a buffer size of twice the maximum burst size is sufficient to achieve packet loss probabilities less than 10/sup -9/. Resequencing delay is shown to be insensitive to burst size, but the variance is large and grows linearly with burst size.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"316 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":"128641628","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.253384
S. Biswas
A hybrid model is used to evaluate the end-to-end performance of a multihop packet radio LAN, operating under a window based flow control mechanism. The model consists of radio data-link layer, transport layer, and application layer queuing representations. The radio data-link layer is modeled by using a simulator, written for a specific CSMA-type channel access algorithm. A multichain closed queuing network for the virtual circuit based end-to-end model is solved using an approximate mean value analysis (MVA) algorithm with modified convergence schemes. Network performance measures such as end-to-end delivery delay and throughput are computed from the analysis of the hybrid model. How the network bottleneck drifts around the network with varying application service times of the terminal radio stations is studied.<>
{"title":"Performance modeling of window based flow control in a multihop packet radio LAN","authors":"S. Biswas","doi":"10.1109/INFCOM.1993.253384","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253384","url":null,"abstract":"A hybrid model is used to evaluate the end-to-end performance of a multihop packet radio LAN, operating under a window based flow control mechanism. The model consists of radio data-link layer, transport layer, and application layer queuing representations. The radio data-link layer is modeled by using a simulator, written for a specific CSMA-type channel access algorithm. A multichain closed queuing network for the virtual circuit based end-to-end model is solved using an approximate mean value analysis (MVA) algorithm with modified convergence schemes. Network performance measures such as end-to-end delivery delay and throughput are computed from the analysis of the hybrid model. How the network bottleneck drifts around the network with varying application service times of the terminal radio stations is studied.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"274 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":"122952175","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.253334
M. S. Corson, A. Ephremides
An architecture for incorporating mobile data users into an existing MAP/TOP (Manufacturing Automation Protocol/Technical and Office Protocol) system is presented. The scheme attaches a small number of radio base stations to the TOP network through which the mobiles may access the system by executing a capture-based, multi-receiver extension of the traditional nonadaptive slotted Aloha protocol. A two-component capture model motivated by the factory channel is developed, and the multireceiver system's throughput performance is analyzed under two transmission models: base location independent and spatially correlated. It is seen that there is significant throughput degradation when base coverage areas overlap, indicating that this overlap should be minimized during system design.<>
{"title":"An analysis of multi-receiver, non-adaptive, slotted Aloha with capture for wireless communications in factories","authors":"M. S. Corson, A. Ephremides","doi":"10.1109/INFCOM.1993.253334","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253334","url":null,"abstract":"An architecture for incorporating mobile data users into an existing MAP/TOP (Manufacturing Automation Protocol/Technical and Office Protocol) system is presented. The scheme attaches a small number of radio base stations to the TOP network through which the mobiles may access the system by executing a capture-based, multi-receiver extension of the traditional nonadaptive slotted Aloha protocol. A two-component capture model motivated by the factory channel is developed, and the multireceiver system's throughput performance is analyzed under two transmission models: base location independent and spatially correlated. It is seen that there is significant throughput degradation when base coverage areas overlap, indicating that this overlap should be minimized during system design.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"15 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":"129188849","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.253247
Rosario Aiello, E. Pagani, G. P. Rossi
A multicast protocol that is independent of the subnetwork and can operate on the top of a basic datagram network is described. The protocol provides reliable communication among the members of a group nd guarantees that each message sent to a group G is delivered to all active, i.e. both correct and faulty, processes in G or to none of them, and that all the members of G consistently decide on the same progressive order to process messages. The focus is mainly on the design of the protocol. The protocol architecture to which it belongs is described, and some simulation results are given. An outline of the protocol algorithm, which uses a centralized approach based on the rotating coordinator paradigm, allows processes to asynchronously decide on a given value, and recovers processes from failures through history buffers, is also given.<>
{"title":"Design of a reliable multicast protocol","authors":"Rosario Aiello, E. Pagani, G. P. Rossi","doi":"10.1109/INFCOM.1993.253247","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253247","url":null,"abstract":"A multicast protocol that is independent of the subnetwork and can operate on the top of a basic datagram network is described. The protocol provides reliable communication among the members of a group nd guarantees that each message sent to a group G is delivered to all active, i.e. both correct and faulty, processes in G or to none of them, and that all the members of G consistently decide on the same progressive order to process messages. The focus is mainly on the design of the protocol. The protocol architecture to which it belongs is described, and some simulation results are given. An outline of the protocol algorithm, which uses a centralized approach based on the rotating coordinator paradigm, allows processes to asynchronously decide on a given value, and recovers processes from failures through history buffers, is also given.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"17 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":"129033036","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
扫码关注我们
求助内容：
应助结果提醒方式：