Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253394
F. Yegenoglu, B. Jabbari
The performance of an asynchronous transfer mode (ATM) multiplexer is evaluated, with the aggregate arrivals modeled as a Markov-modulated Poisson process (MMPP). The analysis is based on two simplifying assumptions: the probability that the MMPP goes through multiple state transitions between two successive departures is negligible, and state transitions occur at departure points. The transition probability matrix that describes the number of cells in the buffer after a departure can then be partitioned into submatrices, each of which is analogous to that of an M/D/1/K queue. These assumptions are reasonable for ATM traffic models in which the arrival rates are large and cell size is small. The accuracy of the analysis is evaluated, using a four-state MMPP model to represent the aggregate arrival process. The departure point and arrival point queue-length distributions, cell loss probabilities and average queuing delays are obtained analytically and compared to simulation results.<>
{"title":"Performance evaluation of MMPP/D/1/K queues for aggregate ATM traffic models","authors":"F. Yegenoglu, B. Jabbari","doi":"10.1109/INFCOM.1993.253394","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253394","url":null,"abstract":"The performance of an asynchronous transfer mode (ATM) multiplexer is evaluated, with the aggregate arrivals modeled as a Markov-modulated Poisson process (MMPP). The analysis is based on two simplifying assumptions: the probability that the MMPP goes through multiple state transitions between two successive departures is negligible, and state transitions occur at departure points. The transition probability matrix that describes the number of cells in the buffer after a departure can then be partitioned into submatrices, each of which is analogous to that of an M/D/1/K queue. These assumptions are reasonable for ATM traffic models in which the arrival rates are large and cell size is small. The accuracy of the analysis is evaluated, using a four-state MMPP model to represent the aggregate arrival process. The departure point and arrival point queue-length distributions, cell loss probabilities and average queuing delays are obtained analytically and compared to simulation results.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"54 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":"127569938","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.253264
J. Spinelli
It is shown that implementing self-stabilizing versions of standard ARQ (automatic-repeat-request) protocols, such as stop-and-wait or go-back-n, would require knowledge of a bound on the maximum delay or maximum memory of the communication channel involved. An alternative approach to self-stabilizing ARQ that incorporates a delay or memory bound directly as part of the communication model is given. Two ARQ protocols are presented that self-stabilize by using one bit of overhead in each transmitted message. The protocols operate exactly like standard stop-and-wait ARQ except that when a fault places them in an incorrect (unsafe) state, the additional bit in the protocol messages allows automatic recovery.<>
{"title":"Self-stabilizing ARQ on channels with bounded memory or bounded delay","authors":"J. Spinelli","doi":"10.1109/INFCOM.1993.253264","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253264","url":null,"abstract":"It is shown that implementing self-stabilizing versions of standard ARQ (automatic-repeat-request) protocols, such as stop-and-wait or go-back-n, would require knowledge of a bound on the maximum delay or maximum memory of the communication channel involved. An alternative approach to self-stabilizing ARQ that incorporates a delay or memory bound directly as part of the communication model is given. Two ARQ protocols are presented that self-stabilize by using one bit of overhead in each transmitted message. The protocols operate exactly like standard stop-and-wait ARQ except that when a fault places them in an incorrect (unsafe) state, the additional bit in the protocol messages allows automatic recovery.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"47 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":"127536058","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.253283
K. Sohraby, A. E. Eckberg
In many applications certain parameters of a system should be set on the basis of some large percentiles of a delay random variable, for which the characteristics may not be known or may change slowly with time. Assuming that sample values of delays are available sequentially, the authors obtain a simple algorithm to track two key statistical characteristics of the delay. Any high percentile then may be approximated as a simple linear function of these parameters. The approach is based on a quasi-exponential assumption concerning the delays.<>
{"title":"Real-time high percentile tracking of quasi-exponential delays","authors":"K. Sohraby, A. E. Eckberg","doi":"10.1109/INFCOM.1993.253283","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253283","url":null,"abstract":"In many applications certain parameters of a system should be set on the basis of some large percentiles of a delay random variable, for which the characteristics may not be known or may change slowly with time. Assuming that sample values of delays are available sequentially, the authors obtain a simple algorithm to track two key statistical characteristics of the delay. Any high percentile then may be approximated as a simple linear function of these parameters. The approach is based on a quasi-exponential assumption concerning the delays.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"61 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":"121266745","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.253297
A. Campbell, G. Coulson, Francisco J. García, D. Hutchison, H. Leopold
The integration of distributed multimedia systems around the unifying theme of quality of service (QOS) is addressed. A set of key QOS requirements is presented and mapped onto a provisional QOS architecture (QOS-A) that has emerged from a experimental system designed and implemented at Lancaster. The scope of the discussion is limited to aspects of a QOS-A for the support of continuous media communications. Also, the focus is on asynchronous transfer mode (ATM) at the network layer rather than the full range of multiservice networks. Functions and mechanisms for QOS support are examined and placed within the evolving QOS-A.<>
{"title":"Integrated quality of service for multimedia communications","authors":"A. Campbell, G. Coulson, Francisco J. García, D. Hutchison, H. Leopold","doi":"10.1109/INFCOM.1993.253297","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253297","url":null,"abstract":"The integration of distributed multimedia systems around the unifying theme of quality of service (QOS) is addressed. A set of key QOS requirements is presented and mapped onto a provisional QOS architecture (QOS-A) that has emerged from a experimental system designed and implemented at Lancaster. The scope of the discussion is limited to aspects of a QOS-A for the support of continuous media communications. Also, the focus is on asynchronous transfer mode (ATM) at the network layer rather than the full range of multiservice networks. Functions and mechanisms for QOS support are examined and placed within the evolving QOS-A.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"43 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":"128673696","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.253350
Xiaoqiang Chen
The performance of connection admission control is analyzed on the basis of the single-class, single-queue scheme with input consisting of statistically identical on-off traffic sources, each modeled by an IPP process. The scheme known as the MMPP/G/1/K queue is first analyzed exactly. The computational complexity associated with the exact analysis becomes intolerable for increasing dimensionality of both buffer space and number of traffic sources, so a computationally simple approximation for the model, using a quasi-stationary approximation technique, is proposed. The validity of this approximation is examined through the transient analysis of the underlying state process. Numerical results illustrate the effectiveness of the quasi-stationary approximation and provide insight into the system performance.<>
{"title":"Modeling connection admission control","authors":"Xiaoqiang Chen","doi":"10.1109/INFCOM.1993.253350","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253350","url":null,"abstract":"The performance of connection admission control is analyzed on the basis of the single-class, single-queue scheme with input consisting of statistically identical on-off traffic sources, each modeled by an IPP process. The scheme known as the MMPP/G/1/K queue is first analyzed exactly. The computational complexity associated with the exact analysis becomes intolerable for increasing dimensionality of both buffer space and number of traffic sources, so a computationally simple approximation for the model, using a quasi-stationary approximation technique, is proposed. The validity of this approximation is examined through the transient analysis of the underlying state process. Numerical results illustrate the effectiveness of the quasi-stationary approximation and provide insight into the system performance.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"21 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":"129056264","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.253408
L. Lewis
Most fault resolution systems for communications networks represent fault resolution expertise using a rule-based reasoning (RBR) paradigm. Although the RBR paradigm is appropriate for problem-solving tasks that are confined and well-understood, its limitations are an inability to learn from experience, an inability to deal with novel problems, and the difficulty of updating the systems to keep up with rapidly changing domains such as expanding heterogeneous networks. A case-based reasoning (CBR) application that is less constrained by these limitations is described. The approach taken is to enhance a standard fault management system with a CBR component, CBR techniques for retrieving, adapting, and embedding knowledge in a case library are reviewed, and CRITTER, a CBR trouble ticketing system for managing and resolving network faults, is described.<>
{"title":"A case-based reasoning approach to the management of faults in communication networks","authors":"L. Lewis","doi":"10.1109/INFCOM.1993.253408","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253408","url":null,"abstract":"Most fault resolution systems for communications networks represent fault resolution expertise using a rule-based reasoning (RBR) paradigm. Although the RBR paradigm is appropriate for problem-solving tasks that are confined and well-understood, its limitations are an inability to learn from experience, an inability to deal with novel problems, and the difficulty of updating the systems to keep up with rapidly changing domains such as expanding heterogeneous networks. A case-based reasoning (CBR) application that is less constrained by these limitations is described. The approach taken is to enhance a standard fault management system with a CBR component, CBR techniques for retrieving, adapting, and embedding knowledge in a case library are reviewed, and CRITTER, a CBR trouble ticketing system for managing and resolving network faults, is described.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"43 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":"115995655","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.253265
V. Rutenburg, R. Ogier
Link-state updating in communication networks undergoing topological changes is addressed. It is concluded that the best way of disseminating link-state information is through event-driven (ED) updating, and it is shown how to overcome the traditional drawbacks of ED updating. An efficient algorithm that extracts the maximum implicit information from ED topology updates by computing the latest time for which each processing node can be certain of the state of each network link is given. It is shown that the information obtained is equivalent to that obtained by continuous flooding of link-state information. A method that allows each node to refresh the above information continuously without running the algorithm more than once for each received update is presented, as is an approximate version of the algorithm that reduces communication overhead by limiting the radii of propagation.<>
{"title":"How to extract maximum information from event-driven topology updates","authors":"V. Rutenburg, R. Ogier","doi":"10.1109/INFCOM.1993.253265","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253265","url":null,"abstract":"Link-state updating in communication networks undergoing topological changes is addressed. It is concluded that the best way of disseminating link-state information is through event-driven (ED) updating, and it is shown how to overcome the traditional drawbacks of ED updating. An efficient algorithm that extracts the maximum implicit information from ED topology updates by computing the latest time for which each processing node can be certain of the state of each network link is given. It is shown that the information obtained is equivalent to that obtained by continuous flooding of link-state information. A method that allows each node to refresh the above information continuously without running the algorithm more than once for each received update is presented, as is an approximate version of the algorithm that reduces communication overhead by limiting the radii of propagation.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"57 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":"117316634","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.253306
Hyeog-In Kwon, Arnon Tubtiang, G. Pujolle
A simple flow control mechanism, called RCT (rate control for end-to-end transport), is proposed for end-to-end transport in an asynchronous transfer mode (ATM) network. It reacts to instantaneous internal congestion as determined by the measured overload period. Transmission rate is adjusted by means of an adaptive window flow control mechanism that uses multiplicative decrease and linear increase algorithms. The RCT shows acceptable performance when the average round trip delay and the variance of the average value are small.<>
{"title":"A simple flow control mechanism in ATM network with end to end transport","authors":"Hyeog-In Kwon, Arnon Tubtiang, G. Pujolle","doi":"10.1109/INFCOM.1993.253306","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253306","url":null,"abstract":"A simple flow control mechanism, called RCT (rate control for end-to-end transport), is proposed for end-to-end transport in an asynchronous transfer mode (ATM) network. It reacts to instantaneous internal congestion as determined by the measured overload period. Transmission rate is adjusted by means of an adaptive window flow control mechanism that uses multiplicative decrease and linear increase algorithms. The RCT shows acceptable performance when the average round trip delay and the variance of the average value are small.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"128 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":"115753935","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.253255
S. Low, P. Varaiya
A framework for studying a stream of traffic or a message as it is transferred over an asynchronous transfer mode (ATM) connection was previously proposed by the authors (1991). A message is modeled as a deterministic fluid flow, and an ATM node is modeled as a server that allocates bandwidth among concurrent messages. The key concept is that of the burstiness curve of an incoming message, which gives the buffer size needed if the message is served at rate mu . It is shown there that the fixed rate, the leaky bucket, and the affine server are burst reducing. The burstiness bound for each of these servers is presented. A sequence of identical affine servers is related to a fixed rate server, and it is suggested how quality-of-service parameters can usefully be based on the burstiness curve.<>
{"title":"Burstiness bounds for some burst reducing servers","authors":"S. Low, P. Varaiya","doi":"10.1109/INFCOM.1993.253255","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253255","url":null,"abstract":"A framework for studying a stream of traffic or a message as it is transferred over an asynchronous transfer mode (ATM) connection was previously proposed by the authors (1991). A message is modeled as a deterministic fluid flow, and an ATM node is modeled as a server that allocates bandwidth among concurrent messages. The key concept is that of the burstiness curve of an incoming message, which gives the buffer size needed if the message is served at rate mu . It is shown there that the fixed rate, the leaky bucket, and the affine server are burst reducing. The burstiness bound for each of these servers is presented. A sequence of identical affine servers is related to a fixed rate server, and it is suggested how quality-of-service parameters can usefully be based on the burstiness curve.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"229 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":"126984193","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.253301
R. Cohen, A. Segall
A media access control protocol, called the multiple token protocol, for high-speed ring networks is described. Its purpose is to increase the throughput under a heavy load and to decrease the access delay under a light load of the token-ring protocol. The protocol maintains several logical token rings in the single physical ring. The number of logical rings can be changed dynamically by the ring stations according to the actual ring load. Each logical ring has its own token, and its operation is close to a token ring with early-token-release and destination removal. Multiple tokens enable multiple simultaneous transmissions of new frames by different stations and decrease the waiting for a token delay.<>
{"title":"Multiple logical token-rings in a single high-speed ring","authors":"R. Cohen, A. Segall","doi":"10.1109/INFCOM.1993.253301","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253301","url":null,"abstract":"A media access control protocol, called the multiple token protocol, for high-speed ring networks is described. Its purpose is to increase the throughput under a heavy load and to decrease the access delay under a light load of the token-ring protocol. The protocol maintains several logical token rings in the single physical ring. The number of logical rings can be changed dynamically by the ring stations according to the actual ring load. Each logical ring has its own token, and its operation is close to a token ring with early-token-release and destination removal. Multiple tokens enable multiple simultaneous transmissions of new frames by different stations and decrease the waiting for a token delay.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"4 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":"124305040","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
扫码关注我们
求助内容：
应助结果提醒方式：