2008 Proceedings of 17th International Conference on Computer Communications and Networks最新文献

筛选
英文 中文
A New Integrated Spatio-Temporal Framework for Video Error Concealment 一种新的视频错误隐藏集成时空框架
Ee Sin Ng, J. Y. Tham, S. Rahardja
{"title":"A New Integrated Spatio-Temporal Framework for Video Error Concealment","authors":"Ee Sin Ng, J. Y. Tham, S. Rahardja","doi":"10.1109/ICCCN.2008.ECP.155","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.155","url":null,"abstract":"Temporal error concealment (TEC) algorithms do not produce good results in the presence of cut scenes, camera panning or object occlusion in videos due to the lack of a suitable reference frame. Under such circumstances, spatial EC (SEC) may perform better. Thus, EC algorithms should decide adaptively between TEC or SEC. In this paper, we propose an integrated spatio-temporal EC framework which extends our previous work in TEC and SEC. The proposed algorithm decides adaptively on the best EC mode and produces average PSNR improvements of up to 4.59 dB over a coding-mode based EC algorithm. Most importantly, our algorithm produces results of much better perceptual quality.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"34 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":"124046479","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}
引用次数: 1
Group-Oriented Communication: Concept and Network Architecture 面向群体的传播:概念和网络架构
Yousuke Takahashi, K. Sugiyama, H. Ohsaki, M. Imase, T. Yagi, J. Murayama
{"title":"Group-Oriented Communication: Concept and Network Architecture","authors":"Yousuke Takahashi, K. Sugiyama, H. Ohsaki, M. Imase, T. Yagi, J. Murayama","doi":"10.1109/ICCCN.2008.ECP.179","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.179","url":null,"abstract":"In this paper, we propose a novel communication paradigm called group-oriented communication. Different from conventional unicast-based communications, group-oriented communication is entirely based on group-based communication. Our group-oriented communication is essentially a type of many-to- many communication, but it realizes any type of communications including one-to-one, one-to-many, many-to-one and many-to- many communications based on group-based communication. With our group-oriented communication, diverse social activities can be shifted into a communication network in a straightforward way, and users' requirements on security/reliability can be fulfilled. In this paper, we first qualitatively discuss advantages of our group-oriented communication by comparing with the conventional IP-based network. We then discuss four design goals of a network architecture for our group-oriented communication: supporting dynamic entity/group, supporting address operation expression, realization of entity/group find ability, and realization of security. After carefully examining these design goals, we design a network architecture for realizing our group-oriented communication. Through quantitative evaluations, we show that the network architecture for our group-oriented communication should be packet-based, that reachability control is the core networking technology, and that the network architecture should have the two-layer structure consisting of transport and control layers.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"16 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":"115235132","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}
引用次数: 5
A Position-Based Deployment and Routing Approach for Directional Wireless Mesh Networks 一种基于位置的无线网状网络部署与路由方法
Weisheng Si, S. Selvadurai
{"title":"A Position-Based Deployment and Routing Approach for Directional Wireless Mesh Networks","authors":"Weisheng Si, S. Selvadurai","doi":"10.1109/ICCCN.2008.ECP.74","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.74","url":null,"abstract":"Observing that simplicity implies efficiency and scalability, this paper proposes a position-based deployment and routing strategy, and then gives a concrete approach under this strategy, for the emerging wireless mesh networks with multiple radios and directional antennas. The main idea of this strategy is to deploy the mesh network in certain kind of geometric graph and then design a position-based routing protocol by exploiting the routing properties of this graph. The proposed concrete approach comprises two parts: (1) a topology generation algorithm based on Delaunay triangulations and (2) a routing protocol based on the greedy forwarding algorithm. Both parts have appealing properties for deployment or routing, with formal proofs provided when applicable. Our simulation results strongly support this proposed approach.","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":"125399384","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}
引用次数: 8
A Hybrid Anycast Routing Protocol for Load Balancing in Heterogeneous Access Networks 异构接入网负载均衡的混合任播路由协议
K. Sharif, Lijuan Cao, Yang Wang, T. Dahlberg
{"title":"A Hybrid Anycast Routing Protocol for Load Balancing in Heterogeneous Access Networks","authors":"K. Sharif, Lijuan Cao, Yang Wang, T. Dahlberg","doi":"10.1109/ICCCN.2008.ECP.37","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.37","url":null,"abstract":"The wireless multihop to an access point model appears to be a promising component of future network architectures, including multihop cellular networks and wireless access networks at the edges of mesh networks. Sophisticated software radios and core network protocols are being developed to support the integration of heterogeneous access networks. A challenge is managing diverse resources at access points (e.g., 3G, WiFi or WiMax), as well as the distributed interference among the mobiles within a heterogeneous access network. We propose the use of a new anycasting protocol to guide access point discovery and path selection for balancing access point resource and routing packets to access points (APs). In addition, a hybrid proactive/reactive approach is used to reduce overhead of AP discovery. We use theoretical analysis and extensive simulations, to study the tradeoff of our hybrid anycasting protocol. The simulation study indicates that the use of the hybrid anycasting protocol for AP discovery, load balancing and routing, results in consistent performance improvements.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"4 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":"126382241","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}
引用次数: 14
Wavebanding in Bi-Directional WDM Ring Networks with Limited Reconfigurability 具有有限可重构性的双向WDM环形网络中的波带
M. Alnaimi, S. Subramaniam
{"title":"Wavebanding in Bi-Directional WDM Ring Networks with Limited Reconfigurability","authors":"M. Alnaimi, S. Subramaniam","doi":"10.1109/ICCCN.2008.ECP.94","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.94","url":null,"abstract":"An important factor that affects the cost of WDM networks is the number of wavelengths to be added/dropped by reconfigurable optical add drop multiplexers (ROADMs). Limiting the range of wavelengths that can be accessed at a node reduces costs. In this paper, we study wavelength assignment (WA) in WDM bi-directional ring networks with limited reconfigurability and take up the problem of supporting two traffic types - permutation traffic and all-to-all traffic - while minimizing the worst-case wavelength range of the ROADMs and respecting the wavelength termination and continuity constraints. ROADMs can be limited in tuning range (L-ROADMs) or have full range (F- ROADMs). In this work, a node can either possess a limited-add L-ROADM or an F-ROADM. For permutation traffic, we show that at least one F-ROADM is necessary, and we also give an upper bound on the number of F-ROADMs needed as a function of the range of L-ROADMs at other nodes. For all-to-all traffic, we develop an integer linear programming (ILP) formulation, and also propose a new wavelength assignment algorithm that uses Wu = N2/4 - N/2 + 1/4 wavelengths. Our heuristic's results are similar to the ILP's. The results show that a saving of 85-93.3% in tuning range is achievable for this type of traffic.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"63 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":"121617912","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}
引用次数: 0
IP Traffic Classification for QoS Guarantees: The Independence of Packets 保证QoS的IP流分类:报文的独立性
M. Dusi, F. Gringoli, L. Salgarelli
{"title":"IP Traffic Classification for QoS Guarantees: The Independence of Packets","authors":"M. Dusi, F. Gringoli, L. Salgarelli","doi":"10.1109/ICCCN.2008.ECP.170","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.170","url":null,"abstract":"The classification of IP flows according to the application that generated them has become a popular research subject in the last few years. Several recent papers based their studies on the analysis of features of flows such as the packet size and inter-arrival time, which are then used as input to classification techniques derived from various scientific areas such as pattern recognition. In this paper we analyze the impact on flow classification of a hypothesis that is often overlooked, i.e., the tenet that the features of consecutive packets of a given IP flow can be considered statistically independent. We compare two approaches, one based on a technique that considers consecutive packets statistically independent, and one that relies on the opposite assumption. These techniques are then applied to three different sets of traffic traces. Experimental results show that while assuming the independence of consecutive packets has relatively few effects on true positives, it can have a significant negative impact on the false positive and true negative rates, therefore lowering the precision of the classification process.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"328 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":"121675246","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}
引用次数: 9
Massively Parallel Anomaly Detection in Online Network Measurement 在线网络测量中的大规模并行异常检测
S. Shanbhag, T. Wolf
{"title":"Massively Parallel Anomaly Detection in Online Network Measurement","authors":"S. Shanbhag, T. Wolf","doi":"10.1109/ICCCN.2008.ECP.63","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.63","url":null,"abstract":"Detecting anomalies during the operation of a network is an important aspect of network management and security. Recent development of high-performance embedded processing systems allow traffic monitoring and anomaly detection in real-time. In this paper, we show how such processing capabilities can be used to run several different anomaly detection algorithms in parallel on thousands of different traffic subclasses. The main challenge in this context is to manage and aggregate the vast amount of data generated by these processes. We propose (1) a novel aggregation process that uses continuous anomaly information (rather than binary outputs) from existing algorithms and (2) an anomaly tree representation to illustrate the state of all traffic subclasses. Aggregated anomaly detection results show a lower false positive and false negative rate than any single anomaly detection algorithm.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"48 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":"126448401","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}
引用次数: 11
On the Fairness of TCP Throughput Under Loss TCP吞吐量损失下的公平性研究
S. Wright, A. Cui
{"title":"On the Fairness of TCP Throughput Under Loss","authors":"S. Wright, A. Cui","doi":"10.1109/ICCCN.2008.ECP.149","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.149","url":null,"abstract":"There have been a number of efforts devoted to predicting or modeling TCP performance under the presence of various network defects with a statistic such as average TCP throughput. While the average TCP throughput is useful, it does not provide insight on the variability of results that may be seen across multiple end users. This paper reports on a simulation study to characterize the distribution of TCP throughput performance across multiple users sharing a bottleneck link using fairness as a metric. In particular, the sensitivity of the results is explored when considering variations in the numbers of clients sharing the bottleneck link and the effects of loss in the network experienced by an individual client.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"13 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":"125541189","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}
引用次数: 0
Best Effort Quality-of-Service 尽最大努力服务质量
Bradley R. Smith, J. Garcia-Luna-Aceves
{"title":"Best Effort Quality-of-Service","authors":"Bradley R. Smith, J. Garcia-Luna-Aceves","doi":"10.1109/ICCCN.2008.ECP.84","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.84","url":null,"abstract":"We show that the fundamental problems in providing quality-of-service in the existing Internet architecture has been the assumption that a single, \"best\" path from source to destination is adequate for any communications requirements of the network. We present a new, best-effort architecture for providing quality-of-service in the Internet based on the use of the \"best set of paths\" to destinations. We show that this set of paths is well defined, can be efficiently computed, and present an approach to efficiently implement this new, best-effort quality- of-service architecture.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"9 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":"128213079","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}
引用次数: 10
Modeling the Execution Time of Reed-Solomon Decoding on an ARM9-Based Mobile Platform 基于arm9移动平台的Reed-Solomon解码执行时间建模
Kyungtae Kang, Cheolgi Kim, D. Noh, Junhee Ryu
{"title":"Modeling the Execution Time of Reed-Solomon Decoding on an ARM9-Based Mobile Platform","authors":"Kyungtae Kang, Cheolgi Kim, D. Noh, Junhee Ryu","doi":"10.1109/ICCCN.2008.ECP.148","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.148","url":null,"abstract":"BCMCS (broadcast and multicast services) greatly increase the capacity of CDMA2000 mobile networks for multimedia broadcasting, but only require minor changes to existing radio and core network protocols. To provide high-quality multimedia services over error-prone wireless networks, we need to control delay, because it is one of the most important QoS parameters for multimedia applications. We identified error control using Reed-Solomon (RS) forward error correction (FEC) in the medium access control (MAC) layer as a significant cause of delay variation, and have proposed a novel analytic model that can predict the time required for RS decoding at a mobile, under different levels of block interleaving and for varying conditions of the Rayleigh fading channel at that mobile. This model enables us to estimate the buffer size required to ensure seamless multimedia services.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"70 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":"130413070","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}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信