Your SlideShare is downloading. ×
A resource allocation scheme for scalable video multicast in wi max relay networks
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

A resource allocation scheme for scalable video multicast in wi max relay networks

272

Published on


Bulk Projects For sale

IEEE 2009-10-11-12-13 PAPERS AVILABLE.

We are providing low cost project for final year student projects.

Solved 2010 -2011 -2012 - 2013 IEEE in all the domain

Mobile : 8940956123

E-Mail : ambitlick@gmail.com,

INNOVATIVE TITLES ARE ALSO WELLCOME TO DO WITH US


For All BE/BTech, ME/MTech, MSC/MCA/MS , and diplamo graduates

PROJECT SUPPORTS & DELIVERABLES

•Project Abstract
•IEEE Paper
•PPT / Review Details
•Project Report
•Working Procedure in Video
•Screen Shots
•Materials & Books in CD
•Project Certification

Published in: Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
272
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
4
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  1. Ambit lick Solutions Mail Id: Ambitlick@gmail.com , Ambitlicksolutions@gmail.Com A Resource Allocation Scheme for Scalable Video Multicast in WiMAX Relay Networks This paper proposes the first resource allocation scheme in the literature to support scalable-video multicast for WiMAX relay networks. We prove that when the available bandwidth is limited, the bandwidth allocation problems of 1) maximizing network throughput and 2) maximizing the number of satisfied users are NP-hard. To find the near-optimal solutions to this type of maximization problem in polynomial time, this study first proposes a greedy weighted algorithm, GWA, for bandwidth allocation. By incorporating table-consulting mechanisms, the proposed GWA can intelligently avoid redundant bandwidth allocation and thus accomplish high network performance (such as high network throughput or large number of satisfied users). To maintain the high performance gained by GWA and simultaneously improve its worst case performance, this study extends GWA to a bounded version, BGWA, which guarantees that its performance gains are lower bounded. This study shows that the computational complexity of BGWA is also in polynomial time and proves that BGWA can provide at least 1/ρ times the performance of the optimal solution, where rho is a finite value no less than one. Finally, simulation results show that the proposed BGWA bandwidth allocation scheme can effectively achieve different performance objectives with different parameter settings.

×