2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology最新文献

筛选
英文 中文
A heuristic chunk scheduling algorithm reducing delay for Mesh-Pull P2P live streaming 一种减少Mesh-Pull P2P直播延迟的启发式块调度算法
2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology Pub Date : 2009-12-04 DOI: 10.1109/ICBNMT.2009.5347834
Chen Wei, S. Kai, Su Sen, Y. Fangchun
{"title":"A heuristic chunk scheduling algorithm reducing delay for Mesh-Pull P2P live streaming","authors":"Chen Wei, S. Kai, Su Sen, Y. Fangchun","doi":"10.1109/ICBNMT.2009.5347834","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347834","url":null,"abstract":"Many Mesh-Pull P2P live streaming systems deployed in Internet catch a large number of users during recent years. While they have high scalability and low cost, they suffer from bad delay performance. In this paper, we aim at reducing the delay caused by chunk scheduling for Mesh-Pull P2P live streaming in the environment of heterogeneous upload bandwidth, heterogeneous and dynamic propagation delays. And we quantify and model the delivery latency of chunk scheduling as an optimization problem by introducing the propagation delay(usually ignored) between peers to the design of chunk scheduling, and put forward a heuristic pull-based chunk scheduling algorithm. Through simulation, our algorithm can adapt to random variance of propagation delays and outperform the two classical Mesh-Pull chunk scheduling algorithms not only in delay performance but also in chunk loss ratio.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127114225","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
AN AOSD-based method for integrated services implementation in telecommunication field 一种基于aosd的电信综合业务实现方法
2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology Pub Date : 2009-12-04 DOI: 10.1109/ICBNMT.2009.5348541
W. Yumei, ChenLang Lu, R. Lina, Zhang Lin
{"title":"AN AOSD-based method for integrated services implementation in telecommunication field","authors":"W. Yumei, ChenLang Lu, R. Lina, Zhang Lin","doi":"10.1109/ICBNMT.2009.5348541","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5348541","url":null,"abstract":"More and more services (e.g. IMS services) in the telecommunication field are built by combining different service features. One service can be appended with new service features to form an integrated service to meet new requirements of subscribers. An Aspect-Oriented Software Development (AOSD)-based method of appending the original old service (called the primary service) with other new service feature is proposed in this paper. The new service feature is added to the primary service as an aspect, which would extend the service functionalities while keeping the logic of the primary service unchanged at the same time. The main idea is to model the logic of the primary service with Petri Net and to add the new service feature with AO (Aspect-oriented) analysis. An example for service integration is presented to demonstrate how the method works. Finally, AspectJ-based implementation of the service is given to validate the feasibility of the method.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125170794","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
Load balancing exploiting P2P technology for softswitch system 利用P2P技术实现软交换系统的负载均衡
2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology Pub Date : 2009-12-04 DOI: 10.1109/ICBNMT.2009.5347836
S. Chunyan, Peng Jin, Le Lifeng, Su Sen, S. Kai
{"title":"Load balancing exploiting P2P technology for softswitch system","authors":"S. Chunyan, Peng Jin, Le Lifeng, Su Sen, S. Kai","doi":"10.1109/ICBNMT.2009.5347836","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347836","url":null,"abstract":"As the core of current telecommunication Networks, Softswitch system plays an important role in communication networks. However, current Softswitch system still faces some challenges. Firstly its subscriber database, i.e., HLR, is a centralized network entity which may have the problem of the single point of failure and poor scalability; Secondly, current MSC Pool strategy cannot achieve the load balancing inter-domain; Thirdly, the existing disaster recovery and load balancing technologies can't handle tremendous traffic variance (neither R4 nor IMS) due to unpredictability of burst load. In this paper, we propose an architecture of distributed Softswitch system exploiting P2P technology. Based on the P2P Softswitch system, it can naturally eliminate the problem of database's single point of failure by distributing users' data. Besides, we design a geographical awareness algorithm achieving load balancing both intra-domain and inter-domain and reduce the delay in the registration and session setup. Our simulation results show that our algorithm can achieve the load balancing both intradomain and inter-domain. When the calling number is 6 times of the daily in certain area with the neighbors 3, it is able to serve 100% of the calling attempts; when the calling number is even 17 times of the daily in certain area, it is still able to serve 62.8% of the calling attempts fully utilizing the remaining capacity of inter-domain neighbors and having the less effect to the other domains.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"120 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125833079","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
Research of parallel decoding algrithm in H.264 on TILE64 H.264并行解码算法在TILE64上的研究
2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology Pub Date : 2009-12-04 DOI: 10.1109/ICBNMT.2009.5348537
Guan Hui, Wang Hongpeng
{"title":"Research of parallel decoding algrithm in H.264 on TILE64","authors":"Guan Hui, Wang Hongpeng","doi":"10.1109/ICBNMT.2009.5348537","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5348537","url":null,"abstract":"Due to the increasing performance requirements of decoding H.264/AVC in High Definition (HD) or larger resolution videos, new approaches are necessary to realize real-time processing. With the development of multi-core architecture, it's efficient to adopt parallel decoding in the multi-core processor environment. According to the characteristics of H.264/AVC standard, this paper analyses the parallelism of decoding algorithm, designs a parallelization approach of Hybrid decomposition, and implements parallel decoding based on the TILE64 multi-core processor. The experiment result proves that the performance of decoder can be improved greatly.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123783509","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}
引用次数: 2
Priority based bandwidth allocation scheme for WIMAX systems 基于优先级的WIMAX系统带宽分配方案
2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology Pub Date : 2009-12-04 DOI: 10.1109/ICBNMT.2009.5347783
K. Wee, S. Lee
{"title":"Priority based bandwidth allocation scheme for WIMAX systems","authors":"K. Wee, S. Lee","doi":"10.1109/ICBNMT.2009.5347783","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347783","url":null,"abstract":"IEEE 802.16 based wireless access scheme (commonly known as WiMAX) is considered as one of the most promising wireless broadband access schemes for communication networks in metropolitan areas today. One of the most challenging tasks in the access scheme is the need to support quality of service (QoS). The paper proposes a priority based bandwidth allocation mechanism in WiMAX networks which is compliant with the standards.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125264178","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}
引用次数: 15
Prediction model based on Gompertz function 基于Gompertz函数的预测模型
2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology Pub Date : 2009-12-04 DOI: 10.1109/ICBNMT.2009.5347813
Zheng Yan
{"title":"Prediction model based on Gompertz function","authors":"Zheng Yan","doi":"10.1109/ICBNMT.2009.5347813","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347813","url":null,"abstract":"A novel prediction model based on Gompertz function and Customer Life Cycle (CLC) is presented in this paper. Firstly, the calling behavior between the inner-net (China Unicom) mobile customers and the outer-net (China Mobile) mobile customers are extracted and analyzed, then fitted a CLC curve by Gompertz function. Furthermore, the different period of CLC is identified according to the fitting curve. Finally the number of outer-net mobile customers is predicted accurately and dynamically. The experiments of real data illustrate the availability and accuracy of the proposed prediction model.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115172226","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}
引用次数: 2
Seamless virtual machine live migration on network security enhanced hypervisor 在网络安全增强的管理程序上无缝虚拟机实时迁移
2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology Pub Date : 2009-12-04 DOI: 10.1109/ICBNMT.2009.5347800
Chen Xianqin, Wan Han, Wan Sumei, Long Xiang
{"title":"Seamless virtual machine live migration on network security enhanced hypervisor","authors":"Chen Xianqin, Wan Han, Wan Sumei, Long Xiang","doi":"10.1109/ICBNMT.2009.5347800","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347800","url":null,"abstract":"Since the virtual network traffic is invisible outside the hypervisor, it is impossible for traditional network-base security devices to harness the attacks happened in virtual computing environment. Industry and academies adopt the network security enabled hypervisor (NSE-H) to protect virtual machines (VM) residing in the virtual network. In this paper, we identified the insufficiency of the existing live migration implementation, which prevents itself from providing transparent VM relocation between NSE-Hs. This occurs because the contemporary migration implementation only takes VM encapsulated states into account, but ignores VM related security context(SC) needed by NSE-H embedded security engines (SE). We presented a comprehensive live migration framework for the NSE-H, considering both the execution context encapsulated in VM instance and the VM related security context within the SEs. We built a prototype system of the framework based on stateful firewall enabled Xen hypervisor. Our experiment was performed with realistic applications and the results demonstrate that the solution complements the insufficiency without introducing significant performance downgrade. Even in the worst case, the downtime that occurs during migration increases no more than 15%, comparing to existing implementation.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122402135","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}
引用次数: 30
Optimizing multi-path routing by avoiding Key Nodes 避开关键节点优化多路径路由
2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology Pub Date : 2009-12-04 DOI: 10.1109/ICBNMT.2009.5347851
Yang Junlong, Yuan Hewei
{"title":"Optimizing multi-path routing by avoiding Key Nodes","authors":"Yang Junlong, Yuan Hewei","doi":"10.1109/ICBNMT.2009.5347851","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347851","url":null,"abstract":"In this paper, we propose a new routing algorithm which combines source routing and intermediate routing in order to meet the requirement of node disjointed path and scalability. We also discover the existing of Key Nodes which we call KN, KN are the transmission congestion host spots, also in multi-path routing, they will lead to a low performance in disjointed path. We give a simple, effective method to detect KN and avoid them. The result of simulation shows that this method can obtain a good performance on disjointed path, and can significantly improve network reliability.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123021388","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}
引用次数: 2
MCR: A mutual cooperative recovery mechanism in peer-to-peer storage systems MCR:点对点存储系统中的一种相互协作的恢复机制
2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology Pub Date : 2009-12-04 DOI: 10.1109/ICBNMT.2009.5347841
Hu Yuchong, X. Yinlong, Wang Xiaozhao
{"title":"MCR: A mutual cooperative recovery mechanism in peer-to-peer storage systems","authors":"Hu Yuchong, X. Yinlong, Wang Xiaozhao","doi":"10.1109/ICBNMT.2009.5347841","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347841","url":null,"abstract":"A data recovery to maintain redundancy from multiple node failures often occurs in dynamic peer-to-peer storage systems. Most of the existing recovery schemes are designed to repair these node failures one by one. In this paper we design a mutually cooperative recovery (MCR) mechanism for multiple node failures, that is, new nodes for recovery are repaired mutually cooperatively. Via a cut-based analysis in information flow graph, we find out a lower bound of maintenance traffic based on MCR and prove the existence of a random linear scheme satisfying the minimal bandwidth maintenance traffic with a sufficient large field. We also give an evaluation to compare MCR with other redundancy recovery schemes in the storage cost and maintenance traffic to show the advantage of MCR.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"8 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114270249","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
Feature extraction and classification of brain CT image based on sound logic 基于声音逻辑的脑CT图像特征提取与分类
2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology Pub Date : 2009-12-04 DOI: 10.1109/ICBNMT.2009.5347803
Chen Jialin, He Huacan
{"title":"Feature extraction and classification of brain CT image based on sound logic","authors":"Chen Jialin, He Huacan","doi":"10.1109/ICBNMT.2009.5347803","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347803","url":null,"abstract":"This paper discusses properties of sound logic based on flexible logic. In the practical application of fuzzy decision tree, algorithm of matching operator in the fuzzy decision tree is improved based on sound logic. In order to get the best combination of the features, the algorithm that extracts the shape feature considering the adjacent parts is proposed based on the idea of chart transferring tree in the tree structure comprehensively. Compared with the traditional extracting algorithms which aim at the whole picture or a single part, the experiments by examination and analysis of clinical cases show that the proposed algorithm can obtain a higher diagnostic accuracy.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121894751","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
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学术官方微信