Designing for Network and Service Continuity in Wireless Mesh Networks

Dutta, Rudra; Pathak, Parth H.

doi:10.1007/978-1-4614-4627-9

Cited by 7 publications

(6 citation statements)

References 128 publications

(166 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this work, installation and storage costs are assumed to be insignificant. This is acceptable because the installation cost of mesh networking nodes is inexpensive in practice [39] and the cost of storage devices is also cheap [40]. We assume that all mesh nodes are stationary as other general mesh nodes.…”

Section: A System Modelmentioning

confidence: 99%

Efficient Cache Placement Strategy in Two-Tier Wireless Content Delivery Network

Sung

Kim

Lim

et al. 2016

IEEE Trans. Multimedia

View full text Add to dashboard Cite

Internet content caching for multimedia services has received much attention mainly in the field of large-scale wired networking as a primary solution to save network resources and improve quality of service (QoS). Rapidly increasing consumption of multimedia content in mobile networks brings a challenge of how to efficiently deliver content in local wireless access networks. Cache embedment in wireless mesh environment is an intriguing attempt to enhance the QoS and service capacity, leading to the question of how to design an efficient content delivery network considering the inherent characteristics of the wireless environment. We propose and investigate an efficient cache placement strategy in novel two-tier wireless content delivery networks, which utilize separate channels for content dissemination and content service. Such a two-tier network system model helps achieve much better content delivery performance with a greatly reduced system design complexity compared to single-tier network system models. Further, we incorporate a delay cost due to contention, which is mainly responsible for performance in shared-medium wireless networks, as a key metric for cache placement under the system model. After formally formulating the cache placement problem, we propose a cross-layer heuristic algorithm and demonstrate its performance compared with an optimal solution by integer linear programming. Simulation results show significant performance improvements by our strategy compared to the performance of existing representative strategies in terms of service delay, packet delivery ratio, and the amount of delivered packets within a given delay deadline.Index Terms-Wireless content delivery network, two-tier architecture, cache placement, contention, cross-layer design.Jihoon Sung works toward a Ph.

show abstract

Section: A System Modelmentioning

confidence: 99%

Efficient Cache Placement Strategy in Two-Tier Wireless Content Delivery Network

Sung

Kim

Lim

et al. 2016

IEEE Trans. Multimedia

View full text Add to dashboard Cite

show abstract

“…. All the real-time and mission-critical applications require the continuity of service as an important figure-of-merit (Pathak et al, 2012). Xue (1998) first considered the reliability parameter in the QPP and proposed reliable quickest path computation for different data amount.…”

Section: Introductionmentioning

confidence: 99%

Risk-energy aware service level agreement assessment for computing quickest path in computer networks

Sharma

Kumar

2019

IJRS

View full text Add to dashboard Cite

In this paper, a new variant of the Quickest Path Problem (QPP) is addressed with additional factors of risk and energy which leads to the evaluation of Risk-Energy Constrained Quickest Path Problem (REQPP) computation. In REQPP, risk is based on lag-time or delay and energy necessary for the transmission between two adjacent nodes. The formulation of this problem presents a realistic path computation for critical applications. The success of REQPP is measured by defining a Service Level Agreement (SLA). The proposed algorithm is able to solve the risk-energy constrained REQPP for the continuity of communication. SLA fulfills the needs of multi-constrained path whereas its time-complexity is of the order of Dijkstra's algorithm. Finally, in the end, variation of penalty time and risk variation helps to find the high-performance value of the allowed delay time toward success of SLA.

show abstract

“…is QPP model was also extended toward the building evacuation problem by Hamacher and Tjandra [15] who propose a building evacuation problem. e QPP model was also extended toward the continuity of critical applications where it has been considered as an important figure of merit [16]. e network is associated with certain uncertainties which may lead to service failure, and to deal with these failures, reliability theory has been used in [17] and the reliable QPP model has been proposed.…”

Section: Introductionmentioning

confidence: 99%

A Framework for Risk-Energy Aware Service-Level Agreement Provisioning (RESP) for Computing the Quickest Path

Sharma

Kumar

2019

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

This paper involved the computation of quickest paths with the help of service-level agreement (SLA) and energy constraints. The consideration of these constraints helps to propose a novel system model which computes the path to strengthen the continuity and criticality of the data transmission. The proposed risk-energy aware SLA provisioning (RESP) system model incorporates the research gaps of the existing risk assessment models in the literature without any increase in time complexity. The formulation of RESP shows the usefulness in the critical applications. The results show that the computation of risk-provisioned path gives the SLA satisfied paths and has a great impact of variations in the data traffic. The performance of the proposed algorithm has been indicated in terms of different performance parameters such as mean s−t paths, average hop counts, and average energy efficiency. Simulation result implies that as data traffic increases, the number of the risk‐provisioned s−t paths decreases whereas corresponding average hop counts and average energy efficiency increases.

show abstract

Designing for Network and Service Continuity in Wireless Mesh Networks

Abstract: The paradigm of wireless mesh networks has matured in the last decade after extensive research and development. As opposed to the time of their inception, current mesh networks are expected to deliver carrier-grade access services to their users. With the increasing expectations,

Cited by 7 publications

References 128 publications

Efficient Cache Placement Strategy in Two-Tier Wireless Content Delivery Network

Efficient Cache Placement Strategy in Two-Tier Wireless Content Delivery Network

Risk-energy aware service level agreement assessment for computing quickest path in computer networks

A Framework for Risk-Energy Aware Service-Level Agreement Provisioning (RESP) for Computing the Quickest Path

Contact Info

Product

Resources

About