A Novel Structure and Access Mechanism for Mobile Data Broadcast in Digital Ecosystems

Waluyo, Agustinus Borgy; Rahayu, Wenny; Taniar, David; Scrinivasan, Bala

doi:10.1109/tie.2009.2035457

Cited by 82 publications

(29 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In mobile computing environments, wireless broadcasting has been widely adopted for delivering information to a large number of users due to its scalability benefit [12][13][14][15]. In a wireless broadcasting system, the server periodically broadcasts data objects through the wireless broadcasting channel in a pre-scheduled sequential order.…”

Section: Related Workmentioning

confidence: 99%

Efficient Processing of Spatial Range Queries on Wireless Broadcast Streams

In¹,

Jung²,

Youn³

et al. 2014

IJDMS

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient Processing of Spatial Range Queries on Wireless Broadcast Streams

In¹,

Jung²,

Youn³

et al. 2014

IJDMS

View full text Add to dashboard Cite

show abstract

“…Important features of such applications include the security, capability to be self-organized, decentralized, scalable, and sustainable [3][4][5][6]. P2P computing systems offer many advantages of decentralized distributed systems but suffer from availability and reliability.…”

Section: Introductionmentioning

confidence: 99%

P2P Data Replication: Techniques and Applications

Spaho

Barolli

Xhafa

et al. 2015

Modeling and Processing for Next-Generation Big-Data Technologies

View full text Add to dashboard Cite

Abstract. Peer-to-Peer (P2P) computing systems offer many advantages of decentralized distributed systems but suffer from availability and reliability. In order to increase availability and reliability, data replication techniques are considered commonplace in P2P computing systems. Replication can be seen as a family of techniques. Full documents or just chunks can be replicated. Since the same data can be found at multiple peers, availability is assured in case of peer failure. Consistency is a challenge in replication systems that allow dynamic updates of replicas. Fundamental to any of them is the degree of replication (full vs. partial), as well as the source of the updates and the way updates are propagated in the system. Due to the various characteristics of distributed systems as well as system's and application's requirements, a variety of data replication techniques have been proposed in the distributed computing field. One important distributed computing paradigm is that of P2P systems, which distinguish for their large scale and unreliable nature. In this chapter we study some data replication techniques and requirements for different P2P applications. We identify several contexts and use cases where data replication can greatly support collaboration. This chapter will also discuss existing optimistic replication solutions and P2P replication strategies and analyze their advantages and disadvantages. We also propose and evaluate the performance of a fuzzy-based system for finding the best replication factor in a P2P network.

show abstract

“…In order to realize ecosystems [1], it is significant to reduce the total electric power consumption of servers in addition to achieving the performance and reliability objectives like response time. By abstracting essential properties which dominate the power consumption of a server from the experimental results, power consumption models of a server to perform application processes are discussed at macro level [2][3][4][5][6].…”

Section: Introductionmentioning

confidence: 99%

Energy-efficient dynamic clusters of servers

et al. 2014

View full text Add to dashboard Cite

Electric power consumed by servers has to be reduced in order to realize green societies. We consider computation (CP) and storage (ST) types of application processes performed on servers in this paper, where CPU and storage drives are mainly used, respectively. In the storage-and computation-based power consumption model proposed by the authors, the power consumption rate of a server depends on what types of processes are performed but is independent of how may processes are performed on the server. In the storage-and computation-based processing model, the execution time of an ST process depends on the number of concurrent CP and ST processes but the execution time of a CP process depends on only CP processes and is independent of ST processes. In our previous studies, the energy-aware algorithm is discussed to select a server in a cluster of servers for each request so that the total power consumption of the servers can be reduced. However, a server consumes electric power even if the server is idle, i.e. no process is performed. In this paper, we discuss a dynamic energyaware (DEA) cluster which includes only active servers where at least one process is performed. A server for each request is selected in a dynamic cluster so that the total 123 D. Duolikun et al.power consumption of servers in the cluster can be reduced. We evaluate the DEA algorithm in terms of the total power consumption and average execution time and show the total power consumption can be reduced.

show abstract

A Novel Structure and Access Mechanism for Mobile Data Broadcast in Digital Ecosystems

Cited by 82 publications

References 28 publications

Efficient Processing of Spatial Range Queries on Wireless Broadcast Streams

Efficient Processing of Spatial Range Queries on Wireless Broadcast Streams

P2P Data Replication: Techniques and Applications

Energy-efficient dynamic clusters of servers

Contact Info

Product

Resources

About