{"title":"Calculating the Frame Collision Probability under IEEE 802.11b DCF","authors":"J. Liu","doi":"10.1109/ICCCN.2008.ECP.86","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.86","url":null,"abstract":"The frame collision probability is an important parameter of the performance modeling. This probability has long been assumed as a value that is determined by the channel characteristics and is independent to the medium access control. The validity of this assumption has not been scrutinized. In this paper, we modeled the CSMA/CA mechanism by a closed-loop model through which the analytical expressions of important probability metrics are derived. These probability metrics include the frame collision probability, the probability of the channel being idle, and the probability that a successful transmission of DATA frame is made. The validity of our modeling is demonstrated by comparing the analytical results with the measurement results obtained from simulations. The analytical results closely approximate the measurement results.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129766033","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":"p-Percent Coverage Schedule in Wireless Sensor Networks","authors":"Shan Gao, Xiaoming Wang, Yingshu Li","doi":"10.1109/ICCCN.2008.ECP.109","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.109","url":null,"abstract":"We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is not necessary and different subareas of the monitored area may have different coverage requirements. The first algorithm, CPCA, is a centralized algorithm which selects the least number of nodes to monitor p-percent of the monitored area. The second algorithm, DPCP, is a distributed algorithm which can determine a set of nodes in a distributed manner to cover p-percent of the monitored area. Both of the algorithms guarantee network connectivity. The simulation results show that our algorithms can remarkably prolong network lifetime, have less than 5% unrequired coverage for large networks and employ nodes fairly for most cases.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117217811","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":"Work-Conserving Fair-Aggregation with Rate-Independent Delay","authors":"J. Cobb","doi":"10.1109/ICCCN.2008.ECP.85","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.85","url":null,"abstract":"Flow aggregation has been proposed as a technique to improve the scalability of QoS scheduling in the core of the Internet, by reducing the amount of per-flow state necessary at a router. This is accomplished by aggregating into a single flow multiple flows that share part of the same path to the destination. In its simplest form, flow aggregation is inherently non-work- conserving, that is, it may temporarily leave the output channel idle even though there are still packets to be forwarded. Work-conserving variations of flow aggregation are more desirable, because they allow flows to temporarily exceed their reserved rate and take advantage of bandwidth unused by other flows. This, however, requires a per-hop delay proportional to the rate reserved for the aggregate flow. Thus, if a lower delay is desired, the aggregate flow must reserve from the network a data rate that is greater than its true rate. In this paper, we explore the conditions under which work- conserving flow aggregation can be performed with rate- independent delay. That is, the aggregate flow is able to choose a per-hop delay that is independent of the data rate it reserved from the network. The price to be paid for this flexibility, however, is a restriction in the choice of packet size and data rates of its constituent flows.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122678665","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":"Channel-Aware Peer Selection in Multi-View Peer-to-Peer Multimedia Streaming","authors":"Miao Wang, Lisong Xu, B. Ramamurthy","doi":"10.1109/ICCCN.2008.ECP.137","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.137","url":null,"abstract":"Motivated by the success of the Picture in Picture feature of the traditional TV, several commercial Peer-to-Peer MultiMedia Streaming (P2PMMS) applications now support the multi-view feature, with which a user can simultaneously watch multiple channels on its screen. This paper considers the peer selection problem in multi-view P2PMMS. This problem has been well studied in the traditional single-view P2PMMS; however, it becomes more complicated in multi-view P2PMMS, mainly due to the fact that a peer watching multiple channels joins multiple corresponding overlays. In this paper, we propose a novel peer selection algorithm, called Channel-Aware Peer Selection (CAPS), where a peer selects its neighboring peers based on the channel subscription of the system, in order to efficiently utilize the bandwidth of all peers in the system, especially those peers watching multiple channels. The results of a large-scale simulation with 10,000 peers and 4 channels shows that CAPS can significantly improve the system performance over the straightforward Random Peer Selection (RPS), which is widely used in single-view P2PMMS networks.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122457425","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":"Energy Aware Provisioning in Solar Powered WLAN Mesh Networks","authors":"Ghada H. Badawy, A. Sayegh, T. D. Todd","doi":"10.1109/ICCCN.2008.ECP.96","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.96","url":null,"abstract":"WLAN mesh networks are often installed to provide wireless coverage for temporary events. In these types of networks, the WLAN mesh nodes can sometimes be operated using an energy sustainable source such as solar power. Resource provisioning consists of pre-assigning each node with a solar panel and battery combination that is sufficient to prevent node outage for the duration of the deployment. This is done by assuming a temporal load profile for each node, which is then used to perform the assignment using historical solar insolation data for the desired deployment location. Unfortunately, this methodology cannot take into account the state dependencies which occur when the network uses energy aware routing, and therefore the system may be over-provisioned. In this paper we propose a methodology for WLAN mesh node resource assignment that incorporates energy aware routing into the assignment algorithm. The problem consists of determining a network-wide minimum cost resource assignment subject to satisfying the input load profile. A genetic algorithm (GA) has been developed for this purpose. Our results show the large resource savings that energy aware resource assignment can achieve when compared to that done using the conventional methodology. We also study the competitive ratio of both resource assignment schemes and show that for small traffic overloading, energy aware routing performs better than shortest path routing in networks which are provisioned using the proposed methodology.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132408979","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":"High-Definition MPEG-4 AVC Traffic Analysis and Bandwidth Prediction","authors":"Laetitia Lanfranchi, B. Bing","doi":"10.1109/ICCCN.2008.ECP.83","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.83","url":null,"abstract":"In this paper, we propose and evaluate the accuracy of two new MPEG-4 AVC video traffic models. The first predicts the size of the B-frames of MPEG-4 AVC compressed video. The second predicts the size of the group of pictures (GOP) of the MPEG-4 AVC compressed video. We also propose an enhancement to these models using a new scene change detector metric. These traffic models can be employed by a network scheduler to provision MPEG-4 AVC video bandwidth efficiently.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"8 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127512096","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 New Proposal for QKD Relaying Models","authors":"Cuong Le Quoc, P. Bellot","doi":"10.1109/ICCCN.2008.ECP.92","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.92","url":null,"abstract":"We investigate a quasi-trusted QKD relaying model. This is a three-party communication model. Two nodes Alice and Bob want to establish a secret key. However, the distance between them exceeds the limited range of QKD. Carol is a intermediate node that could share QKD links with Alice and Bob. Carol is assumed to be quasi-trusted: she correctly follows the given three-party protocol. However, she may be eavesdropped by the malicious person Eve. We propose two single-photon based protocols that allow Alice, Carol and Bob to achieve the goal. As a result, these protocols could be applied to securely extend up to two times the limited range of QKD without invoking entangled photons.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114451850","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":"Impact of Network Sharing in Multi-Core Architectures","authors":"G. Narayanaswamy, P. Balaji, Wu-chun Feng","doi":"10.1109/ICCCN.2008.ECP.61","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.61","url":null,"abstract":"As commodity components continue to dominate the realm of high-end computing, two hardware trends have emerged as major contributors-high-speed networking technologies and multi-core architectures. Communication middleware such as the Message Passing Interface (MPI) uses the network technology for communicating between processes that reside on different physical nodes, while using shared memory for communicating between processes on different cores within the same node. Thus, two conflicting possibilities arise: (i) with the advent of multi-core architectures, the number of processes that reside on the same physical node and hence share the same physical network can potentially increase significantly, resulting in increased network usage, and (ii) given the increase in intra-node shared-memory communication for processes residing on the same node, the network usage can potentially decrease significantly. In this paper, we address these two conflicting possibilities and study the behavior of network usage in multi-core environments with sample scientific applications. Specifically, we analyze trends that result in increase or decrease of network usage, and we derive insights into application performance based on these. We also study the sharing of different resources in the system in multi-core environments and identify the contribution of the network in this mix. In addition, we study different process allocation strategies and analyze their impact on such network sharing.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115922505","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":"Instrumentation and Analysis of MPI Queue Times on the SeaStar High-Performance Network","authors":"R. Brightwell, K. Pedretti, Kurt B. Ferreira","doi":"10.1109/icccn.2008.ecp.116","DOIUrl":"https://doi.org/10.1109/icccn.2008.ecp.116","url":null,"abstract":"Understanding the communication behavior and network resource usage of parallel applications is critical to achieving high performance and scalability on systems with tens of thousands of network endpoints. The need for better understanding is not only driven by the desire to identify potential performance optimization opportunities for current networks, but is also a necessity for designing next-generation networking hardware. In this paper, we describe our approach to instrumenting the SeaStar interconnect on the Cray XT series of massively parallel processing machines to gather low-level network timing data. This data provides a new perspective on performance evaluation, both in terms of evaluating the resource usage patterns of applications as well as evaluating different implementation strategies in the network protocol stack.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116601698","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":"Seamless Video Transmission over Wireless LANs based on an Effective QoS Model and Channel State Estimation","authors":"B. Oh, Guogang Hua, Chang Wen Chen","doi":"10.1109/ICCCN.2008.ECP.59","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.59","url":null,"abstract":"This paper presents a scheme for video transmission over wireless LANs based on an effective QoS model and channel state estimation (CSE). The proposed QoS model is able to effectively characterize the performance of video transmission over error prone wireless channels. Unlike existing schemes that use complicated metrics based on the actual distortion computed from decoded video frames, the proposed model employs H.264 group of pictures (GOP) level estimator of decodable slice rate (GEDSR). This new GEDSR model can be obtained from simplified calculation of decodable I, P, and B slices without computing the actual distortions. With this model, it is possible for the estimation to include the dependence of error control such as forward error correction and redundant slices. In this research, we also develop an adaptive cross-layer feedback mechanism based on channel status, maximum retry limit value, and RTS/CTS function. Extensive simulations have been carried out to confirm the effectiveness of the proposed GEDSR model for the distortion analysis. The experimental results of the GEDSR model analysis have been applied to selecting forward error correction (FEC) coding parameters for video streams to respond to dynamic channel changes. Simulations on video transmission over wireless LAN show that the proposed scheme is able to achieve significant performance gains (7dB) over schemes without channel feedback.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115071179","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}