Pub Date : 1992-04-01DOI: 10.1109/PCCC.1992.200558
S. Benedetto, G. Olmo
An exact analysis of a code division multiple access (CDMA) optical system using Gold sequences is presented for two coherent modulation schemes, in terms of the bit error rate (BER) as a function of the number of simultaneous transmissions, and of the power penalty to be paid in order to allow for a given number of interferers, maintaining an acceptable BER level. The true statistics of the random variable representing the interferers is employed, and no bit synchronization among the transmitters is assumed. The chip asynchronous case has also been considered, leading to slightly better performance than the chip synchronous one. Results have been obtained employing both the periodic and the nonperiodic crosscorrelation between Gold sequences. The results show that, in many realistic network contexts, the CDMA technique can be effectively exploited without requiring any synchronization among all the stations.<>
{"title":"Performance evaluation of an optical network employing a code division multiple access scheme based on Gold sequences","authors":"S. Benedetto, G. Olmo","doi":"10.1109/PCCC.1992.200558","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200558","url":null,"abstract":"An exact analysis of a code division multiple access (CDMA) optical system using Gold sequences is presented for two coherent modulation schemes, in terms of the bit error rate (BER) as a function of the number of simultaneous transmissions, and of the power penalty to be paid in order to allow for a given number of interferers, maintaining an acceptable BER level. The true statistics of the random variable representing the interferers is employed, and no bit synchronization among the transmitters is assumed. The chip asynchronous case has also been considered, leading to slightly better performance than the chip synchronous one. Results have been obtained employing both the periodic and the nonperiodic crosscorrelation between Gold sequences. The results show that, in many realistic network contexts, the CDMA technique can be effectively exploited without requiring any synchronization among all the stations.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115404372","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200516
A. Hameurlain, F. Morvan, M. Huguet
A parallel algorithm to propagate the insertion or deletion of a set of tuples in a binary relation into a transitively closed concrete relation without complete recomputation of the transitive closure is presented. The parallel external closure operator is used to determine the tuples which have to be added or deleted from the concrete relation. A performance analysis for the parallel external closure algorithm, the parallel algorithm for the differential maintenance of a transitively closed relation, is presented. The analytical model for the performance analysis is based on the work by P. Valduriez and S. Khoshafian (1988). The performance analysis outlines the improvement in response time for the differential maintenance of a transitively closed relation in contrast to the recomputation of the transitive closure.<>
{"title":"A parallel algorithm for the differential maintenance of a transitively closed relation","authors":"A. Hameurlain, F. Morvan, M. Huguet","doi":"10.1109/PCCC.1992.200516","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200516","url":null,"abstract":"A parallel algorithm to propagate the insertion or deletion of a set of tuples in a binary relation into a transitively closed concrete relation without complete recomputation of the transitive closure is presented. The parallel external closure operator is used to determine the tuples which have to be added or deleted from the concrete relation. A performance analysis for the parallel external closure algorithm, the parallel algorithm for the differential maintenance of a transitively closed relation, is presented. The analytical model for the performance analysis is based on the work by P. Valduriez and S. Khoshafian (1988). The performance analysis outlines the improvement in response time for the differential maintenance of a transitively closed relation in contrast to the recomputation of the transitive closure.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"628 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123340580","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200530
C.Y.R. Chen, G. Makhoul, D. Meliksetian
A queuing model for the distributed queue dual bus protocol is presented and analyzed. A queue buffer of length one and a single priority level are assumed. The state of a node is defined by the number of requests in the distributed queue before and after generation of a packet. The node average waiting time and average throughput are analyzed as functions of the node position and state in the network. The results illustrate the effect of the various parameters on the waiting time and throughput. Comparisons with simulation and analytical results are presented.<>
{"title":"A queueing approach to the performance evaluation of DQDB","authors":"C.Y.R. Chen, G. Makhoul, D. Meliksetian","doi":"10.1109/PCCC.1992.200530","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200530","url":null,"abstract":"A queuing model for the distributed queue dual bus protocol is presented and analyzed. A queue buffer of length one and a single priority level are assumed. The state of a node is defined by the number of requests in the distributed queue before and after generation of a packet. The node average waiting time and average throughput are analyzed as functions of the node position and state in the network. The results illustrate the effect of the various parameters on the waiting time and throughput. Comparisons with simulation and analytical results are presented.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121350425","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200560
Y. Wu, H. Ikeda, K. Fukuma, H. Yoshida, E. Tsuchiya, S. Shinohara, K. Nishimura
Experiments were carried out on a new type of data word transmission system employing a GI glass fiber. A frequency division multiplexed scheme was employed because of simple circuit configuration and low cost. Parallel data consisting of multiple frequency signals occupy separate frequencies in a specified frequency domain. The frequency domain used for the parallel data transmission system is described. A square wave frequency modulation (SWFM) scheme was used. Since the SWFM scheme enables the transmission system to be constructed very simply, a data word is easily recovered from the received SWFM signal by using a 4-b parallel data detector. For applying the new system to the industrial field, a Z80 data processor was built into the receiver to process the data words and to output the instructions to the associated external devices. This optical fiber transmission system has high reliability against electromagnetic interference.<>
{"title":"Optical-fiber data-word transmission system for use with microcomputer controller","authors":"Y. Wu, H. Ikeda, K. Fukuma, H. Yoshida, E. Tsuchiya, S. Shinohara, K. Nishimura","doi":"10.1109/PCCC.1992.200560","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200560","url":null,"abstract":"Experiments were carried out on a new type of data word transmission system employing a GI glass fiber. A frequency division multiplexed scheme was employed because of simple circuit configuration and low cost. Parallel data consisting of multiple frequency signals occupy separate frequencies in a specified frequency domain. The frequency domain used for the parallel data transmission system is described. A square wave frequency modulation (SWFM) scheme was used. Since the SWFM scheme enables the transmission system to be constructed very simply, a data word is easily recovered from the received SWFM signal by using a 4-b parallel data detector. For applying the new system to the industrial field, a Z80 data processor was built into the receiver to process the data words and to output the instructions to the associated external devices. This optical fiber transmission system has high reliability against electromagnetic interference.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127437963","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200548
A. Stephens, Y. Yesha, K. Humenik
The authors consider a partially replicated distributed database located on a tree network each of whose links may fail with a probability p. For small p they derive necessary conditions for optimal placement of copies in order to maximize the probabilities of successful read-only and write-only transactions. These results suggest several heuristics for general networks. Numerical results are presented.<>
{"title":"Optimal allocation for partially replicated database systems on tree-based networks","authors":"A. Stephens, Y. Yesha, K. Humenik","doi":"10.1109/PCCC.1992.200548","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200548","url":null,"abstract":"The authors consider a partially replicated distributed database located on a tree network each of whose links may fail with a probability p. For small p they derive necessary conditions for optimal placement of copies in order to maximize the probabilities of successful read-only and write-only transactions. These results suggest several heuristics for general networks. Numerical results are presented.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"72 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130753238","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200532
S. Latifi, S. Zheng
The authors consider the problem of simulating linear arrays and ring architectures on a multiply twisted hypercube. For the hypercube, a powerful tool for embedding linear arrays and rings is the Gray code (GC), which cannot be directly applied to multiply twisted hypercubes. They define a new concept of reflected link label sequence and use it to define a generalized Gray code (GCC). It is shown that by using the GCC at least n-factorial distinct Hamiltonian paths and at least n-factorial/2+(n-2)-factorial distinct Hamiltonian cycles of Q/sub n//sup MT/ can be identified. A method is described for embedding a ring of an arbitrary number of modes into Q/sub n//sup MT/ with dilation 1 and congestion 1. This method can be extended to embed many mode-disjoint and link-disjoint rings of different sizes into Q/sub n//sup MT/ simultaneously.<>
{"title":"Optimal simulation of linear array and ring architectures on multiply-twisted hypercube","authors":"S. Latifi, S. Zheng","doi":"10.1109/PCCC.1992.200532","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200532","url":null,"abstract":"The authors consider the problem of simulating linear arrays and ring architectures on a multiply twisted hypercube. For the hypercube, a powerful tool for embedding linear arrays and rings is the Gray code (GC), which cannot be directly applied to multiply twisted hypercubes. They define a new concept of reflected link label sequence and use it to define a generalized Gray code (GCC). It is shown that by using the GCC at least n-factorial distinct Hamiltonian paths and at least n-factorial/2+(n-2)-factorial distinct Hamiltonian cycles of Q/sub n//sup MT/ can be identified. A method is described for embedding a ring of an arbitrary number of modes into Q/sub n//sup MT/ with dilation 1 and congestion 1. This method can be extended to embed many mode-disjoint and link-disjoint rings of different sizes into Q/sub n//sup MT/ simultaneously.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132456487","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200570
K. Claffy, George C. Polyzos
The authors examine one aspect of connection management currently receiving attention: dynamic, location-independent addressing. They offer a proposed clarification of relevant terminology, outline the location transparency problem, and explore both existing and potential approaches to its implementation. Underlying the exploration is the fundamental premise that addressing and routing in a location transparent environment necessitates considering a virtual addressing capability, which allows a device to have an unchanging virtual address at one level, and a physical address at a lower level, which dynamically changes according to the position of the device.<>
{"title":"Location transparent connection management: a survey of protocol issues","authors":"K. Claffy, George C. Polyzos","doi":"10.1109/PCCC.1992.200570","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200570","url":null,"abstract":"The authors examine one aspect of connection management currently receiving attention: dynamic, location-independent addressing. They offer a proposed clarification of relevant terminology, outline the location transparency problem, and explore both existing and potential approaches to its implementation. Underlying the exploration is the fundamental premise that addressing and routing in a location transparent environment necessitates considering a virtual addressing capability, which allows a device to have an unchanging virtual address at one level, and a physical address at a lower level, which dynamically changes according to the position of the device.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114968932","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200540
S. Som, M. D. Wagh
The authors discuss throughput enhancement for pipelining and digital signal processing applications in a multiprocessor environment. A common objective in pipelining and digital signal processing is the repeated execution of the same computational job consisting of a set of computational operations with high throughput or sampling rates. For good performance and avoidance of internal conflicts, the concurrent computational operations of successive data sets of a computational job should be properly scheduled. Heuristic suboptimal scheduling algorithms are developed whose execution time is a polynomial function of the number of items to be scheduled. Insertion of delay is used as a basic tool for better utilization of hardware, thereby increasing the throughput. Rescheduled computational jobs are directed to architectures consisting of arbitrary number of processors. Simulation results are presented.<>
{"title":"Throughput enhancement in multiprocessor architectures for pipelining and digital signal processing applications","authors":"S. Som, M. D. Wagh","doi":"10.1109/PCCC.1992.200540","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200540","url":null,"abstract":"The authors discuss throughput enhancement for pipelining and digital signal processing applications in a multiprocessor environment. A common objective in pipelining and digital signal processing is the repeated execution of the same computational job consisting of a set of computational operations with high throughput or sampling rates. For good performance and avoidance of internal conflicts, the concurrent computational operations of successive data sets of a computational job should be properly scheduled. Heuristic suboptimal scheduling algorithms are developed whose execution time is a polynomial function of the number of items to be scheduled. Insertion of delay is used as a basic tool for better utilization of hardware, thereby increasing the throughput. Rescheduled computational jobs are directed to architectures consisting of arbitrary number of processors. Simulation results are presented.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121249032","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200593
S. Olariu, J. L. Schwing, J. Zhang
A number of data movement algorithms for the two-dimensional reconfigurable mesh are presented. These include computing the prefix sum of a binary sequence and computing the prefix maxima of a sequence of real numbers. These algorithms lead to a fast algorithm to sort a sequence of n reals in O(log n/log m) time on a reconfigurable mesh of size mn*n with 3>
{"title":"Fundamental data movement algorithms for reconfigurable meshes","authors":"S. Olariu, J. L. Schwing, J. Zhang","doi":"10.1109/PCCC.1992.200593","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200593","url":null,"abstract":"A number of data movement algorithms for the two-dimensional reconfigurable mesh are presented. These include computing the prefix sum of a binary sequence and computing the prefix maxima of a sequence of real numbers. These algorithms lead to a fast algorithm to sort a sequence of n reals in O(log n/log m) time on a reconfigurable mesh of size mn*n with 3<or=m<or=n. The result implies that sorting n real numbers takes O(1) time on a reconfigurable mesh of size n/sup 1.5/*n. The sorting algorithm uses significantly fewer processors than the best-known algorithm to date. Next, it is shown that computing the convex hull of a planar set of n points takes O(log n/log m) time on a reconfigurable mesh of size mn*n with 3<or=m<or=n. The result implies that the convex hull of n points in the plane can be coupled in O(1) time on a reconfigurable mesh of size n/sup 1.5/*n.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124772156","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200566
K. Arai, H. Shigeno, T. Yokoyama, Y. Matsushita
A network system having two layers is proposed. This system uses radio as a transmission medium for the lower layer and uses a conventional LAN for the upper layer. The users of a wireless network enjoy complete freedom from frequent relocation of existing terminal arrangements. However, office buildings present a harsh environment for radio transmission because of numerous reflections from walls, furniture and even people. A dynamic channel assignment scheme with no host computers is described. The system performance was analyzed through computer simulations. The results show that the number of channels assigned to each base station can be reduced without loss of performance under the condition that a 10-Mb/s carrier sense multiple access with collision detection (CSMA/CD) network is used as the upper layer and a 32 kb/s CSMA packet radio network is used as the lower layer.<>
提出了一种两层网络系统。该系统底层采用无线电作为传输介质，上层采用传统的局域网。无线网络的用户享有完全的自由，不必频繁地搬迁现有的终端设施。然而，由于来自墙壁、家具甚至人的大量反射，办公楼呈现出恶劣的无线电传输环境。描述了一种没有主机的动态信道分配方案。通过计算机仿真分析了系统的性能。结果表明，在采用10mb /s的CSMA/CD (carrier sense multiple access with collision detection)网络作为上层，32kb /s的CSMA分组无线网络作为下层的情况下，可以在不影响性能的情况下减少分配给各基站的信道数。
{"title":"A hybrid indoor data network with radio and wire performance evaluation in a Rayleigh channel","authors":"K. Arai, H. Shigeno, T. Yokoyama, Y. Matsushita","doi":"10.1109/PCCC.1992.200566","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200566","url":null,"abstract":"A network system having two layers is proposed. This system uses radio as a transmission medium for the lower layer and uses a conventional LAN for the upper layer. The users of a wireless network enjoy complete freedom from frequent relocation of existing terminal arrangements. However, office buildings present a harsh environment for radio transmission because of numerous reflections from walls, furniture and even people. A dynamic channel assignment scheme with no host computers is described. The system performance was analyzed through computer simulations. The results show that the number of channels assigned to each base station can be reduced without loss of performance under the condition that a 10-Mb/s carrier sense multiple access with collision detection (CSMA/CD) network is used as the upper layer and a 32 kb/s CSMA packet radio network is used as the lower layer.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126270119","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
扫码关注我们
求助内容：
应助结果提醒方式：