{"title":"Efficient broadcast with forward node set in clustered mobile ad hoc networks","authors":"W. Lou, Jie Wu","doi":"10.1109/ICCCN.2002.1043098","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043098","url":null,"abstract":"The clustered architecture of a mobile ad hoc network (MANET) has the virtue of keeping the node information locally which is suitable for scalability. Reducing broadcast redundancy can avoid the broadcast storm problem and save scarce resources such as bandwidth and energy. We propose an approach that chooses a subset of nodes, called forward node set, to relay the broadcast packet. Each clusterhead computes its forward node set that connects its adjacent clusterheads. A non-clusterhead node just relays the broadcast packet if it is selected as a forward node or else it does nothing. Therefore, the broadcast operation can be restricted only to clusterheads and nodes in locally selected forward node sets. We also utilize the information of clusterheads that are piggybacked with the broadcast packet to further reduce each forward node set. Simulation shows its performance improvement against other broadcast algorithms.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134496774","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 impact of non-DS domains in a multi-domain DiffServ network","authors":"Pei Zheng, L. Ni","doi":"10.1109/ICCCN.2002.1043063","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043063","url":null,"abstract":"Differentiated Services (DiffServ) architecture has been proposed as a scheme to provide scalable end-to-end QoS by employing a simple classification based on the DSCP in IP header. One of the major reasons that hinder ISPs to provide DiffServ is that the service level cannot be guaranteed when a specific traffic flow traverses a number of DS and non-DS domains. The issue of the impact of non-DS domains or non-DS routers in a hybrid multi-domain DiffServ network on the performance of Premium Services and Assured Services has been largely ignored by the research community. In this paper, we first present a preliminary queueing analysis of the hybrid multidomain DiffServ network based on a tandem queue model. Then we propose a performance metric called SPI (Service Provision Index) to measure the service level degradation of preferred services in a hybrid multi-domain DiffServ network with respect to an All-DS network. Network simulations and emulations are conducted on a variety of scenarios with different parameter settings to explore the performance of a hybrid multi-domain DiffServ network. Based on the quantitative analysis, the simulation and emulation results, we make some observations on the underlying problem, which could help ISPs or researchers determine the major factors of service degradation, as well as possible directions to improve the services.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131301136","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":"Traffic engineering for MPLS-based virtual private networks","authors":"C. Chou","doi":"10.1109/ICCCN.2002.1043054","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043054","url":null,"abstract":"This paper considers the traffic engineering of MPLS-based virtual private networks (VPNs) with multiple classes of service. We focus on two main issues. Firstly, we point out that the one LSP per ingress-egress pair constraint can be relaxed for the case of MPLS-based VPNs due to the ease in classifying flows on a per-VPN basis. This allows us to use LSP with finer granularity and thus better load balancing. Secondly, we point out that the single objective traffic engineering formulations proposed in literature address only one particular aspect of the traffic engineering problem. We propose a multiobjective traffic engineering problem which takes both resource usage and link utilisation into account. This optimisation problem is NP-complete and involves a large number of variables. We propose an heuristic to solve this problem.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116491394","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":"Probabilistic guarantees on message delays over wide-area networks using in-situ instruments","authors":"N. Rao","doi":"10.1109/ICCCN.2002.1043053","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043053","url":null,"abstract":"Messages transported over wide-area networks are subject to various delays at the intermediate nodes and hosts. In addition to bandwidth limits, the delays have an apparent \"random\" component due to the complicated dynamics of the network traffic. We consider that the messages sent over the network are subjected to three types of delays: (a) propagation delays along the links, (b) delays due to bandwidth availability on the links, and (c) \"other delays\" at the intermediate nodes which are randomly distributed according to unknown distributions. We propose an overlay network of in-situ instruments on such a network to collect delay measurements, and to compute and implement paths for message transport. We propose an algorithm to compute a path whose message delay is close to the optimal expected delay with a high probability, based entirely on measurements. We then present a multiple path method for achieving low end-to-end delays, which is implemented over the Internet using user-level daemons. These daemons realize multiple paths among themselves without explicit support from the underlying network routers, and achieve higher aggregated bandwidths compared to the usual transport methods.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123813130","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 the scalable multicast balanced gamma (BG) switch","authors":"Cheng Li, H. Heys, R. Venkatesan","doi":"10.1109/ICCCN.2002.1043117","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043117","url":null,"abstract":"The paper presents the design and implementation of a new multicast switch for broadband communications. Using distributed control and modular design, the multicast balanced gamma (BG) switch features a scalable, high performance architecture for unicast, multicast and combined traffic under both uniform and non-uniform traffic conditions. The important design characteristic of the switch is that a distributed cell replication function for multicast cells is integrated into the functionality of the switching element (SE) with the self-routing and conflict contention functions. We discuss in detail the design issues associated with the multicast functionality of the switch. VLSI implementation results for the BG switch fabric using 0.18 /spl mu/m CMOS technology are presented. Scalability and performance properties of the multicast BG switch are also briefly discussed.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116597872","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":"Utility-based resource allocation for wireless networks with mixed voice and data services","authors":"Chi Zhou, M. Honig, S. Jordan, R. Berry","doi":"10.1109/ICCCN.2002.1043110","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043110","url":null,"abstract":"Power allocation across users in two adjacent cells is studied for a wireless code division multiple access (CDMA) network with mixed voice and data services. We assume that each user has a utility function that measures the user's satisfaction, or utility, as a function of the received signal-to-interference-plus-noise ratio (SINR). Each particular service (voice or data) is associated with a different utility function. We consider the forward link. Our objective is to allocate transmitted power to maximize the total utility summed over all active users subject to rate and power constraints. We show that the maximum utility can be achieved with a pricing scheme. We characterize the solution to a one-cell utility maximization problem with fixed interference from the other cell. For two-cell utility maximization, the two cells must cooperate to achieve the maximum utility.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116786874","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":"Application-oriented multimedia scheduling over lossy wireless networks","authors":"Xiaoqiao Meng, Hao Yang, Songwu Lu","doi":"10.1109/ICCCN.2002.1043075","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043075","url":null,"abstract":"This work seeks a better understanding of the relations between the better network service provided by QoS-oriented wireless packet scheduling and the actual benefits perceived by the multimedia applications that use them. Through extensive simulations driven by real (multimedia and wireless channel error) traces, we observe that in general, there is a performance gap between application perceived QoS and network QoS provided by the wireless fair packet scheduler. This gap tends to increase further as the channel error rate aggravates. The exact distribution of channel errors greatly affects the multimedia application performance, but its impact on network QoS is much smaller. We then present the solution, which is based on idealized weighted fair queuing (IWFQ) to further improve three popular multimedia applications' performance.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115862103","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":"On the latency bound of deficit round robin","authors":"S. Kanhere, H. Sethu","doi":"10.1109/ICCCN.2002.1043123","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043123","url":null,"abstract":"The emerging high-speed broadband packet-switched networks are expected to simultaneously support a variety of services with different quality-of-service (QoS) requirements over the same physical infrastructure. Fair packet scheduling algorithms used in switches and routers play a critical role in providing these QoS guarantees. Deficit round robin (DRR), a popular fair scheduling discipline, is very efficient with an O(l) dequeuing complexity. Using the concept of latency-rate (/spl Lscr//spl Rscr/) servers introduced by Stiliadis and Varma (1996), we obtain an upper bound on the latency of DRR and prove that our bound is tight. Our upper bound is lower than the previously known upper bound. This illustrates that the DRR scheduler has better performance characteristics than previously believed, especially for real-time applications where the latency plays a role in the size of the playback buffer required.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122016009","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":"Enhancing multicast communication to support protocol design","authors":"Luciana Chen, Gurdip Singh","doi":"10.1109/ICCCN.2002.1043087","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043087","url":null,"abstract":"Designing protocols to support collaborative applications is a non-trivial task that must be aided with design methodologies and middleware support. Support for multicasting is an important requirement in collaborative applications and several multicast frameworks supporting different ordering semantics such as FIFO, causal and total ordering have been studied. In this paper, we study the ordering requirements imposed by the modular, compositional structure of a protocol on the underlying multicast communication service (MCS). Collaborative protocols often consist of multiple functions, and techniques for designing multifunction protocols can be used for their development. The modular structure of such multifunction protocols may impose certain ordering requirements on the underlying MCS. We propose a scheme that allows a protocol to specify its ordering requirements and a technique to implement these requirements using an underlying MCS. We show that protocol design and composition is simplified if the messages are delivered in the application-specified order. We also show that the underlying MCS can exploit the structured communication pattern imposed by the modular structure of a protocol to improve the performance.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126814113","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":"Distributed media and arts","authors":"F. Golshani","doi":"10.1109/ICCCN.2002.1043119","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043119","url":null,"abstract":"Summary form only given. The traditional hierarchical view of data, information and knowledge as various stages of (artificial) intelligence sidesteps a significant stage, namely \"experience\", which is the main concern of artists. With digital multimedia taking a more prominent role in arts and entertainment, we have much more opportunity to create unique experiences, as well as new challenges to overcome. Of particular interest are those experiences which provide the observer the opportunity to participate in and respond to events. Immersive virtual reality experiments aspire to achieve this, but generally for one specific user. Should we generalize this concept to performances involving multiple artists and multiple audiences, we will then have a distributed media system for performing arts. At the heart of this idea are several questions, such as how digital presentations may affect experiences, or how information may be presented to create a specific experience. From a technology standpoint, a number of research and development issues must be overcome. These provide the means for data to be accurately collected, measured, tested, proven, and delivered, in conjunction with artistic, contextual, and user specific concepts. Progress in this area has been made at a new laboratory for distributed media and the arts.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124972804","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}