发布求助
文献互助 智能选刊 最新文献

2007 IEEE International Performance, Computing, and Communications Conference最新文献

筛选
英文 中文
Epidemics of Mobile Worms 移动蠕虫的流行
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358929
Yu.E. Bulygin
{"title":"Epidemics of Mobile Worms","authors":"Yu.E. Bulygin","doi":"10.1109/PCCC.2007.358929","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358929","url":null,"abstract":"Mathematical epidemiology has been developing for over a hundred years. Mathematical models developed for spreading of viruses in human populations take into account various effects influencing the epidemic. Recently results of mathematical epidemiology have also been applied to modeling of epidemic viruses in computer networks. The current work applies results of mathematical epidemiology to the research of dynamics of potential epidemics of worms in mobile networks. The work simulates epidemics of two types of mobile worms that we have already run into - MMS and Bluetooth worms.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122052010","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
A Malware Signature Extraction and Detection Method Applied to Mobile Networks 一种应用于移动网络的恶意软件签名提取与检测方法
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358875
Guoning Hu, D. Venugopal
{"title":"A Malware Signature Extraction and Detection Method Applied to Mobile Networks","authors":"Guoning Hu, D. Venugopal","doi":"10.1109/PCCC.2007.358875","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358875","url":null,"abstract":"The rapid development of mobile phone networks has facilitated the need for better protection against malware. Malware detection is a core component of a security system protecting mobile networks. In this paper, we describe a system for detecting malware within the network traffic using malware signatures. Our system contains two key components. The first one automatically extracts a set of signatures from existing malware samples. In particular, we reduce the number of signatures by using a common signature for a malware and its variants. In addition, we minimize the total false alarm rate of malware detection by extracting signatures that are most uncommon within mobile network traffic. The second one is an efficient method that scans the network traffic using a hash table and sub-signature matching. Our evaluation on Symbian viruses show that our system detects existing malware and their new variants within the network traffic efficiently.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"4 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115604699","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}
引用次数: 23
Automatic Generation of User-Centric Multimedia Communication Services 以用户为中心的多媒体通信服务的自动生成
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358910
R. Rangaswami, S. M. Sadjadi, N. Prabakar, Yi Deng
{"title":"Automatic Generation of User-Centric Multimedia Communication Services","authors":"R. Rangaswami, S. M. Sadjadi, N. Prabakar, Yi Deng","doi":"10.1109/PCCC.2007.358910","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358910","url":null,"abstract":"Multimedia communication services today are conceived, designed, and developed in isolation, following a stovepipe approach. This has resulted in a fragmented and incompatible set of technologies and products. Building new communication services requires a lengthy and costly development cycle, which severely limits the pace of innovation. In this paper, we address the fundamental problem of automating the development of multimedia communication services. We propose a new paradigm for creating such services through declarative specification and generation, rather than through traditional design and development. Further, the proposed paradigm pays special attention to how the end-user specifies his/her communication needs, an important requirement largely ignored in existing approaches.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116100662","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}
引用次数: 7
Adaptive Probabilistic Scheduling for a Cellular Emergency Network 蜂窝应急网络的自适应概率调度
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358950
Jiazhen Zhou, C. Beard
{"title":"Adaptive Probabilistic Scheduling for a Cellular Emergency Network","authors":"Jiazhen Zhou, C. Beard","doi":"10.1109/PCCC.2007.358950","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358950","url":null,"abstract":"Currently, wireless priority services (WPS) are provided using call queueing with a weighted round-robin schedule based on a fixed parameter. In this paper, we introduce a flexible, analytically-based scheme for dealing with admission control in a cellular network that supports emergency service. In the scheduling scheme, a priority queue is used to ensure the wise utilization of system resources while guaranteeing the priority of public handoff traffic. Also, probabilistic scheduling is considered for adaptively ensuring the high admission rate of emergency traffic and protecting public calls for different traffic demands. The admission of emergency traffic and public originating traffic can be flexibly adjusted. Numerical results about the evaluation of this strategy are presented and show an obvious improvement over related strategies.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126788717","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
Applications of the Oriented Permission Role-Based Access Control Model 面向权限基于角色的访问控制模型的应用
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358918
Liang Chen, Jason Crampton
{"title":"Applications of the Oriented Permission Role-Based Access Control Model","authors":"Liang Chen, Jason Crampton","doi":"10.1109/PCCC.2007.358918","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358918","url":null,"abstract":"Role-based access control and role hierarchies have been the subject of considerable research in recent years. In this paper, we consider three useful applications of a new role-based access control model that contains a novel approach to permissions and permission inheritance: one is to illustrate that the new model provides a simpler and more natural way to implement BLP model using role-based techniques; a second application is to make it possible to define separation of duty constraints on two roles that have a common senior role and for a user to be assigned to or activate the senior role; finally, we describe how a single hierarchy in the new model can support the distinction between role activation and permission usage. In short, the oriented permission model provides ways of implementing a number of useful features that have previously required ad hoc and inelegant solutions.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126080050","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}
引用次数: 160
Peer-to-Peer Multimedia Streaming Using BitTorrent 点对点多媒体流使用BitTorrent
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358912
Purvi Shah, Jehan-Francois Pâris
{"title":"Peer-to-Peer Multimedia Streaming Using BitTorrent","authors":"Purvi Shah, Jehan-Francois Pâris","doi":"10.1109/PCCC.2007.358912","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358912","url":null,"abstract":"We propose a peer-to-peer multimedia streaming solution based on the BitTorrent content-distribution protocol. Our proposal includes two modifications that allow it to deliver multimedia data on time. First, we replace the rarest-first chunk downloading policy of BitTorrent by a policy requiring peers to download first the chunks that they will watch in the near future. Second, we introduce a new randomized tit-for-tat peer selection policy that gives free tries to a larger number of peers and lets them participate sooner in the media distribution. Our simulations indicate that both changes are required to achieve a good streaming quality.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128446604","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}
引用次数: 142
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks 异构传感器网络覆盖问题的O(log n)-局部算法
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358882
M. Thai, Yingshu Li, Feng Wang
{"title":"O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks","authors":"M. Thai, Yingshu Li, Feng Wang","doi":"10.1109/PCCC.2007.358882","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358882","url":null,"abstract":"In this paper, we study the maximum lifetime target coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. Many centralized algorithms have been proposed to solve this problem. A very few distributed versions have also been presented but none of them obtains a good approximation ratio. In this paper, we propose two O(log n) localized algorithms. In particular, we first reduce the MTC problem to the domatic number problem in directed graphs. This relation shows that a feasible solution to the domatic number problem is also a feasible solution to the MTC problem. We next prove the lower and upper bounds of this domatic number. Based on this proof, we present two O (log n)-localized algorithms to solve the MTC problem.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125604961","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}
引用次数: 27
A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters 用最少转换器的有界树宽光网络广播的下界
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358889
Tong Yi, G. Ding, Bogdan Oporowski
{"title":"A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters","authors":"Tong Yi, G. Ding, Bogdan Oporowski","doi":"10.1109/PCCC.2007.358889","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358889","url":null,"abstract":"Wavelengths and converters are shared by communication requests in optical networks. The usage of converters increases the utilization of wavelengths and allows more requests to succeed. The converters usage problem (CUP) is to determine the minimum number of converter so that each node can send messages to all the others (broadcasting). In this paper, we study the CUP in sparse conversion networks with bounded treewidth. A converter wavelength-dominates a node if there is a uniform wavelength path between them. The minimal wavelength dominating set problem (MWDSP) is to locate the minimum number of converters so that all the other nodes in the network are wavelength-dominated. We use a linear complexity dynamic programming algorithm to solve the MWDSP for networks with bounded treewidth. One such solution provides a low bound for the optimal solution to the CUP.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132498676","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
Application Insight Through Performance Modeling 通过性能建模了解应用程序
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358880
G. Marin, J. Mellor-Crummey
{"title":"Application Insight Through Performance Modeling","authors":"G. Marin, J. Mellor-Crummey","doi":"10.1109/PCCC.2007.358880","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358880","url":null,"abstract":"Tuning the performance of applications requires understanding the interactions between code and target architecture. This paper describes a performance modeling approach that not only makes accurate predictions about the behavior of an application on a target architecture for different inputs, but also provides guidance for tuning by high-lighting the factors that limit performance in each section of a program. We introduce two new performance metrics that estimate the maximum gain expected from tuning different parts of an application, or from increasing the number of machine resources. We show how this metric helped identify a bottleneck in the ASCI SweepSD benchmark where the lack of instruction-level parallelism limited performance. Transforming one frequently executed loop to ameliorate this bottleneck improved performance by 16% on an Itanium2 system.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131844956","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}
引用次数: 12
Threat Analysis of the Session Initiation Protocol Regarding Spam 基于垃圾邮件的会话发起协议威胁分析
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358923
S. Dritsas, John Mallios, M. Theoharidou, G. Marias, D. Gritzalis
{"title":"Threat Analysis of the Session Initiation Protocol Regarding Spam","authors":"S. Dritsas, John Mallios, M. Theoharidou, G. Marias, D. Gritzalis","doi":"10.1109/PCCC.2007.358923","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358923","url":null,"abstract":"Voice over Internet protocol (VoIP) is becoming increasingly popular due to its significant advantages regarding cost and support of enhanced multimedia services. Despite of the substantial advantages of using the Internet as the transmission medium for voice calls, we can foresee many undesirable uses, especially in terms of spam. VoIP technology may provide new means for the transmission of bulk unsolicited messages and calls (spam over Internet telephony - SPIT), mainly due to the reduced cost compared to traditional telephony. Therefore, mechanisms are essential to address the SPIT problem, while maintaining the advantages of VoIP technology. In this paper we conduct a comprehensive threat analysis that addresses the ascendant VoIP protocol, the session initiation protocol, in terms of its vulnerability regarding SPIT deliverance. Our analysis introduces the requirements that the mechanisms dealing with the SPIT phenomenon should take into account, in order to be feasible and efficient.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133011277","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}
引用次数: 22
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信