CN1145327C - Method for universal grouped radio business network node to transmit telephone bill to charge network - Google Patents
Method for universal grouped radio business network node to transmit telephone bill to charge network Download PDFInfo
- Publication number
- CN1145327C CN1145327C CNB011215178A CN01121517A CN1145327C CN 1145327 C CN1145327 C CN 1145327C CN B011215178 A CNB011215178 A CN B011215178A CN 01121517 A CN01121517 A CN 01121517A CN 1145327 C CN1145327 C CN 1145327C
- Authority
- CN
- China
- Prior art keywords
- window
- gprs
- send window
- node
- packet
- 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.)
- Expired - Fee Related
Links
Abstract
The present invention relates to a response positioning method adopting a sliding window on the basis of a GTP call bill transmitting protocol during the transmission of a call bill to a CG in a GPRS network, which comprises the following steps: a transmitting window is arranged on a GPRS node, and the sliding window is utilized for sliding on the transmitting window; a sequence number is continuously allocated to a GTP packet on each transmitting window, and the sequence number is attached to the GTP packet entering the sliding window, which is transmitted to the charging gateway (CG) through a network; after receiving the GTP packet, the charging gateway returns a response signal to the GPRS node. The method not only ensures the reliable transmission of the call bill, but also ensures the uniform transmission between the networks, and enhances the processing efficiency of a system.
Description
The present invention relates to a kind of ticket sending method, particularly a kind of GPRS (GPRS) node is to the method for charging gateway (CG) transmit telephone bill.
In the prior art, the general employing of response frame of sliding window searched method, in GTP ' agreement, packet number is value (can not repeat in a short time) in 0~65535 scope, and under the bigger situation of send window, the method for searching is quite time-consuming, for example when window is 200, treat a response sequence number, maximum possible will be searched 200 times, and minimum will be searched 1 time, calculate according to probability, on average to search 100 times, concerning 200 windows, search 200 * 100=20000 time.
Therefore an object of the present invention is on the basis of the flexibility of the reliability of utilizing GTP ' agreement and sliding window, to construct a kind of better simply ticket sending method, improve the treatment effeciency that ticket in the GPRS network produces node.GSN node described herein and GPRS node are meant GGSN node and the SGSN node in the GPRS network.
According to the present invention, provide the method for a kind of GPRS network (GPRS) node at this to the charging gateway transmit telephone bill, comprising following steps:
Set up a send window at GPRS network (GPRS) node;
Utilize a sliding window on send window, to slide, realize that flow is even less than send window;
To the GTP ' on each send window (GPRS Tunnel Protocol) bag continuous dispensing sequence number, enclosed sequence number at the GTP ' bag that enters sliding window, send to charging gateway (CG) by network;
After charging gateway (CG) is received this GTP ' bag, return a response signal to GPRS network (GPRS) node with the sequence number of going up this bag.
Wherein the method for salary distribution of sequence number is:
SNO=M×N+Index;
When receiving a response, it is located with following formula:
Index=SNO%M
Wherein: SNO: packet number
M: the size of send window (26)
N: the number of times that the packet in the send window (26) successfully sends
Index: the location index in send window (26);
The sequence number modulo operation of big or small M to returning with send window obtains the call number of this packet number in current send window, and the location sends successful packet.
The present invention is described with reference to the accompanying drawings.
The Information Security that Fig. 1 illustrates existing GTP ' (GPRS Tunnel Protocol) guarantees mechanism;
Fig. 2 illustrates sliding window transmit mechanism of the present invention.
The Information Security assurance mechanism of existing GTP ' (GPRS Tunnel Protocol) is at first described with reference to Fig. 1.
1.GSN (GPRS Support Node) 12 sends to CG1 (CG1: the main CG that accepts ticket), wait for the affirmation of receiving of CG1 to the call bill data bag.If receive affirmation, continue to give a packet.
2.GSN12 do not receive response (might can not work by CG1, perhaps circuit disconnects).
3.GSN12 will the package identification of not receiving affirmation be sent on the CG2.CG2 does not temporarily send to the ticket that indicates " may repeat " on the BS (base station).
4.CG2 respond, before CG1 brought back to life, GSN12 delivered to ticket on the CG2.
5. if over time, GSN12 receives CG1 " resurrection " solicited message.
6.GSN12 respond.
7.GSN12 after confirming that CG1 is normal, once sent to CG1 but not have the packet number of the packet of response to send empty a bag (identifying " may repeat ") to CG1 with former.
8.a) CG1 comparison packet number, if do not receive the bag of this sequence number, CG1 returns to correct confirmation of receipt of GSN12.
8.b) if CG1 had received this bag, return to GSN12 and received message (can judge from sequence number).
9.a) GSN12 notice CG2 can deliver to BS to the bag of the preservation of receiving.
9.b) GSN12 notice CG2 is the deletion of the bag of this temporary sequence number.
10.CG2 respond.
2, sliding window transmit mechanism
In sending the packet task, send the packet in the window at every turn, head pointer 23 and tail pointer 22 write down original position and the end position that sends respectively, confirm the position of the confirmed ticket of pointer 25 records.When each the transmission, the head and the tail of head pointer 23, tail pointer 22 and sliding window 24 overlap, and when receiving the sequence number of affirmation, confirm pointer 25 these positions of record, move behind the window, as shown.The packet that expression between send window 26 left sides and the head pointer 23 can send, the pointer of the wait acknowledge that the expression between head pointer 23 and the affirmation pointer 25 has sent.Confirm that ticket between pointer 25 (send window 26 right sides) and the tail pointer 22 represents the packet of having confirmed.
3, the quick location mechanism of data response message
The reliability that can guarantee data of GTP ' agreement and preventing loss, its key is the distribution of sequence number.
At the description of GTP ' in the GPRS agreement, for the ease of realizing Flow Control, to the CG transmit telephone bill time, set up a sliding window 24, send a GTP ' bag to every to CG, its packet number adds 1, once can send a plurality of GTP ' bags.
Key of the present invention is the branch of GTP ' packet number is mixed.
Set up a bigger send window 26, utilize a less sliding window 24 to slide then thereon, even to realize flow.To the bag of the GTP ' on each send window 26 continuous dispensing sequence number (0~65535), enclosed sequence number at the GTP ' bag that enters sliding window 24, send by network; After CG receives this GTP ' bag, return ACK with the sequence number of going up this bag, owing to be the network through a complexity, the sequence number that returns may be out of order fully.The present invention utilizes a kind of method, realizes the quick location of response, and the method for salary distribution of its sequence number is:
SNO=M×N+Index
Receiving when response, to its localization method:
Index=SNO%M
Parameter declaration:
SNO: packet number
M: the size of send window 26
N: the number of times that the packet in the send window 26 successfully sends
Index: the location index in send window 26
For example:
Suppose that send window 26 sizes are 2000, wherein the 3rd window successfully sends 4 times,
Then the sequence number of this window bag that promptly will send is:
SNO=2000×4+3=8003
In actual treatment, need not calculate the number of times that successfully sends, only write down the number of frames that successfully sent last time, add that window size is exactly the sequence number that this time sends.
When CG returns this sequence number, the location:
Index=8003%2000=3
" 3 " are exactly the window call number, directly response message are located.
Method of the present invention and send window 26, sliding window 24, head pointer 23, tail pointer 22 are described, confirm the relation between the pointer 25 at a concrete example below.
Suppose:
Send window 26 sizes are 8000;
Sent N time (at the circulation of send window 26 N time);
Sliding window 24 is 200 to the maximum;
The packet that drops in the sliding window 24 is: 2000-2199 (call number);
The normal transmission when beginning, delivery header pointer 23 sends tail pointer 22, confirms that pointer 25 all points to 2000.
Packet of every transmission, head pointer 23 moves down one, and 2000,2001,2002,2003...2199;
Then:
GTP ' the sequence number that sends is respectively: 8000 * N+2000,8000 * N+2001...8000 * N+2199
After ticket in the send window 26 all sent, N=N+1;
After ticket in sliding window 24 is sent completely, can wait-for-response and overtime.If response arrives in proper order, then to confirm to move behind the pointer 25, response is complete overtime to then deleting.
If response is less than complete, then thinks and confirm that the packet between pointer 25 and the head pointer 23 is overtime.
After GTP ' agreement and sliding window 24 mechanism combine, both can guarantee the reliability of data, uniqueness can guarantee the even of network traffics again, prevents network congestion.After optimizing, improved treatment effeciency again greatly.
Claims (4)
1, a kind of GPRS network (GPRS) node is to the method for charging gateway transmit telephone bill, comprising following steps:
Set up a send window (26) at GPRS network (GPRS) node;
Utilizing a sliding window less than send window (26) (24) to go up at send window (26) slides;
To the bag of the GTP ' (GPRS Tunnel Protocol) on each send window (26) continuous dispensing sequence number, enclosed sequence number at the GTP ' bag that enters sliding window (24), send to charging gateway (CG) by network;
Charging gateway (CG) returns a response signal with the sequence number of going up this bag to GPRS network (GPRS) node after receiving this GTP ' bag.
2, ticket sending method according to claim 1, wherein said GPRS node are Gateway GPRS Support Node (GGSN) node or Serving GPRS Support Node (SGSN) node.
3, ticket sending method according to claim 1, wherein the method for salary distribution of sequence number is:
SNO=M×N+Index;
When receiving a response, it is located with following formula:
Index=SNO%M
Wherein: SNO: packet number
M: the size of send window (26)
N: the number of times that the packet in the send window (26) successfully sends
Index: the location index in send window (26);
The sequence number modulo operation of big or small M to returning with send window (26) obtains the call number of this packet number in current send window (26), and the location sends successful packet.
4, according to ticket sending method described in claim 1 or 3, wherein also comprise the steps:
When sending beginning, delivery header pointer (23), transmission tail pointer (22), affirmation pointer (25) all point to the initial data bag in the current send window (26);
Packet of every transmission, head pointer (23) moves down one;
After ticket in the send window (26) all sent, the transmission number of success N=N+1 of send window (26);
After ticket in the sliding window (24) is sent completely, can wait-for-response and overtime;
If response arrives in proper order, then to confirm to move behind the pointer (25), response is complete overtime to then deleting;
If response is less than complete, then thinks and confirm that the packet between pointer (25) and the head pointer (23) is overtime.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNB011215178A CN1145327C (en) | 2001-06-05 | 2001-06-05 | Method for universal grouped radio business network node to transmit telephone bill to charge network |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNB011215178A CN1145327C (en) | 2001-06-05 | 2001-06-05 | Method for universal grouped radio business network node to transmit telephone bill to charge network |
Publications (2)
Publication Number | Publication Date |
---|---|
CN1390019A CN1390019A (en) | 2003-01-08 |
CN1145327C true CN1145327C (en) | 2004-04-07 |
Family
ID=4664498
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CNB011215178A Expired - Fee Related CN1145327C (en) | 2001-06-05 | 2001-06-05 | Method for universal grouped radio business network node to transmit telephone bill to charge network |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN1145327C (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2007093078A1 (en) * | 2006-02-14 | 2007-08-23 | Zte Corporation | Method of determining sliding window size in a mobile wireless communication system |
CN100403736C (en) * | 2006-03-14 | 2008-07-16 | 杭州华三通信技术有限公司 | Message serial number inspection and inspector with multi-unit transmission |
CN101145893B (en) * | 2007-10-08 | 2010-10-13 | 华为技术有限公司 | Receiving method, device and billing gateway for CDR data frame |
CN101500341B (en) * | 2008-02-02 | 2011-02-02 | 上海贝尔阿尔卡特股份有限公司 | Gateway and base station for content synchronization based on window and method thereof |
CN107769988B (en) * | 2016-08-19 | 2021-05-04 | 华为技术有限公司 | Method, device and network equipment for sending information and detecting message loss |
-
2001
- 2001-06-05 CN CNB011215178A patent/CN1145327C/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
CN1390019A (en) | 2003-01-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN1173515C (en) | Data retransmission method in a voice-over-data communication system | |
CN1227854C (en) | Link Layer acknowledgement and retransmission for cellular telecommunications | |
CN1251443C (en) | Method and device for reliable retransmission of packet data by grouping wireless terminals | |
CN1223221C (en) | Data transmission control method for GPRS | |
EP1211840A1 (en) | Hybrid ARQ with parallel packet transmission | |
CN1528077A (en) | Protocol data unit encapsulation method | |
CN1328734A (en) | Efficient error control for wireless packet transmissions | |
CN1422086A (en) | System and method for polling transmitting protocol data unit in buffer memory | |
CN101389119A (en) | Data retransmission method and device in process of LTE system cell switching | |
CN1245390A (en) | Improved method for transmitting pilot frequency intensity measuring message in communication system | |
CN1753408A (en) | Method for handling discarding of a sequence of service data units and communication apparatus | |
CN1889414A (en) | Method for transmitting status PDU based on missing PDU detection mechanism | |
CN1742469A (en) | Methods and devices for transmitting data between storage area networks | |
CN1145327C (en) | Method for universal grouped radio business network node to transmit telephone bill to charge network | |
CN1745533A (en) | Transmission control method in an ARQ system | |
CN1341308A (en) | Controlled data network error recovery | |
CN1383656A (en) | Data transmitter, data receiver, and data tansmitting/receiving method | |
CN1271833C (en) | Apparatus and method without IP rcombination, distribution and group | |
CN1138385C (en) | Method and device for increasing a data throughput | |
CN1852155A (en) | Method for realizing charge of advertisement business | |
CN1863140A (en) | Method for improving network resource utilization ratio of wireless communication system | |
CN101030841A (en) | Method and apparatus for notifying protocol unit length variation | |
CN1689277A (en) | Mobile terminal and radio access point in radio access system | |
CN1115013C (en) | Method for managing received data in complex digital cellular terminal | |
CN1499868A (en) | Method for downloading data based on control instructions along with roate |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
DD01 | Delivery of document by public notice |
Addressee: Huawei Technologies Co., Ltd. Document name: Notification to Pay the Fees |
|
DD01 | Delivery of document by public notice |
Addressee: Huawei Technologies Co., Ltd. Document name: Notification of Termination of Patent Right |
|
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20040407 Termination date: 20140605 |
|
EXPY | Termination of patent right or utility model |