Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12893
H. Ahmadi, W. Denzel, C. A. Murphy, E. Port
An architecture is described for a high-performance switching fabric that can accommodate circuit-switched and packet-switched traffic in a unified manner. The switch fabric is self-routing and uses fixed-length minipackets within the switching fabric for all types of connections. Its architecture provides full input/output connectivity paths with FIFO (first-in-first-out) queueing at each output. The connection paths are non-overlapping, so there is no internal blocking. Because of output queueing, there is also practically no output port blocking. The uniformity in architecture allows the construction of any size fabric from a single basic module which could be realized on a single chip. Larger-size configurations can be realized either as single-stage configuration.<>
{"title":"A high-performance switch fabric for integrated circuit and packet switching","authors":"H. Ahmadi, W. Denzel, C. A. Murphy, E. Port","doi":"10.1109/INFCOM.1988.12893","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12893","url":null,"abstract":"An architecture is described for a high-performance switching fabric that can accommodate circuit-switched and packet-switched traffic in a unified manner. The switch fabric is self-routing and uses fixed-length minipackets within the switching fabric for all types of connections. Its architecture provides full input/output connectivity paths with FIFO (first-in-first-out) queueing at each output. The connection paths are non-overlapping, so there is no internal blocking. Because of output queueing, there is also practically no output port blocking. The uniformity in architecture allows the construction of any size fabric from a single basic module which could be realized on a single chip. Larger-size configurations can be realized either as single-stage configuration.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131058760","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 : 1988-03-27DOI: 10.1109/INFCOM.1988.13027
E. Lu, Wen-Yih Hwang, L. Harn, J. Lee
A conference key distribution system (CKDS) can provide a common secret communication key to a set of M stations. A CKDS based on Lagrange interpolating polynomial is introduced. It is easy to see that breaking this system is equivalent to break the Diffie-Hellman public-key distribution system. This conference key is selected by the conference chairstation and hidden in the Lagrange interpolating polynomial. Recovering this key by each participating station only requires M-1 multiplications and M-2 additions over a finite field GF(P).<>
{"title":"A conference key distribution system based on the Lagrange interpolating polynomial","authors":"E. Lu, Wen-Yih Hwang, L. Harn, J. Lee","doi":"10.1109/INFCOM.1988.13027","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13027","url":null,"abstract":"A conference key distribution system (CKDS) can provide a common secret communication key to a set of M stations. A CKDS based on Lagrange interpolating polynomial is introduced. It is easy to see that breaking this system is equivalent to break the Diffie-Hellman public-key distribution system. This conference key is selected by the conference chairstation and hidden in the Lagrange interpolating polynomial. Recovering this key by each participating station only requires M-1 multiplications and M-2 additions over a finite field GF(P).<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125332738","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 : 1988-03-27DOI: 10.1109/INFCOM.1988.12900
A. Dahbura, Krishan K. Sabnani
A description is given of an experience in estimating fault coverage of a test sequence designed to test the control portion of a protocol. The control portion of this protocol is modeled as a finite-state machine. This study uses Monte Carlo simulation and introduces a novel notion of machine equivalence. An algorithm given checks for this notion of machine equivalence.<>
{"title":"An experience in estimating fault coverage of a protocol test","authors":"A. Dahbura, Krishan K. Sabnani","doi":"10.1109/INFCOM.1988.12900","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12900","url":null,"abstract":"A description is given of an experience in estimating fault coverage of a test sequence designed to test the control portion of a protocol. The control portion of this protocol is modeled as a finite-state machine. This study uses Monte Carlo simulation and introduces a novel notion of machine equivalence. An algorithm given checks for this notion of machine equivalence.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125500898","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 : 1988-03-27DOI: 10.1109/INFCOM.1988.12954
C. H. Chen, L. Bhuyan
A discussion is presented of multiple-token-ring networks. Based on different packet transmission schemes, three protocols are discussed: (i) separate queues with simultaneous transmissions, (ii) single queue with simultaneous transmissions, and (iii) single queue with single transmission. The interface design and the approximate analyses are presented for all of the three protocols.<>
{"title":"Design and analysis of multiple token ring networks","authors":"C. H. Chen, L. Bhuyan","doi":"10.1109/INFCOM.1988.12954","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12954","url":null,"abstract":"A discussion is presented of multiple-token-ring networks. Based on different packet transmission schemes, three protocols are discussed: (i) separate queues with simultaneous transmissions, (ii) single queue with simultaneous transmissions, and (iii) single queue with single transmission. The interface design and the approximate analyses are presented for all of the three protocols.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122899002","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 : 1988-03-27DOI: 10.1109/INFCOM.1988.12990
K. Sato, H. Nakada, Y. Sato
An exploration is made of some techniques which will play important roles in the development of the future universal transport network. In the network, the information can be efficiently integrated and transported by making the most of the burstiness of the information flows and of the store-and-forward process at the transport nodes. First, a coding and multiplexing scheme for audio signals matched to the above transportation mode is proposed. The effectiveness of the scheme is demonstrated through computer simulation and the extent of the deviations are provided for some sets of parameters. The analysis provides useful tools to perform sensitivity analysis of network delay performance.<>
{"title":"Variable rate speech coding and network delay analysis for universal transport network","authors":"K. Sato, H. Nakada, Y. Sato","doi":"10.1109/INFCOM.1988.12990","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12990","url":null,"abstract":"An exploration is made of some techniques which will play important roles in the development of the future universal transport network. In the network, the information can be efficiently integrated and transported by making the most of the burstiness of the information flows and of the store-and-forward process at the transport nodes. First, a coding and multiplexing scheme for audio signals matched to the above transportation mode is proposed. The effectiveness of the scheme is demonstrated through computer simulation and the extent of the deviations are provided for some sets of parameters. The analysis provides useful tools to perform sensitivity analysis of network delay performance.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122095427","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 : 1988-03-27DOI: 10.1109/INFCOM.1988.12989
K. Sriram, D. Lucantoni
The authors examine the performance of a packet voice multiplexer queue in which the less significant bits on voice packets are dropped during states of congestion in the multiplexer. Using the results of simulation and analytical modeling, it is illustrated that bit dropping on voice packets significantly smoothes the superposition packet voice traffic by speeding up the packet service rate during critical periods of congestion in the queue. This phenomenon renders it possible to approximate the superposition process by a Poisson process for analyzing a packet voice multiplexer with bit dropping. The multiplexer is modeled using an M/D/1/K model in which D denotes the deterministic but state-dependent nature of service. By comparison with a simulation, this model is shown to produce quite accurate performance predictions.<>
{"title":"Traffic smoothing effects of bit dropping in a packet voice multiplexer","authors":"K. Sriram, D. Lucantoni","doi":"10.1109/INFCOM.1988.12989","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12989","url":null,"abstract":"The authors examine the performance of a packet voice multiplexer queue in which the less significant bits on voice packets are dropped during states of congestion in the multiplexer. Using the results of simulation and analytical modeling, it is illustrated that bit dropping on voice packets significantly smoothes the superposition packet voice traffic by speeding up the packet service rate during critical periods of congestion in the queue. This phenomenon renders it possible to approximate the superposition process by a Poisson process for analyzing a packet voice multiplexer with bit dropping. The multiplexer is modeled using an M/D/1/K model in which D denotes the deterministic but state-dependent nature of service. By comparison with a simulation, this model is shown to produce quite accurate performance predictions.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132474779","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 : 1988-03-27DOI: 10.1109/INFCOM.1988.12974
S. Chanson, K. Ravindran, J. Robinson
The authors examine the design and performance of LNTP, a connection-orientated transport-level protocol for local area networks (LANs) in the 4.2 BSD Unix operating system. Various measurements are taken, and LNTP's performance is compared to that of TCP/IP (ARPAnet's Transmission Control Protocol), a LHN protocol which is often used in LAN environments. The optimum values of various LNTP parameters are determined, some theoretically and others empirically. The theoretical results are compared to the experimentally observed values. It is concluded that LNTP does indeed outperform TCP/IP. However, due to the overhead of the non-LNTP specific protocol layers, this improvement is not as great as it might be. Nonetheless, LNTP proves itself to be a viable replacement for TCP/IP.<>
{"title":"The design and tuning of a transport protocol for local area networks","authors":"S. Chanson, K. Ravindran, J. Robinson","doi":"10.1109/INFCOM.1988.12974","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12974","url":null,"abstract":"The authors examine the design and performance of LNTP, a connection-orientated transport-level protocol for local area networks (LANs) in the 4.2 BSD Unix operating system. Various measurements are taken, and LNTP's performance is compared to that of TCP/IP (ARPAnet's Transmission Control Protocol), a LHN protocol which is often used in LAN environments. The optimum values of various LNTP parameters are determined, some theoretically and others empirically. The theoretical results are compared to the experimentally observed values. It is concluded that LNTP does indeed outperform TCP/IP. However, due to the overhead of the non-LNTP specific protocol layers, this improvement is not as great as it might be. Nonetheless, LNTP proves itself to be a viable replacement for TCP/IP.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134379970","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 : 1988-03-27DOI: 10.1109/INFCOM.1988.12984
T. Suda, N. Watanabe
An investigation is made of various error recovery schemes for a very-high-speed packet switched network. The schemes investigated are: (1) edge-to-edge recovery, whereby retransmission of erred packets only takes place between source and destination nodes, (2) link-by-link recovery, whereby retransmission only takes place between adjacent switching nodes, and (3) link-edge-combined recovery, using both link-by-link and edge-to-edge schemes. The performance measures are the distribution of transmission delay and error probability of packets across a network. To obtain these measures, the authors develop a tandem queuing network model with feedbacks, where each queue represents a protocol layer within a switching node rather than a switching node as a whole. Numerical results show that for a network with very-high-speed/low-error-rate channels, the edge-to-edge scheme gives the smallest packet transmission delay, while keeping the packet error probability sufficiently small. The only drawback of the edge-to-edge scheme is that it causes network saturation at smaller network traffic load than the older schemes.<>
{"title":"Evaluation of error recovery schemes for a high-speed packet switched network: link-by-link versus edge-to-edge schemes","authors":"T. Suda, N. Watanabe","doi":"10.1109/INFCOM.1988.12984","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12984","url":null,"abstract":"An investigation is made of various error recovery schemes for a very-high-speed packet switched network. The schemes investigated are: (1) edge-to-edge recovery, whereby retransmission of erred packets only takes place between source and destination nodes, (2) link-by-link recovery, whereby retransmission only takes place between adjacent switching nodes, and (3) link-edge-combined recovery, using both link-by-link and edge-to-edge schemes. The performance measures are the distribution of transmission delay and error probability of packets across a network. To obtain these measures, the authors develop a tandem queuing network model with feedbacks, where each queue represents a protocol layer within a switching node rather than a switching node as a whole. Numerical results show that for a network with very-high-speed/low-error-rate channels, the edge-to-edge scheme gives the smallest packet transmission delay, while keeping the packet error probability sufficiently small. The only drawback of the edge-to-edge scheme is that it causes network saturation at smaller network traffic load than the older schemes.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132910945","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 : 1988-03-27DOI: 10.1109/INFCOM.1988.12934
F. Bernabei, A. Forcina, M. Listanti
The definition of a class of N*N interconnection networks called the parallel delta network (PDN) is studied. For this class of networks the nonblocking conditions are given. In particular, by the graph colouring technique, it has been proved that the minimum number of delta subnetworks (L) necessary to provide the nonblocking property is L=n where n is the size of the basic switching element and S the number of stages required by an N*N delta network. A routing algorithm for the establishment of any permutation has been defined. It operates for any value of n and shows a polynomial time complexity equal to O(N/sup 3///sup 2/). Moreover, in case of the setup of a single connection request, this algorithm assures a time complexity equal to O( square root N). This property makes it well suitable to an asynchronous telecommunication environment.<>
{"title":"On non-blocking properties of parallel delta networks","authors":"F. Bernabei, A. Forcina, M. Listanti","doi":"10.1109/INFCOM.1988.12934","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12934","url":null,"abstract":"The definition of a class of N*N interconnection networks called the parallel delta network (PDN) is studied. For this class of networks the nonblocking conditions are given. In particular, by the graph colouring technique, it has been proved that the minimum number of delta subnetworks (L) necessary to provide the nonblocking property is L=n where n is the size of the basic switching element and S the number of stages required by an N*N delta network. A routing algorithm for the establishment of any permutation has been defined. It operates for any value of n and shows a polynomial time complexity equal to O(N/sup 3///sup 2/). Moreover, in case of the setup of a single connection request, this algorithm assures a time complexity equal to O( square root N). This property makes it well suitable to an asynchronous telecommunication environment.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128538309","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 : 1988-03-27DOI: 10.1109/INFCOM.1988.12898
Y. Ofek
The optical hypergraph is a novel network architecture in which each edge of the hypergraph is a multiple-access broadcast medium constructed as a passive optical star coupler. Access to each net (edge) is time-slotted, and the system maintains global slot synchronization. The integration of voice into the system is done by reserving time slots in a periodic manner. A packet which contains several voice parcels from different phone conversations is transferred in these slots. These parcels may have different destinations on the optical net. As a result of the global end-to-end synchronization, the delay from the source to the destination is a known constant, with accuracy of plus or minus half a time slot. In the analysis, it is shown that the system improves its operation as the communication bandwidth increases. In other words, the algorithms and protocols improve in performance as the communication bandwidth increases. Two criteria are used to exhibit this phenomenon: (i) the utilization efficiency and (ii) the end-to-end delay.<>
{"title":"Integration of voice communication on a synchronous optical hypergraph","authors":"Y. Ofek","doi":"10.1109/INFCOM.1988.12898","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12898","url":null,"abstract":"The optical hypergraph is a novel network architecture in which each edge of the hypergraph is a multiple-access broadcast medium constructed as a passive optical star coupler. Access to each net (edge) is time-slotted, and the system maintains global slot synchronization. The integration of voice into the system is done by reserving time slots in a periodic manner. A packet which contains several voice parcels from different phone conversations is transferred in these slots. These parcels may have different destinations on the optical net. As a result of the global end-to-end synchronization, the delay from the source to the destination is a known constant, with accuracy of plus or minus half a time slot. In the analysis, it is shown that the system improves its operation as the communication bandwidth increases. In other words, the algorithms and protocols improve in performance as the communication bandwidth increases. Two criteria are used to exhibit this phenomenon: (i) the utilization efficiency and (ii) the end-to-end delay.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128677261","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
扫码关注我们
求助内容：
应助结果提醒方式：