Pub Date : 1991-12-02DOI: 10.1109/GLOCOM.1991.188705
K. Kerpez
The application of two types of forward error correction codes to the DS1 rate asymmetric digital subscriber line (ADSL) channel is examined: interleaved Reed-Solomon codes used for compact disc, and Iwadare burst error correction codes. A model is derived for the distribution of burst errors that impulse noise causes with ADSL. This model is used to analyze the performance of the codes in the presence of impulse noise. The bit error rate with crosstalk or Gaussian noise is also determined and results are compared to those for uncoded transmission. It is found that the compact disc codes are very effective for ADSL.<>
{"title":"Forward error correction for asymmetric digital subscriber lines (ADSL)","authors":"K. Kerpez","doi":"10.1109/GLOCOM.1991.188705","DOIUrl":"https://doi.org/10.1109/GLOCOM.1991.188705","url":null,"abstract":"The application of two types of forward error correction codes to the DS1 rate asymmetric digital subscriber line (ADSL) channel is examined: interleaved Reed-Solomon codes used for compact disc, and Iwadare burst error correction codes. A model is derived for the distribution of burst errors that impulse noise causes with ADSL. This model is used to analyze the performance of the codes in the presence of impulse noise. The bit error rate with crosstalk or Gaussian noise is also determined and results are compared to those for uncoded transmission. It is found that the compact disc codes are very effective for ADSL.<<ETX>>","PeriodicalId":343080,"journal":{"name":"IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132613432","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 : 1991-12-02DOI: 10.1109/GLOCOM.1991.188572
M. Karol, B. Glance
The performance aspects of the PAC (protection-against-collision) optical packet network are discussed. An analysis is made of the delay-throughput performance of this network for uniform traffic patterns. Results show that in geographically distributed applications the maximum achievable throughput (normalized to the transmission rate) is typically between 0.4 and 0.5 per channel. For example, the maximum achievable throughput is between 400 and 500 Gb/s for a 1000-channel system with a 1-Gb/s transmission rate. In a centralized switch, the (normalized) maximum achievable throughput can approach 0.8 per channel. These values are higher than previously published optical systems.<>
{"title":"Performance of the PAC optical packet network","authors":"M. Karol, B. Glance","doi":"10.1109/GLOCOM.1991.188572","DOIUrl":"https://doi.org/10.1109/GLOCOM.1991.188572","url":null,"abstract":"The performance aspects of the PAC (protection-against-collision) optical packet network are discussed. An analysis is made of the delay-throughput performance of this network for uniform traffic patterns. Results show that in geographically distributed applications the maximum achievable throughput (normalized to the transmission rate) is typically between 0.4 and 0.5 per channel. For example, the maximum achievable throughput is between 400 and 500 Gb/s for a 1000-channel system with a 1-Gb/s transmission rate. In a centralized switch, the (normalized) maximum achievable throughput can approach 0.8 per channel. These values are higher than previously published optical systems.<<ETX>>","PeriodicalId":343080,"journal":{"name":"IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record","volume":"13 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132215277","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 : 1991-12-02DOI: 10.1109/GLOCOM.1991.188693
M. LeRoux, D. Bernardi
The personal communication service proposed aims at providing the most value to end users and service providers in a competitive marketplace. It was designed around a set of basic conditions-ubiquity, uniformity, community of interest, public addresses, price/value packaging-that have proven their worth with another highly successful communication service, POTS. The whole version is predicated on the concept of internetworking which will be made possible by a numbering scheme outgrown from the North American Numbering Plan (NANP) and the network interfaces proposed.<>
{"title":"Internetworking: the key PCS success factor","authors":"M. LeRoux, D. Bernardi","doi":"10.1109/GLOCOM.1991.188693","DOIUrl":"https://doi.org/10.1109/GLOCOM.1991.188693","url":null,"abstract":"The personal communication service proposed aims at providing the most value to end users and service providers in a competitive marketplace. It was designed around a set of basic conditions-ubiquity, uniformity, community of interest, public addresses, price/value packaging-that have proven their worth with another highly successful communication service, POTS. The whole version is predicated on the concept of internetworking which will be made possible by a numbering scheme outgrown from the North American Numbering Plan (NANP) and the network interfaces proposed.<<ETX>>","PeriodicalId":343080,"journal":{"name":"IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134221087","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 : 1991-12-02DOI: 10.1109/GLOCOM.1991.188639
S. Liew
The author investigates the general problem of multicast routing in the three-stage Clos switching network, with point-to-point routing as a special case. An optimal and a heuristic algorithm have been designed and tested. The results show that the heuristic algorithm can find multicast routes that are close to optimal within a response time that is significantly lower than that of the optimal algorithm. Further analysis of the experimental data suggests a hybrid implementation in which the optimal and heuristic algorithms are run in parallel with a set time limit. The algorithms and the discussion provided also apply to other networks, including wide-area communication networks, with a two-hop structure.<>
{"title":"Multicast routing algorithms for 3-stage Clos ATM switching networks","authors":"S. Liew","doi":"10.1109/GLOCOM.1991.188639","DOIUrl":"https://doi.org/10.1109/GLOCOM.1991.188639","url":null,"abstract":"The author investigates the general problem of multicast routing in the three-stage Clos switching network, with point-to-point routing as a special case. An optimal and a heuristic algorithm have been designed and tested. The results show that the heuristic algorithm can find multicast routes that are close to optimal within a response time that is significantly lower than that of the optimal algorithm. Further analysis of the experimental data suggests a hybrid implementation in which the optimal and heuristic algorithms are run in parallel with a set time limit. The algorithms and the discussion provided also apply to other networks, including wide-area communication networks, with a two-hop structure.<<ETX>>","PeriodicalId":343080,"journal":{"name":"IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114678077","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 : 1991-12-02DOI: 10.1109/GLOCOM.1991.188589
K. Krishnan
An overview is presented of some of the papers on traffic routing presented at the 13th International Teletraffic Congress in Copenhagen, Denmark, in June 1991.<>
{"title":"Dynamic traffic routing and network management","authors":"K. Krishnan","doi":"10.1109/GLOCOM.1991.188589","DOIUrl":"https://doi.org/10.1109/GLOCOM.1991.188589","url":null,"abstract":"An overview is presented of some of the papers on traffic routing presented at the 13th International Teletraffic Congress in Copenhagen, Denmark, in June 1991.<<ETX>>","PeriodicalId":343080,"journal":{"name":"IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116731961","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 : 1991-12-02DOI: 10.1109/GLOCOM.1991.188734
Chang-jia Chen, Tai-yi Chen
DC-free runlength-limited codes are studied. Their finite state sequential machine is defined and the achievable rate region is discussed. For the code construction aspect, two general rules are proposed as follows: (1) Always leave suitable redundancy when using the output word which is false in decreasing the running digital sum (RDS) in the absolute value. (2) If state splitting is inevitable, then first try to split the states with small n-l (where n and l are the accumulated RDS and encoding delay, respectively) and with large delay l. By using these rules, several DC-free (d,k) codes are constructed. It is shown that, by following the general rules, the trial work can be substantially reduced.<>
{"title":"DC free runlength-limited codes","authors":"Chang-jia Chen, Tai-yi Chen","doi":"10.1109/GLOCOM.1991.188734","DOIUrl":"https://doi.org/10.1109/GLOCOM.1991.188734","url":null,"abstract":"DC-free runlength-limited codes are studied. Their finite state sequential machine is defined and the achievable rate region is discussed. For the code construction aspect, two general rules are proposed as follows: (1) Always leave suitable redundancy when using the output word which is false in decreasing the running digital sum (RDS) in the absolute value. (2) If state splitting is inevitable, then first try to split the states with small n-l (where n and l are the accumulated RDS and encoding delay, respectively) and with large delay l. By using these rules, several DC-free (d,k) codes are constructed. It is shown that, by following the general rules, the trial work can be substantially reduced.<<ETX>>","PeriodicalId":343080,"journal":{"name":"IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116138462","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 : 1991-12-02DOI: 10.1109/GLOCOM.1991.188502
A. Kajiwara, M. Nakagawa
A description is presented of a direct-sequence spread-spectrum (DS/SS) block demodulator with cross-correlation canceller which can provide high capacity per unit bandwidth. In a DS/SS block demodulator, signals are from all channels recursively detected from the received packet signal stored in buffer memory, and then the cross-correlation component is removed algebraically. The simulation results show that the capacity is higher than around 45%, and good near-far resistance capability is also achieved.<>
{"title":"Spread-spectrum block demodulator with high capacity crosscorrelation canceller","authors":"A. Kajiwara, M. Nakagawa","doi":"10.1109/GLOCOM.1991.188502","DOIUrl":"https://doi.org/10.1109/GLOCOM.1991.188502","url":null,"abstract":"A description is presented of a direct-sequence spread-spectrum (DS/SS) block demodulator with cross-correlation canceller which can provide high capacity per unit bandwidth. In a DS/SS block demodulator, signals are from all channels recursively detected from the received packet signal stored in buffer memory, and then the cross-correlation component is removed algebraically. The simulation results show that the capacity is higher than around 45%, and good near-far resistance capability is also achieved.<<ETX>>","PeriodicalId":343080,"journal":{"name":"IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115113762","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 : 1991-12-02DOI: 10.1109/GLOCOM.1991.188650
A. Nakamura, T. Tanaka, H. Uesaka
The authors discuss the hardware architecture for the service control point (SCP). They show the network architecture for the intelligent network (IN) which is the basis of the discussion. Functions required for the SCP are classified into three types. Requirements for the SCP hardware architecture are clarified. On a certain SCP model satisfying the requirements, where a single SCP consists of multiple modules and module types, it is shown that on designing the performance of the SCP, there exists a solution giving the minimum cost of SCP, and a method is outlined to obtain this solution. Some examples are given to show the effectiveness of the method.<>
{"title":"SCP architecture with performance flexibility","authors":"A. Nakamura, T. Tanaka, H. Uesaka","doi":"10.1109/GLOCOM.1991.188650","DOIUrl":"https://doi.org/10.1109/GLOCOM.1991.188650","url":null,"abstract":"The authors discuss the hardware architecture for the service control point (SCP). They show the network architecture for the intelligent network (IN) which is the basis of the discussion. Functions required for the SCP are classified into three types. Requirements for the SCP hardware architecture are clarified. On a certain SCP model satisfying the requirements, where a single SCP consists of multiple modules and module types, it is shown that on designing the performance of the SCP, there exists a solution giving the minimum cost of SCP, and a method is outlined to obtain this solution. Some examples are given to show the effectiveness of the method.<<ETX>>","PeriodicalId":343080,"journal":{"name":"IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115277115","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 : 1991-12-02DOI: 10.1109/GLOCOM.1991.188520
D. Ghosh, J. Daly
Analytical and simulation results are presented on the performance of delta networks constructed with crossbars having multiple channels per input/output (I/O) ports. The probability of internal blocking is reduced significantly when two or more parallel channels interconnect stages of crossbars. Using small buffers (about 20 packets) at the outputs of the networks a throughput exceeding 90% can be achieved by using 3 channels per port. With further increase in the number of channels and buffer size the throughput approaches 100%. These networks can be used in telecommunication switching employing asynchronous transfer mode and in multiprocessor systems.<>
{"title":"Delta networks with multiple links and shared output buffers: a high performance architecture for packet switching","authors":"D. Ghosh, J. Daly","doi":"10.1109/GLOCOM.1991.188520","DOIUrl":"https://doi.org/10.1109/GLOCOM.1991.188520","url":null,"abstract":"Analytical and simulation results are presented on the performance of delta networks constructed with crossbars having multiple channels per input/output (I/O) ports. The probability of internal blocking is reduced significantly when two or more parallel channels interconnect stages of crossbars. Using small buffers (about 20 packets) at the outputs of the networks a throughput exceeding 90% can be achieved by using 3 channels per port. With further increase in the number of channels and buffer size the throughput approaches 100%. These networks can be used in telecommunication switching employing asynchronous transfer mode and in multiprocessor systems.<<ETX>>","PeriodicalId":343080,"journal":{"name":"IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record","volume":"226 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123217185","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 : 1991-12-02DOI: 10.1109/GLOCOM.1991.188484
M. Bagheri, D. Kong, W. Holden, F. C. Irizarry, D. Mahoney, D. C. Larson
To study the key technical issues in SONET (synchronous optical network byte multiplexing at gigabit/s data rates and the interworking of SONET and other broadband network elements, the authors implemented an experimental SONET STS-48 (synchronous transport signal) (2.488 Gb/s) testbed with broadband user interfaces (STS-3c and higher data rates). The testbed includes a SONET-compatible experimental STS-3c to STS-48 byte multiplexer and demultiplexer. A description is presented of the architecture, implementation, and experimental results of the high-speed components of the byte multiplexer and demultiplexer. The implementation employs a combination of custom VLSI integrated circuits and off-the-shelf components for rapid prototyping and verifying the validity of the architecture.<>
{"title":"An experimental 2.488 gigabit/sec SONET STS-3c to STS-48 byte multiplexer and demultiplexer","authors":"M. Bagheri, D. Kong, W. Holden, F. C. Irizarry, D. Mahoney, D. C. Larson","doi":"10.1109/GLOCOM.1991.188484","DOIUrl":"https://doi.org/10.1109/GLOCOM.1991.188484","url":null,"abstract":"To study the key technical issues in SONET (synchronous optical network byte multiplexing at gigabit/s data rates and the interworking of SONET and other broadband network elements, the authors implemented an experimental SONET STS-48 (synchronous transport signal) (2.488 Gb/s) testbed with broadband user interfaces (STS-3c and higher data rates). The testbed includes a SONET-compatible experimental STS-3c to STS-48 byte multiplexer and demultiplexer. A description is presented of the architecture, implementation, and experimental results of the high-speed components of the byte multiplexer and demultiplexer. The implementation employs a combination of custom VLSI integrated circuits and off-the-shelf components for rapid prototyping and verifying the validity of the architecture.<<ETX>>","PeriodicalId":343080,"journal":{"name":"IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123333407","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
扫码关注我们
求助内容：
应助结果提醒方式：