{"title":"Offset distortion traces for trace-based evaluation of video quality after network transport","authors":"P. Seeling, M. Reisslein, F. Fitzek","doi":"10.1109/CCNC.2006.1593034","DOIUrl":"https://doi.org/10.1109/CCNC.2006.1593034","url":null,"abstract":"Video traces containing the sizes and (PSNR) qualities of the individual frames of a video encoding are a convenient video representation for the evaluation of video networking mechanisms. These video traces can be used to find the frame loss probabilities of a lossy networking mechanism, but can not give the PSNR video quality after lossy network transport. To date the video quality after lossy network transport could only be determined through experiments with actual video or by approximating the quality of the frames affected by a loss with some low PSNR quality. In this paper we introduce and evaluate offset distortion traces with which the video quality after lossy network transport can be accurately determined without requiring experiments with actual video. We explain how the offset distortion traces can be used by networking researchers without equipment or experience in video signal processing to accurately evaluate video networking mechanisms in terms of the PSNR video quality.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131397914","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 studies of networked video-on-demand systems","authors":"V. Tokekar, A. Ramani, S. Tokekar","doi":"10.1109/ICCCN.2005.1523892","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523892","url":null,"abstract":"In a multimedia service such as video-on-demand system, video streaming requires allocation of several communication channels. The overall cost of establishing a video-on-demand system also includes the channel cost. Several caching and batching schemes have been proposed in literature for the optimal utilization of these channels. A viewer is served with a mix of main and small (e.g. advertisement) movies. The requested movies not necessarily will be of same duration. This study deals with the system having limited number of channels and servicing of requests for mixed movies of different durations. The system is modeled for its behavior with a continuous time Markov chain (CTMC) process. The performance measures such as channel utilization, number of channels in use, blocking probability of channels, cost and duration after which the proposed system starts yielding profit etc. are quantified in terms of various design parameters like, total number of channels, users request arrival rate, and batching interval, request service rate etc.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115367969","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":"Streaming over subscription overlay networks","authors":"Ying Cai, Jianming Zhou","doi":"10.1109/ICCCN.2005.1523943","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523943","url":null,"abstract":"A subscription overlay network (SON) consists of a stream source server and a number of subscribing nodes that pay monthly fee to watch the program. While the video program is continuous and endless, a subscriber typically watches the program only in some time interval. Thus, a SON may have a large number of subscribing nodes, but at any one time, only a small percentage of them may be playing (i.e., receiving some program) while many others are just idling. In this paper, we consider how these idling nodes can be leveraged for constructing highly efficient overlay multicast, where clients can join and leave dynamically. Unlike regular playing nodes, an idling node should be included in a multicast tree only when doing so can improve the system performance (e.g., reducing network traffic). We address this challenge and propose a novel overlay multicast technique that is able to find and incorporate appropriate idling nodes for data forwarding. We evaluate the performance of the proposed technique through simulation, and the results confirm its performance advantages.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127362635","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}
Horácio Oliveira, E. Nakamura, A. Loureiro, A. Boukerche
{"title":"Directed position estimation: a recursive localization approach for wireless sensor networks","authors":"Horácio Oliveira, E. Nakamura, A. Loureiro, A. Boukerche","doi":"10.1109/ICCCN.2005.1523938","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523938","url":null,"abstract":"The establishment of a localization system is an important task in wireless sensor networks. Due to the geographical correlation of the sensed data, location information is commonly used to name the gathered data and address nodes and regions in data dissemination protocols. In general, to estimate its location, a node needs the position information of, at least, three reference points (neighbors that know their positions). In this work, we propose a different scheme in which only two reference points are required to estimate a position. To choose between the two possible solutions of an estimate, we use the known direction of the recursion. This approach leads to a recursive localization system that works with low density networks (increasing in 40% the number of nodes with estimates in some cases), reduces the position error in almost 30%, requires 37% less processor resources to estimate a position, uses less beacon nodes, and also indicates the node position error based on its distance to the recursion origin. No GPS-enabled node is required, as the recursion origin can be used as the relative coordinate system.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122489499","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}
Xun Wang, S. Chellappan, Wenjun Gu, Wei Yu, D. Xuan
{"title":"Search-based physical attacks in sensor networks","authors":"Xun Wang, S. Chellappan, Wenjun Gu, Wei Yu, D. Xuan","doi":"10.1109/ICCCN.2005.1523922","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523922","url":null,"abstract":"The small form factor of the sensors, coupled with the unattended and distributed nature of their deployment expose sensors to physical attacks that physically destroy sensors in the network. In this paper, we study the modeling and analysis of search-based physical attacks in sensor networks. We define a search-based physical attack model, where the attacker walks through the sensor network using signal detecting equipment to locate active sensors, and then destroys them. We consider both flat and hierarchical sensor networks. The attacker in our model uses a weighted random selection based approach to discriminate multiple target choices (normal sensors and cluster-heads) to enhance sensor network performance degradation. Our performance metric in this paper is accumulative coverage (AC), which effectively captures coverage and lifetime of the sensor network. We then conduct detailed evaluations on the impacts of search-based physic attacks on sensor network performance. Our performance data clearly show that search-based physical attacks significantly reduce sensor network performance. We observe that attack related parameters, namely attacker movement speed, detection range and accuracy have significant impacts on the attack effectiveness. We also observe that the attack effectiveness is significantly impacted by sensor network parameters, namely the frequency of communication and frequency of cluster-head rotation. We believe that our work in this paper on modeling and analyzing search-based physical attacks is an important first step in understanding their overall impacts, and effectively defending against them in the future.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128570318","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":"Analysis of TCP throughput in IEEE 802.11 based multi-hop ad hoc networks","authors":"Xia Li, P. Kong, K. Chua","doi":"10.1109/ICCCN.2005.1523871","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523871","url":null,"abstract":"This paper analyzes the TCP performance in an 802.11 based multi-hop ad hoc network. The analysis is unique because it tries to quantify the throughput of a TCP flow after considering the interaction between TCP's congestion window size and 802.11's MAC (medium access control) contention window size. The analysis results in formulae to compute the throughput of a single TCP flow for an n-hop string topology under the ideal situation where there is no packet loss in the network. The analytical results have been validated by benchmarking against simulation results from ns-2. The outcome of the analysis is useful when ad hoc networks are adopted as an extension to the Internet because TCP is the prevalent transport protocol for reliable data transmissions in the Internet.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121471145","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":"Dynamic reconfiguration for optical network","authors":"Saurabh Bhandari, E. Park","doi":"10.1109/ICCCN.2005.1523859","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523859","url":null,"abstract":"Our work looks into the reconfiguration of virtual topology for wavelength-routed mesh optical network under dynamic traffic demand. When reconfiguring the optical network, it is important to minimize the number of receivers that need to be retuned. It is also important to minimize the average weighted hop count as it is directly proportional to the throughput of the network. The tradeoff here is between the optimality of the network and the network disruption. In our work we first model this tradeoff as mixed integer linear problem and then present a heuristic algorithm for dynamic reconfiguration of optical network. Our algorithm minimizes the physical resources used, physical hops encountered, and the necessary number of retuning of receivers. It tries to satisfy the traffic demand with minimal network disruption.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126278675","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":"Adaptable video streaming over wireless networks","authors":"D. Jarnikov, J. Lukkien, P. V. D. Stok","doi":"10.1109/ICCCN.2005.1523951","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523951","url":null,"abstract":"The paper addresses the issue of controlling streaming of scalable video over wireless links to resource-constrained devices (terminals). A controller on the terminal maximizes user perceived quality taking into account available computing resources and condition of the network. The controller determines the number of layers to be processed using a strategy calculated for the given layers configuration and network conditions. We present a method to decrease the number of pre-calculated strategies for the controller by exploring the dependency between layers configuration and network conditions.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125450312","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 fair scheduling in heterogeneous link aggregated services","authors":"S. Mohanty, L. Bhuyan","doi":"10.1109/ICCCN.2005.1523843","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523843","url":null,"abstract":"Provisioning quality of service (QoS) across an aggregate of transmission entities (e.g., link aggregation) or processing elements (e.g. network processors) is a challenging problem. The difficulty lies in simultaneously satisfying fairness to flows (with different bandwidth requirements) and ensuring minimized intra-flow reordering. This problem is crucial to many applications (that utilize parallel communication or processing paths) like multi-path load distribution, multi-path storage I/O, web service, data processing by network processors in the datapath of routers, transcoding multimedia flow traffic content over the Internet to name a few. We present two algorithms for multi-link systems that aim at reducing undesired reordering, ensure fair sharing of flows and optimal utilization of the links. Our algorithms are based on a new approach of dynamically partitioning flows among links. We perform simulations on real Internet traces to validate our algorithmic approach.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121721174","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}
M. Marwah, David Chavez, Don Gillespie, Vivek Velamala
{"title":"Efficient, scalable migration of IP telephony calls for enhanced fault-tolerance","authors":"M. Marwah, David Chavez, Don Gillespie, Vivek Velamala","doi":"10.1109/ICCCN.2005.1523928","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523928","url":null,"abstract":"IP telephony or VoIP has seen tremendous growth in the past few years and is predicted to grow rapidly in the coming years. Hence, IP telephony components must provide service with high-availability, comparable to traditional telephony systems. In this paper, we present an efficient and scalable fault-tolerance mechanism for migrating calls to an alternate IP telephony call controller in the event of the failure of the call controller or network connectivity to it. We also present an efficient algorithm for merging components of migrated calls, so that the same call features are available on these calls as the original calls. Some of these techniques have been incorporated in commercial products, resulting in improved fault-tolerance.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115767745","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}