Method for buffering data of router

Abstract

The invention provides a router data buffering method, which comprises the following steps that: a router decides a buffering mode of a data message according to the following logic: if a router buffering area has a residual space, the data message is buffered to a logic partition corresponding to a service type to which the data message belongs; if the router buffer area has no residual space and the occupied space of the logic partition corresponding to the service type to which the data message belongs is smaller than the buffer threshold value of the logic partition, buffering the data message in a replacement mode; if the router buffer area has no residual space and the occupied space of the logic partition corresponding to the service type to which the data message belongs is greater than or equal to the buffer threshold value of the logic partition, discarding the data message; each logic partition is a storage area divided by the router in the buffer area according to the service type, and each logic partition has different priorities according to the service type to which the logic partition belongs. The method has the advantage that the dynamic allocation of the buffer resources considering the data service types is realized.

Description

Technical Field

[0001] The present application belongs to the technical field of buffer resource management, and in particular relates to a method for buffering data in a router. Background Art

[0002] With the explosive growth of mobile data traffic and the number of mobile hosts, host mobility has become a long-standing problem and challenge in mobile communication networks. In traditional TCP / IP network architecture, the host's IP address has dual semantics: it serves as a unique identifier for the terminal and also as a location identifier, providing routing and addressing for its communications. This inherent dual semantics of IP addresses in traditional TCP / IP networks has severely limited the development of mobility management technologies. Furthermore, with the increasing proliferation of services such as real-time audio and high-definition video, traditional location-based TCP / IP networks are unable to meet the demands of distributing massive amounts of data traffic. Networks are becoming increasingly information-centric, leading to the development of Information-Centric Networks (ICNs). The core concept of ICNs is the separation of name and address, which resolves the dual semantics of IP addresses and offers a natural advantage in supporting mobility.

[0003] Existing ICN mobility support methods minimize packet loss during handover by buffering packets on the original access router for a period of time. However, existing ICN mobility support methods that utilize data buffering lack effective management of buffered data and cannot distinguish between mobile service types, resulting in irrational buffer resource allocation. Different types of services have different requirements for packet loss. In video communication and streaming applications, especially real-time video conferencing or online live broadcasts, service continuity and real-time performance are particularly important for mobile users' performance experience. Therefore, when buffer resources are limited, how to effectively allocate buffer resources for different types of mobile services is an urgent problem to be solved. The quality of buffer resource allocation will directly affect the mobile user's quality of experience. Summary of the Invention

[0004] The purpose of this application is to overcome the defects of the existing ICN mobility support method using routers to buffer data, which lacks effective management of buffer resources and cannot distinguish mobile service types, resulting in low buffer resource utilization.

[0005] To achieve the above objectives, the present application proposes a method for buffering data in a router, comprising:

[0006] The router decides how to buffer data packets based on the following logic:

[0007] If there is free space in the router buffer, the data packet is buffered in the logical partition corresponding to the service type to which the data packet belongs;

[0008] If there is no remaining space in the router buffer and the occupied space of the logical partition corresponding to the service type of the data packet is less than the buffer threshold of the logical partition, the data packet is buffered in replacement mode;

[0009] If there is no remaining space in the router buffer and the occupied space of the logical partition corresponding to the service type to which the data packet belongs is greater than or equal to the buffer threshold of the logical partition, the data packet is discarded;

[0010] The logic partition is a storage area divided by the router in the buffer according to the service type, and each logic partition has a different priority according to the service type.

[0011] As an improvement to the above method, in the logical partition, the router creates a buffer queue for each mobile terminal entity.

[0012] As an improvement to the above method, the replacement method includes:

[0013] Find the logical partition with the lowest priority and a total buffer queue length exceeding the buffer threshold, and select the tail of a buffer queue from the logical partition to discard a packet.

[0014] The data message is buffered in the logical partition corresponding to the service type to which the data message belongs.

[0015] As an improvement to the above method, the sum of the buffer thresholds of all logical partitions is equal to the total capacity of the router buffer.

[0016] As an improvement to the above method, the buffer threshold T of the i-th logical partition i The calculation formula is:

[0017]

[0018] Where B represents the total capacity of the router buffer; G represents the number of logical partitions; θ i Represents the coefficient of the i-th logical partition, and the calculation formula is:

[0019] θ i =(priority i ) 2 *percent i

[0020] Among them, priority i , 0 <priority i ≤1 indicates the priority of the i-th type of service; percent i Indicates the proportion of traffic of type i in a statistical period:

[0021]

[0022] Among them, S i Indicates the number of data packets received by the i-th logical partition in a statistical period.

[0023] As an improvement to the above method, the buffer threshold is updated periodically.

[0024] As an improvement to the above method, the header of the data message carries the entity identifier of the mobile terminal, the destination network address and the service type.

[0025] As an improvement to the above method, a name resolution system is used to maintain a mapping relationship between the entity identifier of the mobile terminal and the network address of the mobile terminal.

[0026] As an improvement to the above method, the router, in addition to basic routing and forwarding capabilities, also has the following functions:

[0027] Read, fill in and modify the fields in the data message header. The modified fields include: destination network address;

[0028] Maintain the mapping relationship between business types and corresponding priorities;

[0029] The buffer threshold of the logical partition is calculated based on the business traffic entering the logical partition, the priority corresponding to the business type of the logical partition, and the total buffer capacity; the business traffic refers to the business traffic entering the logical partition measured in each logical partition period.

[0030] Compared with the prior art, the advantages of this application are:

[0031] The method of the present invention divides the buffer of the router into multiple logical partitions according to the service type, and timely adjusts the buffer resource allocation result according to the remaining space in the router buffer, changes in the traffic of different types of services, and the priorities of different types of services, thereby realizing dynamic allocation of buffer resources considering the data service type. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 Shown is a schematic diagram of a router buffer;

[0033] Figure 2 The figure shows a flow chart of router buffering data to achieve mobility support;

[0034] Figure 3 The figure shows the flow chart of router forwarding data packets. DETAILED DESCRIPTION

[0035] The technical solution of this application is described in detail below with reference to the accompanying drawings.

[0036] The present application proposes a router data buffering method, which involves a router, a name resolution system and a mobile terminal.

[0037] During network transmission, an identifier is used to uniquely identify the entity of a mobile terminal, and a name resolution system is used to maintain the mapping relationship between the entity identifier of the mobile terminal and the network address of the mobile terminal. The header of the data message sent to the mobile terminal carries the entity identifier, destination network address and service type.

[0038] The entity identifier includes but is not limited to a terminal identifier, a service identifier, and a content identifier. The destination network address is a routable network address corresponding to the entity identifier of the mobile terminal.

[0039] The router divides the buffer into multiple logical partitions based on service type. Within each logical partition, the router creates a buffer queue for each mobile terminal entity. When the router detects that a mobile terminal is about to be handed off and receives a data packet sent to the mobile terminal, it reads the service type field in the data packet header, selects the corresponding logical partition based on the value of the service type field, and decides whether to buffer the data packet based on the following logic:

[0040] (1) If there is free space in the router buffer, the data packet is buffered to the corresponding logical partition;

[0041] (2) If there is no remaining space in the router buffer, when the occupied space of the logical partition is less than the buffer threshold of the logical partition, the data packet is buffered to the corresponding logical partition;

[0042] Specifically, it includes: finding a logical partition whose total queue length exceeds the buffer threshold and has the lowest priority, selecting a buffer queue at the end of the logical partition to discard a packet, and then buffering the newly arrived data message to this logical partition.

[0043] (3) If there is no remaining space in the router buffer, when the occupied space of the logical partition is greater than or equal to the buffer threshold of the logical partition, the data packet is discarded.

[0044] The buffer threshold has two characteristics:

[0045] (1) The buffer threshold is updated periodically;

[0046] (2) The sum of the buffer thresholds of all logical partitions is the total buffer capacity.

[0047] In addition to basic routing and forwarding capabilities, the routers involved in this application also have functions including but not limited to:

[0048] (1) Read, fill in and modify relevant fields in the data message header. The modifiable fields include but are not limited to: destination network address;

[0049] (2) Maintain the mapping relationship between business types and corresponding priorities;

[0050] (3) The buffer threshold of a logical partition can be calculated based on the service flow entering the logical partition, the priority corresponding to the service type of the logical partition, and the total buffer capacity. Service flow refers to the service flow entering the logical partition measured in each logical partition period.

[0051] The name resolution system involved in this application has functions including but not limited to: being responsible for maintaining the mapping relationship between the mobile terminal entity identifier and its corresponding network address.

[0052] To make the objectives, technical solutions, and advantages of the present invention more clear, the technical solutions of the present invention will be clearly and completely described below in conjunction with the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts shall fall within the scope of protection of the present invention.

[0053] In order to make the purpose, technical solutions and advantages of the present invention more clear, the technical solutions of the present invention will be clearly and completely described below in conjunction with the accompanying drawings of the present invention.

[0054] like Figure 1 As shown in FIG, an embodiment of the present invention provides a schematic diagram of a router buffer. The router divides a fixed resource buffer into G logical partitions (LP) according to the service type. i Defined as the i-th logical partition, T i Defined as LP i If B is the total buffer capacity and G is the total service category, then Buffer threshold T of the logical partition i It is related to different types of business traffic and business priorities, so T i The calculation formula is as follows.

[0055]

[0056] Where θ i is the i-th logical partition LP i The coefficient of θ i It is related to the proportion of different types of business traffic and business priority, θ i The calculation formula is as follows:

[0057] θ i =(priority i ) 2 *percent i (2)

[0058] Among them, priority i (0 <priority i ≤1) is the priority of the i-th class of service, and for the highest priority class, the priority is equal to 1;

[0059] percent i is the proportion of the i-th type of business traffic. Business traffic will change dynamically over time, so the buffer threshold of the logical partition needs to be updated regularly. Let S i,m Indicates the number of data packets received by the i-th logical partition in the m-th statistical period. The percentage of the i-th service traffic in the n-th statistical period. i,n The formula for obtaining is:

[0060]

[0061] In a logical partition, the router creates a buffer queue for each mobile terminal entity. A group of data packets sent to a mobile terminal constitutes a mobile data flow. Logical partition LP i Maintain relevant information of the buffer queue of mobile data flow belonging to service type i. i,1 ,q i,2 ,…,q i,F} is the logical partition LP i The buffer queue set, q i,k Is a logical partition LP i China Mobile Data Flow k The identifier of the buffer queue can be represented by the entity identifier carried in the data packet header. The information of the buffer queue includes the buffer queue length l i,k Logical Partition LP i The total queue length Q i The calculation formula is as follows.

[0062]

[0063] The calculation formula for the total queue length Q of G logical partitions is as follows.

[0064]

[0065] When a newly arrived data packet is received by the router buffer, first find the service type I it belongs to according to the service type field carried in the data packet header. Then, use formula (4) and formula (5) to calculate the total length Q of all logical partition queues. Next, determine whether there is remaining space in the router buffer. If Q < B, it proves that there is remaining space in the buffer. At this time, directly buffer the data packet into the corresponding logical partition LP I . If Q ≥ B, it proves that there is no remaining space in the buffer, and it is necessary to continue to judge the total length Q I of the logical partition LP I whether it is less than its buffering threshold T I . If the total length Q I of the logical partition LP I is less than its buffering threshold T I , it proves that there is at least one logical partition in the buffer whose total length of the logical partition queue is greater than its buffering threshold. At this time, a replacement operation needs to be performed. Replacement operation: (1) First, find the logical partition LP J whose total length of the logical partition queue is greater than its buffering threshold and has the lowest priority; (2) Then, select a buffered data packet from the logical partition LP J to discard; (3) Finally, buffer the newly arrived data packet into the corresponding logical partition LP I . If the total length Q I of the logical partition LP I is greater than or equal to its buffering threshold T I , discard the newly arrived data packet.

[0066] To successfully implement the router buffer data method, the router locally maintains a Mobile Entity State Table (MEST). The Mobile Entity State Table consists of a set of Mobile Entity State Entries (MESTE). MESTE includes the Entity Identifier (EID) of the mobile terminal and the corresponding latest network address (new NA). Among them, "new NA" can be the latest network address or the default value. The router has the basic routing function and maintains a Forwarding Information Base (FIB) to implement forwarding the data packet according to the destination address carried in the data packet header. The Name Resolution System (NRS) maintains the mapping relationship between the Entity Identifier (EID) of the mobile terminal and its corresponding network address (NA). As Figure 2 shown, consider that the mobile terminal (UE) continuously requests the content published by the content server. Before the UE mobility handover, the original data packet forwarding path for the content server to reply to the UE is content server -> R3 -> R2 -> R1 -> UE.

[0067] As Figure 2 shown, the specific steps for the router buffer data to implement mobility support are summarized as follows:

[0068] (1) When the access router (R1) senses that a mobile terminal (UE) is about to undergo a mobility handover, R1 will receive a mobility handover notification. The mobility handover notification must carry the entity identifier (EID0) of the mobile terminal.

[0069] (2) After receiving the mobile handover notification, R1 updates / adds the local MEST related table entry, sets the "EID" of the table entry to "EID0" and the corresponding "new NA" to the default value. At this time, R1 starts buffering the data packets sent to the mobile terminal.

[0070] (3) After R1 detects that the UE has completed handover, R1 will receive a mobility event message. The mobility event message needs to carry EID0.

[0071] (4) After receiving the mobility event message, R1 sends a resolution query request to the name resolution system based on EID0 to query the latest network address of the UE.

[0072] (5) After R1 receives the resolution query response from the name resolution system, R1 obtains the latest network address of the UE.

[0073] (6) After learning the latest network address of the UE, the R1 router updates the local MEST related table entry and sets the "new NA" of the corresponding table entry to the latest network address of the mobile terminal.

[0074] (7) R1 indexes the data packet from the buffer based on EID0 and schedules the indexed data packet to enter MEST, thus redirecting the buffered data. The forwarding path of the buffered data packet and subsequent data packets sent to the UE is content server->R3->R2->R1->R4->UE.

[0075] like Figure 3 As shown in the figure, the specific steps of the router forwarding data packets are summarized as follows:

[0076] Upon receiving a datagram, the router first queries the MEST table based on the entity identifier carried in the datagram header. If a matching MESTE exists and the "new NA" in the table entry is not the default value, the router performs post-binding on the datagram, replacing the destination network address in the datagram with the corresponding NA in the MESTE. The router then matches the FIB for forwarding. If a matching MESTE exists and the "new NA" in the table entry is the default value, the router schedules the datagram to the buffer. If no matching MESTE exists, the router directly matches the FIB for forwarding.

[0077] Finally, it should be noted that the above embodiments are intended only to illustrate the technical solutions of this application and are not intended to limit the scope of the present invention. Although this application has been described in detail with reference to the embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions to the technical solutions of this application do not depart from the spirit and scope of the technical solutions of this application and should be encompassed by the claims of this application.

Claims

1. A method for buffering data in a router, comprising: The router decides how to buffer data packets based on the following logic: If there is free space in the router buffer, the data packet is buffered in the logical partition corresponding to the service type to which the data packet belongs; If there is no remaining space in the router buffer and the occupied space of the logical partition corresponding to the service type to which the data packet belongs is less than the buffer threshold of the logical partition, the data packet is buffered in replacement mode; If there is no remaining space in the router buffer and the occupied space of the logical partition corresponding to the service type to which the data packet belongs is greater than or equal to the buffer threshold of the logical partition, the data packet is discarded; The logic partition is a storage area divided by the router in the buffer according to the service type, and each logic partition has a different priority according to the service type.

2. The method for buffering data in a router according to claim 1, wherein: In the logical partition, the router creates a buffer queue for each mobile terminal entity.

3. The method for buffering data in a router according to claim 2, wherein: The replacement method includes: Find the logical partition with the lowest priority and a total buffer queue length exceeding the buffer threshold, and select the tail of a buffer queue from the logical partition to discard a packet. The data message is buffered in the logical partition corresponding to the service type to which the data message belongs.

4. The method for buffering data in a router according to claim 1, wherein: The sum of the buffer thresholds of all logical partitions equals the total capacity of the router buffer.

5. The method for buffering data in a router according to claim 4, wherein: The buffer threshold T of the i-th logical partition i The calculation formula is: Where B represents the total capacity of the router buffer; G represents the number of logical partitions; θ i Represents the coefficient of the i-th logical partition, and the calculation formula is: θ i =(priority i ) 2 *percent i Among them, priority i , 0 <priority i ≤1 indicates the priority of the i-th type of service; percent i Indicates the proportion of traffic of type i in a statistical period: Among them, S i Indicates the number of data packets received by the i-th logical partition in a statistical period.

6. The method for buffering data in a router according to claim 5, wherein: The buffer threshold is updated periodically.

7. The method for buffering data in a router according to claim 1, wherein: The header of the data message carries the entity identifier of the mobile terminal, the destination network address and the service type.

8. The method for buffering data in a router according to claim 7, wherein: A name resolution system is used to maintain a mapping relationship between the entity identifier of the mobile terminal and the network address of the mobile terminal.

9. The method for buffering data in a router according to claim 7, wherein: In addition to basic routing and forwarding capabilities, the router also has the following functions: Read, fill in and modify the fields in the data message header. The modified fields include: destination network address; Maintain the mapping relationship between business types and corresponding priorities; The buffer threshold of the logical partition is calculated based on the business traffic entering the logical partition, the priority corresponding to the business type of the logical partition, and the total buffer capacity; the business traffic refers to the business traffic entering the logical partition measured in each logical partition period.

Images