(Paper) P2P VIDEO BROADCAST BASED ON PER-PEER TRANSCODING AND ITS EVALUATION ...Naoki Shibata
Shibata, N., Yasumoto, K., and Mori, M.: P2P Video Broadcast based on Per-Peer Transcoding and its Evaluation on PlanetLab, Proc. of 19th IASTED Int'l. Conf. on Parallel and Distributed Computing and Systems (PDCS2007), pp. 478-483, (November 2007).
http://ito-lab.naist.jp/themes/pdffiles/071121.shibata.pdcs2007.pdf
We have previously proposed a P2P video broadcast method called MTcast for simultaneously delivering video to user peers with different quality requirements. In this paper, we design and implement a prototype system of MTcast and report the results of its performance evaluation in the real Internet environment. MTcast relies on each peer to transcode and forward video to other peers. We conducted experiments on 20 PlanetLab nodes, evaluated startup delay and recovery time from peer leaving/failure, and confirmed that MTcast achieves practical performance in a real environment.
Resource-Oriented Architecture offers advantages over other web-service architectures. It is based on a simple, scalable and highly standardised application-level protocol. Multimedia content is commonly managed using the MPEG-7. The MPEG-7 is a standard for representing audiovisual information that satisfies specific requirements based on syntax, semantic and decoding. Content descriptions under MPEG-7 can be organised and characterized without ambiguity. The MPEG-7 eXperimental Model (XM) includes the best performing tools for MPEG-7 normative and non-normative elements. In this paper, multimedia content is managed using the MPEG-7 eXperimental Model functionalities and provided using web-services technology. RESTful principles are the guidelines for achieving multimedia content storage and retrieval. Quantitative evaluation of the proposed web services has shown that this approach has better performance, in term of retrieval speed and storage space
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSijwmn
Wireless sensor networks are useful for streaming multimedia in infrastructure-free and hazardous environments. However, these networks are quite different from their wired counterpart and are composed of nodes with constrained bandwidth and energy. Multiple-path transmission is one of the methods for ensuring QoS routing in both wired and wireless environment. Directed diffusion, a well known wireless sensor network protocol, only routes packets through a single path, which barely meets the throughput requirement of multimedia data. Instead, we propose a multipath algorithm based on directed diffusion that reinforces multiple routes with high link quality and low latency. This algorithm retains the merits of the original directed diffusion algorithms, including its energy efficiency and scalability. A hybrid metric of link quality and latency is used as the criterion for path selection. In order to select disjoint paths, we propose a scheme for reinforced nodes to respond negatively to multiple reinforcement messages. We use the NS-2 simulation tool with video trace generated by Multiple Description Coding (MDC) to evaluate the performance. The results show that our algorithm gives better throughput and delay performance, i.e higher video quality, than standard directed diffusion that transmits over a single path, with low overheads and energy consumption.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
(Paper) P2P VIDEO BROADCAST BASED ON PER-PEER TRANSCODING AND ITS EVALUATION ...Naoki Shibata
Shibata, N., Yasumoto, K., and Mori, M.: P2P Video Broadcast based on Per-Peer Transcoding and its Evaluation on PlanetLab, Proc. of 19th IASTED Int'l. Conf. on Parallel and Distributed Computing and Systems (PDCS2007), pp. 478-483, (November 2007).
http://ito-lab.naist.jp/themes/pdffiles/071121.shibata.pdcs2007.pdf
We have previously proposed a P2P video broadcast method called MTcast for simultaneously delivering video to user peers with different quality requirements. In this paper, we design and implement a prototype system of MTcast and report the results of its performance evaluation in the real Internet environment. MTcast relies on each peer to transcode and forward video to other peers. We conducted experiments on 20 PlanetLab nodes, evaluated startup delay and recovery time from peer leaving/failure, and confirmed that MTcast achieves practical performance in a real environment.
Resource-Oriented Architecture offers advantages over other web-service architectures. It is based on a simple, scalable and highly standardised application-level protocol. Multimedia content is commonly managed using the MPEG-7. The MPEG-7 is a standard for representing audiovisual information that satisfies specific requirements based on syntax, semantic and decoding. Content descriptions under MPEG-7 can be organised and characterized without ambiguity. The MPEG-7 eXperimental Model (XM) includes the best performing tools for MPEG-7 normative and non-normative elements. In this paper, multimedia content is managed using the MPEG-7 eXperimental Model functionalities and provided using web-services technology. RESTful principles are the guidelines for achieving multimedia content storage and retrieval. Quantitative evaluation of the proposed web services has shown that this approach has better performance, in term of retrieval speed and storage space
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSijwmn
Wireless sensor networks are useful for streaming multimedia in infrastructure-free and hazardous environments. However, these networks are quite different from their wired counterpart and are composed of nodes with constrained bandwidth and energy. Multiple-path transmission is one of the methods for ensuring QoS routing in both wired and wireless environment. Directed diffusion, a well known wireless sensor network protocol, only routes packets through a single path, which barely meets the throughput requirement of multimedia data. Instead, we propose a multipath algorithm based on directed diffusion that reinforces multiple routes with high link quality and low latency. This algorithm retains the merits of the original directed diffusion algorithms, including its energy efficiency and scalability. A hybrid metric of link quality and latency is used as the criterion for path selection. In order to select disjoint paths, we propose a scheme for reinforced nodes to respond negatively to multiple reinforcement messages. We use the NS-2 simulation tool with video trace generated by Multiple Description Coding (MDC) to evaluate the performance. The results show that our algorithm gives better throughput and delay performance, i.e higher video quality, than standard directed diffusion that transmits over a single path, with low overheads and energy consumption.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Ölförderung in Bürstadt Information der Fa. Rhein Petroleum im Umweltausschußerhard renz
In Bürstadt beabsichtigt die Firma Rhein Petroleum Öl zu fördern. In der öffentlichen Sitzung des Umweltausschußes wurden die Ergebnisse der seismischen Untersuchungen vorgestellt.
http://www.sonnenfluesterer.de/2013/09/olforderung-in-burstadt/
CCNxCon2012: Session 2: DASH over CCN: A CCN Use-Case for a SocialMedia Base...PARC, a Xerox company
DASH over CCN: A CCN Use-Case for a SocialMedia Based Collaborative Project
Yaning Liu, Joost Geurts (JCP-Consult, France), Benjamin Rainer, Stefan Lederer, Christopher Muller, Christian Timmerer (Alpen-Adria-Universit Klagenfurt)
Ölförderung in Bürstadt Information der Fa. Rhein Petroleum im Umweltausschußerhard renz
In Bürstadt beabsichtigt die Firma Rhein Petroleum Öl zu fördern. In der öffentlichen Sitzung des Umweltausschußes wurden die Ergebnisse der seismischen Untersuchungen vorgestellt.
http://www.sonnenfluesterer.de/2013/09/olforderung-in-burstadt/
CCNxCon2012: Session 2: DASH over CCN: A CCN Use-Case for a SocialMedia Base...PARC, a Xerox company
DASH over CCN: A CCN Use-Case for a SocialMedia Based Collaborative Project
Yaning Liu, Joost Geurts (JCP-Consult, France), Benjamin Rainer, Stefan Lederer, Christopher Muller, Christian Timmerer (Alpen-Adria-Universit Klagenfurt)
Algorithmic Construction of Optimal and Load Balanced Clusters in Wireless Se...M H
This paper proposes a clustering algorithm - Ba-lanced Minimum Radius Clustering (BMRC) - for use in large scale, distributed Wireless Sensor Networks (WSN). Cluster balancing is an intractable problem to solve in a distributed manner, and distribution is important, by reason of both avoiding specialised node vulnerability and minimising message overhead.The BMRC algorithm described here distributes several of the cluster balancing functions to the cluster-heads. In proposing this algorithm, several tentative claims have been made for it, namely that it is suitable for arbitrary number of cluster heads; that its pecifies a way to elect cluster heads and use them to create the local models; that it accomplishes optimal balanced clusters in distributed manner; that it is scalable and it uses the number-of-hops as a clustering parameter; that it is energy efficient. These claims were studied and verified by simulation.
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...GiselleginaGloria
Wireless mesh networking has transpired as a gifted technology for potential broadband wireless access. In a communication network, wireless mesh network plays a vital role in transmission and are structured in a mesh topology. The coordination of mesh routers and mesh clients forms the wireless mesh networks which are routed through the gateways. Wireless mesh networks uses IEEE 802.11 standards and has its wide applications broadband home networking and enterprise networking deployment such as Microsoft wireless mesh and MIT etc. A professional Qos provisioning in intra cluster packet level resource allocation for WMN approach takes power allocation, sub carrier allocation and packet scheduling. This approach combines the merits of a Karush-Kuhn-Tucker (KKT) algorithm and a genetic algorithm (GA) based approach. The KKT algorithm uses uniform power allocation over all the subcarriers, based on the optimal allocation criterion. The genetic algorithm is used to generate useful solutions to optimization and search problems and it is also used for search problems. By combining the intrinsic worth of both the approaches, it facilitates effective QOS provisioning at the packet level. It is concluded that, this approach achieves a preferred stability between system implementation and computational convolution.
International Journal of Computational Engineering Research(IJCER) ijceronline
nternational Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
A Low Control Overhead Cluster Maintenance Scheme for Mobile Ad hoc NETworks ...IDES Editor
Clustering is an important research area for
mobile ad hoc networks (MANETs) as it increases the
capacity of network, reduces the routing overhead and
makes the network more scalable in the presence of both
high mobility and a large number of mobile nodes. In
clustering the clusterhead manage and store recent routing
information. However the frequent change of clusterhead
leads to loss of routing information stored, changes the route
between two nodes, affects the performance of the routing
protocol and makes the cluster structure unstable.
Communication overhead in terms of exchanging messages
is needed to elect a new clusterhead. The goal then would be
to keep the clusterhead change as least as possible to make
cluster structure more stable, to prevent loss of routing
information which in turn improve the performance of
routing protocol based on clustering. This can be achieved
by an efficient cluster maintenance scheme. In this work, a
novel clustering algorithm, namely Incremental
Maintenance Clustering Scheme (IMS) is proposed for
Mobile Ad Hoc Networks. The goals are yielding low
number of clusterhead and clustermember changes,
maintaining stable clusters, minimizing the number of
clustering overhead. Through simulations the performance
of IMS is compared with that of least cluster change (LCC)
and maintenance scheme of Cluster Based Routing Protocol
(CBRP) in terms of the number of clusterhead changes,
number of cluster-member changes and clustering overhead
by varying mobility and speed. The simulation results
demonstrate the superiority of IMS over LCC and
maintenance scheme of CBRP.
Cache Performance Analysis of Virtualized Router on Virtual Content-Centric N...josephjonse
Content-centric networking (CCN) is one of the major proposals for realizing information-centric networking. CCN routers cache forwarded data in a buffer memory called the ContentStore (CS). Virtual content-centric networking (VCCN), which enables the construction of multiple virtual networks (called VCCN slices) on a content-centric network, has been recently proposed. When multiple VCCN slices are constructed, the performance of each VCCN slice and that of the entire network are strongly affected by the CCN routers' CS allocation to VCCN router instances in VCCN slices. In this paper, we analyze the effects of CS allocation methods and content request patterns in VCCN slices on the performance of each VCCN slice and that of the entire network. Through several numerical examples, we show that when content request patterns are heterogeneous, a hybrid resource allocation method is effective in terms of both network fairness for VCCN slices and overall network performance.
Cache performance analysis of virtualized router on virtual content centric n...ijngnjournal
Content-centric networking (CCN) is one of the major proposals for realizing information-centric networking. CCN routers cache forwarded data in a buffer memory called the ContentStore (CS). Virtual content-centric networking (VCCN), which enables the construction of multiple virtual networks (called VCCN slices) on a content-centric network, has been recently proposed. When multiple VCCN slices are constructed, the performance of each VCCN slice and that of the entire network are strongly affected by the CCN routers' CS allocation to VCCN router instances in VCCN slices. In this paper, we analyze the effects of CS allocation methods and content request patterns in VCCN slices on the performance of each VCCN slice and that of the entire network. Through several numerical examples, we show that when content request patterns are heterogeneous, a hybrid resource allocation method is effective in terms of both network fairness for VCCN slices and overall network performance.
CFMS: A CLUSTER-BASED CONVERGECAST FRAMEWORK FOR DENSE MULTI-SINK WIRELESS SE...ijwmn
Convergecast is one of the most challenging tasks in Wireless Sensor Networks (WSNs). Indeed, this data
collection process must be conducted while copying with packet collisions, nodes’ congestion or data
redundancy. These issues always result in energy waste which is detrimental to network efficiency and
lifetime. This paper is aimed to address these problems in large-scale multi-sink WSNs. Inspired by our
previous work MSCP, we designed a lightweight protocol stack that seamlessly combines clustering, pathvector routing, sinks’ duty cycling, data aggregation and transmission scheduling in order to minimise
message overhead and packet losses. Simulation results show that this solution can mitigate delay while
significantly increasing packet delivery and network lifetime.
Similar to CCNxCon2012: Poster Session:On a Novel Joint Replicating and Caching Strategy for Content-Centric Networks (20)
Enterprise Gamification – Exploiting People by Letting Them Have Fun [PARC Fo...PARC, a Xerox company
PARC Forum Presents: Using game mechanics and game design techniques in non-game contexts like business applications have shown significant increases in user engagement, and increased the ROI and other metrics. In this talk we will learn what business can learn from Angry Birds. We will shatter stereotypes about games, show what gamified applications you already use, give you some facts and figures on the impact of gamification on results, and highlight examples in the corporate world.
Mario Herger is a Senior Innovation Strategist at SAP Labs in Palo Alto, California and Global Head of the Gamification Initiative at SAP. He has worked in the past as developer, development manager, architect, product manager and other roles on a series of new SAP products. He has been driving communities for more than 15 years, including innovative topics at SAP, like Visual Composer, Business Process Experts, mobile and gamification.
In his work as head of the Gamification Initiative at SAP he has encountered and supported gamification efforts in the enterprise from multiple levels and departments, like Sustainability, On Demand, Mobile, HR, Training & Education, Banking etc. He has driven the awareness around gamification inside and outside SAP by organizing and leading innovation events around this topic, holding full day gamification workshops, working with gamification platform- & service-providers and game studios, consulting and advising organizations, and by incorporating gamification into SAP's strategy.
He has a Ph.D. in Chemical Engineering from the Vienna University of Technology and an undergraduate degree in International Business Management from the Vienna University of Economy.
He recently played through all levels of the iPad game Air Attack and currently works with his five year old son on reaching the final level of Angry Birds in Space.
CCNxCon2012: Session 2: Network Management Framework for Future Internet Scen...PARC, a Xerox company
Network Management Framework for Future Internet Scenarios
Rui L Aguiar, Daniel Corujo (Instituto de Telecomunicações, Universidade de Aveiro), Ivan Vidal Fernandez, Jaime Garcia (Universidade Carlos III de Madrid)
CCNxCon2012: Poster Session: Cache Coordination in a HierarchicalPARC, a Xerox company
Cache Coordination in a Hierarchical Network: Early Experiences with CCNx
Giovanna Carofiglio, Diego Perino, Girolamo Piccinni (Bell Labs, Alcatel-Lucent)
CCNxCon2012: Poster Session: A Backward-Compatible CCNx Extension for Improve...PARC, a Xerox company
A Backward-Compatible CCNx Extension for Improved Support for Notifications and Content-Based Addresses
Antonio Carzaniga, Michele Papalini (University of Lugano, Switzerland), Alexander L. Wolf (Imperial College London)
CCNxCon2012: Session 3: Content-centric VANETs: routing and transport issuesPARC, a Xerox company
Content-centric VANETs: routing and transport issues
Marica Amadeo, Claudia Campolo, Antonella Molinaro (University Mediterranea of Reggio Calabria, Italy)
CCNxCon2012: Session 4: Disjoint Path Discovery in CCN NetworksPARC, a Xerox company
Disjoint Path Discovery in CCN Networks
Asanga Udugama, Xinyi Zhang, Yasir Zaki, Carmelita Goerg (University of Bremen), Andreas Timm-Giel (Hamburg University of Technology)
CCNxCon2012: Session 5: Steaming up CCN against TCP
CCNxCon2012: Poster Session:On a Novel Joint Replicating and Caching Strategy for Content-Centric Networks
1. L.GHAZZAI 1 Y.HADJADJ-AOUL 1 A.KSENTINI 1 G.BICHOT 2 S.GOUACHE 2 A.BELGHIT 3
1 University of Rennes 1 2 Technicolor 3 University of Manouba
On a novel joint replicating and caching strategy for
content centric networks
Portal Device with caching
ABSTRACT
support (e.g. Router,
DSLAM, )
STB with possible
caching support
The rise of popularity of video services has resulted in increased
volumes of network traffic that, in turn, has created bottlenecks
in the networks causing degradations of the perceived quality.
CDN The CCN paradigm is considered as one of the most
surrogate
prominent solution to address such issue. However, the
cascaded LRU caches introduced by CCN presents some
limits. In this work, we first analyze such limits. Then, we
propose a new caching and replication strategy to optimize
resources utilization and to maximize the number of different
chunks existing within the intra domain.
Fig.1 Intra-‐Domain Architecture
Fig.2 Popularity vs. Number of Nodes
Number of Nodes
Content replication vs. caching in CCN 18
16
Early, in-network caching was proposed as a mean to get the 14
contents closer to the end-users. With the shift towards 12
content-centric networking (CCN), this logic is pushed further.
10
CCN introduces two distinct techniques: contents caching and
8
replication. However, one should consider the mutual impact
existing between these techniques. Indeed, the benefits of 6
contents replication can be completely cancelled with a 4
bad caching technique (see Fig. 3). 2
Popularity
0
0 5E-‐11 1E-‐10 1,5E-‐10 2E-‐10 2,5E-‐10
Fig.3 Popularity vs. Delay
0,8
Limits of existing approaches
Delay
0,7
0,6
CCNs allow popular content to be present in many nodes to make
0,5 the content closer to the end users (see Fig. 2). However, the
0,4 use of LRU as a caching strategy deceases the duration of
0,3 the contents presence in caches.
0,2 Some changes should be introduced to the classical CCN
0,1 architecture by focusing on: (i) reducing the amount of
0 replica in the intra-domain; (ii) storing as many various data
Popularity
0 5E-‐11 1E-‐10 1,5E-‐10 2E-‐10 2,5E-‐10 as possible.
A Combined caching and replication Each CCN node, in the path to the destination, stores the chunk
using this probability.
technique
The proposed caching technique, combines the benefits of
Initially affect to each piece of data (i.e. chunk), to be Least Recently Used (LRU) and Least Frequently Used (LFU)
transmitted, a nonzero storage probability depending notably on solutions.
the chunk s popularity P.
If a CCN node decides to store a particular chunk, it puts
P0 = min [ max (( i) , 0) , 1]
P= its storage probability to zero (or reduce the probability) to
PK = min[max(PK-1 + S /N , 0) , 1]
where i : popularity of the chunk i. S = 1 if the chunk have been avoid multiple duplication of the same content. Otherwise,
stocked, 0 else. the probability is increased.
Acknowledgement The work is partially supported by the national French project ANR VERSO ViPeer.