Cart (Loading....) | Create Account
Close category search window
 

Efficient call admission control and scheduling technique for GPRS using genetic algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Thilakawardana, S. ; Centre for Commun. Syst. Res., Surrey Univ., Guildford, UK ; Tafazolli, R.

In future wireless packet networks, it is anticipated that a wide variety of data applications, ranging from WWW browsing to Email, and real time services like packetized voice and videoconference will be supported with varying levels of QoS. Therefore there is a need for packet and service scheduling schemes that effectively provide QoS guarantees and also are simple to implement. This paper describes a novel dynamic admission control and scheduling technique based on genetic algorithms, focusing on static and dynamic parameters of service classes. A performance comparison of this technique on a GPRS system is evaluated against data services and also a traffic mix comprising voice and data.

Published in:

Vehicular Technology Conference, 2004. VTC 2004-Spring. 2004 IEEE 59th  (Volume:5 )

Date of Conference:

17-19 May 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.