With the rapid development of Web-based technologies, our daily life has become intensely involved with Internet. Combined with the maturity of wireless network technologies, the transmission of multimedia data using mobile communication equipments will surely become the next step of Internet usage. More and more real-time data and massive amount of information are being transmitted on the Internet, making the bandwidth a scarce resource. To resolve the congestion of Internet, therefore, the efficient management and distribution of limited and valuable resource is more important than the enhancement of it.

Our research posed a dynamic resource allocation method, which exploited the reward-penalty concept in order to find the most efficient allocation solution under the constraint of limited resources. The method enabled the users who need to use resource to achieve the necessary resources and their guarantee of quality. The system resource managers or service providers could make the best arrangement of their constrained resources and gain the highest reward through two essential procedures: Admission Control and Resource Allocation. Users themselves, on the other hand, “smoothly” adjust the resource they had to match the resources they gained. Our algorithm provided existent users with what they requested while at the same time maximized the benefit of the system and made the most efficient arrangement of resources in regards to new requests.

The consequences of simulation experiments showed that our system, which was based on reward-penalty model, is apparently superior to the so-called one based on reward model. The results also showed that CB method took users’ reward rate as well as their penalty rate into account while maintaining admission control.