{"title":"A multiple access technique for centralized multiple satellite networking with on-board processing in the central node","authors":"M. Sharifi, M. Arozullah","doi":"10.1109/INFCOM.1988.13018","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13018","url":null,"abstract":"The authors defines multiple-access method suitable for a centralized multiple satellite network, with onboard processing in the central node. This multiple-access method (CDMA/Aloha/BFN) is a combination of code-division multiple-access (CDMA), random multiple access (RMA) or Aloha, and a set of electronic beam forming networks (BFN). CDMA/Aloha/BFN multiple access maintains the advantages of CDMA and RMA techniques and avoids their disadvantages by using some processing on board the central satellite stations. The major characteristics of this method are: no need for network synchronization resistance to jamming, efficient use of the available system power and bandwidth, low equipment complexity, low mutual interference, ability to operate in systems supporting highly dynamic users, and good delay-throughput performance. The theory of operation of the CDMA/Aloha/BFN multiple-access technique is described and its performance is analyzed.<<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":"129501350","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}
{"title":"Performance analysis of a moving boundary/fixed frame integrated voice/data multiplexing technique with correlated sources","authors":"D. McDysan, R. Pickholtz","doi":"10.1109/INFCOM.1988.12977","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12977","url":null,"abstract":"The data queuing performance is analyzed for a fixed-frame-size, integrated voice-data multiplexer (IVDM), where voice has preemptive priority over data, a maximum capacity is available for voice (above which voice freeze-outs occur), and data is queued when there is insufficient capacity. A discrete-state-continuous-time Markov model is used to model a discrete-state-discrete-time IVDM when the average source burst duration is significantly larger than the multiplexer frame time. The correlation of the voice and data source activity is shown to have a significant effect on IVDM data queuing performance. An approximate, simple analytical model for the mean data queue length is derived. The approximate analytical model for mean data queue length is shown to provide a lower bound for exact calculations and simulation results. The concept of maximizing queuing power (throughput/delay) is applied to the data 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":"128574844","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}
{"title":"Traffic characterization for integrated services","authors":"San-qi Li, J. Mark","doi":"10.1109/INFCOM.1988.12991","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12991","url":null,"abstract":"A traffic model in which the interruption traffic is a correlated process is introduced. In this model the effect of correlation is culminated in a parameter that is the sum of all the imbalances of the autocorrelation function of the interruption process. Based on this model, the queueing analysis of integrated services on a packet switched TDM system is developed. It is shown that the presence of correlation increases the mean queue length. An adaptive flow control scheme that successively adjusts the short-bursty traffic arrival rate at each TDM node to reduce the correlation effect on the queue length build-up is proposed.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"158 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":"116107964","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}
{"title":"Networking requirements of the Rapport multimedia conferencing system","authors":"S. Ahuja, D. Horn, J. Ensor","doi":"10.1109/INFCOM.1988.12987","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12987","url":null,"abstract":"The Rapport multimedia conferencing system supports interactive real-time distributed conferences among two or more people. Rapport executes on personal workstations interconnected by data and voice networks. It is designed to help people emulate face-to-face conferences as closely as possible with their workstations. These conferences can be of different type, including phone conversations, group meetings, or lectures. The authors describe the Rapport system and elaborate on its networking requirements. Based on experience with their initial prototype system, the authors highlight some of the current networking limitations and examine future directions, such as broadband communication, for alleviating these problems.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"13 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":"114369758","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}
{"title":"A fiber optic CDMA network for real-time communication","authors":"A. Gelman, D. Schilling","doi":"10.1109/INFCOM.1988.12899","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12899","url":null,"abstract":"An analysis is presented of a fiber-optic random-access network suitable for real-time communication. It is based on pure Aloha access discipline of a hybrid, time-wavelength, code-division-multiplexed channel. The network performance is determined as a function of the signaling parameters, number of active users, and their information rates. It is shown that the network throughput can be significantly increased if users allow a few bit errors per packet. Thus, users have the freedom of trading off throughput for bit error rate and vice-versa.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"51 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":"121662672","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}
{"title":"Fault tolerant packet switched network design using capacity augmentation","authors":"T. Nishida, H. Miyahara","doi":"10.1109/INFCOM.1988.13009","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13009","url":null,"abstract":"A design method for packet-switched networks is presented that enhances the reliability and prevents the performance degradation caused by network failures. The method is based on a design technique wherein the redundant capacity is assigned to appropriate links in advance to be capable of accommodating the detoured traffic caused by failed links. Using this technique, it is crucial to accurately evaluate to how large an amount the capacity for each link must be augmented. An augmented capacity function is introduced, which determines the capacity of a link based on the probability of a particular network state and a parameter which represents how important the link is in the state. Numerical examples are given to demonstrate the feasibility of the method, in terms of cost/performance effectiveness. The relation between the reliability level and the network cost 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":"69 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":"134551739","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}
{"title":"An optimal two-copy routing scheme in a communication network","authors":"S. Chiou, V. Li","doi":"10.1109/INFCOM.1988.12929","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12929","url":null,"abstract":"The authors consider a static routing problem in a network with failure-prone links. Two copies of each externally generated message are sent from the source to the destination along two disjoint paths with the objective of reducing the delay resulting from retransmissions of unsuccessful packets. They formulate an optimal-routing problem using a suitable delay function. This results in a nonlinear programming problem of minimizing the delay over routing assignment under certain constraints. Specifically, they impose a disjoint-path constraint on the route assignment. This nonlinear program is solved by an iteration method incorporating a combinatorial algorithm. The solution converges to the global minimum for a convex objective function over a convex feasible region.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125716957","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}
{"title":"Improving gateway performance with a routing-table cache","authors":"D. Feldmeier","doi":"10.1109/INFCOM.1988.12930","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12930","url":null,"abstract":"A way to increase gateway throughput is to reduce the routing-table lookup time per packet. A routing-table cache can be used to reduce the average lookup time per packet and the purpose of this study is to determine the best management policies for this cache as well as its measured performance. The performance results of simulated caches for a gateway at MIT are presented. These results include the probability of reference versus previous access time, cache hit ratios, and the number of packets between cache misses. A simple, conservative analysis using the presented measurements shows that current gateway routing-table lookup time could be reduced by up to 65%.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"43 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":"122943530","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}
{"title":"Formal specification and analysis of DMI-an X-25 based protocol","authors":"V. Gehlot, Insup Lee","doi":"10.1109/INFCOM.1988.12975","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12975","url":null,"abstract":"The digital multiplexed interface (DMI) specifies the interface requirements for multiplexed data communication over digital facilities between a host computer and a PBX. A part of the DMI's packet-mode data-transfer protocol, which is based on the X.25 packet-level protocols, is specified formally using the selection/resolution (S/R) model. A formal verification of the resetting phase of this protocol, using the S/R-model-based software tool SPANNER, is presented. It is shown that the protocol is not fully correct in the sense that some sequence of events may lead it to unsafe states. These states give rise to a livelock situation. A way to rectify this problem is suggested.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114150757","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}
{"title":"Effects of output buffer sharing on buffer requirements in an ATDM packet switching","authors":"A. E. Eckberg, T. Hou","doi":"10.1109/INFCOM.1988.12952","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12952","url":null,"abstract":"Broadband packet switches handling an asynchronous-time-division-multiplexing type protocol format, e.g. Starlite, can achieve buffer efficiencies by sharing buffers between output ports. It is shown that the number of buffers required with sharing, for random traffic, would be overestimated by as much as 30% at 90% traffic load if the negative correlations that naturally exist, for this type of traffic, between packet streams destined for different output ports were not taken into account. In general, the discrepancy increases as the traffic load increases, and decreases as the switch size increases. A general approach is developed for the analysis of set of queues to which the arrival streams are correlated, which could be used to assess the impacts on shared buffer requirements due to other types of stream correlation (e.g. positive correlations) that may result from other traffic assumptions.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"21 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":"125578576","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}