Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253285
R. Addie, M. Zukerman
A method for approximating the probability distributions of stationary statistics in first-in, first-out (FIFO) single server queues is provided. The method is based on the Wiener-Hopf factorization technique and is applied to semi-Markov queues with the underlying state space of unlimited size. A particularly important case is a model for a statistical multiplexer where the net input process forms a stationary ergodic Gaussian discrete-time stochastic process.<>
{"title":"An approximation for performance evaluation of stationary single server queues","authors":"R. Addie, M. Zukerman","doi":"10.1109/INFCOM.1993.253285","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253285","url":null,"abstract":"A method for approximating the probability distributions of stationary statistics in first-in, first-out (FIFO) single server queues is provided. The method is based on the Wiener-Hopf factorization technique and is applied to semi-Markov queues with the underlying state space of unlimited size. A particularly important case is a model for a statistical multiplexer where the net input process forms a stationary ergodic Gaussian discrete-time stochastic process.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"70 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":"129813179","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.253395
W. Lau, San-qi Li
The conditions under which nodal decomposition can be applied for networkwide, multimedia traffic analysis are determined. Through extensive simulation studies of individual departure source characteristics and intersource cross-correlation at the output side of a network node, the nodal decomposition approach is validated for large-scale high-speed, integrated networks. Both homogeneous and heterogeneous traffic environments in which individual sources are modeled as various two-state/multiple-state Markov-modulated processes are considered. By applying the validated nodal decomposition approach, the problem of analyzing the performance of a multimedia network as a whole becomes tractable. Each ATM node is modeled by a queue with infinite buffers and a deterministic server.<>
{"title":"Traffic analysis in large-scale high-speed integrated networks: validation of nodal decomposition approach","authors":"W. Lau, San-qi Li","doi":"10.1109/INFCOM.1993.253395","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253395","url":null,"abstract":"The conditions under which nodal decomposition can be applied for networkwide, multimedia traffic analysis are determined. Through extensive simulation studies of individual departure source characteristics and intersource cross-correlation at the output side of a network node, the nodal decomposition approach is validated for large-scale high-speed, integrated networks. Both homogeneous and heterogeneous traffic environments in which individual sources are modeled as various two-state/multiple-state Markov-modulated processes are considered. By applying the validated nodal decomposition approach, the problem of analyzing the performance of a multimedia network as a whole becomes tractable. Each ATM node is modeled by a queue with infinite buffers and a deterministic server.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"268 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":"121156905","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.253374
C. Cranor, G. Parulkar
Recently, a number of research groups have proposed connection-oriented access protocols that can provide a variable grade of service with performance guarantees on top of diverse networks. These connection-oriented internet protocols (COIPs) have performance tradeoffs. The authors have designed a COIP kernel (COIP-K), which can be used as a toolkit to implement any of the proposed COIPs, COIP-K features module interchange and incremental software support. The COIP-K implementation and its performance characteristics are presented.<>
{"title":"An implementation model for connection-oriented internet protocols","authors":"C. Cranor, G. Parulkar","doi":"10.1109/INFCOM.1993.253374","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253374","url":null,"abstract":"Recently, a number of research groups have proposed connection-oriented access protocols that can provide a variable grade of service with performance guarantees on top of diverse networks. These connection-oriented internet protocols (COIPs) have performance tradeoffs. The authors have designed a COIP kernel (COIP-K), which can be used as a toolkit to implement any of the proposed COIPs, COIP-K features module interchange and incremental software support. The COIP-K implementation and its performance characteristics are presented.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"3 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":"130847481","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.253261
D. Tipper, J. Hammond, Sandeep Sharma, Archana Khetan, K. Balakrishnan, S. Menon
The results of a study to determine the effects of link failures on network performance are presented. The network studied is a virtual-circuit-based packet-switched wide area network. A generic queuing framework is developed to study the effect of failures, and the subsequent traffic restoration, on network performance. In general, the congestion resulting after a failure is a transient phenomenon. Hence, a numerical-method-based nonstationary queuing analysis is conducted in order to quantify the effects of failures in terms of the transient behavior of queue lengths and packet loss probabilities. A bounding relationship is developed whereby a network node can determine whether or not congestion will occur as the result of traffic restoration after a failure.<>
{"title":"An analysis of the congestion effects of link failures in wide area networks","authors":"D. Tipper, J. Hammond, Sandeep Sharma, Archana Khetan, K. Balakrishnan, S. Menon","doi":"10.1109/INFCOM.1993.253261","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253261","url":null,"abstract":"The results of a study to determine the effects of link failures on network performance are presented. The network studied is a virtual-circuit-based packet-switched wide area network. A generic queuing framework is developed to study the effect of failures, and the subsequent traffic restoration, on network performance. In general, the congestion resulting after a failure is a transient phenomenon. Hence, a numerical-method-based nonstationary queuing analysis is conducted in order to quantify the effects of failures in terms of the transient behavior of queue lengths and packet loss probabilities. A bounding relationship is developed whereby a network node can determine whether or not congestion will occur as the result of traffic restoration after a failure.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"68 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":"133888365","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.253398
G. Rouskas, M. Ammar
Single-hop lightwave networks with stations interconnected using wavelength-division multiplexing are considered. The stations are equipped with tunable transmitters and/or receivers. Coordination between the transmitting and receiving stations is achieved by assuming synchronous control and a predefined, frequency-time oriented schedule which specifies the slots and the wavelengths on which communication between any two pairs of stations is allowed to take place. The authors define and analyze, in terms of throughput, all possible types of schedules in the situation where the number of available wavelengths is equal to the number of stations. The results are valid for the general case, i.e., nonuniform traffic. The optimization of schedules, given the traffic requirements, is considered, and optimization heuristics that give near-optimal results are presented.<>
{"title":"Analysis and optimization of transmission schedules for single-hop WDM networks","authors":"G. Rouskas, M. Ammar","doi":"10.1109/INFCOM.1993.253398","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253398","url":null,"abstract":"Single-hop lightwave networks with stations interconnected using wavelength-division multiplexing are considered. The stations are equipped with tunable transmitters and/or receivers. Coordination between the transmitting and receiving stations is achieved by assuming synchronous control and a predefined, frequency-time oriented schedule which specifies the slots and the wavelengths on which communication between any two pairs of stations is allowed to take place. The authors define and analyze, in terms of throughput, all possible types of schedules in the situation where the number of available wavelengths is equal to the number of stations. The results are valid for the general case, i.e., nonuniform traffic. The optimization of schedules, given the traffic requirements, is considered, and optimization heuristics that give near-optimal results are presented.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"117 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":"131602658","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.253329
Jean-François P. Labourdette, A. Acampora
A practical approach to the analysis and operation of medium to large-size distributed asynchronous transfer mode (ATM) switches based on an original optical reconfigurable architecture is described. The optical nature of the switch provides enormous bandwidth with input/output port rates on the order of gigabits/second, and the distributed approach is highly modular, creating an easily growable switch. The interconnection pattern between input and output ports is dynamically reconfigurable; the switch can thus exploit nonuniformities in the offered traffic and optimize its connectivity accordingly. For a 24*24 switch, this leads to performance that matches that of a fully connected output buffered ideal centralized switch. Simulation results for a switch of size 81*81 seem to indicate that the traffic-handling capability scales well with the size of the switch when nonuniformity prevails in the offered traffic, a realistic assumption. Clustering techniques would permit the optimization and operation of much larger reconfigurable distributed ATM switches.<>
{"title":"Logical clustering for the optimization and analysis of a rearrangeable distributed ATM switch","authors":"Jean-François P. Labourdette, A. Acampora","doi":"10.1109/INFCOM.1993.253329","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253329","url":null,"abstract":"A practical approach to the analysis and operation of medium to large-size distributed asynchronous transfer mode (ATM) switches based on an original optical reconfigurable architecture is described. The optical nature of the switch provides enormous bandwidth with input/output port rates on the order of gigabits/second, and the distributed approach is highly modular, creating an easily growable switch. The interconnection pattern between input and output ports is dynamically reconfigurable; the switch can thus exploit nonuniformities in the offered traffic and optimize its connectivity accordingly. For a 24*24 switch, this leads to performance that matches that of a fully connected output buffered ideal centralized switch. Simulation results for a switch of size 81*81 seem to indicate that the traffic-handling capability scales well with the size of the switch when nonuniformity prevails in the offered traffic, a realistic assumption. Clustering techniques would permit the optimization and operation of much larger reconfigurable distributed ATM switches.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"3 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":"131016741","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.253349
J. Bannister, M. Gerla, M. Kovacevic
Given that many optical fibers can be economically packaged within a single cable, the design of communication networks that exploit multifiber topologies is considered. A network architecture that uses the multifiber tree topology to provide high-speed datagram and circuit-switching communication services to a large population of stations is presented. Using a combination of space-, wavelength-, and time-division multiplexing, this network architecture provides all-optical transmission media to its stations and can interconnect several thousand stations in a metropolitan region without the need for optical amplification or electrooptical signal regeneration.<>
{"title":"An all-optical multifiber tree network","authors":"J. Bannister, M. Gerla, M. Kovacevic","doi":"10.1109/INFCOM.1993.253349","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253349","url":null,"abstract":"Given that many optical fibers can be economically packaged within a single cable, the design of communication networks that exploit multifiber topologies is considered. A network architecture that uses the multifiber tree topology to provide high-speed datagram and circuit-switching communication services to a large population of stations is presented. Using a combination of space-, wavelength-, and time-division multiplexing, this network architecture provides all-optical transmission media to its stations and can interconnect several thousand stations in a metropolitan region without the need for optical amplification or electrooptical signal regeneration.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"24 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":"115032580","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.253315
K. Lee, V. Li
A wavelength-convertible switch architecture and routing algorithm for circuit-switched wavelength-division-multiplexing optical networks is studied. Wavelength converters are used to resolve wavelength conflicts and to reuse wavelengths. These converters are not dedicated to individual channels, but are shared by the channels of a node or those of an outbound link in the share-per-node or the share-per-link wavelength-convertible switch, respectively. A routing algorithm is developed to converse wavelength converters while maintaining performance close to that of a network with abundant converters. It is found that converters can improve the network performance, such as the blocking probability and fairness, considerably.<>
{"title":"Routing and switching in a wavelength convertible optical network","authors":"K. Lee, V. Li","doi":"10.1109/INFCOM.1993.253315","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253315","url":null,"abstract":"A wavelength-convertible switch architecture and routing algorithm for circuit-switched wavelength-division-multiplexing optical networks is studied. Wavelength converters are used to resolve wavelength conflicts and to reuse wavelengths. These converters are not dedicated to individual channels, but are shared by the channels of a node or those of an outbound link in the share-per-node or the share-per-link wavelength-convertible switch, respectively. A routing algorithm is developed to converse wavelength converters while maintaining performance close to that of a network with abundant converters. It is found that converters can improve the network performance, such as the blocking probability and fairness, considerably.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"99 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":"121766758","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.253253
Hong-Dah Sheng, San-qi Li
A wideband source in high speed networks is typically represented by a binary random process. The second-order properties of each binary source are characterized here by a multistate Markov-modulated Poisson process. A comprehensive numerical study is carried out to identify the individual effect of source second-order dynamics on queue length and loss rate. The concept of input power spectrum is then developed as a unified source measurement for multimedia traffic queuing analyses. The authors thoroughly explore the relationship between the source second-order dynamics in the time domain and the input power spectrum in the frequency domain, as well as its overall impact on system performance.<>
{"title":"Second order effect of binary sources on characteristics of queue and loss rate","authors":"Hong-Dah Sheng, San-qi Li","doi":"10.1109/INFCOM.1993.253253","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253253","url":null,"abstract":"A wideband source in high speed networks is typically represented by a binary random process. The second-order properties of each binary source are characterized here by a multistate Markov-modulated Poisson process. A comprehensive numerical study is carried out to identify the individual effect of source second-order dynamics on queue length and loss rate. The concept of input power spectrum is then developed as a unified source measurement for multimedia traffic queuing analyses. The authors thoroughly explore the relationship between the source second-order dynamics in the time domain and the input power spectrum in the frequency domain, as well as its overall impact on system performance.<<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":"114759033","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
扫码关注我们
求助内容：
应助结果提醒方式：