The traffic characteristics of the switched multi-megabit data service (SMDS) are examined. SMDS is a connectionless public packet switched service which will be available initially at DS1 (1.544 Mb/s) and DS3 (44.736 Mb/s) rates, and later at OCn rates. Results of a technology test on an SMDS network that carried many different types of applications ranging from LAN-type data traffic to medical imaging are presented. The characteristics of the traffic on this SMDS network are reviewed. Using these traffic data, several important characteristics for SMDS and broadband traffic in general are identified.<>
{"title":"A look at the traffic characteristics of the first broadband service","authors":"G. C. Hudek","doi":"10.1109/ICC.1992.267944","DOIUrl":"https://doi.org/10.1109/ICC.1992.267944","url":null,"abstract":"The traffic characteristics of the switched multi-megabit data service (SMDS) are examined. SMDS is a connectionless public packet switched service which will be available initially at DS1 (1.544 Mb/s) and DS3 (44.736 Mb/s) rates, and later at OCn rates. Results of a technology test on an SMDS network that carried many different types of applications ranging from LAN-type data traffic to medical imaging are presented. The characteristics of the traffic on this SMDS network are reviewed. Using these traffic data, several important characteristics for SMDS and broadband traffic in general are identified.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114235982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The objective of call admission control is to keep the network load moderate to achieve a performance objective associated with quality of services. In asynchronous transfer mode (ATM) networks, the cell loss rate is more sensitive to offered load than the queueing delay. Therefore, call admission control in ATM networks should be cell loss rate sensitive. The author proposes and evaluates a call admission control method which can be applied to the priority control case. The proposed method is suitable for real time operation even in a multimedia case, because the amount of calculation for call admission control is reduced considerably compared to conventional techniques and does not increase in the multimedia case. The method uses a probability density function for the number of cells transferred from multiplexed cells and uses recursive equations in estimating cell loss rate.<>
{"title":"Call admission control method in ATM networks","authors":"H. Esaki","doi":"10.1109/ICC.1992.268017","DOIUrl":"https://doi.org/10.1109/ICC.1992.268017","url":null,"abstract":"The objective of call admission control is to keep the network load moderate to achieve a performance objective associated with quality of services. In asynchronous transfer mode (ATM) networks, the cell loss rate is more sensitive to offered load than the queueing delay. Therefore, call admission control in ATM networks should be cell loss rate sensitive. The author proposes and evaluates a call admission control method which can be applied to the priority control case. The proposed method is suitable for real time operation even in a multimedia case, because the amount of calculation for call admission control is reduced considerably compared to conventional techniques and does not increase in the multimedia case. The method uses a probability density function for the number of cells transferred from multiplexed cells and uses recursive equations in estimating cell loss rate.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116002306","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}
A N*N switching element with output queueing, as used in a large asynchronous transfer mode (ATM) switching network, is considered. All the inlets of the switching elements are synchronized on minislots, where a minislot is the fixed-length time unit for transmission of one minicell. When entering the network, an ATM cell is converted into a minicell train, consisting of a fixed number of minicells. Using a two-state model, it is assumed that on each inlet, the number of minicell trains in an active period and the length of a silence period are both geometrically distributed, and the arriving minicell trains are uniformly distributed among all the outlets. The performance of the switching element can thus be obtained by analyzing one single output queue, which can be modeled as a discrete-time single-server queue with train arrivals. An upper bound and an approximate expression for the mean queue length are derived. An analytical method to obtain an upper bound and an approximation for the tail distribution of the queue length are presented. A comparison with simulation results shows that this upper bound is very tight.<>
{"title":"Approximate analytic performance study of an ATM switching element with train arrivals","authors":"Y. Xiong, H. Bruneel","doi":"10.1109/ICC.1992.268019","DOIUrl":"https://doi.org/10.1109/ICC.1992.268019","url":null,"abstract":"A N*N switching element with output queueing, as used in a large asynchronous transfer mode (ATM) switching network, is considered. All the inlets of the switching elements are synchronized on minislots, where a minislot is the fixed-length time unit for transmission of one minicell. When entering the network, an ATM cell is converted into a minicell train, consisting of a fixed number of minicells. Using a two-state model, it is assumed that on each inlet, the number of minicell trains in an active period and the length of a silence period are both geometrically distributed, and the arriving minicell trains are uniformly distributed among all the outlets. The performance of the switching element can thus be obtained by analyzing one single output queue, which can be modeled as a discrete-time single-server queue with train arrivals. An upper bound and an approximate expression for the mean queue length are derived. An analytical method to obtain an upper bound and an approximation for the tail distribution of the queue length are presented. A comparison with simulation results shows that this upper bound is very tight.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"636 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116480308","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}
In Voronoi constellations, the Voronoi region of a lattice, called the shaping lattice, is used as the boundary of the signal constellation. Some properties of Voronoi constellations based on the shaping lattices D/sub N/ and D/sub N/* are discussed. The induced probability distribution on the two-dimensional subspaces is found. A prefix coding scheme as an alternative for the addressing is presented. This code in some sense simulates the effect of the boundary by using the points of the subspaces with nonequal probability. An example of such a coding scheme is presented.<>
{"title":"Using a prefix code for addressing the Voronoi constellations based on lattices D/sub N/ and D/sub N/*","authors":"A. Khandani, P. Kabal","doi":"10.1109/ICC.1992.268110","DOIUrl":"https://doi.org/10.1109/ICC.1992.268110","url":null,"abstract":"In Voronoi constellations, the Voronoi region of a lattice, called the shaping lattice, is used as the boundary of the signal constellation. Some properties of Voronoi constellations based on the shaping lattices D/sub N/ and D/sub N/* are discussed. The induced probability distribution on the two-dimensional subspaces is found. A prefix coding scheme as an alternative for the addressing is presented. This code in some sense simulates the effect of the boundary by using the points of the subspaces with nonequal probability. An example of such a coding scheme is presented.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114891969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The performances of the replicated and the dilated banyan networks, which are being considered for use in broadband packet switch architectures, are analyzed. A strong argument is made for comparing the performances of the various multipath networks using the assumption that multiple packets can be accepted at any destination. Multipath banyan networks with one internal buffer in each switching element are also studied.<>
{"title":"Performance analysis off multipath banyan networks","authors":"R. Venkatesan, H.T. Moutfah","doi":"10.1109/ICC.1992.268154","DOIUrl":"https://doi.org/10.1109/ICC.1992.268154","url":null,"abstract":"The performances of the replicated and the dilated banyan networks, which are being considered for use in broadband packet switch architectures, are analyzed. A strong argument is made for comparing the performances of the various multipath networks using the assumption that multiple packets can be accepted at any destination. Multipath banyan networks with one internal buffer in each switching element are also studied.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116682430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The bandwidth domination problem (BDP) in the distributed queue dual bus (DQDB) medium access control (MAC) protocol could occur if the network bandwidth is dominated by a single node when it is active early and other nodes having heavy traffic demands are active later. The priority domination problem (PDP) is the problem that the network bandwidth may be dominated by an upstream node with lower priority when it is active early and other nodes with higher priorities are active later. To solve the BDP a mechanism is provided such that the bandwidth can be shared among all active nodes. To solve the PDP a mechanism is provided such that nodes with higher priority can capture all the bandwidth. The authors propose two adaptive algorithms to solve the BDP and a priority mechanism to solve the PDP. The adaptive algorithms and priority mechanism were evaluated by simulation. It is also shown that if the adaptive algorithms and priority mechanism are combined together, then the nodes with highest priority can use all the bandwidth and the bandwidth can be balanced among these nodes rapidly.<>
{"title":"Solving bandwidth and priority domination problems of DQDB metropolitan area networks","authors":"N.-F. Huang, S.-T. Sheu","doi":"10.1109/ICC.1992.268143","DOIUrl":"https://doi.org/10.1109/ICC.1992.268143","url":null,"abstract":"The bandwidth domination problem (BDP) in the distributed queue dual bus (DQDB) medium access control (MAC) protocol could occur if the network bandwidth is dominated by a single node when it is active early and other nodes having heavy traffic demands are active later. The priority domination problem (PDP) is the problem that the network bandwidth may be dominated by an upstream node with lower priority when it is active early and other nodes with higher priorities are active later. To solve the BDP a mechanism is provided such that the bandwidth can be shared among all active nodes. To solve the PDP a mechanism is provided such that nodes with higher priority can capture all the bandwidth. The authors propose two adaptive algorithms to solve the BDP and a priority mechanism to solve the PDP. The adaptive algorithms and priority mechanism were evaluated by simulation. It is also shown that if the adaptive algorithms and priority mechanism are combined together, then the nodes with highest priority can use all the bandwidth and the bandwidth can be balanced among these nodes rapidly.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121570295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The MetaRing architecture is a full-duplex ring with fairness and spatial reuse. The authors describe a protocol for integrating two types of traffic on the MetaRing: synchronous or real-time traffic which is periodic and requires a connection set-up and will have guaranteed bandwidth and bounded delay; and connectionless or asynchronous traffic with no real-time constraints that can use the remainder of the bandwidth. The integration mechanism is functionally equivalent to the function in the fiber distributed data interface (FDDI). However, unlike FDDI, it guarantees round-robin fairness among nodes with asynchronous traffic and has spatial reuse. A Markovian state space formulation of the network is given. This formulation was used for an efficient simulation of the network with an arbitrary number of nodes. An upper bound on the delay of the synchronous data is also presented.<>
{"title":"Integration of synchronous and asynchronous traffic on the MetaRing architecture and its analysis","authors":"H.-T. Wu, Y. Ofek, K. Sohraby","doi":"10.1109/ICC.1992.268272","DOIUrl":"https://doi.org/10.1109/ICC.1992.268272","url":null,"abstract":"The MetaRing architecture is a full-duplex ring with fairness and spatial reuse. The authors describe a protocol for integrating two types of traffic on the MetaRing: synchronous or real-time traffic which is periodic and requires a connection set-up and will have guaranteed bandwidth and bounded delay; and connectionless or asynchronous traffic with no real-time constraints that can use the remainder of the bandwidth. The integration mechanism is functionally equivalent to the function in the fiber distributed data interface (FDDI). However, unlike FDDI, it guarantees round-robin fairness among nodes with asynchronous traffic and has spatial reuse. A Markovian state space formulation of the network is given. This formulation was used for an efficient simulation of the network with an arbitrary number of nodes. An upper bound on the delay of the synchronous data is also presented.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125018830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The authors investigate self-healing ring networks that utilize wavelength-division multiplexing (WDM) to provide survivable transport without the need for high-speed electronic add-drop multiplexers. They propose three specific multiwavelength ring networks, two designed for consolidation of switching resources at a single node on the ring, and one that supports symmetrical interconnection between all pairs of nodes. The maximum number of nodes and the maximum total capacity for the three networks are compared, as governed by the characteristics of the optical amplifiers and WDM techniques employed. It is found that all three networks are capable of supporting on the order of ten or more nodes with throughputs of 2.5 Gb/s to 10 Gb/s per node. The descriptions of the proposed networks assume an interoffice-network application, in which the nodes on the ring are central offices.<>
{"title":"Multiwavelength ring networks for switch consolidation and interconnection","authors":"S. Wagner, T. Chapuran","doi":"10.1109/ICC.1992.268130","DOIUrl":"https://doi.org/10.1109/ICC.1992.268130","url":null,"abstract":"The authors investigate self-healing ring networks that utilize wavelength-division multiplexing (WDM) to provide survivable transport without the need for high-speed electronic add-drop multiplexers. They propose three specific multiwavelength ring networks, two designed for consolidation of switching resources at a single node on the ring, and one that supports symmetrical interconnection between all pairs of nodes. The maximum number of nodes and the maximum total capacity for the three networks are compared, as governed by the characteristics of the optical amplifiers and WDM techniques employed. It is found that all three networks are capable of supporting on the order of ten or more nodes with throughputs of 2.5 Gb/s to 10 Gb/s per node. The descriptions of the proposed networks assume an interoffice-network application, in which the nodes on the ring are central offices.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121483996","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}
A deterministic model for indoor radio propagation that is suitable for analyzing the performances of sector antenna systems in indoor radio channels is presented. This model considers the direct line of sight path and the paths arrived through reflections from the walls to determine all the existing paths between the transmitter and receiver. Using this model, the outage probabilities of binary phase shift keying (BPSK) and BPSK/DFE (decision feedback equalizer) radio modems with omnidirectional and six-sector antennas operating in the same room are compared. The effects of room size, data rate, transmitted power, and sector antenna patterns on the performances of the systems are analyzed.<>
{"title":"Comparative performance evaluation of sector antenna and DFE systems in indoor radio channels","authors":"G. Yang, K. Pahlavan","doi":"10.1109/ICC.1992.268045","DOIUrl":"https://doi.org/10.1109/ICC.1992.268045","url":null,"abstract":"A deterministic model for indoor radio propagation that is suitable for analyzing the performances of sector antenna systems in indoor radio channels is presented. This model considers the direct line of sight path and the paths arrived through reflections from the walls to determine all the existing paths between the transmitter and receiver. Using this model, the outage probabilities of binary phase shift keying (BPSK) and BPSK/DFE (decision feedback equalizer) radio modems with omnidirectional and six-sector antennas operating in the same room are compared. The effects of room size, data rate, transmitted power, and sector antenna patterns on the performances of the systems are analyzed.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121736825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The authors propose an algorithm for an equalizer/demodulator to minimize the effects of the propagation channel on pi /4 offset differential quadrature phase shift keying (DQPSK) modulated symbols transmitted over a flat fading channel. The proposed equalizer/demodulator takes as input the in-phase and quadrature samples of the received signal and outputs the corresponding decoded bits. The equalizer uses a Hilbert transform to estimate the absolute value of the phase differential of the carrier from the envelope of the carrier. This is demonstrated on a mobile radio channel.<>
{"title":"Equalization of pi /4 offset DQPSK transmitted over flat fading channels","authors":"M. Fattouche, H. Zaghloul","doi":"10.1109/ICC.1992.268245","DOIUrl":"https://doi.org/10.1109/ICC.1992.268245","url":null,"abstract":"The authors propose an algorithm for an equalizer/demodulator to minimize the effects of the propagation channel on pi /4 offset differential quadrature phase shift keying (DQPSK) modulated symbols transmitted over a flat fading channel. The proposed equalizer/demodulator takes as input the in-phase and quadrature samples of the received signal and outputs the corresponding decoded bits. The equalizer uses a Hilbert transform to estimate the absolute value of the phase differential of the carrier from the envelope of the carrier. This is demonstrated on a mobile radio channel.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115930559","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
扫码关注我们
求助内容：
应助结果提醒方式：