The concept of collaboration between employees in branch banking as facilitated by various software methods is intended to reduce problems with training, turnover, and level of experience encountered with branch bank employees. The authors demonstrate how these problems were reduced by online collaboration between bank branch employees through the use of facilities provided by the NCR Application Management Services (AMS) product. This concept of collaboration is presented, along with technical problems experienced and overcome during the course of development. The collaborative features of AMS allow an experienced supervisor to solve problems encountered by new users and less experienced users without having to leave his or her desktop computer. The supervisor may be located in the same LAN workgroup or may have access to the workgroup through a telecommunications link. The six features that support collaboration within the bank branches are described. AMS is based on a client/server architecture in which the clients are Windows or MS-DOS based workstations and the server is a UNIX or OS/2 based system providing a communication gateway and database services as well as file and print services.<>
{"title":"Application management services: collaboration in branch banking","authors":"K. Draeger, A. Gross, F. Miller, E. Wasser","doi":"10.1109/ICC.1992.268148","DOIUrl":"https://doi.org/10.1109/ICC.1992.268148","url":null,"abstract":"The concept of collaboration between employees in branch banking as facilitated by various software methods is intended to reduce problems with training, turnover, and level of experience encountered with branch bank employees. The authors demonstrate how these problems were reduced by online collaboration between bank branch employees through the use of facilities provided by the NCR Application Management Services (AMS) product. This concept of collaboration is presented, along with technical problems experienced and overcome during the course of development. The collaborative features of AMS allow an experienced supervisor to solve problems encountered by new users and less experienced users without having to leave his or her desktop computer. The supervisor may be located in the same LAN workgroup or may have access to the workgroup through a telecommunications link. The six features that support collaboration within the bank branches are described. AMS is based on a client/server architecture in which the clients are Windows or MS-DOS based workstations and the server is a UNIX or OS/2 based system providing a communication gateway and database services as well as file and print services.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"21 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":"122668335","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 new technique is presented for evaluating the jitter performance of a symbol timing recovery (STR) subsystem for binary synchronous data transmission systems. The STR system consists of any even-symmetric zero-memory nonlinear device followed by a narrowband filter tuned to the pulse repetition frequency. The exact analytical expressions are derived for the mean and the mean-squared values of the timing wave, based on the high-order moments of the input signal. The root-mean-square jitter performance is then computed as a function of various system parameters such as the power series expansion of the zero-memory nonlinear device, prefiltering, and postfiltering. The numerical results obtained from some specific examples serve to illustrate several aspects of the timing recovery problem.<>
{"title":"A new approach for evaluating the performance of a symbol timing recovery system employing a general type of nonlinearity","authors":"E. Panayirci, Elisha K. Bar-Ness","doi":"10.1109/ICC.1992.268108","DOIUrl":"https://doi.org/10.1109/ICC.1992.268108","url":null,"abstract":"A new technique is presented for evaluating the jitter performance of a symbol timing recovery (STR) subsystem for binary synchronous data transmission systems. The STR system consists of any even-symmetric zero-memory nonlinear device followed by a narrowband filter tuned to the pulse repetition frequency. The exact analytical expressions are derived for the mean and the mean-squared values of the timing wave, based on the high-order moments of the input signal. The root-mean-square jitter performance is then computed as a function of various system parameters such as the power series expansion of the zero-memory nonlinear device, prefiltering, and postfiltering. The numerical results obtained from some specific examples serve to illustrate several aspects of the timing recovery problem.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"37 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":"122875439","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 compare constant bit rate (CBR) and variable bit rate (VBR) video services in an asynchronous transfer mode (ATM) environment. The simplified network model of CCITT SGXV is used to estimate the statistical multiplexing gain for VBR service. Current NNI (network node interface) capacities, 150 or 600 Mb/s, are determined to be too small to effectively support standard television signals that are VBR coded at average bit rates of 5-10 Mb/s. It is also shown that the leaky bucket technique is superior to the sliding window technique for an average bit rate usage parameter control from the service point of view. If sliding window is used, higher picture quality and shorter delay are not always guaranteed in VBR video services.<>
{"title":"A study on comparison between VBR and CBR video service in ATM environment","authors":"T. Tanaka, S. Okubo, H. Hashimoto, H. Yasuda","doi":"10.1109/ICC.1992.268221","DOIUrl":"https://doi.org/10.1109/ICC.1992.268221","url":null,"abstract":"The authors compare constant bit rate (CBR) and variable bit rate (VBR) video services in an asynchronous transfer mode (ATM) environment. The simplified network model of CCITT SGXV is used to estimate the statistical multiplexing gain for VBR service. Current NNI (network node interface) capacities, 150 or 600 Mb/s, are determined to be too small to effectively support standard television signals that are VBR coded at average bit rates of 5-10 Mb/s. It is also shown that the leaky bucket technique is superior to the sliding window technique for an average bit rate usage parameter control from the service point of view. If sliding window is used, higher picture quality and shorter delay are not always guaranteed in VBR video services.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"26 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":"125161738","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 focus on a signaling protocol for the long-term broadband ISDN (B-ISDN), for which work is being done by CCITT SGs XVIII and XI. A brief description of services handling which must be performed by a broadband network is given. The advantages of the call control and bearer control functional separation, needed to support the complex services offered by a broadband network, are discussed. Since the current ISDN Signaling System No.7 is not able to satisfy the signaling requirements of a broadband network, a new protocol is needed and new concepts have to be introduced. Consequently, the main principles of the open systems interconnection (OSI) application layer structure (ALS) are presented. A protocol based on these concepts is the ISCP. It is the best candidate for the target B-ISDN signaling protocol. A number of identifiers are analyzed, whose function is to correlate call control entities with bearer control entities in an ISCP environment.<>
{"title":"Signalling protocol for broadband ISDN","authors":"A. Paglialunga, A. Biocca, M. Siviero","doi":"10.1109/ICC.1992.268212","DOIUrl":"https://doi.org/10.1109/ICC.1992.268212","url":null,"abstract":"The authors focus on a signaling protocol for the long-term broadband ISDN (B-ISDN), for which work is being done by CCITT SGs XVIII and XI. A brief description of services handling which must be performed by a broadband network is given. The advantages of the call control and bearer control functional separation, needed to support the complex services offered by a broadband network, are discussed. Since the current ISDN Signaling System No.7 is not able to satisfy the signaling requirements of a broadband network, a new protocol is needed and new concepts have to be introduced. Consequently, the main principles of the open systems interconnection (OSI) application layer structure (ALS) are presented. A protocol based on these concepts is the ISCP. It is the best candidate for the target B-ISDN signaling protocol. A number of identifiers are analyzed, whose function is to correlate call control entities with bearer control entities in an ISCP environment.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"10 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":"126172797","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 consider the problem of change in traffic parameters of a connection in an asynchronous transfer mode (ATM) network and have found out that the traffic parameters of a connection may change appreciably along its path. They present a simulation-based study to examine the magnitude of this phenomenon. The experiments showed that, under certain circumstances, there may be a significant variation in traffic characteristics of a connection at different nodes along its path. Resource allocation must take this variation into account to ensure that quality of service requirements of different connections can be satisfied. A way to handle the problem would be to restore the original traffic pattern on the connection, either fully or partially, at each node along the path. A scheme is proposed to partially reconstruct the original traffic pattern, and its effectiveness was studied by means of simulation experiments.<>
{"title":"Variation of traffic parameters in ATM networks","authors":"Dinesh Verma, Domenico Ferrari","doi":"10.1109/ICC.1992.268195","DOIUrl":"https://doi.org/10.1109/ICC.1992.268195","url":null,"abstract":"The authors consider the problem of change in traffic parameters of a connection in an asynchronous transfer mode (ATM) network and have found out that the traffic parameters of a connection may change appreciably along its path. They present a simulation-based study to examine the magnitude of this phenomenon. The experiments showed that, under certain circumstances, there may be a significant variation in traffic characteristics of a connection at different nodes along its path. Resource allocation must take this variation into account to ensure that quality of service requirements of different connections can be satisfied. A way to handle the problem would be to restore the original traffic pattern on the connection, either fully or partially, at each node along the path. A scheme is proposed to partially reconstruct the original traffic pattern, and its effectiveness was studied by means of simulation experiments.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"1 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":"125835867","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}
Motivated by the observations in the characterization of traffic patterns, a network traffic model is proposed. A simulation study for network file system (NFS) traffic across a switched multi-megabit data service (SMDS) is conducted to apply the traffic model to SMDS access links in supporting high-performance applications in distributed systems over a wide area. The results show the high applicability of the model to traffic pattern reproduction and manipulation of performance studies. An alternative interval performance criterion is described to better specify the system performance at various time scales.<>
{"title":"Traffic pattern reproduction and manipulation for LAN-to-LAN SMDS experiments","authors":"Y.-D. Lin, S. Holmgren, C. Druce, F. James","doi":"10.1109/ICC.1992.267945","DOIUrl":"https://doi.org/10.1109/ICC.1992.267945","url":null,"abstract":"Motivated by the observations in the characterization of traffic patterns, a network traffic model is proposed. A simulation study for network file system (NFS) traffic across a switched multi-megabit data service (SMDS) is conducted to apply the traffic model to SMDS access links in supporting high-performance applications in distributed systems over a wide area. The results show the high applicability of the model to traffic pattern reproduction and manipulation of performance studies. An alternative interval performance criterion is described to better specify the system performance at various time scales.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"52 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":"125874256","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 a star topology for multihop lightwave networks in which the conventional N*N passive star coupler is replaced by fixed wavelength division multiplexing (WDM) cross-connects. The proposed topology overcomes three major limitations of the conventional star topology. First, it reduces the number of wavelengths needed in a (p,k) ShuffleNet from kp/sup k+1/ wavelengths in the conventional topology to p wavelengths in the proposed one. Second, the signal power loss due to the 1/N power splitting at the star coupler no longer exists in the WDM cross-connects and, therefore, the restriction on the supported number of users by the star network is alleviated. Third, it completely eliminates the need for wavelength filtering at the input to the receivers, as is the case in the conventional star topology. The use of 2*2 WDM lapped couplers as a cheap WDM cross-connect for a (2,k) ShuffleNet is investigated. A p*p star coupler followed by p fiber Fabry-Perot filters can be used as a p*p WDM cross-connect for a (p,k) ShuffleNet at the expense of using p/sup 2/ rather than p wavelengths.<>
{"title":"A WDM cross-connected star multihop optical network","authors":"M. Irshid, M. Kavehrad","doi":"10.1109/ICC.1992.268001","DOIUrl":"https://doi.org/10.1109/ICC.1992.268001","url":null,"abstract":"The authors propose a star topology for multihop lightwave networks in which the conventional N*N passive star coupler is replaced by fixed wavelength division multiplexing (WDM) cross-connects. The proposed topology overcomes three major limitations of the conventional star topology. First, it reduces the number of wavelengths needed in a (p,k) ShuffleNet from kp/sup k+1/ wavelengths in the conventional topology to p wavelengths in the proposed one. Second, the signal power loss due to the 1/N power splitting at the star coupler no longer exists in the WDM cross-connects and, therefore, the restriction on the supported number of users by the star network is alleviated. Third, it completely eliminates the need for wavelength filtering at the input to the receivers, as is the case in the conventional star topology. The use of 2*2 WDM lapped couplers as a cheap WDM cross-connect for a (2,k) ShuffleNet is investigated. A p*p star coupler followed by p fiber Fabry-Perot filters can be used as a p*p WDM cross-connect for a (p,k) ShuffleNet at the expense of using p/sup 2/ rather than p wavelengths.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"47 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":"130126066","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 methods for controlling the flow of traffic in gateways and evaluate their performance. A gateway can interconnect several LANs over a high-speed interconnecting backbone, in which case every LAN has a set of buffers assigned for input and output, respectively. System configurations are investigated where packet transfer times over the interconnecting backbone are negligible. The gateway control consists of a policy which determines when a packet from an input LAN buffer is allowed to be transferred to the output LAN buffer. An associated strategy determines from which input LAN buffer to transfer a packet at that time. Alternative strategies and policies are studied, and the optimal control of gateways is defined. An analytical model is introduced, showing the interconnected system performance in terms of throughput, packet loss probability, and the average packet delay for the optimal and other types of control.<>
{"title":"Configuration and control of gateways","authors":"I. Chlamtac, E. Wong","doi":"10.1109/ICC.1992.268127","DOIUrl":"https://doi.org/10.1109/ICC.1992.268127","url":null,"abstract":"The authors propose methods for controlling the flow of traffic in gateways and evaluate their performance. A gateway can interconnect several LANs over a high-speed interconnecting backbone, in which case every LAN has a set of buffers assigned for input and output, respectively. System configurations are investigated where packet transfer times over the interconnecting backbone are negligible. The gateway control consists of a policy which determines when a packet from an input LAN buffer is allowed to be transferred to the output LAN buffer. An associated strategy determines from which input LAN buffer to transfer a packet at that time. Alternative strategies and policies are studied, and the optimal control of gateways is defined. An analytical model is introduced, showing the interconnected system performance in terms of throughput, packet loss probability, and the average packet delay for the optimal and other types of control.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"58 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":"129631402","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}
An exact performance analysis of an asynchronous transfer mode (ATM) statistical multiplexer whose inputs consist of superposition of mixed continuous-bit-rate and bursty traffic is presented. Two priority levels are considered for each class of traffic. ATM cells arriving at the multiplexer are generated according to a Markov modulated Poisson process. The performance of the multiplexer for different classes of traffic was investigated. The quality of service required for each class is met by introducing selective cell discarding using a partial buffer sharing scheme. The performance of the multiplexer for both deterministic and exponential service distributions was investigated. The results indicate that the deterministic service compared to the exponential service shows better performance in the same traffic environment. It is shown that for heavy load situations the exponential service requires less buffer space than the deterministic service. It is also shown that the loss probability obtained under the deterministic service is about one order of magnitude lower than that of the exponential service.<>
{"title":"Performance models for ATM switching of mixed continuous-bit-rate and bursty traffic with threshold-based discarding","authors":"P. Yegani","doi":"10.1109/ICC.1992.268018","DOIUrl":"https://doi.org/10.1109/ICC.1992.268018","url":null,"abstract":"An exact performance analysis of an asynchronous transfer mode (ATM) statistical multiplexer whose inputs consist of superposition of mixed continuous-bit-rate and bursty traffic is presented. Two priority levels are considered for each class of traffic. ATM cells arriving at the multiplexer are generated according to a Markov modulated Poisson process. The performance of the multiplexer for different classes of traffic was investigated. The quality of service required for each class is met by introducing selective cell discarding using a partial buffer sharing scheme. The performance of the multiplexer for both deterministic and exponential service distributions was investigated. The results indicate that the deterministic service compared to the exponential service shows better performance in the same traffic environment. It is shown that for heavy load situations the exponential service requires less buffer space than the deterministic service. It is also shown that the loss probability obtained under the deterministic service is about one order of magnitude lower than that of the exponential service.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"43 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":"124837640","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：