{"title":"Design issues in data networks","authors":"E. Drakopoulos","doi":"10.1109/ICCCN.1997.623354","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623354","url":null,"abstract":"The paper describes the network design and analysis of a multi-protocol application environment characterized by a client/server architecture, integration of legacy and distributed database structures, frame relay wide area network, and token ring local area networks. Detailed workload characterization and performance modeling of the application environment is presented, and network design issues are addressed. The model is used to study network performance under various load conditions, identify bottlenecks and compare design alternatives.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128967332","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":"Shared tree wireless network multicast","authors":"Ching-Chuan Chiang, M. Gerla, Lixia Zhang","doi":"10.1109/ICCCN.1997.623287","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623287","url":null,"abstract":"In this paper we propose a multicast protocol for a multihop, mobile wireless network with cluster based routing and token access protocol within each cluster. The multicast protocol uses a shared tree which is dynamically updated to adjust to changes in topology and membership (i.e. dynamic joins and quits). Two options for tree maintenance have been simulated and evaluated: \"hard state\" (i.e. each connection must be explicitly cleared) and \"soft state\" (each connection is automatically timed out and must be refreshed). For the soft state policy, the performance of different choices of timeout and refresh timers is first analyzed for a range of node mobility values. Next, soft state and hard state policies are compared based on throughput, join delay, and control overhead criteria.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132258966","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":"Evaluation of the number of destination hosts for data networking and its application to address cache design","authors":"M. Aida, N. Takahashi","doi":"10.1109/ICCCN.1997.623334","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623334","url":null,"abstract":"This paper discuses how to design the capacity of address cache tables for large-scale computer communication networks. We show that destination addresses of packets can, be assumed to be characterized by two types of Zipf's law. Based on the complementary use of these laws, we derive the relation between the number of accesses and the number of destination addresses. Experimental results show that the relation gives a good approximation. Applying this relation, we derive the upper/lower bounds for cache hit probability. Using the probabilities, design issues including the capacity of the cache table and aging algorithm of cache entries are also discussed.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130213890","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 multicast ATM switch with slotted ring fabric","authors":"R. Henry","doi":"10.1109/ICCCN.1997.623358","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623358","url":null,"abstract":"This paper proposes a scalable, optical fiber, slotted ring ATM switch architecture. The internal switching fabric and transport mechanism is developed, a model formulated, and deterministic performance analysis equations derived. The delay and blocking performance metrics of a 16/spl times/16 switch with 150 Mbps links are given. It is shown that zero blocking performance can be achieved, as can delays as low as several bit times.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131552203","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":"The performance of multicast banyan networks","authors":"Yuanyuan Yang","doi":"10.1109/ICCCN.1997.623290","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623290","url":null,"abstract":"Multicast is the ability to transmit information from a single source node to multiple selected destination nodes in a network. Current trends in networking applications indicate that there will be an increasing demand in future networks for multicast communication. Banyan networks have been proposed for use in ATM high-speed communications networks and have been used for the interconnection of processors in scalable parallel computers. This paper addresses the performance issues of supporting multicast communication in banyan networks. Previous work on the performance of banyan networks has been primarily for the networks which can support only one-to-one communication (i.e., unicast banyan networks). We present an analytical model for the performance of banyan networks which support multicast communication (i.e., multicast banyan networks). The performance of both unbuffered and buffered banyan multicast networks is analyzed. Our model yields a set of equations that can be solved for the throughput of the network. We show that the throughput of a multicast banyan network is generally higher than that of a unicast banyan network. In particular, we obtain that the throughput of an unbuffered multicast banyan network is /spl Theta/(N), where N is the size of the network, compared with /spl Theta/(N/log N) for an unbuffered unicast banyan network. In addition to the throughput, we also derive formulas for two other important performance metrics, average packet transfer time and packet loss probability, in the buffered multicast banyan networks.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125198247","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 performance model for ATM switches with multiple input queues","authors":"Ge Nong, J. Muppala, M. Hamdi","doi":"10.1109/ICCCN.1997.623316","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623316","url":null,"abstract":"An analytical model for the performance analysis of a novel input access scheme for an ATM switch is developed and presented in this paper. The interconnection network of the ATM switch is internally nonblocking and each input port maintains a separate queue for each output port so as to reduce the head-of-line (HOL) blocking of conventional input queuing switches. Each input is allowed to send only one cell per time slot, and each output port is allowed to receive only one cell per time slot. Using a tagged queue approach, an analytical model with an underlying two-dimensional Markov chain with a state space of size (queue capacity/spl times/switch size) is constructed for evaluating the switch performance under i.i.d Bernoulli traffic for different offered traffic loads. The switch throughput, mean cell delay, and cell loss probability are computed from the analytical model. The accuracy of the analytical model is verified using simulation.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127719785","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}
David C. Roberts, D. Grossman, O. Frieder, R. Bernstein, E. Bisfiop
{"title":"Performance testing of communication protocols for three-tier computing: results for ICA and X window protocols","authors":"David C. Roberts, D. Grossman, O. Frieder, R. Bernstein, E. Bisfiop","doi":"10.1109/ICCCN.1997.623350","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623350","url":null,"abstract":"We present the results of performance tests to compare two protocols for three-tier computing using the Windows NT operating system. Three-tier computing features a data server for stored databases (Tier 1), an application server that runs applications (Tier 2), and a simple client program that runs on desktop machines that presents the user interface (Tier 3). Three protocols are available to communicate between Tier 2 and 3: intelligence computer architecture (ICA) with and without data compression, and X Window. We measured the performance of the three protocols in a multi-user environment in which we simulated the workload imposed by typical users. We found that, for Microsoft Office 97 and Lotus Notes applications, the X Window protocol uses approximately twice the network bandwidth of ICA, without compression. We also found that compressed ICA generates roughly one third less network traffic than uncompressed ICA at a cost of 20% of additional processor utilization.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125809375","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":"Routing in ad hoc networks using a spine","authors":"Bevan Das, Raghupathy Sivakumar, V. Bharghavan","doi":"10.1109/ICCCN.1997.623288","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623288","url":null,"abstract":"We present a two-level hierarchical routing architecture for ad hoc networks. Within each lower level cluster, we describe a self-organizing, dynamic spine structure to (a) propagate topology changes, (b) compute updated routes in the background, and (c) provide backup routes in case of transient failures of the primary routes. We analyze and bound the worst case of movements between upper level clusters to show that this hierarchical architecture scales well with network size.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129593860","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":"Performability analysis of handoff calls in personal communication networks","authors":"C. Ro, Kishor S. Trivedi","doi":"10.1109/ICCCN.1997.623299","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623299","url":null,"abstract":"A combined performance and dependability (called performability) model for dealing with handoff calls is introduced. Stochastic reward nets (SRNs) are used for this purpose. An SRN model of channel assignment is developed and analyzed. The method of phase type expansion is used is approximate non-exponential call holding time distribution. A discussion, of how hand-off models with failure relate to Markov reward models is also given.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125625793","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":"QOS based performance of selective repeat transport user in hybrid ATM/TDMA networks","authors":"M. Talla, A. Elhakeem, M. Kadoch","doi":"10.1109/ICCCN.1997.623329","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623329","url":null,"abstract":"The selective repeat (SR) transport user end-to-end throughput and delay characteristics are analyzed in a hybrid asynchronous transfer mode/time division multiple access (ATM/TDMA) network. The SR transport user is assumed with an underlying cell-level global congestion control in the ATM multiplexer node. The analysis is based on the interaction of packet level control with the queue management at the ATM cell level. The end-to-end transport users are assumed over an M-node virtual circuit (VC) to derive the throughput and delay using Norton equivalent queueing model. The transport service characteristic of the model is obtained from the end-to-end protocol efficiency. The ATM layer is assumed with a leaky bucket (LB), virtual leaky bucket (VLB), modified LB (mLB), or modified VLB (mVLB) congestion control. A global congestion control scheme prioritizes transit traffic over local traffic and ensures the quality of service (QOS) to several classes of traffic. Based on global congestion status, the transport users modulate their end-to-end flow control parameters, i.e., packet size for video and voice users and window size for data users. The probability of cell-loss at the ATM layer is reflected at the transport layer to derive the effective throughput and delay characteristics. The mVLB scheme consistently provided better end-to-end throughput and delay performance for SR transport user.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134590496","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}