CN101801042A - Strategy for predictive multi-service resource reservation applicable to railway - Google Patents

Strategy for predictive multi-service resource reservation applicable to railway Download PDF

Info

Publication number
CN101801042A
CN101801042A CN201010034313A CN201010034313A CN101801042A CN 101801042 A CN101801042 A CN 101801042A CN 201010034313 A CN201010034313 A CN 201010034313A CN 201010034313 A CN201010034313 A CN 201010034313A CN 101801042 A CN101801042 A CN 101801042A
Authority
CN
China
Prior art keywords
rate
value
calling
cutting
call
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.)
Pending
Application number
CN201010034313A
Other languages
Chinese (zh)
Inventor
姜晓丽
李旭
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jiaotong University
Original Assignee
Beijing Jiaotong University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Jiaotong University filed Critical Beijing Jiaotong University
Priority to CN201010034313A priority Critical patent/CN101801042A/en
Publication of CN101801042A publication Critical patent/CN101801042A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a strategy for predictive multi-service resource reservation applicable to railways and belongs to the technical field of railway communication. The strategy is capable of allocating the resources for railway communication according to the unique access strategy based on the characteristics of the capability of meeting various requirements for multiple services according to the requirements for railway communication, good predictability and the like. The invention not only has the advantage of more flexible resource allocation, but also ensures the quality requirements and priority of multiple services, so as to maximize the system capacity on the basis and predict various accessible traffics of the system.

Description

A kind of multi-service resource reservation strategy that is applied to railway with predictability
Technical field
The present invention relates to the railway communication technical field, especially a kind of multi-service resource reservation strategy that is applied to railway with predictability.
Background technology
The present available resource of railway applications is the 4M frequency spectrum only, and the application that faces is a lot, and as railway emergency call, train scheduling, Train Control, passenger information service etc., this system is the serious constrained system of resource.There are multiple different business and grade of service demand simultaneously, as to real-time and the high row control business of reliability requirement, other passenger information service of general level etc.These business have proposed different demands to resource, and present fixed channel assignment method can't satisfy its demand, therefore the resource technology are scrutinized to consider it is very necessary.
Railway section business and characteristic have better predictability, exercise track, the train interval speed of service etc. when normally moving in the interval as train.The resource policy that research has better predictability is significant.
Summary of the invention
The objective of the invention is problem, proposed a kind of multi-service resource reservation strategy that is applied to railway with predictability at the present Railroad Communication System resource scarcity described in the background technology.
It is characterized in that, may further comprise the steps:
Step 1: in a system with n different business and 2n independent QoS condition, the initial value of initialization system capacity, and the arrival rate of definite miscellaneous service, required number of resources, residence time;
Wherein, in the described QoS condition, n condition is at n new type of call, and all the other n at the individual type of call of distinguishing more of n;
Step 2: calculate cutting off rate and the blocking rate called out;
Channel reservation value R jBe non-integer, when a type be j (j=1,2 ..., 2n-1, when 2n) calling produces, produce simultaneously a random number X ∈ [0,1);
If After this calling is received, if number of available channels is not less than
Figure G2010100343130D00022
Call accepted so; Otherwise calling gets clogged or abandons;
If
Figure G2010100343130D00023
After this calling is received, if number of available channels is not less than R j, call accepted so; Otherwise, get clogged or abandon;
If the blocking rate of the all-calls of every kind of business and cutting off rate satisfy their QoS conditions separately simultaneously, skip to step 3, judge whether the capacity of system reaches optimal value;
If cutting off rate and blocking rate are bigger than normal, then increase channel reservation value R jIf cutting off rate and blocking rate are less than normal, then reduce channel reservation value R j
Wherein, R jValue approach gradually by dichotomy;
Step 3: more current power system capacity and power system capacity before, if exceed the accuracy rating of setting, then approach with dichotomy, recomputate described R jValue, and return step 2; If in the accuracy rating of setting, all R that draw jValue is the channel reservation value of being asked.
The present invention is not only more flexible in resource allocation, and can guarantee the quality requirement and the priority of miscellaneous service, carries out the largest optimization of power system capacity on this basis, various types of traffic carrying capacitys that the system of doping can insert.
Description of drawings
Fig. 1: tactful schematic diagram of the present invention;
Embodiment
Below in conjunction with accompanying drawing preferred embodiment is elaborated.Should be emphasized that following explanation only is exemplary, rather than in order to limit the scope of the invention and to use.
What basic thought of the present invention was the characteristics that have a fine predictability at the railway business with priority is different, gives every kind professionally to reserve certain channel.By this strategy, make every kind of business all reach under the situation of minimum blocking rate and interruption rate the entire system maximum capacity.Multi-channel resource reservation (MFCR) strategy is applicable to many service environments, for each different type of call provides a definite protected level.In the multi-service railway network that different services of n kind and 2n independent QoS restrictive condition are arranged, MFCR has reserved 2n-1 different channels number.As shown in Figure 1, lowest priority is called out (being called Class1 calls out) can not use the R1 channel, inferior lowest priority is called out (type 2 is called out) can not use the R2 channel, and the like, inferior high-priority call (type 2n-1 calling) can not be used the R2n-1 channel, and limit priority is called out (type 2n calling) and do not inserted restriction.That is, Rj is Priority Call j+1 ..., 2n-1, the number of channel that 2n reserves.
Example of the present invention be under the MATLAB7.0 environment with the data instance of certain Line for Passenger Transportation, the emulation that the resource reservation policy under two kinds of service conditions is carried out.According to the data that investigation obtains, can do following hypothesis: call out average duration μ 12=1/72, call out average residence time η 12=1/46, the number of channel b that row transfer professional calling to need 1=1, the number of channel b that the professional calling of row control needs 2The new calling arrival rate ratio f of=2, two kinds of business 1, f 2Be respectively 0.5,0.5.
The channel reservation of every kind of business is counted R jR can be drawn by nested circulation jThe basis for estimation of value is the cutting off rate and the blocking rate of corresponding business need.Wherein, these two values of blocking rate and cutting off rate are in the probability under the various states when needing computing system to stablize.The state of system is limited Markov Chain, and wherein the Gauss-Seidel method is adopted in the calculating of the probability of stability, sets the precision of approaching, and judges with norm.
Table 1 is the result after the emulation,
Table 1 embodiment simulation result
??C max ?R h1N2h2 ??R N2h2 ??R h2 ??P b1 ??P b2 ??P ft1 ??P ft2
??4.3199 ?1.7340 ??1.0000 ??0.7340 ??0.0020 ??0.0020 ??0.0010 ??0.0010
Wherein, C MaxThe system's heap(ed) capacity that obtains for emulation; R H1N2h2, R N2h2, R H2Represent the various professional numbers of channel of reserving that are respectively; P B1, P B2Represent the call blocking rate of Class1 and type 3 respectively; P Ft1, P Ft2Represent the calling cutting off rate of Class1 and type 3 respectively.
Simulation result shows: under blocking rate that guarantees various types of calls and situation that cutting off rate meets the demands, the number of channel that has obtained the heap(ed) capacity of system and reserved for various types of calls, the present invention can reach the set goal, is implemented in the harmonious relations between capacity, quality and the resource.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and is familiar with those skilled in the art in the technical scope of the present invention's exposure; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claim.

Claims (1)

1. the multi-service resource reservation strategy with predictability that is applied to railway is characterized in that, may further comprise the steps:
Step 1: in a system with n different business and 2n independent QoS condition, the initial value of initialization system capacity, and the arrival rate of definite miscellaneous service, required number of resources, residence time;
Wherein, in the described QoS condition, n condition is at n new type of call, and all the other n at the individual type of call of distinguishing more of n;
Step 2: calculate cutting off rate and the blocking rate called out;
Channel reservation value R jBe non-integer, when a type be j (j=1,2 ..., 2n-1, when 2n) calling produces, produce simultaneously a random number X ∈ [0,1);
If
Figure F2010100343130C00011
After this calling is received, if number of available channels is not less than
Figure F2010100343130C00012
Call accepted so; Otherwise calling gets clogged or abandons;
If
Figure F2010100343130C00013
After this calling is received, if number of available channels is not less than R j, call accepted so; Otherwise, get clogged or abandon;
If the blocking rate of the all-calls of every kind of business and cutting off rate satisfy their QoS conditions separately simultaneously, skip to step 3, judge whether the capacity of system reaches optimal value;
If cutting off rate and blocking rate are bigger than normal, then increase channel reservation value R jIf cutting off rate and blocking rate are less than normal, then reduce channel reservation value R j
Wherein, R jValue approach gradually by dichotomy;
Step 3: more current power system capacity and power system capacity before, if exceed the accuracy rating of setting, then approach with dichotomy, recomputate described R jValue, and return step 2; If in the accuracy rating of setting, all R that draw jValue is the channel reservation value of being asked.
CN201010034313A 2010-01-15 2010-01-15 Strategy for predictive multi-service resource reservation applicable to railway Pending CN101801042A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201010034313A CN101801042A (en) 2010-01-15 2010-01-15 Strategy for predictive multi-service resource reservation applicable to railway

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201010034313A CN101801042A (en) 2010-01-15 2010-01-15 Strategy for predictive multi-service resource reservation applicable to railway

Publications (1)

Publication Number Publication Date
CN101801042A true CN101801042A (en) 2010-08-11

Family

ID=42596470

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201010034313A Pending CN101801042A (en) 2010-01-15 2010-01-15 Strategy for predictive multi-service resource reservation applicable to railway

Country Status (1)

Country Link
CN (1) CN101801042A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102300319A (en) * 2011-09-30 2011-12-28 北京交通大学 Method for distributing wireless channels based on cells along railway

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102300319A (en) * 2011-09-30 2011-12-28 北京交通大学 Method for distributing wireless channels based on cells along railway
CN102300319B (en) * 2011-09-30 2013-10-23 北京交通大学 Method for distributing wireless channels based on cells along railway

Similar Documents

Publication Publication Date Title
CN100450259C (en) Apparatus and method for allocating channel in a wireless communication system
Tang et al. Performance of secondary radios in spectrum sharing with prioritized primary access
CN101305635B (en) Spectrum management in dynamic spectrum access wireless systems
CN100558003C (en) Dynamic spectrum management method based on the multiple use of frequency spectrum
CN101291514B (en) Method and device for resource distribution in wireless communication system
KR100581085B1 (en) Apparatus and method for allocating resource in mf-tdma broadband satellite system
CN1498485A (en) Dynamic bandwidth allocation
CN102238627B (en) Resource allocating method and device of downlink shared channel
CN104301933A (en) Method for calculating bandwidth and distributing bandwidth in wireless ad hoc network
CN112996116A (en) Resource allocation method and system for guaranteeing quality of power time delay sensitive service
Wang et al. A maximum throughput channel allocation protocol in multi-channel multi-user cognitive radio network
CN102131298B (en) Method for allocating downlink resources
CN102404862B (en) Method for PDCCH (Physical Downlink Control Channel) resource allocation in LTE (Long Term Evolution) system
CN106162654B (en) Power LTE network frequency distribution and interference coordination method based on service isolation
TW200950553A (en) A method for allocating resources
CN100356812C (en) Method for dynamic channel allocation of multi carrier time division duplex communication system
Patil et al. Reducing feedback for opportunistic scheduling in wireless systems
Ayyagari et al. Admission control with priorities: Approaches for multi‐rate wireless systems
Andrabi et al. The model of conjoint servicing of real time traffic of surveillance cameras and elastic traffic devices with access control
CN101801042A (en) Strategy for predictive multi-service resource reservation applicable to railway
CN102469463A (en) Method, device, system and equipment for allocating marginal frequency resource
OA et al. Adaptive threshold based channel allocation scheme for multimedia network
Adam et al. Spectrum sharing with QoS awareness in cognitive radio networks
KR101825850B1 (en) Method and Device for Allocating Channel in Cognitive Radio Communication
KR100582902B1 (en) A power allocation apparatus and a power allocation method in a mobile communication

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20100811