{"title":"\"Scheduled-multicast\" with application in multimedia networks","authors":"H. El-Gindy, C. Nguyen, A. Symvonis","doi":"10.1109/ICON.2000.875788","DOIUrl":"https://doi.org/10.1109/ICON.2000.875788","url":null,"abstract":"We introduce a novel transmission technique, termed \"scheduled-multicast\". Scheduled-multicast uses existing or additional memory at internal nodes in the transmission paths from the server to the clients to buffer the data stream, and effectively reduce the bandwidth requirements. We designed a new protocol, scheduled-multicast protocol (SMP), and implemented a prototype system employing SMP to test out the feasibility of scheduled-multicast. The results from our experiments shows that SMP can greatly increase the scalability of the system (i.e., the number of concurrent clients who can be serviced) at a very small cost to the processor utilization. Given the positive results from our prototype, we believe SMP can be used to greatly enhance the scalability of large VoD systems at minimal infrastructure cost.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"50 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":"122283220","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":"Providing minimum bandwidth guarantees to TCP traffic in ATM networks","authors":"Xin Zhang, C. Tan","doi":"10.1109/ICON.2000.875837","DOIUrl":"https://doi.org/10.1109/ICON.2000.875837","url":null,"abstract":"The guaranteed frame rate (GFR) was proposed by the ATM Forum as a service category to provide a minimum service guarantee to classical best effort service. We present a new buffer allocation scheme with tagging and FIFO scheduling to provide a minimum rate guarantee. The simulation results show that this scheme achieves good throughput as well as fairness requirements.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"19 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133754208","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}
Jianhua He, K. R. Subramanian, Liren Zhang, Donghua Dong
{"title":"Performance evaluation of a reliable broadcast scheme for satellite communications","authors":"Jianhua He, K. R. Subramanian, Liren Zhang, Donghua Dong","doi":"10.1109/ICON.2000.875822","DOIUrl":"https://doi.org/10.1109/ICON.2000.875822","url":null,"abstract":"We present an analytical method called steady state function method (SSFM) to evaluate the performance of a full memory multidestination selective repeat (MSR) ARQ scheme. For a wide range of system parameters, SSFM provides a throughput closer to the simulation results. SSFM is also extended in a direct way to analyze the performance of a hybrid MSR ARQ scheme in which forward error correction (FEC) is employed in the MSR ARQ scheme. Analytical results shows that the hybrid MSR ARQ scheme largely outperforms the pure MSR ARQ scheme when the packet error ratio is high.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"319 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":"116231802","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":"Modelling and simulation of STTP, a proactive transport protocol","authors":"R. Wade, M. Kara, P. Dew","doi":"10.1109/ICON.2000.875838","DOIUrl":"https://doi.org/10.1109/ICON.2000.875838","url":null,"abstract":"We present an experimental transport protocol which employs alternative methods of startup and congestion avoidance to those commonly used in implementations of TCP. Through modelling and simulation, we demonstrate how a packet-pair probe may be used to replace traditional slow-start methods and how proactive congestion avoidance algorithms provide smoother traffic flow with lower levels of packet loss and retransmission. We also show how a token bucket may be used to allow bounded burstiness for an Internet connection in order to facilitate an application's quality of service.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"37 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":"116796067","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":"Near optimal flow labeling in ATM/IP-LSR networks using multi-segment flows","authors":"A. Harwood, Hong Shen","doi":"10.1109/ICON.2000.875796","DOIUrl":"https://doi.org/10.1109/ICON.2000.875796","url":null,"abstract":"Packet or datagram based routing is widely used for the Internet mainly due to its robustness, ease of implementation and autonomous behavior. Hierarchical networks are necessary to provide scalability. Previous developments proposed for ATM technology to be the basis of packet switched routing protocols. This technology provides flows to reduce the number of times a packet's destination address must be looked up in a routing table thereby increasing the performance of the overall system. Basic methods to establish and maintain these flows have emerged. Clearly one cannot define a flow between every (source, destination) pair since the number of destinations (in the Internet) is prohibitively large. We provide a definition of the problem with optimality criteria, and an algorithm that autonomously establishes a dynamic hierarchy of flows over an arbitrary network according to traffic demand. If the network is of size n, our algorithm uses only O(n/sub 0/log/sub n0/n) labels at each router where n/sub 0/=e/spl ap/3. Packets are routed over a /spl lambda/-segmented flow such that the label table is accessed at most /spl lambda/=log/sub n0/n-1 times. We show that the total table look-up complexity, O(n0log/sub n0//sup 2/n), is a factor /spl Theta/(log/sub n0/log/sub n0/n) times the optimal, which makes substantial improvement of other results known to us. Our hierarchy of flows naturally exists transparently on top of the underlying hierarchical address space (IP) and requires no additional information.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"13 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":"126491209","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 VBR traffic with autoregressive Gaussian processes","authors":"Jung-Shian Li","doi":"10.1109/ICON.2000.875835","DOIUrl":"https://doi.org/10.1109/ICON.2000.875835","url":null,"abstract":"Previous studies about network traffic measurement show that today's network traffic exhibits long-range dependence (LRD). The computation effort of generating LRD traffic is directly proportional to the length of the traces. This paper presents a traces-generating framework based on TES (transform-expand-samples) and synthetic autoregressive Gaussian processes. The proposed scheme can fit both the probability density function and the autocorrelation of the empirical traces. Besides, the computation effort of this scheme is independent of the length of the LRD traces.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"405 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":"121412105","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":"Wavelength assignment for dynamic traffic in WDM networks","authors":"Shizhong Xu, Lemin Li, Sheng Wang, Chibiao Chen","doi":"10.1109/ICON.2000.875817","DOIUrl":"https://doi.org/10.1109/ICON.2000.875817","url":null,"abstract":"We propose a dynamic centralized algorithm, relative least influence algorithm (RLI), for the wavelength assignment problem in WDM networks with fixed routing and alternate routing. It can be used in single-fiber networks as well as multi-fiber networks. Compared with the previously proposed algorithms which take the whole network state into consideration, RLI can model the effect of establishing a new lightpath on the network more accurately. Simulation results show that it performs better than the others (in the cases we studied).","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"31 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":"115680895","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":"Design issues on video-on-demand resource management","authors":"Hongtao Yu, C. Low, Yacine Atif","doi":"10.1109/ICON.2000.875789","DOIUrl":"https://doi.org/10.1109/ICON.2000.875789","url":null,"abstract":"This paper addresses the resource management problem in a distributed video-on-demand (VOD) system. The objective of resource management is to manage video objects in a VOD system and balance the load among video servers. In order to achieve this objective, several research approaches such as allocation, video server selection, replication, and cache management are considered. These approaches take the video objects' characteristics and system load into consideration to achieve good performance in terms of the ability to balance the load among video servers and to minimize the delay for video requests to be served.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"28 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":"115376931","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":"Design and implementation of MPLS network simulator supporting LDP and CR-LDP","authors":"Gaeil An, Woojik Chun","doi":"10.1109/ICON.2000.875828","DOIUrl":"https://doi.org/10.1109/ICON.2000.875828","url":null,"abstract":"The explosive growth of the Internet and the advent of sophisticated services require an epoch-making change. As an alternative that can take in it, MPLS was proposed. Many efforts and activities on MPLS have already been initiated, which prompt the necessity of an MPLS simulator that can evaluate and analyze newly proposed MPLS techniques. This paper describes the design, implementation, and capability of a MPLS simulator, which supports label swapping operation, LDP, CR-LDP, and various sorts of label distribution functions. It enables researchers to simulate how an LSP is established and terminated, and how the labeled packets act on the LSP. In order to show the MPLS simulator's capability, the basic MPLS function defined in the MPLS standards is simulated; label distribution schemes, flow aggregation, ER-LSP, and LSP Tunnel. The results are evaluated and analyzed, and their behaviors are shown in a graphical manner.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"5 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":"115471301","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 application based differentiated service model","authors":"Fugui Wang, P. Mohapatra, S. Mukherjee","doi":"10.1109/ICON.2000.875825","DOIUrl":"https://doi.org/10.1109/ICON.2000.875825","url":null,"abstract":"In this paper we propose a flexible differentiated service model, which is based on the application layer so that applications can indicate their network service requirements directly. We classify Internet applications into four categories and provide different schemes for each of the categories to indicate its request. The model hides the complexity of the network services from the end-users but can still make efficient use of the negotiated network resources. We implement our model in the ns2 network simulator and show that the performance meets our design goal.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"1 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":"130703603","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}