{"title":"Timing properties of the timed token MAC protocol","authors":"Sijing Zhang, A. Burns","doi":"10.1109/ICCCN.1997.623355","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623355","url":null,"abstract":"We investigate the inherent timing properties of the timed token medium access control (MAC) protocol that are necessary for guaranteeing synchronous message deadlines in a timed token ring network such as the Fibre Distributed Data Interface (FDDI) network. As a result, the best-so-far result of the upper bound on the time possibly elapsed between any number of successive token arrivals at a particular node was derived. This result, which is particularly important for studies on real-time communications in any timed token ring network, has been published by Zhang and Burns (see IEEE/ACM Trans. on Networking, vol.3, p. 729-41, 1995) with no proof given. In this paper, we complement our early work by presenting a concise formal proof of this upper bound.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"15 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":"114775184","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":"Boosting the network performance via traffic reshaping","authors":"Sergey Gorinsky, Sanjoy Baruah, A. Stoyen","doi":"10.1109/ICCCN.1997.623325","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623325","url":null,"abstract":"Traffic reshaping and its impact on providing deterministic guarantees of timely data delivery in a packet-switched virtual-circuit fixed-packet network are investigated. Two types of traffic smoothing are considered: global reshaping (when traffic on all network connections is smoothed) and local reshaping (when the traffic specification is changed only for a single connection). The conditions when reshaping is beneficial are derived and the optimal values of traffic model parameters are obtained. In particular, it is shown that, when one tries to minimize end-to-end delay bounds for leaky bucket constrained traffic, the traffic either should be made constant bit rate (CBR) or should not be reshaped at all. It is proven that changing the leaky bucket specification to the dual leaky bucket specification is always able to yield better timeliness guarantees and utilisation of network resources. Finally, local reshaping for the dual leaky bucket model is studied.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"103 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":"115547937","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":"Efficient distributed control protocols for WDM all-optical networks","authors":"Yousong Mei, C. Qiao","doi":"10.1109/ICCCN.1997.623305","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623305","url":null,"abstract":"Path multiplexing (PM) and link multiplexing (LM) are two approaches for establishing connections (or lightpaths) in optical networks. This paper describes distributed control protocols for establishing lightpaths in WDM networks using LM and PM. We propose and evaluate the performance of two classes of protocols, namely source initiated reservation (SIR) and destination initiated reservation (DIR). It is found that DIR protocols generally perform better than SIR protocols. However, the impacts of DIR protocols on the performance of a network using LM and PM are different.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"27 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":"114735759","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}
Abdur Chowdhury, O. Frieder, D. Grossman, Eric W. Burger
{"title":"DRS: a fault tolerant network routing system for mission critical distributed applications","authors":"Abdur Chowdhury, O. Frieder, D. Grossman, Eric W. Burger","doi":"10.1109/ICCCN.1997.623298","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623298","url":null,"abstract":"We present a novel proactive routing algorithm (dynamic routing system, DRS) that consistently searches for failures via frequent ICMP (Internet control message protocol) echo requests. Our algorithm differs from its predecessors in that it is proactive instead of reactive by looking for failures before they affect message transmissions. When a failure is detected, an alternative route is identified and used. Based on our actual implementation, we developed an analytical model of the DRS to evaluate its potential use for large networks. Using this model, we computed for various network sizes the fault identification times given a percentage of network usage. Calculations are carried out for a typical 10 Mbs Ethernet.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"92 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":"116084512","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":"Teletraffic/transmission performance of multi-hop networks using hybrid-store-and-forward","authors":"G. Castañón, O. Tonguz, A. Bononi","doi":"10.1109/ICCCN.1997.623303","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623303","url":null,"abstract":"The teletraffic/transmission performance of regular two-connected multi-hop cell-switching optical networks in uniform traffic under hybrid store-and-forward is presented. The Manhattan street (MS) network and Shufflenet (SN) are compared in terms of average queueing delay, queue size, transit delay, throughput, and bit error rate (BER) for intensity modulation/direct-detection (IM/DD) both analytically and by simulation. A hybrid semi-transparent store-and-forward node architecture is presented. Cells are electronically stored just in the case of conflict to avoid deflection, otherwise the cells will traverse the node without opto-electronic conversion. This architecture performs well, in terms of throughput, propagation delay and BER. It is also shown that by combining deflection routing with the store-and-forward scheme the network can accommodate two different bit-rates. This suggests that the proposed hybrid scheme may have good potential for future multimedia networks.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"25 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":"125069731","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":"Transport state handoff in mobile cellular networks","authors":"K. Brown, R. Gopalakrishnan, Suresh Singh","doi":"10.1109/ICCCN.1997.623300","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623300","url":null,"abstract":"We consider the problem of transport state handoff in mobile networks. The problem is motivated by the observation that an efficient way to implement transport connections, where one end is mobile, is to split these connections in two at a node close to the mobile. In such an environment we need to ensure that transport state can be handed off to a new intermediate node if the mobile roams to a location far away from the location where the connection(s) were opened. Our handoff protocols are efficient and we show that they work correctly despite any sequence of moves made by the mobile.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"44 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":"123839285","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":"GMNF-DVMRP: a modified version of distance vector multicast routing protocol","authors":"Y. Lai, Ying-Dar Lin, Wei-Che Yu, Yuh-Tay Lin","doi":"10.1109/ICCCN.1997.623292","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623292","url":null,"abstract":"In this paper, we make a survey of distance vector multicast routing protocol (DVMRP) and find that it is not optimal in the aspect of network cost (NC). Therefore, we propose a modified version of DVMRP, called \"group membership near first-DVMRP\" (GMNF-DVMRP), to decrease the NC of the multicast tree formed by DVMRP. A simulation is implemented to compare our modified version and the original DVMRP. We find that our method save about 5-7 percent of NC of the multicast tree formed by DVMRP.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"99 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":"122318869","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}
Chan Park, Jong Hyup Lee, Jin-Oh Kim, Hyup-Jong Kim
{"title":"IP routing on logical address group","authors":"Chan Park, Jong Hyup Lee, Jin-Oh Kim, Hyup-Jong Kim","doi":"10.1109/ICCCN.1997.623339","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623339","url":null,"abstract":"In principle, more than one routers are intervened between different IP subnets. IETF RFC1577 \"Classical IP and ARP over ATM\", which is specified to provide IP services on an ATM network, also requires that the router be used between different logical IP subnet (LISs). However, the intervention of the router is not always an effective solution on an ATM network. If there is a direct virtual channel connection between two endpoints on the ATM network, they can exchange their information directly without the help of routers. Actually, some groups of the IETF and ATM Forum are working on such tasks. As a result, the Next Hop Resolution Protocol (NHRP) or MultiProtocol Over ATM (MPOA) is being drafted. However, since those protocols are too heavy and complicated, they are not easy to implement. We propose a simple efficient solution for inter-LIS communication-LIS Information Protocol. Our solution is exactly compatible with RFC1577. We describe how RFC1577 can be used to provide inter-LIS communications and introduce our prototype systems and test-bed network.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"92 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":"128810736","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":"Statistical characterization of wide-area IP traffic","authors":"M. T. Lucas, D. Wrege, B. J. Dempsey, A. Weaver","doi":"10.1109/ICCCN.1997.623349","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623349","url":null,"abstract":"A background traffic model is fundamental to packet-level network simulation since the background traffic impacts packet drop rates, queueing delays, end-to-end delay variation, and also determines available network bandwidth. In this paper, we present a statistical characterization of wide-area IP traffic based on 90-minute traces taken from a week-long trace of packets exchanged between a large campus network a state wide educational network, and a large Internet service provider. The results of this analysis can be used to provide a basis for modelling background load in simulations of wide-area packet-switched networks such as the Internet, contribute to understanding the fractal behavior of wide-area network utilization, and provide a benchmark to evaluate the accuracy of existing traffic models. The key findings of our study include the following: (1) both the aggregate packet stream and its component substreams exhibit significant long-range dependencies in agreement with other traffic studies. (2) the empirical probability distributions of packet arrivals are log-normally distributed. (3) packet sizes exhibit only short-term correlations and (4) the packet size distribution and correlation structure are independent from both network utilization and time of day.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"29 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":"116695819","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 of ATM available bit rate for bursty TCP sources and interfering traffic","authors":"D. Hong, T. Suda","doi":"10.1109/ICCCN.1997.623327","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623327","url":null,"abstract":"The available bit rate (ABR) service dynamically utilizes free bandwidth in ATM networks for data traffic. ABR enables data sources to efficiently utilize network resources without adversely affecting the performance of guaranteed traffic such as for video. However, the majority of research to date on the performance of ABR schemes has ignored the effects of guaranteed traffic. The vast majority of research has also only utilized persistent sources although real data traffic, such as Internet traffic, is bursty. This paper presents a simulation study of bursty Internet TCP traffic over ATM with bursty interfering traffic streams. Two major ABR schemes, rate based ABR with explicit rate (ER) control and the credit based quantum flow control (QFC), are compared. The results indicate that performance with QFC is significantly better than with ER control.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"40 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":"130970378","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}