{"title":"Scheduling packet transmissions in a multi-hop packet switched network based on message length","authors":"E. Modiano","doi":"10.1109/ICCCN.1997.623335","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623335","url":null,"abstract":"This paper describes two algorithms for scheduling packets in a multi-hop network. The objective of the algorithms is to reduce end-to-end message (not packet) transmission delays. Both algorithms schedule packet transmissions based on the length of the original message that the packet belongs to. The first algorithm is preemptive and is based on the shortest-message-first principle and the second is based on the shortest-remaining-transmit-time principle. We develop simulation models for analyzing the algorithms. The simulations show that when message sizes vary widely, these algorithms can significantly reduce average end-to-end message delays compared to first-come-first-serve scheduling.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"3 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":"122521340","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 system for high quality desktop video conference","authors":"S. Catrava, F. Golshani","doi":"10.1109/ICCCN.1997.623343","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623343","url":null,"abstract":"This paper describes a performance system that, by graceful degradation and reallocation of resources, attempts to maintain quality in desktop video conference (DVC) systems. The performance system is based on a distributed agent architecture, where agents cooperate to maintain the required quality of service (QoS) during the video conference session. This system adjusts its setting in real time to optimally respond to a set of changing conditions and parameters. The performance system comprises a set of performance enhancers to compensate for the hardware overloads and to maintain the conference throughput when external factors are changing the environment. The performance system uses quality evaluators to analyze the system behavior and to activate /deactivate a compensation loop.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"8 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":"121096360","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":"Multi-frame isochronous service for ATM networks: stop-and go revisited","authors":"T. Ibaraki, T. Kameda","doi":"10.1109/ICCCN.1997.623284","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623284","url":null,"abstract":"The ATM switching scheme we propose is similar to the multi-frame stop-and-go, except that we use EDF (earliest-deadline-first) scheduling, instead of rate-monotonic, static-priority scheduling. Unlike the multi-frame stop-and-go, our scheme can fully utilize the link bandwidth, and does not require that the input or output frames of the same size be synchronized. EDF scheduling is, in general, more complex than static-priority scheduling. However, we show that the next earliest deadline needs to be computed only when an output frame reaches its end, i.e., not whenever a cell is output, resulting in significant saving in computation time. We derive bounds on end-to-end delay and delay-jitter, and discuss implementation issues.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"39 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":"124182294","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":"Modeling ATM traffic using stochastic Petri net","authors":"Chuang Lin, Bo Li, Jianping Wu","doi":"10.1109/ICCCN.1997.623364","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623364","url":null,"abstract":"This paper describes a general framework for modeling and analyzing ATM traffic control using the stochastic high level Petri net (SHLPN). The reasons SHLPN is chosen are two fold: it can handle concurrent, asynchronous, nondeterministic and stochastic events; and it provides an intuitive yet efficient mechanism that can decompose a complex model into submodels. In addition, there exists a set of well-developed performance analysis techniques for SHLPN. In order to cope with the well known state space explosion problem, we proposed a novel reduction method which incorporates the bursty characteristic of ATM networks. We show how to apply the SHLPN techniques in modeling and analyzing various ATM mechanisms such as: bursty traffic source and traffic rate control.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"82 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":"131145792","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 efficient traffic control scheme for integrated voice, video and data over ATM networks: explicit allowed rate algorithm (EARA)","authors":"A. Dinesh, M. Moh","doi":"10.1109/ICCCN.1997.623342","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623342","url":null,"abstract":"ATM networks are networks with guaranteed quality of service. The main cause of congestion in ATM networks is over utilization of the physical bandwidth. Unlike constant bit rate traffic, the bandwidth reserved by variable bit rate (VBR) traffic is not fully utilized at all instances. Hence, this unused bandwidth is allocated to available bit rate traffic (ABR). As the bandwidth used by VBR traffic changes, the available bandwidth for ABR traffic varies, i.e., the available bandwidth for ABR traffic is inversely proportional to the bandwidth used by the VBR traffic. Based on this fact, a rate based congestion control algorithm, explicit allowed rate algorithm (EARA), is presented. The EARA is compared with the proportional rate control algorithm (PRCA) and explicit rate indication congestion avoidance algorithm (ERICA), under congestion and fairness configurations. The results show that, with a minimal overhead on the switch, the EARA significantly decreases the required buffer space and improves the network throughput.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"33 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":"133468740","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":"Protocol filtering: a microscopic approach to Windows NT and Novell NetWare network modeling","authors":"R. Pimplaskar, Suk-Chung Yoon, E. Park","doi":"10.1109/ICCCN.1997.623352","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623352","url":null,"abstract":"The application of protocol filtering in network modeling was discussed. This technique can be used to conduct performance analysis by simulating system \"what-if\" scenarios. The Windows NT and Novell Netware subnets of the School of Engineering at Widener University were considered as the problem domain. Analysis was conducted on 1.2 GB of data gathered daily over a period of two months by a network monitor. Protocol models built for NCP, SAP, RIP, IPX NetBIOS, UDP Broadcasts, TCP, Telnet, ARP, SMB, IBMNB, NetBIOS NS, AARP, RTMP, and NBP. Identification of different types of protocol traffic in association with source and destination was effected through customized packet filtering. Thereafter, traffic models were built for interarrival time and packet size. After extensive testing of the simulation output, what-if scenarios were setup and addressed. One such scenario involved the addition of ten workstations to an existing subnet. Another variant was to consider a new subnet containing ten workstations. The simulation output has been verified against an external criterion.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"44 7 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":"132370781","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":"Resource allocation control protocols for multicast data transport","authors":"K. Ravindran, Ting-Jian Gong","doi":"10.1109/ICCCN.1997.623311","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623311","url":null,"abstract":"The paper describes a model of protocol mechanisms for integrating resource reservations and multicast path setups. The protocol model is based on shared tree-structured channels in the network to which sources and destinations can connect to exchange data. The paper employs flow aggregation as a construct for realization of resource reservation protocols, as suggested by RSVP. Here, multiple flows that share a link in a tree are merged into a single equivalent flow for resource allocation purposes. Mechanisms to generate a composite flow from a set of flows and vice versa, constitute the functional elements of resource reservation protocols (e.g., bandwidth estimation for aggregated flows). These protocol elements can be parameterized with user-level flow specifications and topological placement of source and destination entities, for making resource allocation and path setup decisions. The novel idea is in casting the routing subsystems of multicast networks with RSVP-style resource allocation functions.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"22 3 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":"127561749","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 video-on-demand server efficiency through stream tapping","authors":"Steven W. Carter, D. Long","doi":"10.1109/ICCCN.1997.623313","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623313","url":null,"abstract":"Efficiency is essential for video-on-demand (VOD) to be successful. Conventional VOD servers are inefficient, they dedicate a disk stream for each client, quickly using up all available streams. However, several systems have been proposed that allow clients to share streams. We present a new system called stream tapping that allows a client to greedily \"tap\" data from any stream on the VOD server containing video data the client can use. This is accomplished through the use of a small buffer on the client set-top box and requires less than 20% of the disk bandwidth used by conventional systems for popular videos. We present a description and analysis of the stream tapping system as well as comparisons between it and other efficiency-improving systems.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"467 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":"128834992","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":"Gis2web and its inter-application communications issues","authors":"X. Meng, R. Fowler, E. Rieken","doi":"10.1109/ICCCN.1997.623347","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623347","url":null,"abstract":"Gis2web is a system intended to bridge the gap between GIS software and datasets and the WWW. The system operates by periodically accessing distributed datasets of GIS information and creating a common repository of WWW accessible information on a gis2web server. In this way gis2web users are provided seamless access to different datasets which may be of quite different forms. This paper discusses the architecture and communications issues of gis2web.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"74 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":"126096133","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":"Automated formal verification of protocols","authors":"D. Avresky, S. Vassilaras","doi":"10.1109/ICCCN.1997.623308","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623308","url":null,"abstract":"We adopt a formalism to describe protocols that is close to the human way of thinking and can be easily used to perform reachability analysis of the described protocol in a state-transition format. This formalism allows for an execution tree (ET) to be generated from a set of assertions such that all paths from the root to the leaves are well-defined formulas. We then extend the formalism with regards to real-time properties. Finally, we present a software verification tool, Verify, that implements the above features in the analysis of protocols.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"54 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":"121882385","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}