By Topic

Networking and Distributed Computing (ICNDC), 2012 Third International Conference on

Date 21-24 Oct. 2012

Filter Results

Displaying Results 1 - 25 of 60
  • [Cover art]

    Publication Year: 2012 , Page(s): C4
    Save to Project icon | Request Permissions | PDF file iconPDF (2359 KB)  
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2012 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (39 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2012 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (131 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2012 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (119 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2012 , Page(s): v - viii
    Save to Project icon | Request Permissions | PDF file iconPDF (158 KB)  
    Freely Available from IEEE
  • Message from General Co-chairs and Program Co-chairs

    Publication Year: 2012 , Page(s): ix - x
    Save to Project icon | Request Permissions | PDF file iconPDF (79 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • ICNDC 2012 Organizing Committee

    Publication Year: 2012 , Page(s): xi
    Save to Project icon | Request Permissions | PDF file iconPDF (94 KB)  
    Freely Available from IEEE
  • ICNDC 2012 Steering Committees

    Publication Year: 2012 , Page(s): xii
    Save to Project icon | Request Permissions | PDF file iconPDF (67 KB)  
    Freely Available from IEEE
  • ICNDC 2012 Program Committees

    Publication Year: 2012 , Page(s): xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (73 KB)  
    Freely Available from IEEE
  • Live Streaming with Content Centric Networking

    Publication Year: 2012 , Page(s): 1 - 5
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (850 KB) |  | HTML iconHTML  

    Media streaming is the killer application in current Internet. There are a variety of media streaming techniques in today's Internet, such as RTSP, HTTP live streaming and Adobe Flash etc. HTTP live streaming (HLS) is a popular and most promising technique as the protocol is based on the Internet workhorse protocol i.e. HTTP, and supported by HTML5 and mobile platform. Most of these media streaming techniques are based on TCP/IP, which is built on the traditional host-to-host network architecture. The host-to-host architecture is proved to be inefficient in content distribution with a lot of bandwidth waste, and it is complicated to deploy network service because of TCP/IP's location-dependence. Content Centric Networking (CCN) is a future Internet architecture which is targeted to solve the above problems by location-independent content naming and universal content caching in router. In this paper, we investigate both HTTP live streaming and CCN, and propose a design of CCN live streaming, which is a media streaming technique base on CCN. Finally, we demo our CCN live streaming on Android client, and conduct evaluation experiments. The results demonstrate that the CCN live streaming is a low-cost scheme and much easier to deploy and configure in operation compared with HTTP live streaming. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelizing FIB Lookup in Content Centric Networking

    Publication Year: 2012 , Page(s): 6 - 10
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1217 KB) |  | HTML iconHTML  

    As a promising future Internet architecture, CCN(Content Centric Networking) is a pragmatic shift from host-to-host to named content model. Providing each piece of content with a specified name, CCN can either directly route a user's Interest for a specific piece of content to the content server, or simply pick the right piece of content from the in network cache and send it back to the user. The combination of content name and in-network cache makes CCN suitable for content distribution. Name based FIB (Forwarding Information Base) table lookup thus plays an important role in CCN routing, as FIB records the forwarding face set for different name prefixes. This paper leverages multi-core platform to accelerate the FIB lookup in CCN router. Based on TILEPro64 platform, which has 64 identical tiles, two parallel zed lookup algorithms, one is based on hash table and the other is based on Bloom filter, are implemented and evaluated. To better evaluate the performance, the size of FIB is estimated and the statistics of URLs are measured to simulate the generation of practical Interests packet traffic. Through theoretical evaluation and experiment, it shows that the parallelization can improve the FIB lookup performance efficiently. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Data Structure for Content Cache Management in Content-Centric Networking

    Publication Year: 2012 , Page(s): 11 - 15
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (315 KB) |  | HTML iconHTML  

    Content-Centric Networking (CCN) is a new network architecture that rethinks the model of network communication. In this architecture all the network sources will be looked as content and routed by name. In this paper, we describe a scheme about the memory management in CCN and explore the impact of this management. We hope to design a solution for the in-network cache. To this purpose, we set up an application platform using the open source CCNx prototype and redesign the cache management by using a different data structure-splay tree and replacement policy compared to the existing design. This data structure is very suitable for caching for that recently accessed content is quick to access again. We also imitate some related work and design a similar experiment. The experimental results show the high efficiency of our management. Our solution improves the hit probability and make the popular content less time to access. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reality Check of CCN Routing Using Search Processor

    Publication Year: 2012 , Page(s): 16 - 20
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (329 KB) |  | HTML iconHTML  

    Content Centric Network (CCN), a typical incarnation of the Information Centric Network (ICN), which is an active research topic of Future Internet Architecture. Naming the content's chunks, retrieving and forwarding the content chunks according to their names are the core ideas of CCN. But the length of the content's name is variable length, which is an obvious difference from the IP address in the IP network. Also the space of the content names is much bigger than IP addresses. It is a big challenge for CCN routing based on name search in FIB table. FIB table lookup based on software solution incurs high latency, which is unsuitable for high speed network while the network needs to forward CCN packets in wire-speed. In this paper, FIB table lookup for CCN routing based on hardware search processor is explored as what can be used as fast TCAM with high performance and low power consumption. And the characteristics of the search processor are introduced and the reason why it is suitable for FIB lookup in CCN routing is also explained based on some evaluations. Some experiments are conducted to compare the software-based solution with our hardware-based solution on the performance. And the power consumption and the cost are also analyzed. Finally, according to the evaluation results, the conclusion can be reached that FIB table lookup based on search processor in CCN routing is practical with power efficiency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reformat Named Data Networking with Cryptographic Message Syntax

    Publication Year: 2012 , Page(s): 21 - 25
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (552 KB) |  | HTML iconHTML  

    The CCNx reference implementation uses XML and ccnb to describe and encode the Interest and Data packet, but currently most security communication uses CMS based on ASN.1 and BER to characterize the protocol packet. Therefore, in order to be compatible with these existing crypto technology and products, we propose to reformat the Interest and Data packet with CMS. In addition, BER encoding causes almost no increase in packet size compared to ccnb encoding, but it used less time spent on functions related to packet name decoding than XML-decoded. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method of Accelerating LDA Program with GPU

    Publication Year: 2012 , Page(s): 26 - 29
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (152 KB) |  | HTML iconHTML  

    LDA (Latent Dirichlet Allocation) is a text modeling algorithm based on a generative probabilistic model. It is widely used to discover latent topics among a set of documents. Mahout has implemented LDA algorithm, however, the execution time of the LDA program is very long when processing a large amount of documents, because the documents are processed in sequence. This paper introduces a method to modify this program with CUDA toolkit provided by NVIDIA, in order that a group of documents could be processed in parallel on GPU. Using this method, the LDA program could be accelerated greatly. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Implementation of High Performance Parallel KNN Algorithm Based on GPU

    Publication Year: 2012 , Page(s): 30
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (162 KB)  

    Summary form only given, as follows. Tremendous data will be generated in ERP system of an enterprise. Those data are very valuable for the enterprise. Therefore, Business Intelligent (BI) is used to help companies. Business Intelligent often uses data mining technologies. One of the methods in data mining is k-nearest neighbor (KNN). The time complexity of KNN is a bottleneck in the practical application in the fields of intelligent business. GPU has obvious advantages for enhancing effectiveness by parallelizing the KNN algorithm. There are lots of researches about GPU based KNN such as the work of V. Garcia, et.al.. However, we focus the GPU based KNN computation on the domain of Business Intelligent. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Parallel Computing on Large Scale Atmospheric Nucleation

    Publication Year: 2012 , Page(s): 31 - 35
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (336 KB) |  | HTML iconHTML  

    During the process of atmospheric nucleation, harmful substances may be generated, thus, it is with significant to conduct research on the process. In our previous work, some tools for visualization have already been developed. However, while the data set becomes larger, the computing time also increases accordingly. To make things worse, sometimes the visualization tool may become unstable due to some limitations, especially while calculating the similarity between molecules. In this paper, we will first propose an algorithm for calculating the similarity between two molecules. Then, in order to accelerate the parsing of data, the proposed algorithm will be implemented with parallel methods, and experimental results will show the improvement of the computing speed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Easy Matrix Computation Based Simulator of NDN

    Publication Year: 2012 , Page(s): 36 - 39
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (273 KB) |  | HTML iconHTML  

    This paper presents an easy matrix computation based simulator of NDN network architecture. This simulator is just like Newtonian mechanics in some way, once given the system initial state, routing table, content distribution, initial data requesting information of NDN network, the simulator can figure out all of the subsequent network state based on matrix operation. This simulator turns packet process event, such as interest generating, interest forwarding, content hitting and transmitting, to matrix computation on the network scale. This simulator is much easier to use than NS3 and CCNx, but it can provide similar simulation result and more details. And the computational complexity depends on number of involved contents and nodes, which makes analysis between small group of nodes and contents very simple and fast. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research and Evaluation of Network Virtualization in Cloud Computing Environment

    Publication Year: 2012 , Page(s): 40 - 44
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (722 KB) |  | HTML iconHTML  

    Network virtualization in cloud computing environment has attracted many attentions recently. With the help of network virtualization, VMM is able to provide fine-grained isolation among different VMs. However, the performance and overhead introduced by network virtualization is also important concerns when applying network virtualization to the cloud computing environment. In this paper, we evaluated the security, performance and QoS of popular virtual switch software Open vSwitch. The results can provide several guidelines for cloud application developer and administrators. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on Education Reform of Negative Feedback Teaching Process Based on Cloudy Computing

    Publication Year: 2012 , Page(s): 45 - 48
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (369 KB) |  | HTML iconHTML  

    In order to improve the quality of teaching, this paper presents a model of a negative feedback process of teaching reform. The model can be developed to improve the teaching program to develop students' ability. The paper discusses the system of two types of indicators to measure teaching effectiveness, as well as a corresponding meaning. Also we propose how to conduct data fusion algorithms and architecture model. Finally, the experimental data is discussed for the effect of the teaching quality improvement for teaching reform. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enabling Distributed Computing Systems with ElopTM

    Publication Year: 2012 , Page(s): 49 - 53
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (283 KB) |  | HTML iconHTML  

    In the era of Internet, one of the most ultimate goals is that users can seamlessly access to any computing application or service at anywhere anytime. Computing infrastructuralization is the path to gradually address the challenge. In this work, elop computing is proposed that encapsulates and integrates various computing elements as services, benefiting from existing advanced computing technology, e.g. virtualization and SaaS. Higher levels of services are also provided, e.g. metadata management, resource management and scheduling, security and authorization, which can be utilized to build distributed computing systems in a scalable way. In this paper, the architecture of elop computing is illustrated and corresponding middleware implementation is introduced in details. A typical scenario is given to demonstrate the potential of enabling distributed computing systems with elopTM. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Algorithm for Constructing Extremal Graphs Based on MapReduce

    Publication Year: 2012 , Page(s): 54 - 58
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (410 KB) |  | HTML iconHTML  

    MapReduce is a common programming model for processing and generating large datasets at present. Using the model, the programming for distributed computing can be easier than others. The extremal graph is a graph with the maximum number of edges such that it does not contain given sub graph. The method of constructing extremal graphs is an important research content in Graph Theory. The algorithm of constructing extremal graphs based on the MapReduce programming model is studied in this paper. By mapping the key-value pairs of MapReduce model properly, the parallel constructing algorithms are designed and implemented. Finally, we construct extremal graphs not containing hexagons and with no more than 26 vertices using the algorithm. By the results of experiments, it is showed that the average speedup is 2.55, and the average efficiency is 85%. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on Hadoop Cloud Computing Model and its Applications

    Publication Year: 2012 , Page(s): 59 - 63
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (167 KB) |  | HTML iconHTML  

    Hadoop is an open-source software platform for distributed computing dealing with a parallel processing of large data sets. It has been widely used in the field of cloud computing. This paper describes the three most crucial parts of Hadoop, including HDFS, the distributed file system, MapReduce, the data processing model, and HBase, the distributed structured data table. The application status, main research directions and existing problems of Hadoop data processing platform are analyzed, and some performance optimization suggestions are given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Reform of Three-Dimensional to the Practice of Telecommunication System for the Applications of Internet of Things

    Publication Year: 2012 , Page(s): 64 - 68
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (151 KB) |  | HTML iconHTML  

    Internet of Things (IOT) which is a rapidly emerging industry is setting off the third wave in the world's information industries, and it will become both the representative of emerging productive forces and the major point of economic growth. In the context of Internet of Things, the colleges and universities have set up the course of Practice of Telecommunication System. This article tries to analyze the main problems that encountered in the teaching and implementation process. These problems are mainly concentrated on the curriculum system, teaching content, experimental teaching equipments, classroom implementation and management, teaching team building and so on. In the end it puts forward some proposals and strategies for reform. It also provides some ideas for a better teaching of the Practice of Telecommunication System. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A strategy for mesh client mobility support in wireless mesh networks

    Publication Year: 2012 , Page(s): 69 - 71
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (356 KB) |  | HTML iconHTML  

    Mesh Client (MC) may be frequently move from the current SMAP to another SMAP in the Wireless Mesh Networks (WMN). The most of the present research papers on WMN assume that the MC is static or quasi static. However, MC may constantly move actually, which connection interruption and packet loss may occur. To solve these problems this paper presents a mobility support strategy for WMN, which consists of two parts: address assignment and mobility management. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.