{"title":"Statistical modeling of MPEG coded video","authors":"Preslav Markov, H. Mehrpour","doi":"10.1109/ICON.2001.962314","DOIUrl":"https://doi.org/10.1109/ICON.2001.962314","url":null,"abstract":"The major driving force behind the emerging of broadband integrated networks is traffic from video sources. Since this traffic will be a substantial portion of the overall traffic carried by the integrated networks, it is extremely important that adequate source models are found. The networks' dimensioning depends on the statistical properties of traffic sources. For video sources the Moving Picture Experts Group (MPEG) compression scheme was proposed several years ago and it has become the de facto standard for video compression since then. However, even with the huge reduction of bits that MPEG compression provides, it does not smooth the video traffic. Indeed the MPEG compression algorithm guarantees that the MPEG stream will be bursty. The aim of the work outlined was finding a suitable model for the MPEG coded video traffic. The paper concentrates on a variety of models and their capabilities to model adequately the statistical properties of MPEG video. In particular, the transform-expand-sample (TES), the autoregressive (AR), the autoregressive moving average (ARIMA) and the first order statistics histogram models were investigated in terms of both accuracy and complexity. A short discussion regarding the tradeoff between the accuracy and the complexity of these models is also provided.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126581107","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":"Current directions in active programmable network","authors":"W. Lau, S. Jha, Mahbub Hassan","doi":"10.1109/ICON.2001.962347","DOIUrl":"https://doi.org/10.1109/ICON.2001.962347","url":null,"abstract":"The active programmable network (APN) has begun a new phenomenon in the logical view towards network in the Internet domain. Traditional technologies based on IP have viewed the network as a black box where the network is hidden from the upper layers. The advantage of this model is the simplicity and the robustness it can offer. However, this model may not be appropriate for the future applications of the Internet where the integration of services are expected. The APN can be considered as an alternative model where components within the network are open for programmability.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126302041","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 multi-base station multi-carrier PRMA MAC protocol","authors":"Mingyuan Li, Yongyi Mao, Xiaoyan Zhang, Juan Guo","doi":"10.1109/ICON.2001.962349","DOIUrl":"https://doi.org/10.1109/ICON.2001.962349","url":null,"abstract":"A multi-base station, multi-carrier PRMA (MM-PRMA) protocol is proposed. This protocol has the property of \"soft\" capacity and \"soft\" handoff similar to CDMA systems, and can decrease times of the handoff meanwhile increase the system capacity.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115836297","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 platform independent image transcoders","authors":"Z. Zhou, A. Seneviratne","doi":"10.1109/ICON.2001.962326","DOIUrl":"https://doi.org/10.1109/ICON.2001.962326","url":null,"abstract":"Today many \"Internet ready\" devices available on the market are Web-enabled. These devices often have a low bandwidth, high latency access to the Internet that causes a bottleneck of data communication. Moreover, a number of client devices have very limited computing power and hardware/software resources to handle some of the content-rich information that a user might want to access from the network. A content transcoder is a possible solution to solve the problem caused by the deficiencies of such devices. To extend the concept further we believe a transportable content transcoder will provide more flexibility than the current static proxy solution. However, the current Internet environment is heterogeneous, and implementing such a transcoder with native programming language is not applicable. To overcome this issue, a transportable transcoder needs to be implemented using platform independence language, such as Java. Inevitably, there will be tradeoffs when using such a language in terms of performance. In this paper, we present our findings on the performance of a Java image transcoder by comparing one written in native code (C). In addition, we investigate means to optimise the performance of our Java transcoder From our results we evaluate the viability of this concept.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"30 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115216839","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":"GLOB: generic load balancing","authors":"T. Verwoerd, R. Hunt","doi":"10.1109/ICON.2001.962319","DOIUrl":"https://doi.org/10.1109/ICON.2001.962319","url":null,"abstract":"Current load balancing solutions are capable of improving the throughput of network service clusters, but they suffer from fundamental structural limitations. In particular, these systems do not cater for balancing gateway systems, such as NAT devices or firewalls. We propose a generic load balancing system (GLOB). GLOB is a client-transparent, peer-to-peer adaptive load balancing system that uses statistically configured packet filters. It offers an alternative to conventional distribution point load balancing schemes, and is specifically suited to gateway systems. Finally, comparative results of our GLOB model relative to mainstream load balancing scheduling schemes is presented.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128663464","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":"Mixing UDP and TCP in a Diffserv assured forwarding PHB - a programmable networks scenario","authors":"G. Rogers, M. Minhazuddin, R. Liu","doi":"10.1109/ICON.2001.962397","DOIUrl":"https://doi.org/10.1109/ICON.2001.962397","url":null,"abstract":"The Differentiated Services assured forwarding PHB is attractive from the network management perspective because it signals congestion by selective, random packet drops. End systems are expected to adapt their transmission rate in response permitting a level of fuzziness in resource allocation. While TCP-based applications are an obvious target of assured forwarding, streams using RTP over UDP are potentially adaptable using the packet loss indication in the return RTCP packets. We report results from a testbed system we have constructed around a simple implementation of assured forwarding in a rudimentary IntServ over DiffServ scenario. We demonstrate that, with suitably chosen RED parameters, two TCP and two UDP streams can be held to approximately their policed rates. The UDP-based DVD video stream is controlled by dropping the MPEG B frames using appropriate filters in a router. We use this to illustrate the type of application-oriented service that could be implemented by a service provider in a programmable networks scenario.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122268101","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 group security association for secure multicasting","authors":"Wonjoo Park, J. Nah, S. Sohn, Daeyoung Kim","doi":"10.1109/ICON.2001.962329","DOIUrl":"https://doi.org/10.1109/ICON.2001.962329","url":null,"abstract":"The growth and commercialization of the group-oriented applications on the Internet has triggered a demand for security solutions for group communications. One such solution, secure multicast, is provided because it is available for the efficiency of multicast data delivery. This paper proposes a method of advertising a group security association for secure group communication and defines extensions of SAP (session announcement protocol) and SDP (session description protocol) for the framework. It provides descriptions for group security associations (GSA) for the support of secure multicasting in IP multicast.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124090038","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 hierarchy-based multicast protocol for wireless mobile ad-hoc networks","authors":"Tzung-Shi Chen, Yuh-Shyan Chen, Hua-Wen Tsai","doi":"10.1109/ICON.2001.962348","DOIUrl":"https://doi.org/10.1109/ICON.2001.962348","url":null,"abstract":"We propose a new multicast routing protocol, named hierarchy-based multicast protocol (HMP), for multihop mobile ad-hoc networks. First, we select a set of nodes, where each is a root node, called core, of a constructed local share tree for connecting parts of neighborhood destinations. Based on these local shared trees, the HMP will be executed on two stages: the first stage, reactive stage, and the second stage, proactive stage. During the first stage, source host forwards source messages to the set of core nodes of those local shared trees using on-demand routing. The second stage is that each core node forwards the source messages to destination nodes along its corresponding constructed local shared tree. Finally, we show that our proposed scheme outperforms the reactive and proactive multicast protocols existing in mobile ad-hoc networks.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124202831","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":"Joint routing and rate assignment in MPLS based networks","authors":"W. Tsai, Wulun Dai","doi":"10.1109/ICON.2001.962340","DOIUrl":"https://doi.org/10.1109/ICON.2001.962340","url":null,"abstract":"The problem of jointly optimizing rate assignment (admission control) and routing with multiple quality of service (QoS) classes is formulated in this paper. A multiobjective lexicographical approach was used to force the higher priority classes to have proportionally smaller packet loss rates and delay variations and higher admitted rate. The lexicographic approach (called the virtual input method) uses the concept of virtual input rates that are shown to be necessary to obtain categorical differences in QoS between classes. This algorithm is then compared to an ad hoc iterative algorithm (called the iterative method) which optimizes delay and rate assignment on an alternating basis. M/M/1/b queues are used to model switching delays in the MPLS based networks. The average packet loss and switching delay in the network are shown to be closely related and the average packet delay is used in the main objective for the optimization. The joint optimization is equivalent to the optimal routing problem (ORP). Since the ORP with packet loss is non-convex, a reduced problem (R-ORP) is formulated by assuming no packet loss at intermediate switches. Numerical results show that the virtual input method produces excellent results for network wide optimal joint assignment.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130108601","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 simple method for implementing PIM to ATM based MPLS networks","authors":"Jaihyung Cho, M. Chung","doi":"10.1109/ICON.2001.962368","DOIUrl":"https://doi.org/10.1109/ICON.2001.962368","url":null,"abstract":"A simple method for providing multicast service in ATM based multi-protocol label switching (MPLS) networks using PIM-SM is presented. This method does not require establishing dedicated multicast routes, but it uses point-to-point LSPs that were established for delivering best-effort traffic in the MPLS network. As a result, this method reduces the signaling overhead associated with establishing multicast trees and enhances scalability by sharing LSPs with multiple groups. The tradeoff is bandwidth inefficiency compared to the optimized tree, however the inefficiency is acceptable compared to the optimal shortest-path tree, and it grows slowly as the size of a group increase. This method is appropriate as the initial implementation scheme for protocol independent multicast-sparse mode (PIM-SM) in an ATM based MPLS network where only a few of switches have the capability of the multicast function.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131707988","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}