{"title":"Architectural considerations for playback of quality adaptive video over the Internet","authors":"R. Rejaie, M. Handley, D. Estrin","doi":"10.1109/ICON.2000.875790","DOIUrl":"https://doi.org/10.1109/ICON.2000.875790","url":null,"abstract":"Lack of QoS support in the Internet has not prevented the rapid growth of streaming applications. However many of these applications do not perform congestion control effectively. Thus there is significant concern about the effects on co-existing well-behaved traffic and the potential for congestion collapse. In addition, the majority of such applications are unable to perform quality adaptation on-the-fly as the available bandwidth changes during a session. This paper provides some architectural insights on the design of video playback applications in the Internet. We present fundamental design principles for Internet applications and identify end-to-end congestion control, quality adaptation and error control as the three major building blocks for Internet video playback applications. We discuss the design space for each of these components, and within that space, present an end-to-end architecture suited for playback of layered-encoded stored video streams. Our architecture reconciles congestion control and quality adaptation which occur on different timescales. It exhibits a TCP-friendly behavior by adopting the RAP protocol for end-to-end congestion control. Additionally it uses a layered framework for quality adaptation with selective retransmission to maximize the quality of the delivered stream as the available bandwidth changes. We argue that the architecture can be generalized by replacing the suggested mechanism for each component by another from the same design space as long as all components remain compatible.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116788185","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":"Deficits for bursty latency-critical flows: DRR++","authors":"M. MacGregor, W. Shi","doi":"10.1109/ICON.2000.875803","DOIUrl":"https://doi.org/10.1109/ICON.2000.875803","url":null,"abstract":"Fair queuing was invented to ensure that every flow gets its fair share of the total bandwidth. Efficient fair queuing using deficit round-robin, DRR, proposed by Shreedhar and Varghese (see IEEE/ACM Trans. Net., vol.4, no.4, p.386-97, 1996), reduces the work to process each packet from O(log(n)) to O(1). DRR+ was also extended to accommodate latency-critical flows. DRR+ uses a timer to police each latency-critical flow and was shown to have a latency bound of (n/sub c/s)+(M/B) for these flows. The definition of the contract of Shreedhar and Varghese, however, constrains a latency-critical flow to generate very smooth arrivals. By giving another definition of contract, we return to using the original concept of deficit to enforce each flow's commitment to its contract. This allows for bursty arrivals which may occur either as the result of source bursts, or as a result of the dynamics of multihop network paths.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122407079","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 fast sub-optimal routing algorithm for large size data network","authors":"W. Tsai, Wulan Dai","doi":"10.1109/ICON.2000.875786","DOIUrl":"https://doi.org/10.1109/ICON.2000.875786","url":null,"abstract":"A fast and efficient distributed sub-optimal routing algorithm using hierarchical aggregation/disaggregation (HAD) scheme is proposed for high speed Internet based on IPv6. The hierarchical structure eliminates the dominant scaling limit of the routing algorithm. It allows the number of subnetworks that must be known to any single router to be bounded. Our algorithm is different from existing HAD algorithms in high level network routing algorithm and composition algorithm. Unlike the previous algorithms, the origin and destination can be any node in the flat network. We compared our algorithm with traditional optimal routing algorithm by gradient projection (TOR-GP) method using the system delay as an objective function. The results show that our algorithm converges much faster than traditional algorithm, and provides a very good approximation to the traditional algorithm. It is safe to say that the solution should have positive effects to the rapid development of the information super-highway.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128431929","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":"VoIP performance on differentiated services enabled network","authors":"J. Muppala, T. Bancherdvanich, A. Tyagi","doi":"10.1109/ICON.2000.875824","DOIUrl":"https://doi.org/10.1109/ICON.2000.875824","url":null,"abstract":"We study the performance of voice over Internet protocol (VoIP) traffic aggregates over differentiated services (Diffserv) enabled network using expedited forwarding (EF) per hop behavior (PHB). We compare the delay and jitter performance of the VoIP traffic generated by different standard voice codec algorithms, both under Diffserv with EF PHB and with best-effort service. Both homogenous and heterogenous voice traffic aggregates are considered. Our results show that the use of EF yields very good performance improvement for voice traffic compared to best-effort. The improvement is greatest for high coding rate algorithms like G.711 than lower coding rate algorithms like G.723.1. For heterogenous traffic aggregates, the traffic from higher bit rate codecs obtains a better performance compared to lower bit rate codecs.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116858220","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 role of packet-dropping mechanisms in QoS differentiation","authors":"G. Quadros, A. Alves, E. Monteiro, F. Boavida","doi":"10.1109/ICON.2000.875808","DOIUrl":"https://doi.org/10.1109/ICON.2000.875808","url":null,"abstract":"Many research teams are developing technologies to turn the Internet into a QoS-capable network, which is one of the biggest challenges that this communication system currently faces. Naturally, at the core of such a challenge are IP routers and the technology they use. It is a well known fact that the common packet scheduling discipline that is used in routers (first come first served) makes them useless when QoS is needed. Thus, a different type of packet scheduling must be used. One of the most referred solutions for QoS-capable systems is the weighted fair queuing (WFQ) discipline. For FreeBSD-based routers, the ALTQ implementation of the WFQ discipline is, of course, an eligible and natural choice. Given this, it is important to fully understand the characteristics and operational behaviour of such an implementation. This paper presents several tests that guide the reader to a detailed knowledge about the WFQ/ALTQ operation-its behaviour, weaknesses, and flaws-with the purpose of showing how relevant can the influence of the dropper mechanism be on the effectiveness of IP routers.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114842934","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":"Bringing service differentiation to the end system","authors":"Domenico Cotroneo, M. Ficco, S. Romano, G. Ventre","doi":"10.1109/ICON.2000.875827","DOIUrl":"https://doi.org/10.1109/ICON.2000.875827","url":null,"abstract":"A number of distributed applications require communication services with quality of service (QoS) guarantees. For this purpose, resource management is required both in the end system and inside the network. To date several approaches have been proposed, dealing either with end system issues or with those more strictly related to the network, but no unified view exists. Furthermore, while network QoS provisioning has reached a good level of standardization, no standard proposals exist for the end systems. We argue that a single architectural model is needed, taking into account a more exhaustive concept of \"resource management\", where quality of service is defined at the level of user perception. We propose an architectural model that enhances the IETF Diffserv framework in order to provide service differentiation even inside network end-points. We also present a prototype implementation of such architecture along with experimental results validating the proposed solution.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124727754","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":"Active multicast core migration","authors":"H. Koubaa, E. Fleury","doi":"10.1109/ICON.2000.875812","DOIUrl":"https://doi.org/10.1109/ICON.2000.875812","url":null,"abstract":"Efficient multicast communication provides a good opportunity for scaling bandwidth intensive application. Current multicast routing involves selection of a core also known as the rendezvous point through which most of the multicast communication is routed. The purpose of this paper is to study the performance impact of migration techniques. Several studies were performed on heuristics to choose a good core but none of them presents and implements the migration itself. Moreover, by using active networking architecture, we are able to adapt our multicast protocol to the application needs. Indeed, the application may provide the cost function used to evaluate the \"quality\" of the multicast tree. Experimental results reveal that active multicast routing with migration performs well and uses network resources in a very efficient way.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128115048","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 ATM traffic scheduler for supporting multimedia services with improved packet level QoS","authors":"H. Chiou, Fu-Ming Tsou, Z. Tsai","doi":"10.1109/ICON.2000.875807","DOIUrl":"https://doi.org/10.1109/ICON.2000.875807","url":null,"abstract":"We propose a novel and efficient traffic scheduling scheme called multi-layer gated frame queueing (MGFQ) to support real-time multimedia services in the ATM networks. MGFQ employs only one set of FIFO queues to provide a wide range of QoS for real-time applications over ATM networks. We also propose a hybrid design to allow MGFQ to combine its scheduling scheme with age priority packet discarding (APPD) scheme. For this hybrid design, the cell level performance as well as the packet level QoS can be improved at the same time. Simulation results show that this hybrid design will be useful for packetized voice and progressive layer-compressed video transmission across the backbone networks. With MGFQ, a receiver can allocate less resources to compensate the disturbed cell arrivals.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121512540","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 storage area networks using high-speed LAN interconnects","authors":"Xavier Molero, F. Silla, V. Santonja, J. Duato","doi":"10.1109/ICON.2000.875833","DOIUrl":"https://doi.org/10.1109/ICON.2000.875833","url":null,"abstract":"Storage area networks (SANs) are an emerging data communications platform which interconnects servers an storage devices (such as disks, disk arrays, and tape drives) to create a pool of storage that users can access directly. SANs eliminate the bandwidth bottlenecks and scalability limitations imposed by previous SCSI bus-based architectures and LAN connections between servers and the stored data. This networking approach reports benefits such as computer clustering, topological flexibility, fault tolerance, high availability, and remote management. The prominent technology for implementing SANs is the fibre channel, due to the suitability of this technology for storage networking. Other technologies for high performance interconnects have also been developed. These interconnects provide switch-based networks with links transferring data at more than 1 Gigabit per second, being mainly used in the LAN environments. We analyze whether these high-speed LAN technologies could also be an interesting alternative to storage networking. We perform this analysis using real-world I/O traces. The main conclusion from our study is that most of the messages present the base network latency, meaning that the network is not heavily loaded. Moreover the response time is, in general, acceptable, being dominated by the time disks need to process the requests.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128296835","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}
Mohit Aiyar, Shefali Nagpal, N. Sundararajan, P. Saratchandran
{"title":"Minimal resource allocation network (MRAN) for call admission control (CAC) of ATM networks","authors":"Mohit Aiyar, Shefali Nagpal, N. Sundararajan, P. Saratchandran","doi":"10.1109/ICON.2000.875849","DOIUrl":"https://doi.org/10.1109/ICON.2000.875849","url":null,"abstract":"The project was undertaken essentially as a technical investigation of the utility of the minimal resource allocation network (MRAN) in the implementation of call admission control (CAC) on asynchronous transfer mode (ATM) networks. CAC is a fundamental mode of traffic management of ATM networks. The model development, simulation and testing were conducted with the aid of the simulation tool-Optimized Network Engineering Tools (OPNET) Version 6. In order to evaluate, the performance of the MRAN facilitated CAC scheme; a comparative study was done with existing conventional algorithms. This was an essential pre-requisite and an integral part of the technical study. The purpose of a call admission controller is to block incoming calls, thus reducing congestion in the network while maintaining quality of service (QoS). Conventional CAC controllers face certain drawbacks that are overcome with the use of neural networks. In this research initiative, the MRAN neural network algorithm has been used for predictive dynamic bandwidth allocation for the facilitation of a more efficient call admission controller. The MRAN is a minimal radial basis function (RBF) neural network which is a sequential learning algorithm.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"46 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116541284","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}