Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12904
S. H. Lee
An approach to achieving integrated transmission of packet and circuit traffic is proposed. Starting with dynamic time-division multiplexing (DTDM), integrated multiplexing techniques based on block-level processing are described together with their design architecture. These multiplexing techniques allow the handling of both bursty traffic and continuous time-multiplexed signals through the same physical multiplexer, while maintaining a design complexity that is not greater than that of a conventional time division multiplexer. By incorporating these multiplexing techniques into the existing network, DTDM will provide a practical migration strategy from the existing predominantly circuit-switched network to a future broadband packet-switched network.<>
{"title":"An integrated transport technique for circuit and packet switched traffic","authors":"S. H. Lee","doi":"10.1109/INFCOM.1988.12904","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12904","url":null,"abstract":"An approach to achieving integrated transmission of packet and circuit traffic is proposed. Starting with dynamic time-division multiplexing (DTDM), integrated multiplexing techniques based on block-level processing are described together with their design architecture. These multiplexing techniques allow the handling of both bursty traffic and continuous time-multiplexed signals through the same physical multiplexer, while maintaining a design complexity that is not greater than that of a conventional time division multiplexer. By incorporating these multiplexing techniques into the existing network, DTDM will provide a practical migration strategy from the existing predominantly circuit-switched network to a future broadband packet-switched 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":"111 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120833102","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.12978
O. Aboul-Magd, A. Leon-Garcia
A queuing model for an integrated voice and data node using burst switching is presented. The integrated node is assumed to have finite capacity for holding the data units waiting for transmission. An exact analytical technique is presented for estimating the mean number of data units in the system. The computational complexity of the analytic approach developed does not depend on the buffer size. The mean number of data units in the system obtained using a quasistatic analysis is compared to that obtained using the exact approach. It is shown that the accuracy of the quasistatic analysis depends on how valid the assumption that each mode reaches the steady state is.<>
{"title":"Performance analysis of a finite buffer burst-switched node","authors":"O. Aboul-Magd, A. Leon-Garcia","doi":"10.1109/INFCOM.1988.12978","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12978","url":null,"abstract":"A queuing model for an integrated voice and data node using burst switching is presented. The integrated node is assumed to have finite capacity for holding the data units waiting for transmission. An exact analytical technique is presented for estimating the mean number of data units in the system. The computational complexity of the analytic approach developed does not depend on the buffer size. The mean number of data units in the system obtained using a quasistatic analysis is compared to that obtained using the exact approach. It is shown that the accuracy of the quasistatic analysis depends on how valid the assumption that each mode reaches the steady state is.<<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":"131125415","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.12953
P. Martini, T. Welzel
The authors study multiple-token rings for mixed traffic imposed by different applications and aiming at the attainment of high-speed local area networks (HSLANs). An approximate analysis based on the first two moments of interarrival time and token rotation time yields results extremely close to simulation results. The multiple-token ring appears to be an excellent candidate for the envisaged scenario. However, buffer dimensioning at the destination LAN, studied by simulation only, proves to be one of the most critical factors during the design phase of a HSLAN.<>
{"title":"The analysis of a token ring backbone","authors":"P. Martini, T. Welzel","doi":"10.1109/INFCOM.1988.12953","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12953","url":null,"abstract":"The authors study multiple-token rings for mixed traffic imposed by different applications and aiming at the attainment of high-speed local area networks (HSLANs). An approximate analysis based on the first two moments of interarrival time and token rotation time yields results extremely close to simulation results. The multiple-token ring appears to be an excellent candidate for the envisaged scenario. However, buffer dimensioning at the destination LAN, studied by simulation only, proves to be one of the most critical factors during the design phase of a HSLAN.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"84 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":"115249620","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.13020
Ge-Ming Chiu, C. Raghavendra
Optimal allocation of redundant resources in distributed computing systems is studied. In this model, a request from a processing site for a resource can be satisfied by any one of the copies. Among the redundant copies of the resources, the least-expensive and the second-least-expensive ones are considered for accessing by each processing site, which is measured in terms of communication cost. This access scheme offers to encompass some of the intrinsically important features, such as graceful degradation and reliability consideration, in the design model. The increase of communication cost due to the failures of resources should be gradual to maintain the system performance. With the present formulation, the goal of the allocation is to minimize the total communication cost incurred. The Lagrangian relaxation and subgradient methods are applied to solve this problem. An efficient algorithm based on these techniques, and computational results, are presented.<>
{"title":"A model for optimal resource allocation in distributed computing systems","authors":"Ge-Ming Chiu, C. Raghavendra","doi":"10.1109/INFCOM.1988.13020","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13020","url":null,"abstract":"Optimal allocation of redundant resources in distributed computing systems is studied. In this model, a request from a processing site for a resource can be satisfied by any one of the copies. Among the redundant copies of the resources, the least-expensive and the second-least-expensive ones are considered for accessing by each processing site, which is measured in terms of communication cost. This access scheme offers to encompass some of the intrinsically important features, such as graceful degradation and reliability consideration, in the design model. The increase of communication cost due to the failures of resources should be gradual to maintain the system performance. With the present formulation, the goal of the allocation is to minimize the total communication cost incurred. The Lagrangian relaxation and subgradient methods are applied to solve this problem. An efficient algorithm based on these techniques, and computational results, are presented.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"16 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114117900","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.13004
Y. Lim, J. Kobza
A dynamic priority discipline called head-of-the-line with priority jumps is proposed as an efficient link schedule for a packet switch serving multiple classes of delay-sensitive traffic. Implementation of this discipline is considered to be relatively simple, and the processing overhead relatively small. It is shown that, by properly adjusting the control parameters, the discipline can: (i) satisfy any relative average delay requirements for the different classes, thus bringing fairness of service, and resulting in resource saving, and (ii) make the tail probability of the delay distributions for the different classes beyond their targeted maximum delays approximately the same, thus approximately minimizing the overall maximum tail probability in the system.<>
{"title":"Analysis of a delay-dependent priority discipline in a multi-class traffic packet switching node","authors":"Y. Lim, J. Kobza","doi":"10.1109/INFCOM.1988.13004","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13004","url":null,"abstract":"A dynamic priority discipline called head-of-the-line with priority jumps is proposed as an efficient link schedule for a packet switch serving multiple classes of delay-sensitive traffic. Implementation of this discipline is considered to be relatively simple, and the processing overhead relatively small. It is shown that, by properly adjusting the control parameters, the discipline can: (i) satisfy any relative average delay requirements for the different classes, thus bringing fairness of service, and resulting in resource saving, and (ii) make the tail probability of the delay distributions for the different classes beyond their targeted maximum delays approximately the same, thus approximately minimizing the overall maximum tail probability in the 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":"17 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":"123363149","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.12976
E. Vázquez, R. Colella, J. Vinyes, J. Fox, J. Berrocal
The authors present the results of research intended to assess the effect of several transport mechanisms on throughput observed between two transport users communicating over concatenated X.25 networks. A set of simulated and live experiments are used to investigate transport performance over X.25 networks. The transport mechanisms of interest (splitting, concatenation, and acknowledgement withholding) are described and the simulation results are presented. Finally, the simulation results are validated with live experiments over two concatenated X.25 networks (ACCUNET and IBERPAC). Use of the three mechanisms considered results in significant improvements in transport-user throughput.<>
{"title":"Performance of OSI transport over ACCUNET and IBERPAC","authors":"E. Vázquez, R. Colella, J. Vinyes, J. Fox, J. Berrocal","doi":"10.1109/INFCOM.1988.12976","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12976","url":null,"abstract":"The authors present the results of research intended to assess the effect of several transport mechanisms on throughput observed between two transport users communicating over concatenated X.25 networks. A set of simulated and live experiments are used to investigate transport performance over X.25 networks. The transport mechanisms of interest (splitting, concatenation, and acknowledgement withholding) are described and the simulation results are presented. Finally, the simulation results are validated with live experiments over two concatenated X.25 networks (ACCUNET and IBERPAC). Use of the three mechanisms considered results in significant improvements in transport-user throughput.<<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":"123487486","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.12960
D. Tipper, M. Sundareshan
A simple analytical approximation to the optimal buffer-management policy valid in the moderate to heavy load ranges is presented. The throughput performance of the present adaptive policies under both steady-state and transient conditions is studied. The superiority of this scheme over the performance resulting from existing buffer-management schemes is demonstrated.<>
{"title":"Adaptive policies for optimal buffer management in dynamic load environments","authors":"D. Tipper, M. Sundareshan","doi":"10.1109/INFCOM.1988.12960","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12960","url":null,"abstract":"A simple analytical approximation to the optimal buffer-management policy valid in the moderate to heavy load ranges is presented. The throughput performance of the present adaptive policies under both steady-state and transient conditions is studied. The superiority of this scheme over the performance resulting from existing buffer-management schemes is demonstrated.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"40 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":"124966448","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.12969
A. Gersht, A. Shulman, P. Nemirovsky
A network optimization model (NOM) that provides a tool for performance analysis and optimal design of a broad class of routing strategies is presented. It can evaluate and optimize both static and dynamic, local and global routing strategies. The tool is applicable to both packet-switched and circuit-switched networks. NOM software is based on original modeling methods and optimization algorithms. It is user-friendly and menu-driven, and has extensive 'what if' capabilities. NOM can be used for performance evaluation of existing routing strategy and for optimal routing design for a given performance criterion. As a performance evaluation tool, for a given network topology, link and node capacities, point-to-point demand matrix, and routing strategy, NOM models the routing and computes important characteristics of network performance. As a routing optimization tool, for a given network topology, link and node capacities, point-to-point demand matrix, and performance criterion, NOM generates the optimal routing, and computes important characteristics of network performance. The current Telenet local dynamic routing strategy is compared with a set of optimal routing strategies designed for various performance criteria.<>
{"title":"NOM-a tool for optimal design and performance evaluation of routing strategies and its application to the Telenet network","authors":"A. Gersht, A. Shulman, P. Nemirovsky","doi":"10.1109/INFCOM.1988.12969","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12969","url":null,"abstract":"A network optimization model (NOM) that provides a tool for performance analysis and optimal design of a broad class of routing strategies is presented. It can evaluate and optimize both static and dynamic, local and global routing strategies. The tool is applicable to both packet-switched and circuit-switched networks. NOM software is based on original modeling methods and optimization algorithms. It is user-friendly and menu-driven, and has extensive 'what if' capabilities. NOM can be used for performance evaluation of existing routing strategy and for optimal routing design for a given performance criterion. As a performance evaluation tool, for a given network topology, link and node capacities, point-to-point demand matrix, and routing strategy, NOM models the routing and computes important characteristics of network performance. As a routing optimization tool, for a given network topology, link and node capacities, point-to-point demand matrix, and performance criterion, NOM generates the optimal routing, and computes important characteristics of network performance. The current Telenet local dynamic routing strategy is compared with a set of optimal routing strategies designed for various performance criteria.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"44 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":"128271603","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.12917
K. Eng, Amar M. Ali, C. Baradello, J. Turner, D. Vlack, S. M. Walters
This panel presentation contains one full position paper on the user network interface in broadband ISDN, and four position summaries. Issues considered in the latter include: the impact of multimedia services, the effect of optical fiber transmission, the superiority of packet switching for diverse applications, and the potential unification of circuit-and packet-switching techniques.<>
{"title":"Packet switching vs. circuit switching in future integrated services digital networks","authors":"K. Eng, Amar M. Ali, C. Baradello, J. Turner, D. Vlack, S. M. Walters","doi":"10.1109/INFCOM.1988.12917","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12917","url":null,"abstract":"This panel presentation contains one full position paper on the user network interface in broadband ISDN, and four position summaries. Issues considered in the latter include: the impact of multimedia services, the effect of optical fiber transmission, the superiority of packet switching for diverse applications, and the potential unification of circuit-and packet-switching techniques.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"23 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":"124670428","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.13030
I. Cidon, M. Sidi
Distributed dynamic channel assignment algorithms for a multihop packet radio network are introduced. The algorithms ensure conflict-free transmissions by the nodes of the network. The basic idea of the algorithms is to split the shared channel into a control segment and a transmission segment. The control segment is used to avoid conflicts among the nodes and to increase the utilization of the transmission segment. It is shown how these algorithms can be used to determine time-division multiaccess cycles with spatial reuse of the channel.<>
{"title":"Distributed assignment algorithms for multi-hop packet-radio networks","authors":"I. Cidon, M. Sidi","doi":"10.1109/INFCOM.1988.13030","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13030","url":null,"abstract":"Distributed dynamic channel assignment algorithms for a multihop packet radio network are introduced. The algorithms ensure conflict-free transmissions by the nodes of the network. The basic idea of the algorithms is to split the shared channel into a control segment and a transmission segment. The control segment is used to avoid conflicts among the nodes and to increase the utilization of the transmission segment. It is shown how these algorithms can be used to determine time-division multiaccess cycles with spatial reuse of the channel.<<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":"125862511","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
扫码关注我们
求助内容：
应助结果提醒方式：