2013 International Conference on Computing, Networking and Communications (ICNC)最新文献_第8页

SESAME: Smartphone enabled secure access to multiple entities SESAME:智能手机支持安全访问多个实体

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504205

Ameva Sanzziri, Anandatirtha Nandugudi, S. Upadhyaya, C. Qiao

引用次数: 7

TCP-FITDC: An adaptive approach to TCP incast avoidance for data center applications TCP- fitdc:一种用于数据中心应用的TCP连发避免的自适应方法

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504236

Jun Zhang, Jiangtao Wen, Jingyuan Wang, Wenlai Zhao

引用次数: 9

Effective cache management and performance limits in information-centric networks 信息中心网络中有效的缓存管理和性能限制

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504219

Vasilis Sourlas, L. Tassiulas

{"title":"Effective cache management and performance limits in information-centric networks","authors":"Vasilis Sourlas, L. Tassiulas","doi":"10.1109/ICCNC.2013.6504219","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504219","url":null,"abstract":"Proliferation of content distribution traffic in the Internet is changing the requirements on the networking infrastructure to the extent that radical new architectures are envisioned, where information is addressed by semantic attributes rather than origin and destination identities. In that volatile environment, Information-Centric Networking (ICN) is a flexible communication model that meets the requirements of the new information distribution trends. Information is residing at various locations-nodes (surrogate servers) and users interested in a piece of information request it from the closest replica. In this paper, we propose a distributed, on-line gradient descent type cache management algorithm, designed for ICN, which re-assigns the information items between the nodes of the network with the aim to minimize the overall traffic cost of the information when the popularity and the locality of users' demand change. We also provide a method to calculate the overall network traffic cost lower bound for a certain category of network topologies, so that we can compare the performance of the proposed cache management algorithm.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127444204","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

An optimized LDPC product network coding scheme in multiple access relay system 一种优化的多址中继系统LDPC产品网络编码方案

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504098

Zhanji Wu, Xiang Chen

引用次数: 4

Towards an enterprise self-healing system against botnets attacks 针对僵尸网络攻击的企业自愈系统

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504248

Adeeb M. Alhomoud, I. Awan, Jules Pagna Disso

引用次数: 1

Intra frame constant rate control scheme for high efficiency video coding 高效视频编码的帧内恒速率控制方案

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504163

Yimin Zhou, Ling Tian, X. Ning

引用次数: 12

Improved P2P content discovery by exploiting user social patterns 通过利用用户社交模式改进P2P内容发现

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504125

R. Farahbakhsh, N. Crespi, Ángel Cuevas, Neetya Shrestha, M. Mani, P. Saengudomlert

{"title":"Improved P2P content discovery by exploiting user social patterns","authors":"R. Farahbakhsh, N. Crespi, Ángel Cuevas, Neetya Shrestha, M. Mani, P. Saengudomlert","doi":"10.1109/ICCNC.2013.6504125","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504125","url":null,"abstract":"One of the most challenging issues in Unstructured Peer-to-Peer (P2P) network is to efficiently locate information resources. In this paper we propose a novel concept in which peers exploit social relations in order to improve the search success rate. In social networks, people can directly contact acquaintances that have knowledge about the resources they are looking for. However, peers lack these capabilities in a P2P network. We can find different searching mechanism such as flooding, which drastically increases the communication overhead, or random walk (RW) that reduces the message overhead, but since it is a blind sequential search it may take a long time to route a query. In front of this we have proposed a two-hop algorithm that incorporates the social behaviors of peers and processes queries more efficiently [2]. However, there is a strict limitation that the recommended nodes must always have the query resources. In this paper, we propose a one-hop algorithm that uses social behavior patterns. In the proposed algorithm peers establish friendship relations and learn from past experiences to recommend suitable peers that will route queries in an efficient manner. The simulation results show that the proposed one-hop algorithm provides better average success rates compared to both the random walk algorithm and the two-hop algorithm by reducing the search to only one logical hop. In addition, our proposal minimizes the required network memory space by limiting the query record, useful friends and resources at each node in the one-hop algorithm.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124954528","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

Improving service differentiation of immediate and advance reservation in resource-partitioned optical WDM networks 改进资源分区光WDM网络中即时预约和预先预约的业务区分

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504075

Derek R. Rousseau, J. Triay, V. Vokkarane

{"title":"Improving service differentiation of immediate and advance reservation in resource-partitioned optical WDM networks","authors":"Derek R. Rousseau, J. Triay, V. Vokkarane","doi":"10.1109/ICCNC.2013.6504075","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504075","url":null,"abstract":"As a result of the rise of Cloud and Grid computing, network operators are requested to improve their resource provisioning systems. In such scenarios, advance reservation (AR) and immediate reservation (IR) are gaining importance. While the former is capable of delivering low connection blocking for delay-tolerant applications, the latter is used by delay-sensitive ones. Even when both IR and AR requests share the same network substrate, service differentiation is needed. Additionally, under network resources partitioning, not only can the overall network capacity be under-utilized, but service differentiation can also be degraded. In this paper, we assess hybrid IR/AR sharing and partitioning mechanisms in optical wavelength-division multiplexing (WDM) networks, and propose efficient schemes for providing relative quality of service (QoS) differentiation among traffic classes. In order to overcome the poor resource utilization of strict partitioning, we develop and evaluate a preemption-based flexible partitioning framework aiming to provide relative QoS in hybrid IR/AR environments still supporting resource partitioning. Two preemption policies are proposed: switch first then preempt (SFTP) and preempt first then switch (PFTS). Through extensive simulations, we show that the proposed flexible partitioning framework can improve resource utilization, lower the overall blocking, and achieve well-differentiated relative QoS compared to strict partitioning.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"96 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124496589","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

VEGK: Virtual ECC group key for wireless sensor networks VEGK:用于无线传感器网络的虚拟ECC组密钥

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504110

A. E. El-Din, R. Ramadan, M. Fayek

引用次数: 9

Cloud-hosted key sharing towards secure and scalable mobile applications in clouds 云托管密钥共享，在云中实现安全和可扩展的移动应用程序

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504126

Piotr K. Tysowski, M. Hasan

引用次数: 7