US20140053219A1 - Dynamic probability-based admission control scheme for distributed video on demand system - Google Patents
Dynamic probability-based admission control scheme for distributed video on demand system Download PDFInfo
- Publication number
- US20140053219A1 US20140053219A1 US13/587,881 US201213587881A US2014053219A1 US 20140053219 A1 US20140053219 A1 US 20140053219A1 US 201213587881 A US201213587881 A US 201213587881A US 2014053219 A1 US2014053219 A1 US 2014053219A1
- Authority
- US
- United States
- Prior art keywords
- class
- video
- demand
- requests
- partition
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/24—Monitoring of processes or resources, e.g. monitoring of server load, available bandwidth, upstream requests
- H04N21/2408—Monitoring of the upstream path of the transmission network, e.g. client requests
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/239—Interfacing the upstream path of the transmission network, e.g. prioritizing client content requests
- H04N21/2393—Interfacing the upstream path of the transmission network, e.g. prioritizing client content requests involving handling client requests
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/239—Interfacing the upstream path of the transmission network, e.g. prioritizing client content requests
- H04N21/2393—Interfacing the upstream path of the transmission network, e.g. prioritizing client content requests involving handling client requests
- H04N21/2396—Interfacing the upstream path of the transmission network, e.g. prioritizing client content requests involving handling client requests characterized by admission policies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/47—End-user applications
- H04N21/472—End-user interface for requesting content, additional data or services; End-user interface for interacting with content, e.g. for content reservation or setting reminders, for requesting event notification, for manipulating displayed content
- H04N21/47202—End-user interface for requesting content, additional data or services; End-user interface for interacting with content, e.g. for content reservation or setting reminders, for requesting event notification, for manipulating displayed content for requesting content on demand, e.g. video on demand
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N7/00—Television systems
- H04N7/16—Analogue secrecy systems; Analogue subscription systems
- H04N7/173—Analogue secrecy systems; Analogue subscription systems with two-way working, e.g. subscriber sending a programme selection signal
- H04N7/17309—Transmission or handling of upstream communications
- H04N7/17318—Direct or substantially direct transmission and handling of requests
Definitions
- the present invention relates to the allocation of resources in cellular and wireless networks, and particularly to a dynamic probability-based admission control scheme for a distributed video on demand system that manages and distributes system resources more efficiently and that may generate more revenue.
- Video on Demand is a system that allows users to select and watch a video on demand. A number of user requests arrive per second for different categories (popular and unpopular) of videos. An admission control policy decides which request can be admitted and which request should be rejected in order to maintain Quality of Service (QoS) requirements.
- QoS Quality of Service
- Traditional admission control systems use either threshold or resource capacity to accept or reject any incoming requests.
- Admission control is a key component for QoS delivery in VOD systems because it determines which request is accepted and which is not, and also how network resources are utilized. Admission control in Video on Demand has become an important area of interest for most network researchers for the provisioning of end-to-end Quality of Service (QoS).
- QoS Quality of Service
- Dynamic Admission control is very important for the allocation and management of bandwidth for different types of call (New or Handover) and for different class of service (voice, video and data).
- Current static admission control methods cannot cope with dynamic changes of input traffic and network topology.
- the dynamic probability based admission control scheme for distributed video on demand system provides a method that decides, in a Video on Demand (VOD) system, which content requests can be admitted and which requests should be rejected to maintain QoS. Requests for popular and expensive movies should not be rejected on behalf of unpopular movies to generate more revenue.
- VOD Video on Demand
- the present dynamic probability admission control policy combines a shared resource admission control and a class-based admission control. Moreover, dynamic probability is used to access shared resources, such as ports and bandwidth. A non-linear dynamic probability function is used for allocation of ports/bandwidth. The present dynamic probability admission control policy improves performance of all the request classes, as well as overall system performance.
- FIG. 1A is a block diagram showing the overall architecture of a system for implementing a dynamic probability admission control (DPAC) policy for video on demand according to the present invention.
- DPAC dynamic probability admission control
- FIG. 1B is a flowchart showing an algorithm implemented on the DPAC system of FIG. 1 .
- FIG. 2A is a chart showing the rejection rate of both the classes A and B for all systems (present scheme Non-Linear probability (N-Lin), Linear Probability (Lin) and without probability (No Pro)).
- FIG. 2B is a chart showing the comparison of total blocking % of each system (present scheme N-Lin, Lin and No Pro).
- FIG. 2C is a chart showing the comparison of revenue generated of each system (present scheme N-Lin, Lin and No Pro).
- FIG. 3A is a chart showing the rejection rate of both the classes A and B for 1st alternative parameter for all systems (present scheme Non-Linear probability (N-Lin), Linear Probability (Lin) and without probability (No Pro)).
- N-Lin Non-Linear probability
- Lin Linear Probability
- No Pro without probability
- FIG. 3B is a chart showing the comparison of total blocking % for 1st alternative parameter for all the systems (present scheme N-Lin, Lin and No Pro).
- FIG. 3C is a chart showing the comparison of revenue generated for 1st alternative parameter in each system (present scheme N-Lin, Lin and No Pro).
- FIG. 4A is a chart showing the rejection % of both the classes A and B for 2nd alternative parameter for all systems (present scheme Non-Linear probability (N-Lin), Linear Probability (Lin) and without probability (No Pro)).
- FIG. 4B is a chart showing the comparison of total blocking % for 2nd alternative parameter for all the systems (present scheme N-Lin, Lin and No Pro).
- FIG. 4C is a chart showing the comparison of revenue generated for 2nd alternative parameter in each system (present scheme N-Lin, Lin and No Pro).
- FIG. 5A is a chart showing the rejection rate of both the classes A and B for 3rd alternative parameter for all systems (present scheme Non-Linear probability (N-Lin), Linear Probability (Lin) and without probability (No Pr)).
- FIG. 5B is a chart showing the comparison of total blocking % for 3rd alternative parameter for all the systems (present scheme N-Lin, Lin and No Pro),
- FIG. 5C is a chart showing the comparison of revenue generated for 3rd alternative parameter in each system (present scheme N-Lin, Lin and No Pro).
- FIG. 6A is a chart showing the rejection rate of both the classes A and B for 4th alternative parameter for all systems (present scheme Non-Linear probability (N-Lin), Linear Probability (Lin) and without probability (No Pro)).
- FIG. 6B is a chart showing the comparison of total blocking % for 4th alternative parameter for all the systems (present scheme N-Lin, Lin and No Pro).
- FIG. 6C is a chart showing the comparison of revenue generated for 4th alternative parameter in each system (present scheme N-Lin, Lin and No Pro).
- the dynamic probability based admission control scheme for distributed video on demand system provides a method that decides, in a Video on Demand (VOD) system, which content requests can be admitted and which requests should be rejected to maintain Quality of Service (QoS). Requests for popular and expensive movies should not be rejected on behalf of unpopular movies in order to generate more revenue.
- VOD Video on Demand
- the present dynamic probability admission control policy combines a shared resource admission control and a class-based admission control. Moreover, dynamic probability is used to access shared resources, such as ports and bandwidth. A non-linear dynamic probability function is used for allocation of ports/bandwidth. The present dynamic probability admission control policy improves performance of all the request classes, as well as overall system performance.
- the dynamic probability based admission control policy provides means for efficiently managing requests so that a maximum number of requests are admitted in order to maximize revenue.
- the DPAC policy also provides means for using most of the resources all of the time, while reserving capacity to admit the request of most popular programs. This feature is provided because the popular class request typically generates more revenue as compared to a less popular class of content.
- the probability of a request to be admitted or rejected is dynamic, depending upon the class of request, the arrival rate of that class, the availability of resources, and the server workload.
- the total capacity of VOD server is partitioned into a number of partitions equal to the number of classes, plus a shared area.
- the exemplary system 10 has a class selector 12 that accepts requests, classifies the requests, and forwards the classes into a partitioner comprising a first partition 14 , a second partition 16 , and a third, shared partition 18 .
- the A and B partitions 14 and 16 forward their respective requests to a shared area manager 20 , which feeds back to the shared partition 18 .
- the class selector 12 decides which class the request belongs to, then the class selector 12 sends the request to its corresponding partition, either 14 or 16 , depending on whether the class was A or B.
- the request is admitted if there is capacity in its corresponding partition. If there is no space in the corresponding partition, the request is not rejected outright, but sent to the shared area manager 20 (SAM).
- SAM shared area manager 20
- a dynamic probability of the request to access the shared area is calculated. If the shared area has capacity and the request has probability, then the request is accepted and resources are allocated from the shared partition 18 .
- the algorithm is shown in FIG.
- a request 8 goes through class selector 12 , which, at step 140 , partitions the classes and, at step 142 , decides whether there is space in the class partition (class A partition 14 or class B partition 16 ) being analyzed.
- the request is accepted at step 144 if there is space. If there is no space, a check is performed at step 146 to determine whether there is space in the shared partition 18 . If not, the request is rejected 148 , otherwise the dynamic probability is calculated at step 150 . If there is probability to access the shared partition 18 , then the request is accepted at step 156 , otherwise the request is rejected at step 154 .
- the VOD server capacity is partitioned as C 1 , C 2 , . . . CN, +CS, where C is a request class, N is a total priority of classes, and CS is a shared Area.
- Requests arrive with rate of ⁇ 1 , ⁇ 2 , . . . , ⁇ v.
- the class selector 12 decides which class the request belongs to. Then the system 10 admits the incoming request if there is capacity in its required class (class A or class B). If there is no capacity in the particular class, then the request is handed over to the shared area manager (SAM) 20 , which admits the request in the shared area with a dynamic probability (Pi).
- SAM shared area manager
- the probability of acceptance of any request in the shared area 18 is dynamic, depending upon the remaining server capacity and the total arrival of that class so for.
- the dynamic probability of any class will not go above 100%, and will not go below its minimum level.
- the minimum level for each class is dynamic, depending upon the percentage (%) of arrival of that class.
- the dynamic probability is a nonlinear function characterized by the relation:
- FIG. 2A shows the percentage of rejected requests of both the classes, popular and unpopular (A and B), and it is shown that the total rejection of both the classes reduced a lot.
- FIG. 2B illustrate that the overall rejection of our proposed system is better then all others, and about 10% improvement is observed for non-linear admission control system 10 .
- FIG. 2C shows a comparison of revenue generated, and it's observed that 12% more revenue can be generated in the proposed system 10 .
- FIGS. 3A , 3 B, and 3 C are the same as FIGS. 2A , 2 B, and 2 C, with the only difference being a fixed movie time of 90 minutes.
- the proposed system was tested against an increasing load of incoming requests while keeping the movie time constant for all (90 minutes).
- FIGS. 4A , 4 B, and 4 C show the results with variable Arrival Rate of class A.
- the proposed system is tested against increasing load of popular movie class requests while all other parameters are kept constant.
- FIGS. 5A , 5 B, and 5 C show the results taken by varying the Arrival Rate of class B.
- the proposed system was tested against an increasing load of unpopular movie class requests while all other parameters are kept constant.
- FIGS. 6A , 6 B, and 6 C show the results taken by varying Partition size.
- the proposed system was tested against an increasing size of shared partitions allocated in DAPS system, while all other parameters are kept constant.
- DPAC Dynamic Probability-based Admission Control policy for VOD system
- the Dynamic Admission Control policy distributes the server resources fairly among the different classes of incoming requests popular and expensive class request will always have priority over unpopular and cheaper class request to generate more revenue. Results show that the present dynamic admission control policy system 10 is the best choice for the allocation of server resources (ports, bandwidth) among different class of traffic in Video on Demand such that maximum revenue can be generated.
- the DPAC system 10 not only improves rejection percentage of the high priority class, but also improves the rejection of other classes and rejection of the overall system. Finally by using this system the overall revenue will increase significantly.
Abstract
Description
- 1. Field of the Invention
- The present invention relates to the allocation of resources in cellular and wireless networks, and particularly to a dynamic probability-based admission control scheme for a distributed video on demand system that manages and distributes system resources more efficiently and that may generate more revenue.
- 2. Description of the Related Art
- Video on Demand (VOD) is a system that allows users to select and watch a video on demand. A number of user requests arrive per second for different categories (popular and unpopular) of videos. An admission control policy decides which request can be admitted and which request should be rejected in order to maintain Quality of Service (QoS) requirements. Traditional admission control systems use either threshold or resource capacity to accept or reject any incoming requests.
- Admission control is a key component for QoS delivery in VOD systems because it determines which request is accepted and which is not, and also how network resources are utilized. Admission control in Video on Demand has become an important area of interest for most network researchers for the provisioning of end-to-end Quality of Service (QoS).
- In cellular and wireless networks, Dynamic Admission control is very important for the allocation and management of bandwidth for different types of call (New or Handover) and for different class of service (voice, video and data). Current static admission control methods cannot cope with dynamic changes of input traffic and network topology.
- Thus, a dynamic probability based admission control scheme for distributed video on demand system solving the aforementioned problems is desired.
- The dynamic probability based admission control scheme for distributed video on demand system provides a method that decides, in a Video on Demand (VOD) system, which content requests can be admitted and which requests should be rejected to maintain QoS. Requests for popular and expensive movies should not be rejected on behalf of unpopular movies to generate more revenue.
- Traditional admission control systems use either threshold or resource capacity to accept or reject any incoming requests. In contrast, the present dynamic probability admission control policy combines a shared resource admission control and a class-based admission control. Moreover, dynamic probability is used to access shared resources, such as ports and bandwidth. A non-linear dynamic probability function is used for allocation of ports/bandwidth. The present dynamic probability admission control policy improves performance of all the request classes, as well as overall system performance.
- These and other features of the present invention will become readily apparent upon further review of the following specification and drawings.
-
FIG. 1A is a block diagram showing the overall architecture of a system for implementing a dynamic probability admission control (DPAC) policy for video on demand according to the present invention. -
FIG. 1B is a flowchart showing an algorithm implemented on the DPAC system ofFIG. 1 . -
FIG. 2A is a chart showing the rejection rate of both the classes A and B for all systems (present scheme Non-Linear probability (N-Lin), Linear Probability (Lin) and without probability (No Pro)). -
FIG. 2B is a chart showing the comparison of total blocking % of each system (present scheme N-Lin, Lin and No Pro). -
FIG. 2C is a chart showing the comparison of revenue generated of each system (present scheme N-Lin, Lin and No Pro). -
FIG. 3A is a chart showing the rejection rate of both the classes A and B for 1st alternative parameter for all systems (present scheme Non-Linear probability (N-Lin), Linear Probability (Lin) and without probability (No Pro)). -
FIG. 3B is a chart showing the comparison of total blocking % for 1st alternative parameter for all the systems (present scheme N-Lin, Lin and No Pro). -
FIG. 3C is a chart showing the comparison of revenue generated for 1st alternative parameter in each system (present scheme N-Lin, Lin and No Pro). -
FIG. 4A is a chart showing the rejection % of both the classes A and B for 2nd alternative parameter for all systems (present scheme Non-Linear probability (N-Lin), Linear Probability (Lin) and without probability (No Pro)). -
FIG. 4B is a chart showing the comparison of total blocking % for 2nd alternative parameter for all the systems (present scheme N-Lin, Lin and No Pro). -
FIG. 4C is a chart showing the comparison of revenue generated for 2nd alternative parameter in each system (present scheme N-Lin, Lin and No Pro). -
FIG. 5A is a chart showing the rejection rate of both the classes A and B for 3rd alternative parameter for all systems (present scheme Non-Linear probability (N-Lin), Linear Probability (Lin) and without probability (No Pr)). -
FIG. 5B is a chart showing the comparison of total blocking % for 3rd alternative parameter for all the systems (present scheme N-Lin, Lin and No Pro), -
FIG. 5C is a chart showing the comparison of revenue generated for 3rd alternative parameter in each system (present scheme N-Lin, Lin and No Pro). -
FIG. 6A is a chart showing the rejection rate of both the classes A and B for 4th alternative parameter for all systems (present scheme Non-Linear probability (N-Lin), Linear Probability (Lin) and without probability (No Pro)). -
FIG. 6B is a chart showing the comparison of total blocking % for 4th alternative parameter for all the systems (present scheme N-Lin, Lin and No Pro). -
FIG. 6C is a chart showing the comparison of revenue generated for 4th alternative parameter in each system (present scheme N-Lin, Lin and No Pro). - Similar reference characters denote corresponding features consistently throughout the attached drawings.
- The dynamic probability based admission control scheme for distributed video on demand system provides a method that decides, in a Video on Demand (VOD) system, which content requests can be admitted and which requests should be rejected to maintain Quality of Service (QoS). Requests for popular and expensive movies should not be rejected on behalf of unpopular movies in order to generate more revenue.
- Traditional admission control systems use either threshold or resource capacity to accept or reject any incoming requests. In contrast, the present dynamic probability admission control policy combines a shared resource admission control and a class-based admission control. Moreover, dynamic probability is used to access shared resources, such as ports and bandwidth. A non-linear dynamic probability function is used for allocation of ports/bandwidth. The present dynamic probability admission control policy improves performance of all the request classes, as well as overall system performance.
- The dynamic probability based admission control policy (DPAC) provides means for efficiently managing requests so that a maximum number of requests are admitted in order to maximize revenue.
- The DPAC policy also provides means for using most of the resources all of the time, while reserving capacity to admit the request of most popular programs. This feature is provided because the popular class request typically generates more revenue as compared to a less popular class of content. The probability of a request to be admitted or rejected is dynamic, depending upon the class of request, the arrival rate of that class, the availability of resources, and the server workload.
- It will be understood that the diagrams in the Figures depicting the dynamic probability based admission control scheme for distributed video on demand system are exemplary only, and may be embodied in a dedicated electronic device having a microprocessor, microcontroller, digital signal processor, application specific integrated circuit, field programmable gate array, any combination of the aforementioned devices, or other device that combines the functionality of the dynamic probability based admission control scheme for distributed video on demand system onto a single chip or multiple chips programmed to carry out the method steps described herein, or may be embodied in a general purpose computer having the appropriate peripherals attached thereto and software stored on a computer readable media that can be loaded into main memory and executed by a processing unit to carry out the functionality of the system and steps of the method described herein.
- In the
DPAC system 10, the total capacity of VOD server (ports) is partitioned into a number of partitions equal to the number of classes, plus a shared area. As shown inFIG. 1A , theexemplary system 10 has aclass selector 12 that accepts requests, classifies the requests, and forwards the classes into a partitioner comprising afirst partition 14, asecond partition 16, and a third, sharedpartition 18. The A andB partitions area manager 20, which feeds back to the sharedpartition 18. - When a request arrives, the
class selector 12 decides which class the request belongs to, then theclass selector 12 sends the request to its corresponding partition, either 14 or 16, depending on whether the class was A or B. The request is admitted if there is capacity in its corresponding partition. If there is no space in the corresponding partition, the request is not rejected outright, but sent to the shared area manager 20 (SAM). Within theSAM 20, a dynamic probability of the request to access the shared area is calculated. If the shared area has capacity and the request has probability, then the request is accepted and resources are allocated from the sharedpartition 18. The algorithm is shown inFIG. 1B , wherein arequest 8 goes throughclass selector 12, which, atstep 140, partitions the classes and, atstep 142, decides whether there is space in the class partition (class A partition 14 or class B partition 16) being analyzed. The request is accepted atstep 144 if there is space. If there is no space, a check is performed atstep 146 to determine whether there is space in the sharedpartition 18. If not, the request is rejected 148, otherwise the dynamic probability is calculated atstep 150. If there is probability to access the sharedpartition 18, then the request is accepted atstep 156, otherwise the request is rejected atstep 154. - More generally, in the
DPAC system 10, the VOD server capacity is partitioned as C1, C2, . . . CN, +CS, where C is a request class, N is a total priority of classes, and CS is a shared Area. Requests arrive with rate of λ1, λ2, . . . , λv. Theclass selector 12 decides which class the request belongs to. Then thesystem 10 admits the incoming request if there is capacity in its required class (class A or class B). If there is no capacity in the particular class, then the request is handed over to the shared area manager (SAM) 20, which admits the request in the shared area with a dynamic probability (Pi). If there is no probability or no capacity in the sharedarea 18, then the request is rejected. The probability of acceptance of any request in the sharedarea 18 is dynamic, depending upon the remaining server capacity and the total arrival of that class so for. The dynamic probability of any class will not go above 100%, and will not go below its minimum level. The minimum level for each class is dynamic, depending upon the percentage (%) of arrival of that class. - In the present dynamic probability admission
control policy system 10, the dynamic probability is a nonlinear function characterized by the relation: -
- If there is probability, then the request is accepted.
- Results taken by using the nonlinear probability function (N-Lin), equation (1), have been compared with linear probability function (Lin) and without probability (No-Pro). The result suggests that the rejection percentage of both the classes are substantially reduced in the
DPAS system 10. The nonlinear DPAC plots 200 a, 200 b, 200 c are shown inFIGS. 2A , 2B and 2C, respectively. The system was tested against increasing load of incoming requests. 70% of these incoming requests were belongs to popular movies, and the rest of them were for unpopular. The duration of requested movies was not fixed. It was random (90 minutes to 120 minutes) to make it more realistic. In real life, a person can request a movie of any duration. All other input parameters were constant. Input parameters included Class A partition size of 25%,Class B 25% Shared 50%, movie time random (90 min to 120 min), arrival rate in request per minute were 4, 6, 8-16, where the Class A contribution (λA) was 70% and the class B (λB) was 30%. Total simulation time was 24 hours.FIG. 2A shows the percentage of rejected requests of both the classes, popular and unpopular (A and B), and it is shown that the total rejection of both the classes reduced a lot.FIG. 2B illustrate that the overall rejection of our proposed system is better then all others, and about 10% improvement is observed for non-linearadmission control system 10.FIG. 2C shows a comparison of revenue generated, and it's observed that 12% more revenue can be generated in the proposedsystem 10. -
FIGS. 3A , 3B, and 3C are the same asFIGS. 2A , 2B, and 2C, with the only difference being a fixed movie time of 90 minutes. The proposed system was tested against an increasing load of incoming requests while keeping the movie time constant for all (90 minutes). -
FIGS. 4A , 4B, and 4C show the results with variable Arrival Rate of class A. The proposed system is tested against increasing load of popular movie class requests while all other parameters are kept constant. -
FIGS. 5A , 5B, and 5C show the results taken by varying the Arrival Rate of class B. The proposed system was tested against an increasing load of unpopular movie class requests while all other parameters are kept constant. -
FIGS. 6A , 6B, and 6C show the results taken by varying Partition size. The proposed system was tested against an increasing size of shared partitions allocated in DAPS system, while all other parameters are kept constant. - In the
present DPAC system 10, a novel (DPAC) Dynamic Probability-based Admission Control policy for VOD system has been designed and developed for improvement in QoS of VOD system. The Dynamic Admission Control policy distributes the server resources fairly among the different classes of incoming requests popular and expensive class request will always have priority over unpopular and cheaper class request to generate more revenue. Results show that the present dynamic admissioncontrol policy system 10 is the best choice for the allocation of server resources (ports, bandwidth) among different class of traffic in Video on Demand such that maximum revenue can be generated. TheDPAC system 10 not only improves rejection percentage of the high priority class, but also improves the rejection of other classes and rejection of the overall system. Finally by using this system the overall revenue will increase significantly. - It is to be understood that the present invention is not limited to the embodiments described above, but encompasses any and all embodiments within the scope of the following claims.
Claims (10)
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/587,881 US8661484B1 (en) | 2012-08-16 | 2012-08-16 | Dynamic probability-based admission control scheme for distributed video on demand system |
PCT/US2012/052206 WO2014028034A1 (en) | 2012-08-16 | 2012-08-24 | Dynamic probability-based admission control scheme for distributed video on demand system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/587,881 US8661484B1 (en) | 2012-08-16 | 2012-08-16 | Dynamic probability-based admission control scheme for distributed video on demand system |
Publications (2)
Publication Number | Publication Date |
---|---|
US20140053219A1 true US20140053219A1 (en) | 2014-02-20 |
US8661484B1 US8661484B1 (en) | 2014-02-25 |
Family
ID=50101041
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/587,881 Expired - Fee Related US8661484B1 (en) | 2012-08-16 | 2012-08-16 | Dynamic probability-based admission control scheme for distributed video on demand system |
Country Status (2)
Country | Link |
---|---|
US (1) | US8661484B1 (en) |
WO (1) | WO2014028034A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2021098845A1 (en) * | 2019-11-21 | 2021-05-27 | Guangdong Oppo Mobile Telecommunications Corp., Ltd. | Method for daps handover, user equipment, and computer readable medium |
Family Cites Families (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5691975A (en) | 1993-03-12 | 1997-11-25 | Fujitsu Limited | Method and apparatus for control in ATM |
FR2758040A1 (en) * | 1996-12-27 | 1998-07-03 | Thomson Multimedia Sa | METHOD FOR CONTROLLING COMMUNICATION STREAM IN AN INTERACTIVE NETWORK |
US7334044B1 (en) * | 1998-11-17 | 2008-02-19 | Burst.Com | Method for connection acceptance control and optimal multi-media content delivery over networks |
US6567415B1 (en) | 1999-03-20 | 2003-05-20 | Lucent Technologies Inc. | Packet scheduling in a communication network with statistical multiplexing of service classes |
US6986156B1 (en) * | 1999-06-11 | 2006-01-10 | Scientific Atlanta, Inc | Systems and methods for adaptive scheduling and dynamic bandwidth resource allocation management in a digital broadband delivery system |
US8806549B1 (en) * | 1999-10-13 | 2014-08-12 | Starz Entertainment, Llc | Pre-storing a portion of a program to allow user control of playback |
US7774468B1 (en) | 2000-07-28 | 2010-08-10 | Siddhartha Nag | Network traffic admission control |
CN100464532C (en) * | 2001-10-29 | 2009-02-25 | 媒体网国际公司 | Method system and data structure for multimedia communications |
US7092693B2 (en) * | 2003-08-29 | 2006-08-15 | Sony Corporation | Ultra-wide band wireless / power-line communication system for delivering audio/video content |
US7653085B2 (en) * | 2005-04-08 | 2010-01-26 | Qualcomm Incorporated | Methods and apparatus for enhanced delivery of content over data network |
MX2008002446A (en) * | 2005-09-08 | 2008-04-03 | Lg Electronics Inc | Method and protocol for handling access attempts for communications systems. |
US20100287298A1 (en) * | 2009-05-06 | 2010-11-11 | Roundbox, Inc. | Datacasting system with hierarchical delivery quality of service management capability |
EP2036347B1 (en) | 2006-06-27 | 2018-08-15 | Thomson Licensing | Admission control for performance aware peer-to-peer video-on-demand |
CN101652974B (en) * | 2007-02-09 | 2013-01-02 | 诺基亚西门子通信有限责任两合公司 | Method, apparatus, and computer program product for dynamic bandwidth management in an ip-network |
US20120233644A1 (en) * | 2007-06-05 | 2012-09-13 | Bindu Rama Rao | Mobile device capable of substantially synchronized sharing of streaming media with other devices |
US8099757B2 (en) * | 2007-10-15 | 2012-01-17 | Time Warner Cable Inc. | Methods and apparatus for revenue-optimized delivery of content in a network |
US8752103B2 (en) * | 2008-01-10 | 2014-06-10 | At&T Intellectual Property I, Lp | Personal television channel and system and method thereof |
US8542642B2 (en) * | 2008-06-26 | 2013-09-24 | Freescale Semiconductor, Inc. | Channel condition dependent scheduling |
US8224341B2 (en) * | 2008-08-11 | 2012-07-17 | Electronics And Telecommunications Research Institute | Method for providing service, and method and apparatus for allocating resource in wireless communication system |
US8108901B2 (en) * | 2008-08-29 | 2012-01-31 | At&T Intellectual Property I, L.P. | Managing access to high definition content |
BR112012002948A2 (en) * | 2009-08-11 | 2016-04-12 | Alcatel Lucent | evolved multimedia multifusion service system and method for performing statistical multiplexing of services with different identifiers of quality of service classes. |
US9438935B2 (en) * | 2010-11-23 | 2016-09-06 | Verizon Patent And Licensing Inc. | Hybrid video selection, delivery, and caching |
-
2012
- 2012-08-16 US US13/587,881 patent/US8661484B1/en not_active Expired - Fee Related
- 2012-08-24 WO PCT/US2012/052206 patent/WO2014028034A1/en active Application Filing
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2021098845A1 (en) * | 2019-11-21 | 2021-05-27 | Guangdong Oppo Mobile Telecommunications Corp., Ltd. | Method for daps handover, user equipment, and computer readable medium |
CN113727392A (en) * | 2019-11-21 | 2021-11-30 | Oppo广东移动通信有限公司 | DAPS handover method, user equipment and computer readable medium |
US11425614B2 (en) | 2019-11-21 | 2022-08-23 | Guangdong Oppo Mobile Telecommunications Corp., Ltd. | Method for daps handover, user equipment, and computer readable medium |
Also Published As
Publication number | Publication date |
---|---|
US8661484B1 (en) | 2014-02-25 |
WO2014028034A1 (en) | 2014-02-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103069406B (en) | For multiple client management Streaming Media bandwidth | |
US8356110B2 (en) | Adaptive bandwidth resource management for media streams | |
US20060236358A1 (en) | System and method for edge resource management | |
US9197687B2 (en) | Prioritized blocking of on-demand requests | |
US10447616B2 (en) | Broadcast services platform and methods for use therewith | |
CN110545450B (en) | Node distribution method, system, electronic equipment and storage medium | |
US20120324466A1 (en) | Scheduling Execution Requests to Allow Partial Results | |
US11540173B2 (en) | Efficient inroute (return channel) load balancing scheme of guaranteed QoS traffic mixed with best effort traffic in an oversubscribed satellite network | |
CN110460879B (en) | Video request scheduling method, device, server and storage medium | |
US20190349633A1 (en) | Network Time-Shift Buffering, Recording Conversion, And Content Management | |
US20070276933A1 (en) | Providing quality of service to prioritized clients with dynamic capacity reservation within a server cluster | |
Taka et al. | Service placement and user assignment in multi-access edge computing with base-station failure | |
Mundur et al. | Class-based access control for distributed video-on-demand systems | |
US8661484B1 (en) | Dynamic probability-based admission control scheme for distributed video on demand system | |
US20160191219A1 (en) | Hardware and software methodologies for dynamic resource allocation in virtualized flexible-grid optical networks | |
Rahman et al. | Radio access network selection mechanism based on hierarchical modelling and game theory | |
JP6276206B2 (en) | Bandwidth allocation control device and bandwidth allocation control method | |
US9419977B2 (en) | Method and apparatus for providing value-based resource management and admission control | |
Pan et al. | Utility maximization for multi-vehicle multimedia dissemination in vehicular ad hoc networks | |
Taka et al. | Joint service placement and user assignment model in multi‐access edge computing networks against base‐station failure | |
US10516642B2 (en) | Priority assignment based on similarity | |
CN105493604B (en) | A kind of network side equipment and dispatching method | |
Moser et al. | The role of max-min fairness in docsis 3.0 downstream channel bonding | |
Alwakeel et al. | Class Based and Shared Resources Access Control for Distributed Video-on-Demand System | |
Assila et al. | Caching as a service in 5G networks: Intelligent transport and video on demand scenarios |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: KING SAUD UNIVERSITY, SAUDI ARABIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ALWAKEEL, SAMI SALEH, DR.;ALTWAIJRY, HESHAM ABDULAZIZ, DR.;UD DIN, MUHAMMAD AMMAD, MR.;SIGNING DATES FROM 20120131 TO 20120205;REEL/FRAME:028800/0972 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
FEPP | Fee payment procedure |
Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY |
|
LAPS | Lapse for failure to pay maintenance fees |
Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY |
|
STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20220225 |