Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12993
J. Pang, F. Tobagi
To support real-time applications on a local area network, some recently proposed standards, such as the IEEE 802.4 token bus standard and FDDI, use timers to control station access of the channel in addition to a basic token-passing protocol. The major reason for incorporating the timing mechanism is to avoid excessively long cycles in token-passing that can disrupt real-time services for packetized voice and real-time control. Nevertheless, the timing mechanism is flexible enough to provide priority among non-real-time traffic as well. The authors present an analysis of the throughput performance of the timer-controlled token-passing protocol under heavy load and a few other assumptions. The analysis not only reveals the priority structure of the protocol but also some salient features that render the protocol more favorable than other cycle-limiting schemes (e.g., fixed-maximum channel access per cycle).<>
{"title":"Throughput analysis of a timer-controlled token-passing protocol under heavy load","authors":"J. Pang, F. Tobagi","doi":"10.1109/INFCOM.1988.12993","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12993","url":null,"abstract":"To support real-time applications on a local area network, some recently proposed standards, such as the IEEE 802.4 token bus standard and FDDI, use timers to control station access of the channel in addition to a basic token-passing protocol. The major reason for incorporating the timing mechanism is to avoid excessively long cycles in token-passing that can disrupt real-time services for packetized voice and real-time control. Nevertheless, the timing mechanism is flexible enough to provide priority among non-real-time traffic as well. The authors present an analysis of the throughput performance of the timer-controlled token-passing protocol under heavy load and a few other assumptions. The analysis not only reveals the priority structure of the protocol but also some salient features that render the protocol more favorable than other cycle-limiting schemes (e.g., fixed-maximum channel access per cycle).<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"4 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":"115874840","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.12946
T. M. Bauman
The author focuses on some of the existing and emerging subnetwork access technologies and presents strategies for interworking. These subnetworks include the backbone data communications network (DCN) and the network element (NE) access network or local communication network (LCN) in the telecommunications management network (TMN). TMNs may include multiple subnetworks including packet-switched networks, public switched telephone networks, and private-line networks. The need for internetworking among different types of networks within a TM as well as between TMNs themselves is discussed, along with the issues that must be addressed to provide an integrated solution.<>
{"title":"Subnetwork access technologies and internetworking within the TMN","authors":"T. M. Bauman","doi":"10.1109/INFCOM.1988.12946","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12946","url":null,"abstract":"The author focuses on some of the existing and emerging subnetwork access technologies and presents strategies for interworking. These subnetworks include the backbone data communications network (DCN) and the network element (NE) access network or local communication network (LCN) in the telecommunications management network (TMN). TMNs may include multiple subnetworks including packet-switched networks, public switched telephone networks, and private-line networks. The need for internetworking among different types of networks within a TM as well as between TMNs themselves is discussed, along with the issues that must be addressed to provide an integrated solution.<<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":"117147483","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.13031
A. Ephremides, Thuan V. Truong
The authors consider multihop, mobile, packet radio networks that need to determine broadcasting transmission schedules in a distributed way with the goal of avoiding interference and achieving reasonable efficiency. Several centralized scheduling schemes have been proposed in the literature, while very few and mostly ad hoc distributed schemes have been considered that generally suffer from serious weaknesses. The authors propose a distributed scheme for scheduling broadcasts that involves very limited overhead and has very good efficiency performance.<>
{"title":"Distributed algorithm for efficient and interference-free broadcasting in radio networks","authors":"A. Ephremides, Thuan V. Truong","doi":"10.1109/INFCOM.1988.13031","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13031","url":null,"abstract":"The authors consider multihop, mobile, packet radio networks that need to determine broadcasting transmission schedules in a distributed way with the goal of avoiding interference and achieving reasonable efficiency. Several centralized scheduling schemes have been proposed in the literature, while very few and mostly ad hoc distributed schemes have been considered that generally suffer from serious weaknesses. The authors propose a distributed scheme for scheduling broadcasts that involves very limited overhead and has very good efficiency performance.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"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":"117256903","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.13003
I. Iliadis, Luke Y.-C. Lien
The resequencing problem is considered in a distributed system environment with multiple classes. A system consisting of two parallel heterogeneous M/M/1 queues shared by C different arrival classes is presented and analyzed. Arriving customers are distributed among the two queues according to a probability distribution which depends upon their class. If customers belong to the same class must depart from the server at the same order as they arrived, they incur additional delay called resequencing delay. A recursive solution technique is first introduced to obtain the exact expression for the expected resequencing delay for a single-class case. The result is then extended to the case of a single class with interfering traffic. Some numerical examples are presented to illustrate changes of resequencing delay as a function of distributed loads to servers.<>
{"title":"Resequencing in distributed systems with multiple classes","authors":"I. Iliadis, Luke Y.-C. Lien","doi":"10.1109/INFCOM.1988.13003","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13003","url":null,"abstract":"The resequencing problem is considered in a distributed system environment with multiple classes. A system consisting of two parallel heterogeneous M/M/1 queues shared by C different arrival classes is presented and analyzed. Arriving customers are distributed among the two queues according to a probability distribution which depends upon their class. If customers belong to the same class must depart from the server at the same order as they arrived, they incur additional delay called resequencing delay. A recursive solution technique is first introduced to obtain the exact expression for the expected resequencing delay for a single-class case. The result is then extended to the case of a single class with interfering traffic. Some numerical examples are presented to illustrate changes of resequencing delay as a function of distributed loads to servers.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"144 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":"115000385","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.12949
Rainer Händel
Efforts to enhance the ISDN (integrated-services digital network) concept in order to include all forseeable kinds of broadband applications are described. The current state of the discussion is reported in terms of broadband services, interface structures, and reference configurations. The work of several standardization organisations (CCITT, T1, CEPT) is also discussed.<>
{"title":"Evolution of ISDN towards broadband ISDN","authors":"Rainer Händel","doi":"10.1109/INFCOM.1988.12949","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12949","url":null,"abstract":"Efforts to enhance the ISDN (integrated-services digital network) concept in order to include all forseeable kinds of broadband applications are described. The current state of the discussion is reported in terms of broadband services, interface structures, and reference configurations. The work of several standardization organisations (CCITT, T1, CEPT) is also 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":"243 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":"115642800","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.12988
F. R. Dawson
The computer graphics metafile (CGM) allows for the capture of static graphical images into compact, transferable files of a standard format. The CGM was implemented to answer the need for a single CGM format that would integrate the creation and delivery of technical information in the corporation. The relationship of the CGM standard to the concepts of an openly architectured network and to the interchange of electronic compound documents is discussed.<>
{"title":"Implementation of the computer graphics metafile at McDonnell Douglas","authors":"F. R. Dawson","doi":"10.1109/INFCOM.1988.12988","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12988","url":null,"abstract":"The computer graphics metafile (CGM) allows for the capture of static graphical images into compact, transferable files of a standard format. The CGM was implemented to answer the need for a single CGM format that would integrate the creation and delivery of technical information in the corporation. The relationship of the CGM standard to the concepts of an openly architectured network and to the interchange of electronic compound documents is 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":"31 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":"124933029","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.12973
P. Amer, Figen Ceceli, G. Juanole
An architecture model and a subset of a behavior model of the ISO virtual terminal (VT) are specified in the formal description technique Estelle. The architecture model includes modules and their appropriate interconnections (channels) for a VT-user, a VT protocol machine (VTPM), an association control service entity (ACSE), autonomous-abort internal events, a presentation layer element, and a mapping machine to map protocol data units of the VTPM onto service primitives of the ACSE and the presentation layer. The behavior model specifies the association establishment phase of the VTPM for the synchronous mode of operation, assuming that no optimal function units are selected. The combination of VT and Estelle represents ISO's effort toward implementing the Open Systems Interconnection (OSI) model.<>
{"title":"Formal specification of ISO virtual terminal in Estelle","authors":"P. Amer, Figen Ceceli, G. Juanole","doi":"10.1109/INFCOM.1988.12973","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12973","url":null,"abstract":"An architecture model and a subset of a behavior model of the ISO virtual terminal (VT) are specified in the formal description technique Estelle. The architecture model includes modules and their appropriate interconnections (channels) for a VT-user, a VT protocol machine (VTPM), an association control service entity (ACSE), autonomous-abort internal events, a presentation layer element, and a mapping machine to map protocol data units of the VTPM onto service primitives of the ACSE and the presentation layer. The behavior model specifies the association establishment phase of the VTPM for the synchronous mode of operation, assuming that no optimal function units are selected. The combination of VT and Estelle represents ISO's effort toward implementing the Open Systems Interconnection (OSI) model.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"70 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":"128719741","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.12956
M. Ammar, K. Chung
The authors consider a flexible and automated two-stage manufacturing system that is externally controlled by computer-based equipment. Communication among the components of this integrated manufacturing system is accomplished over a local area network using a token-passing medium access procedure. Messages from the manufacturing system to the control computers may contain information about the progress of the manufacturing process. Based on this data, the control computers send instructions that serve to control and modify the manufacturing process. A model of such a system is formulated and analyzed, and a set of numerical examples is discussed. The objective is to understand how the efficiency of the manufacturing system is affected by the mechanism and parameters of the communication network.<>
{"title":"Performance of a manufacturing system using a token-passing communication network","authors":"M. Ammar, K. Chung","doi":"10.1109/INFCOM.1988.12956","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12956","url":null,"abstract":"The authors consider a flexible and automated two-stage manufacturing system that is externally controlled by computer-based equipment. Communication among the components of this integrated manufacturing system is accomplished over a local area network using a token-passing medium access procedure. Messages from the manufacturing system to the control computers may contain information about the progress of the manufacturing process. Based on this data, the control computers send instructions that serve to control and modify the manufacturing process. A model of such a system is formulated and analyzed, and a set of numerical examples is discussed. The objective is to understand how the efficiency of the manufacturing system is affected by the mechanism and parameters of the communication 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":"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":"116339476","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.13019
Cheng-Shong Wu, V. Li
A multibeam satellite communications network serving multiple zones with S-Aloha random-access uplinks and dynamically switched transponders in the downlinks is studied. The overhead of switching transponders between zones may degrade the performance of the system significantly. Two different strategies are introduced and studied. In the Guard Time strategy, each slot time is equal to the packet transmission time plus the transponder switching time, allowing the transponder to be pointed to a new zone at the beginning of each slot. In the Idle Waiting strategy, each slot time is equal to the packet transmission time. If a transponder is switched to a new zone, it will take k slot time, where k is the smallest integer greater than the switching time divided by the slot time. The throughputs of these two strategies are analyzed and compared.<>
{"title":"Random access for a multibeam satellite with dynamic transponder switching","authors":"Cheng-Shong Wu, V. Li","doi":"10.1109/INFCOM.1988.13019","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13019","url":null,"abstract":"A multibeam satellite communications network serving multiple zones with S-Aloha random-access uplinks and dynamically switched transponders in the downlinks is studied. The overhead of switching transponders between zones may degrade the performance of the system significantly. Two different strategies are introduced and studied. In the Guard Time strategy, each slot time is equal to the packet transmission time plus the transponder switching time, allowing the transponder to be pointed to a new zone at the beginning of each slot. In the Idle Waiting strategy, each slot time is equal to the packet transmission time. If a transponder is switched to a new zone, it will take k slot time, where k is the smallest integer greater than the switching time divided by the slot time. The throughputs of these two strategies are analyzed and compared.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"45 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":"127067390","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.12896
A. Ganz, I. Chlamtac
The authors consider a path-oriented channel allocation management. As opposed to multiaccess protocols of existing fiber-optic systems, in the proposed approach the outgoing channel of the source node and the incoming channel of the destination node are allocated time-sequentially, creating a time-dependent virtual path for all pairs of users. Using the time-oriented path allocation, the need for packet buffering at the central node is eliminated multiple channels can be utilized simultaneously for different transmissions, and packet delays are bounded. The authors demonstrate that the same approach is feasible for efficient control of multibeam satellite systems. They introduce a tractable analytic model for the evaluation of communication systems based on this approach. The model is used to evaluate the proposed system performance under different switching functionalities of the central node. In addition to providing the throughput/delay characteristics of the system, the model shows a relation between the degree of star symmetry and the system performance, with the equidistant node arrangement yielding the optimal performance.<>
{"title":"Path allocation access control in fiber optic communication systems","authors":"A. Ganz, I. Chlamtac","doi":"10.1109/INFCOM.1988.12896","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12896","url":null,"abstract":"The authors consider a path-oriented channel allocation management. As opposed to multiaccess protocols of existing fiber-optic systems, in the proposed approach the outgoing channel of the source node and the incoming channel of the destination node are allocated time-sequentially, creating a time-dependent virtual path for all pairs of users. Using the time-oriented path allocation, the need for packet buffering at the central node is eliminated multiple channels can be utilized simultaneously for different transmissions, and packet delays are bounded. The authors demonstrate that the same approach is feasible for efficient control of multibeam satellite systems. They introduce a tractable analytic model for the evaluation of communication systems based on this approach. The model is used to evaluate the proposed system performance under different switching functionalities of the central node. In addition to providing the throughput/delay characteristics of the system, the model shows a relation between the degree of star symmetry and the system performance, with the equidistant node arrangement yielding the optimal performance.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"39 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":"125174353","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
扫码关注我们
求助内容：
应助结果提醒方式：