A fast, simple and near-optimal content placement scheme for a large-scale VoD system

He, Jun; Zhao, Xing; Zhao, Baohua

doi:10.1109/iccs.2012.6406174

Cited by 13 publications

(23 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The total amount of budget for external data traffic l 0 Latency for local hit per unit l 1 Latency for in-system hit per unit l 2 Latency for external hit per unit Let indicators y k i and χ k denote whether video content k is prior storage at node i and whether video content k needs to be fetched from the Internet, respectively. Here we assume that the system would never request for any video content clip from the Internet if the clip is local or insystem hit.…”

Section: Request Frequency Of Video Content K In Node I S Kmentioning

confidence: 99%

“…Finally, the original problem (3) of minimizing aggregate latency reduces to the maximizing hit-ratio problem with a fixed in-system video content library, i.e., problem (8). Next, we adopt the α-search approach introduced in [2] to solve the rest problem.…”

Section: A Fast Algorithm For Prior Storing Selected Video Content Himentioning

confidence: 99%

“…In [2], we proved problem (8) is NP-hard. Therefore, the prior storage problem studied in this paper is also NP-hard.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Video Contents Prior Storing Server For Lte Networks

Tsang¹,

Fun²

2015

IJWMN

View full text Add to dashboard Cite

show abstract

Section: Request Frequency Of Video Content K In Node I S Kmentioning

confidence: 99%

Section: A Fast Algorithm For Prior Storing Selected Video Content Himentioning

confidence: 99%

See 1 more Smart Citation

Video Contents Prior Storing Server For Lte Networks

Tsang¹,

Fun²

2015

IJWMN

View full text Add to dashboard Cite

show abstract

“…To improve the acceptance rate of VN and maximize the cost-effectiveness, researchers are concerning the game theory increasingly. But most of them [7][8][9] just consider video request instead of building a general model.…”

Section: Related Workmentioning

confidence: 99%

Dynamic Virtual Network Embedding based on Auction-Game Theory

Liang¹,

Lan²,

Long³

et al. 2015

Proceedings of the 2015 International Conference on Advances in Mechanical Engineering and Industrial Informatics

View full text Add to dashboard Cite

Abstract.To solve the problem of competition among different business sharing the limited substrate network resource, this paper provides a construction model based on auction-game theory. The model regards business as players and business requests as strategy space. Based on this model, a dynamic algorithm of virtual network embedding using auction-game theory is proposed, which can maximize the whole construction effectiveness of the virtual network. The experimental results show that the proposed algorithm has better performance than the existing algorithms, in terms of the whole construction effectiveness, the construction success rate and the occupancy rate of substrate resource.

show abstract

“…Long Term Evolution (LTE) provides wireless communication network of high speed data transmission between mobile phones and data terminals [1,2]. It base on UMTS/HSPA and GSM/EDGE network technologies.…”

Section: Introductionmentioning

confidence: 99%