Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12892
T. Lee, R. Boorstyn, E. Arthurs
The authors propose an architecture that can switch hundreds of gigabits while meeting a wide variety of service requirements. The switch can be constructed out of a few atomic cell types with regular interconnection patterns. This simple structure lends itself to very effective VLSI implementation. The multicast packet switch consists of three internally nonblocking, self-routing subnetworks. First, the selector subnetwork arbitrates among competing demands for copies to satisfy real-time requirements. The copy subnetwork then makes the copies and the switch subnetwork routes the packet copies to their final destinations. The authors detail the architecture and operation of the multicast switch.<>
{"title":"The architecture of a multicast broadband packet switch","authors":"T. Lee, R. Boorstyn, E. Arthurs","doi":"10.1109/INFCOM.1988.12892","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12892","url":null,"abstract":"The authors propose an architecture that can switch hundreds of gigabits while meeting a wide variety of service requirements. The switch can be constructed out of a few atomic cell types with regular interconnection patterns. This simple structure lends itself to very effective VLSI implementation. The multicast packet switch consists of three internally nonblocking, self-routing subnetworks. First, the selector subnetwork arbitrates among competing demands for copies to satisfy real-time requirements. The copy subnetwork then makes the copies and the switch subnetwork routes the packet copies to their final destinations. The authors detail the architecture and operation of the multicast switch.<<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":"116801144","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.12970
K. J. Lee, B. Kadaba
The authors develop distributed routing algorithms for large computer networks that provide virtual circuit connections to end users. One routing scheme in computer networks is to use a topology database maintained at each node that contains information about nodes and link cost. Using this information, each node finds shortest routes to other nodes. This scheme may be inefficient in large networks since the overhead associated with topology database update and shortest path computation may become large. One way of solving this problem is to partition the network into subnetworks or clusters. After partitioning, each node in a cluster only maintains a topology database of nodes and links in its own cluster and possibly marginal information about the entire network. For intracluster communication, shortest path routes are provided. For intercluster communication the source node collaborates with other nodes to find a path to the destination node. The authors propose two collaboration schemes that use simple protocols among network nodes. In one scheme, a broadcast search is used to find a path to the destination node in other clusters. In the other scheme each node maintains information about intercluster links on an up/down basis as well as complete topology database of its own cluster. Using this information, it finds a path to the destination node with the help of border nodes (nodes sharing intercluster links) in the intermediate clusters.<>
{"title":"Distributed routing using topology database in large computer networks","authors":"K. J. Lee, B. Kadaba","doi":"10.1109/INFCOM.1988.12970","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12970","url":null,"abstract":"The authors develop distributed routing algorithms for large computer networks that provide virtual circuit connections to end users. One routing scheme in computer networks is to use a topology database maintained at each node that contains information about nodes and link cost. Using this information, each node finds shortest routes to other nodes. This scheme may be inefficient in large networks since the overhead associated with topology database update and shortest path computation may become large. One way of solving this problem is to partition the network into subnetworks or clusters. After partitioning, each node in a cluster only maintains a topology database of nodes and links in its own cluster and possibly marginal information about the entire network. For intracluster communication, shortest path routes are provided. For intercluster communication the source node collaborates with other nodes to find a path to the destination node. The authors propose two collaboration schemes that use simple protocols among network nodes. In one scheme, a broadcast search is used to find a path to the destination node in other clusters. In the other scheme each node maintains information about intercluster links on an up/down basis as well as complete topology database of its own cluster. Using this information, it finds a path to the destination node with the help of border nodes (nodes sharing intercluster links) in the intermediate clusters.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"41 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":"114532528","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.12912
L. Raman
The authors addresses the operation systems (OS) and network element (NE) interface requirements for the service and protocols at the top three layers of the OSI model. Based on the needs of the operations, administration, maintenance, and provisioning (OAM&P) applications, which are the TMN (telecommunications management network) operations, subsets of the CCITT and ISO standards are defined. At the application layer of the OSI reference model, the different application service elements suitable for providing the maintenance and provisioning processes in today's telecommunications network are presented. Two categories of protocol suites are initially defined based on the requirements for OAM&P applications.<>
{"title":"OSI upper layer protocol requirements for TMN operations","authors":"L. Raman","doi":"10.1109/INFCOM.1988.12912","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12912","url":null,"abstract":"The authors addresses the operation systems (OS) and network element (NE) interface requirements for the service and protocols at the top three layers of the OSI model. Based on the needs of the operations, administration, maintenance, and provisioning (OAM&P) applications, which are the TMN (telecommunications management network) operations, subsets of the CCITT and ISO standards are defined. At the application layer of the OSI reference model, the different application service elements suitable for providing the maintenance and provisioning processes in today's telecommunications network are presented. Two categories of protocol suites are initially defined based on the requirements for OAM&P applications.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"19 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":"115194217","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.12995
B. Mukherjee, J. Meditch
The authors extend the p/sub i/-persistent protocol previously proposed to include voice for multiaccess communication over unidirectional broadcast bus networks. They use a framed approach for integrating these two traffic types. Further, they use not only speech detectors for modeling speech sources, but also a movable-boundary scheme for their protocol in which the voice subframe size is estimated from the number of voice packets transmitted in the previous frame. The authors determine the fraction of speech loss and the fraction of wasted allocated bandwidth due to the estimator by formulating a Markov chain for the number of ready voice stations at the frame boundaries. To analyze data performance, a nonhomogeneous Markov chain is constructed for a data station's buffer content just before the data slots visit that station. Then, these models are converted to homogeneous chains from which the authors determine the optimum p/sub i/ for each data slot.<>
{"title":"A new voice-data integrated protocol for unidirectional broadcast bus networks","authors":"B. Mukherjee, J. Meditch","doi":"10.1109/INFCOM.1988.12995","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12995","url":null,"abstract":"The authors extend the p/sub i/-persistent protocol previously proposed to include voice for multiaccess communication over unidirectional broadcast bus networks. They use a framed approach for integrating these two traffic types. Further, they use not only speech detectors for modeling speech sources, but also a movable-boundary scheme for their protocol in which the voice subframe size is estimated from the number of voice packets transmitted in the previous frame. The authors determine the fraction of speech loss and the fraction of wasted allocated bandwidth due to the estimator by formulating a Markov chain for the number of ready voice stations at the frame boundaries. To analyze data performance, a nonhomogeneous Markov chain is constructed for a data station's buffer content just before the data slots visit that station. Then, these models are converted to homogeneous chains from which the authors determine the optimum p/sub i/ for each data slot.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"5 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":"125327761","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.12948
J. Zornig
Summary form only given. The emerging ISO network management standards support a very general, elegant network management architecture that is easily adapted to the specifics of a particular distributed system, e.g. a network. Because this approach to network management is broadly applicable and will be supported by equipment and software systems available from a number of vendors, it seems likely that the telecommunications industry will simply adopt ISO standards where possible. A telecommunication management network based on ISO standards could soon be procured 'off the shelf' except for two components. One of these would be a system in the local area of the network element which translates (mediates) between the system-specific functions and data structures of a particular vendor and presents to the network and to the operations systems a general, ISO/OSI compliant, interface. The other would be set of applications in the operations systems and workstations that present an operator interface which is as uniform as is possible in a multivendor system.<>
{"title":"Standard networks for telecommunications management","authors":"J. Zornig","doi":"10.1109/INFCOM.1988.12948","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12948","url":null,"abstract":"Summary form only given. The emerging ISO network management standards support a very general, elegant network management architecture that is easily adapted to the specifics of a particular distributed system, e.g. a network. Because this approach to network management is broadly applicable and will be supported by equipment and software systems available from a number of vendors, it seems likely that the telecommunications industry will simply adopt ISO standards where possible. A telecommunication management network based on ISO standards could soon be procured 'off the shelf' except for two components. One of these would be a system in the local area of the network element which translates (mediates) between the system-specific functions and data structures of a particular vendor and presents to the network and to the operations systems a general, ISO/OSI compliant, interface. The other would be set of applications in the operations systems and workstations that present an operator interface which is as uniform as is possible in a multivendor system.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"2 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":"125421453","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.13014
K. J. Lee
The authors study the database query scheduling problem at STPs (signal transfer points) in a CCS (common channel signaling) network. For each arriving query, the STP can send the query to either one of the mated SCPs (service control points) to which it is connected. The authors consider a class of query scheduling policies ranging from policies that do not require any instantaneous workload information from SCPs to a policy that requires such information. Queuing models that describe the behavior of SCPs under each scheduling policy are developed and solved to yield the mean response-time performance of query processing. The authors carry out simulation experiments to obtain the second moment statistics of the response time performance. The results show that when SCPs provide enough concurrent processing capability, a simple round-robin policy yields a good performance as that of a more sophisticated policy requiring instantaneous workload information from SCPs.<>
{"title":"Database query scheduling in common channel signalling network","authors":"K. J. Lee","doi":"10.1109/INFCOM.1988.13014","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13014","url":null,"abstract":"The authors study the database query scheduling problem at STPs (signal transfer points) in a CCS (common channel signaling) network. For each arriving query, the STP can send the query to either one of the mated SCPs (service control points) to which it is connected. The authors consider a class of query scheduling policies ranging from policies that do not require any instantaneous workload information from SCPs to a policy that requires such information. Queuing models that describe the behavior of SCPs under each scheduling policy are developed and solved to yield the mean response-time performance of query processing. The authors carry out simulation experiments to obtain the second moment statistics of the response time performance. The results show that when SCPs provide enough concurrent processing capability, a simple round-robin policy yields a good performance as that of a more sophisticated policy requiring instantaneous workload information from SCPs.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"2014 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":"125684679","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.13000
Anup Kumar, S. Rai, D. Agrawal
The authors introduce two techniques for computing the reliability of a distributed computing system (DCS). The first scheme uses two steps and requires enumeration of multiterminal connections which, in turn, leads to the reliability expression. The second technique, called FARE (Fast Algorithm for Reliability Evaluation), does not require an a priori knowledge of multiterminal connections for computing the reliability expression. A performance parameter called the communication cost index (CCI) is defined. The authors compare algorithms with an existing method in terms of computer time and memory requirement. The results show that FARE outperforms two-step methods.<>
{"title":"Reliability evaluation algorithms for distributed systems","authors":"Anup Kumar, S. Rai, D. Agrawal","doi":"10.1109/INFCOM.1988.13000","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13000","url":null,"abstract":"The authors introduce two techniques for computing the reliability of a distributed computing system (DCS). The first scheme uses two steps and requires enumeration of multiterminal connections which, in turn, leads to the reliability expression. The second technique, called FARE (Fast Algorithm for Reliability Evaluation), does not require an a priori knowledge of multiterminal connections for computing the reliability expression. A performance parameter called the communication cost index (CCI) is defined. The authors compare algorithms with an existing method in terms of computer time and memory requirement. The results show that FARE outperforms two-step methods.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"75 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":"128151846","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.12933
S.-Y.R. Li
The following model of a packet switch is considered: at each clock tick, the switch attempts to route the head-of-line packet at the buffer of every input port to its destination port. Each output port can receive only one packet at a time, but there may be packets from multiple inputs destined for common output. The switch first selects exactly one packet for each requested output and then routes all selected packets through a self-route interconnection network such as the Batcher-Banyan network. Based on the traffic assumption of periodic packet streams, the necessary and sufficient clock rate is determined in order for the switch to be nonblocking. This result has turned out to be quite different from analyses based on the assumption of random traffic.<>
{"title":"Theory of periodic contention and its application to packet switching","authors":"S.-Y.R. Li","doi":"10.1109/INFCOM.1988.12933","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12933","url":null,"abstract":"The following model of a packet switch is considered: at each clock tick, the switch attempts to route the head-of-line packet at the buffer of every input port to its destination port. Each output port can receive only one packet at a time, but there may be packets from multiple inputs destined for common output. The switch first selects exactly one packet for each requested output and then routes all selected packets through a self-route interconnection network such as the Batcher-Banyan network. Based on the traffic assumption of periodic packet streams, the necessary and sufficient clock rate is determined in order for the switch to be nonblocking. This result has turned out to be quite different from analyses based on the assumption of random traffic.<<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":"126832012","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.12958
N. Shacham, D. Towsley
The authors consider an SR ARQ (selective-repeat automatic-repeat-request) protocol with the one source and multiple receivers, where each receiver acknowledges all packets and handles its resequencing buffer based only on the packets that it receives error-free. An analysis of the resequencing delay and buffer occupancy at a receiver is presented. They construct a model that allows them to derive steady-state results and that makes into consideration system parameters such as number of receivers, propagation delay, and error probabilities of packets and acknowledgements. The main results of the analysis are the distribution of the resequencing delay and the distribution of the number of packets occupying the receiver's buffer. They also derive simple expressions for the mean buffer occupancy at the limit as the packet error probability tends to one. Numerical results are provided to illustrate the effects of system parameters on the behavior of the expected resequencing delay and the expected buffer occupancy.<>
{"title":"Resequencing delay and buffer occupancy in selective repeat ARQ with multiple receivers","authors":"N. Shacham, D. Towsley","doi":"10.1109/INFCOM.1988.12958","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12958","url":null,"abstract":"The authors consider an SR ARQ (selective-repeat automatic-repeat-request) protocol with the one source and multiple receivers, where each receiver acknowledges all packets and handles its resequencing buffer based only on the packets that it receives error-free. An analysis of the resequencing delay and buffer occupancy at a receiver is presented. They construct a model that allows them to derive steady-state results and that makes into consideration system parameters such as number of receivers, propagation delay, and error probabilities of packets and acknowledgements. The main results of the analysis are the distribution of the resequencing delay and the distribution of the number of packets occupying the receiver's buffer. They also derive simple expressions for the mean buffer occupancy at the limit as the packet error probability tends to one. Numerical results are provided to illustrate the effects of system parameters on the behavior of the expected resequencing delay and the expected buffer occupancy.<<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":"131365220","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.12936
H. S. Kim, A. Leon-Garcia
The authors present an analytical method to evaluate the performance of the buffered Banyan packet-switching network under nonuniform traffic patterns. It is shown that the nonuniform traffic can have a detrimental effect on the performance of the network. The analytical model is extended to evaluate the performance of multibuffer and parallel Banyan networks. These modified networks are shown to have better throughput capacity and delay performance than the single-buffer Banyan network.<>
{"title":"Performance of buffered Banyan networks under nonuniform patterns","authors":"H. S. Kim, A. Leon-Garcia","doi":"10.1109/INFCOM.1988.12936","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12936","url":null,"abstract":"The authors present an analytical method to evaluate the performance of the buffered Banyan packet-switching network under nonuniform traffic patterns. It is shown that the nonuniform traffic can have a detrimental effect on the performance of the network. The analytical model is extended to evaluate the performance of multibuffer and parallel Banyan networks. These modified networks are shown to have better throughput capacity and delay performance than the single-buffer Banyan 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":"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":"130455050","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
扫码关注我们
求助内容：
应助结果提醒方式：