Adaptive Multimedia Services in Next-Generation Broadband Wireless Access Network

Singhal, Chetna; Barik, Pradip Kumar

doi:10.4018/978-1-5225-2023-8.ch001

Cited by 9 publications

(10 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As Figure 5 shows, we divide into state patterns by using b now and th. We show the steady state equations obtained from these patterns as Equations ( 1)- (10). With proposed method 1, we assume state transition occurs within an infinitesimally small amount of time Δt .…”

Section: Derivation State-transition Diagrams and State Equationsmentioning

confidence: 99%

“…Some CAC methods considers wireless situation. In these CAC methods, we need to consider handover which connecting flows change cell of wireless because users using streaming application move [8–10]. Moreover, some CAC methods with wireless situation are also controlled in core network as centralised approach [11].…”

Section: Introductionmentioning

confidence: 99%

“…using streaming application move [8][9][10]. Moreover, some CAC methods with wireless situation are also controlled in core network as centralised approach [11].…”

mentioning

confidence: 99%

See 2 more Smart Citations

Three types of calls admission control methods considering seek‐bar operation

Miyata

Ode

2023

IET Communications

View full text Add to dashboard Cite

Many network devices, such as a smartphones and tablets, and streaming services, such as YouTube and Netflix, have become widespread. This causes network‐bandwidth congestion, so users require stable and consistent communication quality. Call admission control (CAC) has been proposed to solve these bandwidth resource problems. Some CACs have been proposed in order to maintain QoS. However, these CAC does not assume user behaviour. If CAC assumes some user behaviour, optimal control parameter derived conventional CAC may change because traffic load change by considering user behaviour. This article assumes that arriving types of flows are of three types: narrowband flows, broadband flow without seek‐bar operation, and broadband flows with seek‐bar operation. Under this assumpution, two CAC methods with single threshold or two thresholds are proposed. With these methods, it is assumed that all arriving flows result in the same user satisfaction when accommodated in a network. Under this assumption, the maximum of each user satisfaction is the same as the maximum number of accommodated flows. Using the call loss probability characteristics of Method 1, the objective function in Method 2 is modified. By using the modified objective function, CAC can be realised while properly accommodating broadband users who have been excessively rejected.

show abstract

Section: Derivation State-transition Diagrams and State Equationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Three types of calls admission control methods considering seek‐bar operation

Miyata

Ode

2023

IET Communications

View full text Add to dashboard Cite

show abstract

“…At the blockchain layer, VaNetChain implements mining as a proof of work (PoW), designating RSUs as miners (mRSUs) that try to solve the block hash calculation by applying the Keccak (https: //keccak.team/keccak.html) or SHA-3 algorithm. This idea goes hand in hand with the proposals that rely on RSUs to perform different computing tasks, taking advantage of computer and connectivity benefits [63]. The number of zeros required at the beginning of the hash is set so that an mRSU takes around 10 seconds to add a new block to the blockchain.…”

Section: Vanetchain: Architecturementioning

confidence: 99%

VaNetChain: A Framework for Trustworthy Exchanges of Information in VANETs Based on Blockchain and a Virtualization Layer

et al. 2020

View full text Add to dashboard Cite

Vehicular ad hoc networks (VANETs) face challenges related to the reliability of the data exchanged and the unstability of the communication links. These shortcomings have hampered the development of the long-awaited applications that would turn roads into a smart environment. We present a framework to deploy such services, in which a virtualization layer ensures means to efficiently deliver messages between vehicles and roadside units (RSUs) and, on top of that, blockchain technology is used to enable features of data integrity, traceability, and reliability that cannot be furnished by existing consensus and reputation mechanisms. A simulation experiment is included to determine the optimal number of RSUs to be installed as supporting infrastructure in a city.

show abstract

“…ACDPD 푖 from (8) includes the cost of handling mobility control messages (CAP 푖 and CHP ℎ ) and the cost of data packet delivery (CDPD 푘 ) from CN to the access layer nodes in the created paths, during the MN's session time. This section describes the parameters in both centralized and decentralized approaches and details these parameters for GTP and PMIP protocols.…”

Section: Acdpd For Individual Mobilementioning

confidence: 99%

Quantitative Comparison of the Efficiency and Scalability of the Current and Future LTE Network Architectures

Karimzadeh

Berg

Schmidt

et al. 2017

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

The core architecture of current mobile networks does not scale well to cope with future traffic demands owing to its highly centralized composition. Typically, it is believed that decentralization of the network architecture would be a sustainable approach to deal with ever growing amount of mobile data traffic. Nevertheless, the decentralization strategy of network architecture has not been properly examined through quantitative performance studies. Given that LTE will be the leading mobile networking technology in the coming 5-10 years, we conduct a hybrid study model to compare performance of current and future (decentralized) LTE network architectures. Particularly, our analysis presents numerical results quantifying impact of the number of attached nodes on the load at network routers and links, on the latency, and on the processing cost of the user's data and control planes. Analytical results demonstrate that decentralization of the LTE network architecture achieves higher performance compared to the current architecture and improves the latency and cost of data packet delivery more than 10 and 6 times, respectively. Furthermore, it is also observed that GTP outperforms PMIP for all studied performance metrics in the decentralized architecture and provides about twofold better latency and cost for data packet delivery and roughly 6 times lower data traffic load on the network routers.

show abstract

Adaptive Multimedia Services in Next-Generation Broadband Wireless Access Network

Cited by 9 publications

References 23 publications

Three types of calls admission control methods considering seek‐bar operation

Three types of calls admission control methods considering seek‐bar operation

VaNetChain: A Framework for Trustworthy Exchanges of Information in VANETs Based on Blockchain and a Virtualization Layer

Quantitative Comparison of the Efficiency and Scalability of the Current and Future LTE Network Architectures

Contact Info

Product

Resources

About