Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12938
M. Gerla
A novel fiber-optic architecture, Tree-Net, is presented which does not require intermediate processing components. Tree-Net is based on a tree topology, passive station taps, and implicit token protocol. The properties and performance of Tree-Net are evaluated, and possible extensions of the basic scheme are discussed.<>
{"title":"Tree-Net, a multi-level fiber optics MAN","authors":"M. Gerla","doi":"10.1109/INFCOM.1988.12938","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12938","url":null,"abstract":"A novel fiber-optic architecture, Tree-Net, is presented which does not require intermediate processing components. Tree-Net is based on a tree topology, passive station taps, and implicit token protocol. The properties and performance of Tree-Net are evaluated, and possible extensions of the basic scheme are discussed.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"63 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":"126625673","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.12926
K. Le, C. Raghavendra
Double-loop networks have a higher connectivity and therefore a higher potential for fault tolerance than single-loop networks. The authors present distributed routing schemes that fully utilize that fault-tolerance potential, and that are applicable in particular to a specific class of double-loop networks, characterized by a forward loop connecting all the adjacent nodes, and a backward loop connecting nodes separated by a distance that depends on N, the number of nodes. A nice feature of these schemes is that for a given node, only local knowledge on the status of the neighboring nodes and links is required. Yet the schemes detect faulty nodes and links and adapt to the situation, so that a packet will eventually reach its destination, if there exists a path. A simulation has shown that the average overhead resulting from the schemes, in terms of number of hops, does not exceed 17%, for values of N around 16.<>
{"title":"Fault-tolerant routing in a class of double loop networks","authors":"K. Le, C. Raghavendra","doi":"10.1109/INFCOM.1988.12926","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12926","url":null,"abstract":"Double-loop networks have a higher connectivity and therefore a higher potential for fault tolerance than single-loop networks. The authors present distributed routing schemes that fully utilize that fault-tolerance potential, and that are applicable in particular to a specific class of double-loop networks, characterized by a forward loop connecting all the adjacent nodes, and a backward loop connecting nodes separated by a distance that depends on N, the number of nodes. A nice feature of these schemes is that for a given node, only local knowledge on the status of the neighboring nodes and links is required. Yet the schemes detect faulty nodes and links and adapt to the situation, so that a packet will eventually reach its destination, if there exists a path. A simulation has shown that the average overhead resulting from the schemes, in terms of number of hops, does not exceed 17%, for values of N around 16.<<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":"131224524","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.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.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.12941
Jung-Bong Suk, C. Cassandras
An analysis is provided of queuing models in virtual route networks for which a pacing window flow control mechanism is used. An input queue is introduced to describe the waiting system where messages prevented from entering the network are stored in first-come, first-served manner. Both finite and infinite capacity are considered. The model leads to a Markovian queuing system, which is fully solved by matrix-geometric methods. The analytical results show that the optimal window size which maximizes the power criterion including the admission delay is nearly twice the number of hops (nodes of the network) for the model with infinite input-queue capacity. This rule of thumb also applies to the finite-capacity model with certain restrictions. Simulations are presented to verify the analytical results.<>
{"title":"Analysis and optimization of pacing window flow control with admission delay","authors":"Jung-Bong Suk, C. Cassandras","doi":"10.1109/INFCOM.1988.12941","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12941","url":null,"abstract":"An analysis is provided of queuing models in virtual route networks for which a pacing window flow control mechanism is used. An input queue is introduced to describe the waiting system where messages prevented from entering the network are stored in first-come, first-served manner. Both finite and infinite capacity are considered. The model leads to a Markovian queuing system, which is fully solved by matrix-geometric methods. The analytical results show that the optimal window size which maximizes the power criterion including the admission delay is nearly twice the number of hops (nodes of the network) for the model with infinite input-queue capacity. This rule of thumb also applies to the finite-capacity model with certain restrictions. Simulations are presented to verify the analytical results.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"91 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":"122820574","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.12923
D. Feldmeier
High-speed packet-switched communications to the home can be provided using an existing community antenna television (CATV) system. The author focuses on an efficient access scheme for a network that operates on a CATV system. The scheme takes advantage of packet address locality to minimize the expected network access overhead. Its efficiency is compared with that of other access schemes that might be used on a CATV-based network.<>
{"title":"An efficient access scheme for a CATV-based high-speed packet-switching metropolitan area network","authors":"D. Feldmeier","doi":"10.1109/INFCOM.1988.12923","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12923","url":null,"abstract":"High-speed packet-switched communications to the home can be provided using an existing community antenna television (CATV) system. The author focuses on an efficient access scheme for a network that operates on a CATV system. The scheme takes advantage of packet address locality to minimize the expected network access overhead. Its efficiency is compared with that of other access schemes that might be used on a CATV-based 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":"137 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":"121365823","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.12913
G. Juanole, A. Ónodi
The authors are concerned with the design of multilayer architectures in distributed systems and computer networks. First, they give the basic knowledge that any designer must have for designing, in a consistent way, a set of layers. This knowledge concerns the objects of a layer, their attributes and their relationships. Second, they consider an example of network interconnection, at the network layer, on the basis of the internal organization of the network layer defined by ISO and apply this basic knowledge for specifying the architecture for internetworking.<>
{"title":"Towards a knowledge base for specifying multilayer architectures-application to internetworking","authors":"G. Juanole, A. Ónodi","doi":"10.1109/INFCOM.1988.12913","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12913","url":null,"abstract":"The authors are concerned with the design of multilayer architectures in distributed systems and computer networks. First, they give the basic knowledge that any designer must have for designing, in a consistent way, a set of layers. This knowledge concerns the objects of a layer, their attributes and their relationships. Second, they consider an example of network interconnection, at the network layer, on the basis of the internal organization of the network layer defined by ISO and apply this basic knowledge for specifying the architecture for internetworking.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"46 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":"121432676","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.12950
A. Pattavina
The authors examine the optimal choice of the slot size in terms of bandwidth usage in slotted broadband communication networks based on self-routing switching fabrics and statistical multiplexing schemes. This is a difficult problem, because of the uncertainty of the kinds and of mix of services to be supported by the network. To make this problem less critical, a packet multiplexing scheme is proposed, allowing several packets to be multiplexed in the same slot on a digital link. This scheme aims at avoiding bandwidth inefficiency when the information unit is smaller than the user capacity of a slot. This can take place for transactional data traffic and for packet voice traffic when the voice packet size underutilizes the slot capacity. The performance of a concentrator implementing this feature loaded by a data traffic is evaluated, providing upper bounds on the throughput and evaluating packet delay and buffer occupancy for different input levels.<>
{"title":"A packet multiplexing scheme for slotted broadband networks","authors":"A. Pattavina","doi":"10.1109/INFCOM.1988.12950","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12950","url":null,"abstract":"The authors examine the optimal choice of the slot size in terms of bandwidth usage in slotted broadband communication networks based on self-routing switching fabrics and statistical multiplexing schemes. This is a difficult problem, because of the uncertainty of the kinds and of mix of services to be supported by the network. To make this problem less critical, a packet multiplexing scheme is proposed, allowing several packets to be multiplexed in the same slot on a digital link. This scheme aims at avoiding bandwidth inefficiency when the information unit is smaller than the user capacity of a slot. This can take place for transactional data traffic and for packet voice traffic when the voice packet size underutilizes the slot capacity. The performance of a concentrator implementing this feature loaded by a data traffic is evaluated, providing upper bounds on the throughput and evaluating packet delay and buffer occupancy for different input levels.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"56 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":"128601089","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.12909
Wai Chen, San-qi Li, M. Schwartz
Random access scheduling schemes for broadcast-bus-type local area networks are considered. It is found that a good access scheduling scheme not only has information about the number of packets to be scheduled, but which, more importantly controls the average of this number, which can be achieved by properly choosing the scheduling interval. Furthermore, this scheduling interval is updated in such a way that adjacent intervals overlap, which by correlation gives a better estimate for the number of packets to be scheduled. The scheduling schemes developed using such concepts provide significant performance improvement over schemes using other scheduling approaches previously reported in the literature.<>
{"title":"Access scheduling schemes using global information on local area networks","authors":"Wai Chen, San-qi Li, M. Schwartz","doi":"10.1109/INFCOM.1988.12909","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12909","url":null,"abstract":"Random access scheduling schemes for broadcast-bus-type local area networks are considered. It is found that a good access scheduling scheme not only has information about the number of packets to be scheduled, but which, more importantly controls the average of this number, which can be achieved by properly choosing the scheduling interval. Furthermore, this scheduling interval is updated in such a way that adjacent intervals overlap, which by correlation gives a better estimate for the number of packets to be scheduled. The scheduling schemes developed using such concepts provide significant performance improvement over schemes using other scheduling approaches previously reported in the literature.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"126 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":"116346314","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
扫码关注我们
求助内容：
应助结果提醒方式：