Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12966
Y. Birk, F. Tobagi, M. Marhic
The author presents the topological design space of single-hop interconnection among multitransceiver stations (no intermediate switches and no forwarding). They explore a class of such interconnections for which the throughput with a uniform traffic pattern is proportional to the square of the number of transceivers per station. These interconnections consist of a collection of buses, each of which interconnects a proper subset of the stations, and are referred to as selective-broadcast interconnections. They are compared with a multiple-broadcast-bus interconnection in terms of station hardware, throughput, delay, and power budget.<>
{"title":"Bus-oriented interconnection topologies for single-hop communication among multi-transceiver stations","authors":"Y. Birk, F. Tobagi, M. Marhic","doi":"10.1109/INFCOM.1988.12966","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12966","url":null,"abstract":"The author presents the topological design space of single-hop interconnection among multitransceiver stations (no intermediate switches and no forwarding). They explore a class of such interconnections for which the throughput with a uniform traffic pattern is proportional to the square of the number of transceivers per station. These interconnections consist of a collection of buses, each of which interconnects a proper subset of the stations, and are referred to as selective-broadcast interconnections. They are compared with a multiple-broadcast-bus interconnection in terms of station hardware, throughput, delay, and power budget.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"42 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":"132081929","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.13001
P. Tran-Gia, H. Ahmadi
The authors present and solve a discrete-time G/sup (X)//D/1-S queuing system with a finite queue size and batch arrivals with a general batch size distribution. The motivation for this model arises from performance modeling of a statistical multiplexer with synchronous transmission of fixed-size data units in synchronous time slots. The arrival process to the multiplexer, for example, may originate from a number of independent sources with packets of variable lengths. Hence, a packet arrival corresponds to an arrival of a batch of data units. Different performance measures such as percentage of packet loss and data-unit loss are considered under two different admission policies of packets into the queue.<>
{"title":"Analysis of a discrete-time G/sup (X)//D/1-S queueing system with applications in packet-switching systems","authors":"P. Tran-Gia, H. Ahmadi","doi":"10.1109/INFCOM.1988.13001","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13001","url":null,"abstract":"The authors present and solve a discrete-time G/sup (X)//D/1-S queuing system with a finite queue size and batch arrivals with a general batch size distribution. The motivation for this model arises from performance modeling of a statistical multiplexer with synchronous transmission of fixed-size data units in synchronous time slots. The arrival process to the multiplexer, for example, may originate from a number of independent sources with packets of variable lengths. Hence, a packet arrival corresponds to an arrival of a batch of data units. Different performance measures such as percentage of packet loss and data-unit loss are considered under two different admission policies of packets into the queue.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"6 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":"132375840","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.13007
Nikos B. Pronios, A. Polydoros
The authors develop approximate methods for performance evaluation of a general class of slotted Aloha-type random-access spread-spectrum networks. Approximation is used in three levels: the diffusion approximation of the process Q(t) (a variant of the number of backlogged users), the approximation of the random-access channel and the existing receivers by a single server with equivalent queue-size-dependent service rate, and the approximation of the state-dependent composite traffic distribution by a Gaussian random variable with equivalent mean and variance. Applications and comparisons with the precise solutions are given.<>
{"title":"Approximate methods for analyzing slotted random-access spread-spectrum networks","authors":"Nikos B. Pronios, A. Polydoros","doi":"10.1109/INFCOM.1988.13007","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13007","url":null,"abstract":"The authors develop approximate methods for performance evaluation of a general class of slotted Aloha-type random-access spread-spectrum networks. Approximation is used in three levels: the diffusion approximation of the process Q(t) (a variant of the number of backlogged users), the approximation of the random-access channel and the existing receivers by a single server with equivalent queue-size-dependent service rate, and the approximation of the state-dependent composite traffic distribution by a Gaussian random variable with equivalent mean and variance. Applications and comparisons with the precise solutions are given.<<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":"130048430","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.12939
W. Ritchie
A description is given of the design of the British Telecommunications switched-star multiservice network now operational in London. Particular attention is given to the choice of network architecture, service provision, and control. The Mark 2 design is discussed. A study is also presented of an all-digital, all-optical multiservice star-structured network which anticipates broadband ISDN.<>
{"title":"Developments in integrated, multiservice, broadband local networks","authors":"W. Ritchie","doi":"10.1109/INFCOM.1988.12939","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12939","url":null,"abstract":"A description is given of the design of the British Telecommunications switched-star multiservice network now operational in London. Particular attention is given to the choice of network architecture, service provision, and control. The Mark 2 design is discussed. A study is also presented of an all-digital, all-optical multiservice star-structured network which anticipates broadband ISDN.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"3 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":"131826568","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.12937
G. Hill
A class of wavelength-routing optical networks is described on the basis of the interconnection of wavelength multiplexed channels. Unlike previously described optical network structures, these networks allow the reuse of wavelengths in different transmission sections and this leads to fewer wavelengths being needed. A choice of structures using a common set of components leads to the opportunity to design a network according to the geographical distribution of the switching nodes. The structures provide for a set of point-to-point interconnections and, with modest numbers of wavelengths, full interconnection between the optoelectronic nodes is possible at the optical level. In bypassing intermediate electronic stages the networks appear to offer good reliability characteristics. Providing the components in an initial network are designed to utilize bandwidth efficiently, the networks could be upgraded to incorporate more channels, optical switching, and other forms of optical processing at the optical nodes.<>
{"title":"A wavelength routing approach to optical communications networks","authors":"G. Hill","doi":"10.1109/INFCOM.1988.12937","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12937","url":null,"abstract":"A class of wavelength-routing optical networks is described on the basis of the interconnection of wavelength multiplexed channels. Unlike previously described optical network structures, these networks allow the reuse of wavelengths in different transmission sections and this leads to fewer wavelengths being needed. A choice of structures using a common set of components leads to the opportunity to design a network according to the geographical distribution of the switching nodes. The structures provide for a set of point-to-point interconnections and, with modest numbers of wavelengths, full interconnection between the optoelectronic nodes is possible at the optical level. In bypassing intermediate electronic stages the networks appear to offer good reliability characteristics. Providing the components in an initial network are designed to utilize bandwidth efficiently, the networks could be upgraded to incorporate more channels, optical switching, and other forms of optical processing at the optical nodes.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"35 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":"127363469","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.12901
D. Sidhu, Ting-Kau Leung
The authors present an estimation of fault coverage of four protocol test sequences generation techniques (T-, U-, D-, and W-methods) using Monte Carlo simulation on a simple protocol machine. The ability of a test sequence to decide whether a protocol implementation conforms to its specification heavily relies upon the range of faults that it can capture. This study shows that a test sequence produced by T-method has a poor fault detection capability whereas test sequences produced by U-, D- and W-methods have fault coverage comparable to each other and superior to that for T-method on several classes of randomly generated machines used.<>
{"title":"Fault coverage of protocol test methods","authors":"D. Sidhu, Ting-Kau Leung","doi":"10.1109/INFCOM.1988.12901","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12901","url":null,"abstract":"The authors present an estimation of fault coverage of four protocol test sequences generation techniques (T-, U-, D-, and W-methods) using Monte Carlo simulation on a simple protocol machine. The ability of a test sequence to decide whether a protocol implementation conforms to its specification heavily relies upon the range of faults that it can capture. This study shows that a test sequence produced by T-method has a poor fault detection capability whereas test sequences produced by U-, D- and W-methods have fault coverage comparable to each other and superior to that for T-method on several classes of randomly generated machines used.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"14 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":"128893135","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.12996
Z. Gao, K. Vastola
A Markovian model is developed for the analysis of an integrated voice/data local area network protocol. This protocol is a variation on a protocol proposed by N.F. Maxemchuk (1982). In this protocol, voice accesses the channel initially using CSMA/CD (carrier-sensing multiple access with collision detection) and thereafter using TDMA (time-division multiple access). Data uses CSMA/CD; priority is given to voice. Using this model, the throughput/delay characteristics for data users is derived.<>
{"title":"Performance analysis of an integrated voice/data protocol","authors":"Z. Gao, K. Vastola","doi":"10.1109/INFCOM.1988.12996","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12996","url":null,"abstract":"A Markovian model is developed for the analysis of an integrated voice/data local area network protocol. This protocol is a variation on a protocol proposed by N.F. Maxemchuk (1982). In this protocol, voice accesses the channel initially using CSMA/CD (carrier-sensing multiple access with collision detection) and thereafter using TDMA (time-division multiple access). Data uses CSMA/CD; priority is given to voice. Using this model, the throughput/delay characteristics for data users is derived.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"26 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":"121152322","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.12999
G. A. Ray, J. Dunsmore
The authors present some analytical results which can be used to compute network reliability. Some simple techniques to make asymptotic approximations based on parameters of the network topology are derived. Explicit reliability formulae are computed for four network topologies, including the star and counterrotating ring. Actual manufacturer's data and failure models for laser diodes and LEDs are used to compare the effects of transmitter reliability on the whole network.<>
{"title":"Reliability of network topologies","authors":"G. A. Ray, J. Dunsmore","doi":"10.1109/INFCOM.1988.12999","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12999","url":null,"abstract":"The authors present some analytical results which can be used to compute network reliability. Some simple techniques to make asymptotic approximations based on parameters of the network topology are derived. Explicit reliability formulae are computed for four network topologies, including the star and counterrotating ring. Actual manufacturer's data and failure models for laser diodes and LEDs are used to compare the effects of transmitter reliability on the whole network.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"14 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":"115355375","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.12979
Walter Sotelo, K. Mukumoto, A. Fukuda
The M/sup (m)//M/K and M/sup (m)//M/ infinity models with synchronous fluctuation of traffic intensity are considered. The phase process is assumed to make changes according to an irreducible m-phase Markov chain. In contrast to the model with asynchronous fluctuation of parameters, a phase change may occur only in synchronization with an arrival or beginning of service of a customer. The authors study the steady-state regime of their models and observe that closed-form solutions for the limiting probabilities are generally difficult to obtain. They give a necessary and sufficient condition for the steady state to be attained. Numerical examples are discussed that demonstrate the behavior of the system under different traffic conditions.<>
{"title":"M/M/K systems with M-phase fluctuations of traffic intensity","authors":"Walter Sotelo, K. Mukumoto, A. Fukuda","doi":"10.1109/INFCOM.1988.12979","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12979","url":null,"abstract":"The M/sup (m)//M/K and M/sup (m)//M/ infinity models with synchronous fluctuation of traffic intensity are considered. The phase process is assumed to make changes according to an irreducible m-phase Markov chain. In contrast to the model with asynchronous fluctuation of parameters, a phase change may occur only in synchronization with an arrival or beginning of service of a customer. The authors study the steady-state regime of their models and observe that closed-form solutions for the limiting probabilities are generally difficult to obtain. They give a necessary and sufficient condition for the steady state to be attained. Numerical examples are discussed that demonstrate the behavior of the system under different traffic conditions.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"33 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":"130985381","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.13017
J.-L.C. Wu, J. Wu, Ted C. Lee
The authors analyze the performance of interconnected CSMA/CD (carrier-sense multiple-access with collision detection) LANs. The interconnection system consists of a packet-switch node which interconnects numerous sections of local area networks operated in unslotted nonpersistent CSMA/CD mode. Each of the CSMA/CD networks has a finite number of users. The authors assume that the sections of LANs interconnected are homogeneous and they all have the same number of users attached. A detailed modeling technique of the system using continuous-time Markov chain is explored. The state-transition-rate diagrams of each of the CSMA/CD networks are investigated. The system throughput and delay are also studied. Numerical calculation and simulation of both throughput and delay are provided.<>
分析了CSMA/CD (carrier-sense multiple access with collision detection)局域网的互连性能。互连系统由一个分组交换节点组成，该节点将以无槽非持久CSMA/CD模式运行的局域网的许多部分互连。每个CSMA/CD网络都有有限数量的用户。作者假设相互连接的局域网各部分是同质的，并且它们都有相同数量的用户连接。探讨了用连续时间马尔可夫链对系统进行详细建模的技术。研究了各CSMA/CD网络的状态转移率图。研究了系统的吞吐量和时延。给出了吞吐量和时延的数值计算和仿真。
{"title":"Performance analysis of interconnected CSMA/CD networks with finite population","authors":"J.-L.C. Wu, J. Wu, Ted C. Lee","doi":"10.1109/INFCOM.1988.13017","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13017","url":null,"abstract":"The authors analyze the performance of interconnected CSMA/CD (carrier-sense multiple-access with collision detection) LANs. The interconnection system consists of a packet-switch node which interconnects numerous sections of local area networks operated in unslotted nonpersistent CSMA/CD mode. Each of the CSMA/CD networks has a finite number of users. The authors assume that the sections of LANs interconnected are homogeneous and they all have the same number of users attached. A detailed modeling technique of the system using continuous-time Markov chain is explored. The state-transition-rate diagrams of each of the CSMA/CD networks are investigated. The system throughput and delay are also studied. Numerical calculation and simulation of both throughput and delay are provided.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"27 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":"126834654","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
扫码关注我们
求助内容：
应助结果提醒方式：