enhanced multimedia data delivery based on content-centric ... · model, services and contents are...

Appl. Math. Inf. Sci.9, No. 2L, 579-589 (2015) 579

Applied Mathematics & Information SciencesAn International Journal

http://dx.doi.org/10.12785/amis/092L33

Enhanced Multimedia Data Delivery based onContent-Centric Networking in Wireless Networks

Mahfuzur R. Bosunia1, Anbin Kim1, Daniel P. Jeong2, Chanhong Park1 and Seong-Ho Jeong1,∗

1 Dept. of Information and Communications Engineering, Hankuk University of Foreign Studies, Korea2 Hankuk Academy of Foreign Studies, Korea

Received: 16 Jun. 2014, Revised: 18 Aug. 2014, Accepted: 19 Aug. 2014Published online: 1 Apr. 2015

Abstract: There is a growing interest in content-centric networking which is a new networking paradigm where the content itselfbecomes the core of communications rather than the address or location. Content-centric networking is greatly useful to increase thecontent availability and the efficiency of content delivery. Currently, the content-centric networking architectureis at an early stage,and it is not clearly defined yet in the wireless environment.In this paper, we propose a possible architecture, necessary components,and related mechanisms for multimedia content delivery in the wireless network. The proposed architecture is based on content-centricnetworking. We also present various simulation results to show that the proposed architecture and associated mechanisms work well inthe wireless network.

Keywords: multimedia, data delivery, content naming and routing

1 Introduction

The Internet has been greatly successful since its creationand has become a highway for globalization and aneffective means for networking various devices anddistributing information and services. Its size, complexity,and the role it plays in the modern world have farexceeded the initial expectations. It is now a complicatedand constantly expanding architecture that has become anessential part of our lives, work, communications, andentertainment.

The high complexity and expansion of thearchitecture imply the increased exchange of contents,collaboration, and interactions. To meet the needs ofvarious multimedia applications and services includingvoice/video over IP, crowdsourcing, social networkservices, and multimedia content sharing, researchers aretrying to define a new Internet architecture which cansupport high availability, heterogeneity, mobility, security,and so on. Due to the rapid advancement of the Internetand wireless mobile technologies, mobile Internet usersare able to access multimedia content and socialinformation easily, and stay connected for various mobileapplications and services.

Basically, there are two types of approaches to accessmultimedia content on the Internet. The first one is basedon the improvement of the current host-basedarchitecture: content delivery network (CDN) orpeer-to-peer (P2P) network. The second one is based onthe information-centric architecture: information-centricnetwork (ICN) or content-centric network (CCN)

CDN is built on top of the IP-based host-to-hostcommunication model where several dedicated serversstore all the contents published. The content exists inmultiple copies within strategically dispersed cacheservers which are close to the user. Therefore, CDN canincrease the hit ratio of the content and also minimize theservice delay in delivering the requested content.However, CDN can be inefficient as it has the centralauthority to control content dissemination in thehost-based communication model. On the other hand,P2P is a distributed network model in which each node(peer) acts as a client and also as a server. With the P2Pmodel, services and contents are shared among theinterconnected peers. P2P peers may contradict the trafficengineering policies of the underlying provider IPnetworks.

Typically, users are not much interested in the locationitself from which the content is provided, but instead they

∗ Corresponding author e-mail:[email protected]

c© 2015 NSPNatural Sciences Publishing Cor.

http://dx.doi.org/10.12785/amis/092L33

580 M. R. Bosunia et. al. : Enhanced Multimedia Data Delivery based on...

are more interested in how soon they can access thedesired content. To meet this objective and to overcomethe challenges in the massive amount of contentdistribution, ICN/CCN has recently gained much interest.

Nowadays a large volume of multimedia contents areexchanged on the Internet and comprise about 60% of thetotal Internet traffic. Wireless networks are also becomingoverloaded with multimedia contents due to theincreasing number of mobile devices such as laptops,tablet PCs, and smart phones and are facing variouscommunication challenges to provide efficient, reliable,infrastructure-independent, and scalable content deliveryservices. For efficient content delivery, it has beenemphasized to focus on the content itself and decouplethe content from the host in various research projects suchas NDN, PERSUIT, DONA, and NetInf. However, theCCN architecture is not yet clearly defined in the wirelessenvironment.

In this paper, we define a possible networkarchitecture and necessary components for multimediacontent delivery in the wireless environment. Theproposed architecture is based on content-centricnetworking. We also propose a routing approach thatconstructs a route without the global network-wideinformation and a dependency on the central node andalso drastically reduces the forwarding databaseinformation. In addition, we propose a smart handoverapproach to provide seamless continuity and reachabilityfor the end user. The rest of the paper is organized asfollows. Section 2 describes the recent work related tocontent-centric networking. Section 3 presents anarchitecture, necessary components, and relatedmechanisms for content delivery in the wireless networkin detail. Section 4 presents our network model, andSection 5 discusses performance issues. Finally, Section 6concludes the paper.

2 Related Work

DONA [1] introduces data-centric networking byreplacing the concept of DNS in the traditional host-basedInternet architecture. DONA proposes a flat,self-certifying name based approach. Each node isassociated with a public-private key pair and its content isnamed using the form of node’s public key: the node’ssignature of data. These names are applicationindependent and unique, and ensure content integrity.DONA employs the Resolution Handler (RH) server toindex the content provided by the content provider, andhosts are attached to a RH and make a query to the RH forrequesting the content. Consequently, DONA reduces theapplicability of name-based networking because it isactually location-based and always connected to a RH,and also for each connection it requires sessionre-establishment.

Network of Information (NetInf) [2,3] follows thesimilar naming approach as DONA and also relies on a

name resolution service. The published content objects ofthe content provider use a self-certifying identifier to thelocators for content discovery. NetInf uses MultilevelDHT (MDHT) [4] for name resolution and contentlookup and also for global routing in the DHT area.However, NetInf reduces its scope by increasing itsdependency on the name resolution system which isresponsible for managing registration, updates, andaccumulation of names. It requires a re-binding for thewireless environment similarly to DONA.

PERSUIT [5] proposes a publish/subscribearchitecture that is comprised of three key components:Rendezvous, Topology and Routing. A RendezvousNetwork (RN) is comprised of Rendezvous componentswhich are interconnected by Rendezvous Identifier (RI)and Scope Identifier (SI) in a tree structure. The RN isresponsible for publications and defines its scope basedon the RI and SI. The RN makes a name resolution on arequest for mapping an identifier to a published content.Then the Topology component constructs a path to thecontent source and the Routing component transfers thecontent using the source routing mechanism [6]. Similarlyto NetInf, it also follows the name resolution basedrouting structure.

In [7,8,9,10], several routing policies and scalabilityissues regarding the content-centric approaches aredescribed. These works rarely focus on how routing willbe performed and how the forwarding information base(FIB) will be generated from a huge number ofdisseminated contents throughout the Internet and howthe network architecture will be more responsive to thewireless mobile situation. In [11,12], a resource namebased routing algorithm was introduced, which followsthe present Internet architecture that limits the scope ofthe name-based routing. The content-centric networkingarchitecture [7,13,14,15] decouples the content from thelocation and works like a virtual content distributor allover the network. It will increase the network overheaddue to transmissions of the content request packet calledInterest packet and transmissions of related routingpackets for each content. Ant colony based routing [16,17,18] restricts the Interest packet dissemination andcontent distribution, but the overhead and the complexityof these algorithms are high due to the collection ofglobal information.

CCN still has more issues to be resolved for practicalapplications, and user mobility is one of them. End usermobility architecture is not yet supported by the currentCCN architecture. Several proxy-based approaches [19,20] were proposed to provide seamless connectivitytowards the content when the end users are mobile andchange its location eventually. But these approachesincrease the complexity of handling mobility byincreasing its dependency on a central administration orproxy server.

CCN [13] is based on the communication with thenearby locations where the content is available instead ofthe source-destination communication scenario.


Appl. Math. Inf. Sci.9, No. 2L, 579-589 (2015) /www.naturalspublishing.com/Journals.asp 581

Therefore, CCN can provide anytime, anywherecommunication with respect to content access. In CCN,contents are accessed using the hierarchically arrangedname components that are generated by the contentproviders. An Interest packet which includes the contentname is broadcast towards all the available contentproviders’ CCN nodes. Any node that has the original ora replicated copy of the requested content can respond tothe request.

3 An Architecture for Enhanced MultimediaContent Delivery in the WirelessEnvironment

Although CCN is a promising architecture for efficientdata delivery, it is still an evolving concept. In thissection, we present a possible CCN-based architecture formultimedia content delivery in the wireless environment.

3.1 A Structure for Content Naming

The main principle of CCN is that a content is accessedusing the content name rather than the host address, andthus content naming is a very important issue in CCN.With the exponential growth of multimedia contents onthe Internet, it is difficult to find and organize relevantcontents in an efficient way. Therefore, it is important toprovide a well organized naming scheme that is flexibleand provides a low delay in retrieving or identifying thecontent. Our proposed architecture follows a hierarchicalstructure for content naming, e.g.,’\hufs.ac.kr\videos\missimp.mpeg\V<1, 2> \S <1,2>’. V and S represent version and segment,respectively, and the number of naming components isnot limited. It is fully flexible for the content provider andtakes the shape shown in Fig.1. The CCN content namesalso implicitly contain the SHA-256 digest of the contentto provide unique and data integrity.

hufs.ac.kr

videos audio

V1 V2

miss_imp.mpeg

S1 S2

Fig. 1: A Naming Hierarchy

3.2 The Node Model

Each node in the network has three basic functionalelements for content-centric communication: ContentStore (CS), Forwarding Information Base (FIB), andPending Interest Table (PIT) as in [13].

CS maintains the relation between the content nameand stored content at the local cache of a CCN node. Inour proposed architecture, we divide the CS into twoelements: CS Index (CSI) and CS Repository (CSR). CSIholds the content name, Content Memory Pointer to theCSR, the Time-to-Live (LV), and the Number ofAccessed Times (NAT). CSR holds the correspondingcontent only. We extend the traditional CS for increasingthe flexibility of content management and contentreplacement. The basic structure of CS is shown in Fig.2.

../v1/s1

../v1/s2

../v1/s3

CSR

CSI

CS

Name Pointer LV

/hufs.ac.kr /videos /

miss_imp.mpeg /V1/S1




miss_imp.mpeg /V1 /S3

Fig. 2: Content Store (CS)

FIB contains the necessary information to forward anInterest packet to the appropriate next hop, which is similarto the routing table of the host-based network architecture.It contains all the next hop interface IDs for each reachablecontent. The basic structure of FIB is shown in Fig.3.

FIB

Name Interface

/hufs.ac.kr /videos 1

/hufs.ac.kr /audio 2

Fig. 3: Forwarding Information Base (FIB)

PIT is a fundamental structure to preserve the state ofthe received Interest packet. It records all incominginterface IDs for unsatisfied Interests so that it can satisfythe Interest later as soon as the content is available. EachPIT entry also holds the Time-to-Live (LV) to maintain itsfreshness. The basic structure of PIT is shown in Fig.4.


www.naturalspublishing.com/Journals.asp


PIT

Name Interface LV



0

Fig. 4: Pending Interest Table (PIT)

3.3 Components of the Proposed Architecture

The proposed CCN architecture is comprised of SmartBase Stations (SBS), Smart Routers (SR), ContentServers, and Mobile Devices as shown in Fig.5. Thereare two types of SRs Proxy Routers and AutonomousSystem (AS) Routers. Several AS Routers form a groupor a Content Autonomous System (CAS). CAS isconnected to each other using the Proxy Routers.Network Engineers or ISPs have the complete flexibilityto design the range of CAS. Content names are broadcastinside the CAS and aggregated content names are unicastamong the different CASs using the Proxy Routers. Thereis no centralized intelligent controller, and the mobiledevices are connected with SBSs using the X1 wirelessinterface. SBSs are connected to SRs using the X2 wiredinterface, and Content Servers are connected to the SRsusing the X3 wired interface. SBSs are equipped with amobility handler (e.g., MME in LTE) to deal withhandovers of the mobile devices. The main reason for

CCN Core Network

SBS

Content Servers

X1

X2

X3

SR SR

Mobile Devices

CAS

Fig. 5: The Proposed Architecture

distributing the intelligence among the base stations inour proposed architecture is to reduce the response timefor content delivery even during the handover. All thecomponents in the figure follow the basic structure of theCCN node model.

3.4 Routing

CCN enables content name based routing withoutknowing the host address. This means that the contentsare disseminated across the network; mobile devicesretrieve the desired content by requesting with theappropriate content name; the content will be providedfrom the most appropriate content source.

CCN uses two types of messages for communication,namely, Interest packet and Data packet. The Interestpacket is used to request for a particular content, and thecontent provider provides the requested content based onthe content name. The Interest packet contains the contentname and other identifiers, e.g., type, version, author, etc.Data packets are used to transmit the requested content tothe requester as a response to the Interest packet. Datapackets also contain the digitally signed information forprotecting the content and respecting the contentpublisher. Interest packets may also contain a contentname with a req flag, which implies the content providerneeds to reply back with the exact content name, contentmeta-data (e.g., size, content provider, encoding scheme,etc.) and path attributes (e.g., bandwidth, hop count, etc.)using a Data packet that contains the content name with aspecial flagdataReq.

Content Providers may allow only valid requesters toaccess and store data by publishing the data items witha valid name. Each content is assigned a unique attributeaccording to the category of data items. A CCN node thatintends to publish a content injects its name to its localCS and forwards the name into the network based on thescope.

The FIB prefix is learned in two ways. First, thecontent provider may broadcast, multicast, or unicast thecontent name or a prefix of a content name to the nearbyneighbors. The prefix will eventually reach the corenetwork routers. Second, each node may learn the FIBprefix by referring to the response of the pending Interestpacket. Each router has a limited amount of storagecapacity to handle FIB entries. In order to handle thescalability problem of FIB manipulation for a hugeamount of real world contents, we set a storage thresholdto 0.85. The storage threshold 0.85 means that a node canhold the 85% of its total storage for FIB manipulation.The remaining 15% are used for FIB updates. When anew FIB entry appears, the storage capacity of the nodewill be checked against the threshold, and if it is belowthe threshold, the entry is injected in the FIB, otherwise aFIB aggregation is performed, e.g.,\hufs.ac.kr\videosand\hufs.ac.kr\audio to\hufs.ac.kr, the storage capacitywill be checked again and the new FIB entry is inserted.Each Proxy Router in the core network has the ability toaggregate the FIB entries to its minimum level and totransfer towards the neighboring CAS. The networkengineers or the ISPs should be aware of prefixaggregation to provide the faster, more efficient andscalable content access.



• A Simple ApproachContent Request: Content requesters broadcast an

Interest packet to the nearby SBSs or SRs with the desiredcontent name. An SBS or SR receives the Interest packet,looks up its CS for the requested content. If a matchingcontent is found, then it will be sent out via the arrivalinterface as a response to the Interest packet. If thematching content is not found in the CS, a lookup isperformed in the PIT. If there is an already existing PITentry for the corresponding Interest packet for the samearrival interface, the Interest packet is discarded and thelifetime of the PIT entry is updated. If there is an alreadyexisting PIT entry for the corresponding Interest packetbut the arrival interface is different, then a new PIT entryfor the arrival interface is added to the PIT and theInterest packet is discarded. If there is no matching PITentry, then a lookup is performed in the FIB. If there is amatching entry found in the FIB for the requestedcontent, a new PIT entry is added to the PIT by assigningthe lifetime that adjusts the time-to-live (LV) of the PITentry, and the Interest packet is forwarded to theinterfaces available in the FIB. An Interest packet isforwarded to a single interface according to theround-robin fashion or using the random probability toreduce the response time for the same content fromdifferent providers. It also makes faster retrieval of a largevolume of multimedia contents by requesting smallchunks of the contents from different content providers. Ifthere is no match found in the FIB, the Interest packet isdiscarded, which means that there is no way to satisfy thecontent request. As shown in Fig.6, Steps 1-5 and 9 arerelated to the content request. The pseudo code of thiscontent request approach is presented in Algorithm1.

FIB

PITCS

Fa

ces

3G

4G

WLAN

FIB

PITCS

Fa

ces

3G

4G

WLAN

FIB

PIT CS

3G

4G

WLAN

Fa

cesFIB

PIT CS

3G

4G

WLAN

Fa

ces

3G3G

FIB

PIT CS

3G

4G

WLAN

Fa

ces

1

2345

6 7

8

9

10

Requester 2

Requester 1

Base StationRouterContent Source

Fig. 6: Routing in the Proposed Architecture

Content Retrieval: Contents are delivered back to thecontent requester using the forwarding route of theInterest packet to the content source. When a Data packetis received by the base station or router, it looks up its CS.If a matching entry for the received content is found on itsCS then it discards the content because the content isduplicated and received previously. If there is nocorresponding matching entry in the CS, it looks up itsPIT to find any Interest unsatisfied for the correspondingcontent. If there is a match in the PIT, the content is stored

Algorithm 1 : Content Request Algorithm at each nodeINPUT: Interest(a request for contentc from a contentrequester)1. if c is not flagged with reqthen2. if c is in CSthen3. Returnc to the content requester4. else if c is in PIT then5. if the incoming interface is in PITthen6. Discard Interest7. else8. Update PIT by adding the interface9. end if

10. else if c is in FIB then11. Forward Interest to the next neighbor12. Addc to PIT13. else14. Discard Interest15. end if16. else if c is flagged with reqthen17. exit and Go to Algorithm318. end if

in the CS and forwarded to the interfaces in the PIT. Aftersuccessful forwarding, the PIT entry is removed. If thereis no match found in the PIT, the content is discarded andnot processed further. As shown in Fig.6, Steps 6-8 and10 are related to the content retrieval. Pseudo code of thiscontent request approach is presented in Algorithm2.

Algorithm 2 : Content Retrieval Algorithm at each nodeINPUT: Data(content c from a contentprovider)1. if c is not flagged with reqDatathen2. if c is in CS thenthen3. discard c4. else5. if c is in PIT then6. forwardc to the PIT interface7. and removec from PIT8. else9. discardc

10. end if11. end if12. else if c is flagged with reqDatathen13. exit and go to Algorithm414. else15. discardc16. end if

• A Reliable ApproachIn the simple approach, the Interest packet may be

disseminated to the different content providers, and thesame content may be replied back to the content requesterusing multiple different routes. This will misuse thenetwork resources and badly increase the networkoverhead due to the unnecessary content transfer using




different routes. To reduce the network overhead and toincrease the bandwidth efficiency, we introduce thefollowing reliable approach for the proper route selection.

A Route for Content Request: Content requestersunicast an Interest packet to the nearby SBSs or SRs withthe desired content name by adding an additional flag(req) inside the content name. An SBS or SR receives theInterest packet, looks up its CS for the requested content.If an exactly matched or a larger prefix matched content isfound, then it will be sent out in a data packet thatcontains the exact content name with an additional flagdataReq, other attributes (e.g., size, encoding types, etc.)and the path related information (e.g., bandwidth, currentload, etc.) via the arrival interface as a response to theInterest packet. If the matching content is not found in theCS, a lookup is performed in the PIT. The other operationis similar to the content request functions described in thesimple approach. The algorithmic presentation of this partis shown in Algorithm3. When the core routers receivethe data packetdataReq, it looks up its FIB. If an exactlymatching entry for the named content is found in its FIBthen it calculates its current weight value using Eqn.1. Ifthe weight value is greater than the previous weight value,then the FIB interface is updated, otherwise the datapacket dataReq is discarded. If there is no correspondingmatching entry in the FIB, the incoming interface isstored in the FIB with a LV value equal to the half of thenormal LV value and weight value equal to the calculatedvalue using the Eqn.4 and forwarded to the interfaces inthe PIT. After successful forwarding, the PIT entry isremoved. The algorithmic approach for receiving dataReqis illustrated in Algorithm3.

Algorithm 3 : Route for Content Request, at each nodeINPUT: Interest(a request for content c from the contentrequester)1. if c is flagged withreq then2. if c is in CSthen3. return dataReq to the content requester4. else if c is in PIT then5. if incoming interface is in PITthen6. Discard Interest7. else8. update PIT add interface with req flag9. end if

10. else if c is in FIB then11. forward interest to the next neighbor12. add c to PIT with req flag13. else14. discard Interest15. end if16. else if c is not flagged with reqthen17. exit and go to Algorithm 118. end if

Contents Retrieval: Data packets with the meta-dataof the contents are delivered back to the content requesterusing the forwarding route of the Interest packet to the

Algorithm 4 : Route for Content Request, at each nodeINPUT: INPUT: Data(content c from a contentprovider)1. if c is flagged with reqDatathen2. if c is in CSthen3. discardc4. else5. if c is in PIT with req flagthen6. forwardc to the PIT interface7. removec from PIT8. measure the route weight using Eqn.49. if c is in FIB then

10. if current weight ¿ existing weight ofFIB then

11. update FIB with the currentinterface

12. delete the old one13. else14. discardc15. end if16. else17. addc to FIB18. end if19. end if20. end if21. else if c is flagged withreqData then22. exit and go to Algorithm223. else24. discardc25. end if

content source. When a Data packet dataReq is receivedby the content requester it unicasts an Interest packetusing the previously found forwarding route using thesection Route for Content Request. The other operationsare the same as the content request functions described inthe simple approach and illustrated in Algorithm1, andcontent retrieval functions described in the simpleapproach and illustrated in Algorithm4.

3.5 End User Mobility

It has been shown that CCN works in a network withmobile nodes, but several problems arise with real-timeapplications when nodes become mobile and the contentsize becomes larger. The current CCN architecture is notmature enough to support mobility for real-timemultimedia communication as it cannot guarantee sessioncontinuity and reachability is not given for the toleranttime period. Fig.7 illustrates User Equipment 1 (UE1)currently receiving a content via Access Network Amoves towards Access Network B. If Access Network Bdoes not have the routing information regarding thecontent, the session continuity cannot be maintained untilthe FIB entry of the content is updated. This paperproposes a soft-handover approach where the routinginformation on the new access network is updated before



Content ServersCore Router

Access Network A

Access Network B

Moving

Fig. 7: A Mobility Scenario

the original handover occurs. This is almost similar to thefollow-me service that is the modern trend of mobilecommunications. In our approach, the SBS has thecapability that measures the traffic rate and the signalstrength. the SBS can also apply the utility functionsshown in Eqn.4 to measure the overall weight withrespect to the UE in order to decide whether the UE willmove to a new SBS access network or not. If the old SBSdetects a possible handover of the UE, it forwards thecontent name and the related information to the new SBS,and the new SBS forwards the Interest to the corenetwork to retrieve the content. If successful, the UEterminates the connection to the old SBS and attaches tothe new SBS and continues to receive the contentseamlessly using the new SBS. The handover procedure isillustrated in Fig.8.

1: HO preparation

2: Forward Interest and

Data

3: New route for Content

4: Grant Access and re-

establishment

Time out after fix time

interval

Fig. 8: Handover Procedure

4 The Network Model

In our network model, we consider a number of SmartRouters, Proxy Routers, Smart Base Stations, Mobiledevices and Content Servers that are presented into aweighted graphG(V,E). The V is the number ofCCN-enabled nodes, andE is a set of connectedinterfaces among them. Each node in the network modelfollows the decision problem of computation theorywhere yes or no is converted to′found′ or ′notfound′.Content retrieval is an NP-hard problem where the morethe content information will be learned by the network,the faster the content will be retrieved. We assume that ndifferent nodes are uniformly distributed in a square area.We assume that at least one of the routing messagescorresponding to FIB generation is eventually delivered toall nodes. Under this assumption, the number of routingmessages due to flooding isO(n) and the number ofrouting messages at each node islogb x where b is thedepth level of the content name aggregation andx is thetotal number of content entries that are in the FIB. Letpdenote the probability of the forwarding inefficiency of anode. Then the probability of an Interest message sentoverh hops can be expressed as:

P (h) = 1− (1− p)h (1)

and the expected number of hops that the Interest messagetraverses is as follows:

H(h) =

n∑

i=1

(1 − p)i−1p

P (h).i (2)

• Utility Function: We define a mathematical functioncapable of taking into account receiver’s preference interms of criteria while selecting a route for contenttransfer. Letx be the different value for a single criteriawithin the varied rangexmin ≤ xm ≤ xmax, α be thesteepness andxm the midpoint of the variation range.These variations can be defined as a single criteria utilityfunction as follows:

u(x) =

0 if x ≤ xmin1

1+e

α(xm−x)x−xmin

if xmin < x ≤ xm

1− 1

1+eβ(x−xm)xmax−x

ifxm < x ≤ xmax

1 if x ≥ xmax

(3)

whereβ = α(xmax−xm)xm−xmin

and α > 0 are the tunedsteepness parameters. The proposed utility functionsatisfies the following properties:u(x) = 0 ∀ x ≤ xmin,u(x) = 1 ∀ x ≥ xmax andu(xm) = 0.5. Route selectionin the networking environment is based on an aggregationof different utility functions for decision processes.Hence, we define here a multi-criteria utility function thatis able to integrate the receiver’s different choice metricsto select a better route. Let’s assume thatR is a route onwhich dataReq message is traversed, which can bedescribed as a one different descriptor or multipleattributes (e.g., bandwidth, delay, and cost in terms of hop




count), i.e.,x = x1 ∗ ... ∗ xn. Each alternative attributecan be described as a utility functionu(xi), and thesimple weighted average of a routeAR is used tomaximize the probability of selecting the best route asfollows:

AR =

n∑

i=1

wiu(xi) (4)

wherewi is a weight that reflects the content receiver’spreference. Weights are assigned depending on thereceiver’s expected criteria, and thus the expected criteriahave a higher weight.

5 Simulation Results

We implemented the proposed CCN architecture and therouting mechanisms using NS-3 and CCNx [13] on aLinux Ubuntu environment. The primary goals of ourimplementation were to show the performancecharacteristics of the proposed architecture with respectto CCN functionalities in the wireless environment and toensure that the proposed architecture and the routingmechanism work well with the CCN functionalities in thevarious wireless networks, e.g., Wi-Fi, LTE, andCSMA/CD-based networks. The proposed architecturedelivers the content to the requesters that are interested inthe particular content in a fast manner. We also performedsimulations to show the effectiveness and responsivenessof our proposed work towards mobility for real-timemultimedia communications. We used Content TransferTime as a key performance indicator, and it is normallymeasured from the time at which a user requests for acertain content to the time at which the content isprovided. Note that the network capacity and types oftraffic flows may affect the content transfer time.Assigning weights for the utility function of Eqn. 1depends on the receiver’s preference. In this paper, we didnot consider the assignment of each weight for optimizingthe performance. For our simulation purposes, we usedthree routing attributes, e.i., hop count, bandwidth, andthe number of active connections, and their weight valuesare 0.6, 0.25 and 0.15, respectively to define the utilityfunction. The required parameters related to thesimulation are specified in Table1.

Table 1: Simulation parameters

Parameter Value

Network Type LTE, Wi-Fi, CSMA/CD LANSimulation Time 400 Sec

No of Content Server 1Size of the Content 10

Transport Layer UDPBandwidth 8Mbps, 10 Mbps, 1 Gbps

Delay 2 msContent Packet Size 1024 Bytes

5.1 Scenario 1

Fig. 9 shows a simulation topology with heterogeneousaccess networks where the content server has a 10MBfile, and remote user devices want to download the file.The performance of our proposed architecture has beenevaluated and compared with the current Internetarchitecture and the conventional CCN architecture. We

Wired LAN

10.1.1.0

60.1.1.070.1.1.0

90.1.1.0

20.1.1.0

30.1.1.0

100.1.1.0120.1.1.0

50.1.1.0

7.0.0.0

80.1.1.0

1.0

40.1.1.0

…

…

1.0UE(1)

UE(n)

Station(1)Station(n)

Wired

Node(1)

0.07.0.0.0.0.

Wired

Node(n)

No…

…WiFi

WiWiWi

NodeLTE

60.1.

Content Server

Fig. 9: A Simulation Topology with HeterogeneousAccess Networks

assigned three different routes for each access network tothe content server. There are 10 different end user nodesat each access network, and they request for the samecontent from the content server in a random interval,which means some end user devices start to download thefile at 10 sec, and some user devices to start to get the fileat 13 sec. Scenario 1 is to show how well the proposedarchitecture works with the smart base stations when themobile clients download the file. Fig.10 shows theaverage result of simulation for each node resides at thedifferent access network based on Scenario 1. It took

0

5

10

15

20

25

WiFi Lte CSMA Lan

Co

nte

nt

Tra

nsf

er

Tim

e (

sec)

Access Network

tcp/ip ccn proposed_ccn proposed_reliable_ccn

Fig. 10: Content Transfer Time in Different AccessNetworks

about 21 seconds for the user devices to download the file



using pure TCP/IP and took about 7.5 seconds when ourproposed architecture is used. However, the contenttransfer time, i.e., response time, is much shorter than thedownload time after the first retrieval because of cachingat smart base stations which follow the CCN approach.When the file downloads happen simultaneously at thefirst request, the channel which connects the contentserver and the router suffers from traffic congestion, sothe large download time is required when simulation isperformed on the conventional CCN. However, with ourproposed architecture, less download time is neededbecause of a better route for content transfer. The simpleapproach forwards the Interest randomly, and thereforesometimes it selects a congested route so it requires somemore time to retrieve the content than the reliableapproach. The proposed reliable approach needs less timebecause of its judicious choice of the route before theactual content transfer begins.

5.2 Scenario 2

Fig. 11 shows the second simulation topology with theLTE access network where a 10 MB file is contained inthe content server and UEs download the filesimultaneously from the content server. While increasingthe number of UEs, we measured the average downloadtime for the content. Fig.12 shows the simulation result

Core Routerouter PGW

Content Server UE(n)

UE(1)

UE(n)

UE(1)eNB(n)

UE

eNB(1)

5Mbps 10Mbps5Mbps

W 5Mbps

Fig. 11: A Simulation Topology with the LTE AccessNetwork

where we present the performance of the conventionalCCN-based architecture and the proposed CCNarchitecture. In this simulation, we tried to figure out thescalability performance of our proposed architecturewhen the number of end users for the same content isincreased. As shown in the figure, as the number of UEsis increased, the performance of our proposed architectureis better than the conventional CCN architecture in termsof average download time because of its network-widebalanced route construction and also the exchange oflimited number of routing information. We have also

15

20

25

30

35

40

45

1 2 3 4 5 6

Co

nte

nt

Tra

nsf

er

Tim

e (

sec)

No of UEs

ccn

proposed_ccn

proposed_reliable_ccn

Fig. 12: Content Transfer Time for Different Number ofUEs

measured the performance of reachability and continuityof our proposed architecture in terms of content transfertime, which implies that how fast UEs can retrieve thecontent in a mobile environment where the UE moves at aspeed of 20 m/s from one SBS to another SBS. A singleUE was moved up to 5 SBS during the time of 10MBcontent transfer. Fig.13 shows that our proposedarchitecture is much more responsive than theconventional CCN approach because it retrieves thecontent at the new SBS before the original handover tothe new SBS occurred.

15

20

25

30

35

40

45

50

55

60

65

70

75

80

85

90

95

100

1 2 3 4 5

Co

nte

nt

Tra

nsf

er

Tim

e (

sec)

eNB

ccn proposed_reliable_ccn

Fig. 13: Content Transfer Time for Different Number ofeNBs

6 Concluding Remarks

In this paper, we proposed a possible architecture,necessary components, and related mechanisms formultimedia content delivery in the wireless environment,which is based on content-centric networking. The keycomponents of the architecture include smart base




stations, smart routers, and content access mechanisms.The proposed architecture can provide multimedia datadelivery efficiently and therefore reduce the response timesignificantly. We also proposed a routing approach thatconstructs a route without the global network-wideinformation and a dependency on the central node andalso drastically reduces the forwarding databaseinformation. In addition, we proposed a smart handoverapproach to provide seamless session continuity andreachability for the end user. We presented varioussimulation results to show that the proposed architectureand mechanisms work well in the wireless network.

Acknowledgement

This research was funded by the MSIP (Ministry ofScience, ICT & Future Planning), Korea in the ICT R &D Program 2014. This work was supported by HankukUniversity of Foreign Studies Research Fund of 2015.

References

[1] T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K. H.Kim, S. Shenker, and I. Stoica, ”A dataoriented (and beyond)network architecture”, SIGCOMM Comput. Commun. Rev.,37, 181-192, 2007.

[2] C. Dannewitz, D. Kutscher, B. Ohlman, S. Farrell, B.Ahlgren, and H. Karl, ”Network of information (netinf) -an information-centric networking architecture”, ComputerCommunications, 2013.

[3] C. Dannewitz, J. Golic, B. Ohlman, and B. Ahlgren, ”Securenaming for a network of information”, in INFOCOM IEEEConference on Computer Communications Workshops, 2010.

[4] M. D’Ambrosio, C. Dannewitz, H. Karl, and V. Vercellone,MDHT: A hierarchical name resolution service forinformation-centric networks,” in Proc. ACM SIGCOMMWorkshop on ICN, 2011.

[5] D. Trossen and G. Parisis, ”Designing and realizingan information-centric internet”, IEEE CommunicationsMagazine,50, July 2012.

[6] P. Jokela, A. Zahemszky, C. Esteve Rothenberg, S. Arianfar,and P. Nikander, ”LIPSIN: line speed publish/subscribe inter-networking”, SIGCOMM Comput. Commun. Rev.,39, 195-206, 2009.

[7] DiBenedetto S, Papadopoulos C, Massey D., ”Routingpolicies in named data networking”, Proceedings of the ACMSIGCOMM Workshop on Information-centric Networking(ICN, 11), 2011.

[8] G. Carofiglio, G. Morabito, L. Muscariello, I. Solis, M.Varvello, ”From content delivery today to information centricnetworking”, Computer Networks,57, 3116-3127, November2013.

[9] Vasilis Sourlas, Paris Flegkas, Leandros Tassiulas, ”Anovel cache aware routing scheme for Information-CentricNetworks”, Computer Networks,59, 44-61, February 2014.

[10] Marica Amadeo, Antonella Molinaro, Giuseppe Ruggeri,”E-CHANET: Routing, forwarding and transport inInformation-Centric multihop wireless networks,” ComputerCommunications,36, 792-803, April 2013.

[11] Haesung Hwang, Shingo Ata, Masayuki Murata, ”ResourceName-Based Routing in the Network Layer”, Journal ofNetwork and Systems Management,22, 1-22, January 2014.

[12] Pavlou, George and Wang, Ning and Chai,WeiKoong and Psaras, Ioannis, ”Internet-scale contentmediation in information-centric networks”, annals oftelecommunications,68, 167-177, April 2013.

[13] V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass,N.H. Briggs, and R. L. Braynard, ”Networking named content”,in Proc. 5th ACM CoNEXT, 2009.

[14] Yan ZHANG, Tao HUANG, Jiang LIU, Jian-ya CHEN,Yun-jie LIU, ”Reverse-trace routing scheme in contentcentric networking”, The Journal of China Universities ofPosts and Telecommunications,20, 22-29, October 2013.

[15] Liang Sun and Fei Song and Dong Yang and YajuanQin, DHR-CCN, ”Distributed Hierarchical Routing forContent Centric Network”, Journal of Internet Services andInformation Security (JISIS),3, 71-82, February 2013.

[16] Chengming Li, Kouji Okamura, Wenjing Liu, ”AntColony Based Forwarding Method for Content-CentricNetworking”, 2013 27th International Conference onAdvanced Information Networking and ApplicationsWorkshops, 306-311, 2013.

[17] Shanbhag S, Schwan N, Rimac I, ”SoCCeR: Servicesover content centric routing”, Proceedings of the ACMSIGCOMM Workshop on Information-centric Networking(ICN:11), Aug. 2011.

[18] S. Eum, K. Nakauchi, M. Murata, Y. Shoji, N. Nishinaga,”Potential based routing as a secondary best-effort routingfor Information Centric Networking (ICN)”, ComputerNetworks,57, 3153-3164, November 2013.

[19] Bolla, R. Rapuzzi, and M. Repetto., ”A user-centricmobility framework for multimedia interactive applications”,In Proceedings of the 6th international conferenceon Symposium on Wireless Communication Systems(ISWCS’09). 2009.

[20] Jihoon Lee, Daeyoub Kim, ”Proxy-assisted content sharingusing content centric networking (CCN) for resource-limited mobile consumer devices”, IEEE Trans. ConsumerElectronics,57, 477-483, 2011.

[21] A. Zelenkauskaite and B. Simoes, ”Big data throughcross-platform interest-based interactivity”, InternationalConference on Big Data and Smart Computing, January2014.

[22] Z. Wenrong, Y. Yang, and B. Luo, ”Access control for bigdata using data content”, IEEE International Conference onBig Data, October 2013.



Mahfuzur RahmanBosunia is a Ph.D. candidateat the Department ofComputer & InformationCommunicationsEngineering, HankukUniv. of Foreign Studies,Korea. He is a member of theComputer CommunicationsLaboratory. He received the

B.Sc. and M.Sc. degrees in Computer Science &Engineering from Univ. of Dhaka, Bangladesh in 2010and 2012, respectively. His recent research interestsinclude communications networks, future networks, 5Gtechnologies, mobile multimedia systems, cooperativecommunications, and device-to-device communications.

Anbin Kim is currentlywith Ericsson-LG asa member of Research Staff.He received his B.S. and M.S.degrees in Information andCommunications Engineeringfrom Hankuk Universityof Foreign Studies, Korea, in2011 and 2014, respectively.He has been involved in

various industry projects. His research interests are inthe areas of computer networks, future networks,LTE/LTE-A, 5G technologies, QoS/QoE, multimediaservices, and CCN/CDN.

Daniel P. Jeong iswith Hankuk Academyof Foreign Studies, Korea andhas been involved in the workrelated to computer scienceand engineering. His currentresearch interests includecomputer networks, computeralgorithms, multimediaservices and applications,

embedded systems, mobile communications, and networksecurity.

Chanhong Parkreceived his B.S.degree in Information &Communications Engineeringfrom Hankuk Universityof Foreign Studies, Korea,in 2012, and he is currently aM.S. student in Computer andInformation CommunicationsEngineering at Hankuk

University of Foreign Studies, Korea. He has participatedin various research projects. His research interestsinclude content-centric networking, mobile networks,LTE/LTE-A, 5G communications, multimediaapplications, and future networks.

Seong-Ho Jeong receivedhis Ph.D. degree in Electricaland Computer Engineeringfrom Georgia Instituteof Technology, Atlanta, USA.He worked for Electronicsand TelecommunicationsResearch Institute, Korea, asSenior Member of ResearchStaff from 1990 to 2001. He

is currently Professor of Department of Information andCommunications Engineering at Hankuk University ofForeign Studies, and has worked on various industryprojects as Principal Investigator. His recent researchinterests include communications systems, multimediaapplications & services, wireless/mobile networks,QoS/QoE, future networks, 5G technologies, performanceevaluation, and CCN/CDN/SDN. He has contributedto standardization in various standards developingorganizations including IETF, ITU-T, and 3GPP. He iscurrently Vice-Chairman and WP2 Chairman of ITU-TSG16, a lead study group in multimedia systems, servicesand applications. He is also Vice-President of The KoreanInstitute of Information Scientists and Engineersand Executive Director of The Korean Institute ofCommunications and Information Sciences.



enhanced multimedia data delivery based on content-centric ... · model, services and contents are...

Documents