TWI246281B - A new slot allocation designed for wireless TDMA network - Google Patents

Abstract

This invention is a new slot allocation designed for wireless TDMA network to control the queuing delay of forwarded packets. The slot allocation at wireless base station applied on a multi-queue architecture distributes each non-empty queue with slots to control the delay of packets. The slots of each packet queue are adaptively allocated according to the queued packets. Such an adaptive allocation has the superior properties: (1) steady queue occupancy; (2) controllable queuing delay; (3) coincidence of allocated output bandwidth and input traffic rate. The delay controllability greatly improves the delay variation between client hosts on various locations and synchronizes the content reception in a multicasting group.

Description

1246281 IX. Description of the invention: [Technical field to which the invention belongs] The present invention relates to an adaptive time slot allocation method, especially a time slot allocation method & used by a deer for time-sharing multiple access wireless networks. Multi-layer ^ born in the transmission delay time is controlled at a settable value, and can reduce the packet loss rate, so that different clients can achieve the purpose of wirelessly synchronously receiving packets for the same data source. [Previous technology] * At present, the Internet is composed of many local networks. When you upload and upload shellfish to the Internet, the data will be processed into sections: packets' and may pass through different routers. Reach the designated counterparty machine. Because the original intention of the development of the Internet is to send the data to the pointing machine correctly, therefore, for the purpose of this-passing purpose, the Internet / 疋 —a kind of best-effort transmission service (Best Eifort Service ), And according to: Shield,-the purpose of transmission and the cheaper router uses the simpler :: distribution packet transmission method, that is-a first come first serve (First 丨 nFirst U, F 丨 FO) processing mechanism, there is no Consideration of priorities. Therefore, this kind of packet distribution method may guarantee transmission dependency (㈣ # 丨 叫), but the Ministry does not guarantee the quality of data transmission (for a while). With the current development and popularization of multimedia data, the type of Genbaise sent by the Internet is no longer limited to static data such as text or graphics, but to signals such as moving day, film or sound that need to be transmitted in the next life. . However, the Internet, which is dominated by hard-working Thais, cannot directly provide real-time or delayed controllable operations. When the data is processed into multiple packets and transmitted to the Internet on 12462281 & multiple identical packets transmitted to different destinations, 'second order or from time to time all destinations receive all packets D Β. Currently, Multimedia applications for video conferences or Internet calls on the Internet are still full =: Latency differences cause low-level transmission of asynchronous video or conversations. In addition to the current Internet, wireless networks also face the same problem. 4The wireless network is composed of wireless network capture points and client architectures. Therefore, in terms of the stability of the data transmission channel, it is relatively inferior to the Internet. Because the wireless transmission channel is ultra-high frequency, it is prone to mutation factors such as communication attenuation, linear transmission, multi-T2 path interference, and radio wave interference. It also affects communication channels. It is also vulnerable to wireless network capture points and customers. The change in position between the ends or the distance between them affects the channel quality. Therefore, the wireless network cannot make the multimedia data have high transmission quality.凊 As shown in the seventh figure, it is the architecture diagram of a third-generation mobile communication system. It can be seen from the figure that the third-generation mobile communication has provided a better transmission rate than the 25th generation, that is, the wireless network. In addition to the capture point (50), it can be connected to the Internet ^, and Kushiro 'to provide a quality assurance sending data type and an effort to send data type evil packet transmission function. At present, the third generation mobile communication system adopts Code Division Multiple Access (CDMA) communication. [K is provided for multiple clients in the same communication range (C e I 丨) to share the same code division multiple storage. Channel to connect to the wireless network access point (50) of the communication range, while the wireless network capture point (50) connects to the client, and 纟 σ reverses the time-division multiple access channel to Provided in the same communication range 1246281, the wireless network capture point (50) divides the time by a fixed unit time (commonly known as time slot; Time Slot) and allocates it to clients in the same communication range. The wireless network capture point (50) will use an effective time slot allocation mechanism 'to meet the quality service of transmitting multimedia data as required by customers. The packet data network of the second-generation communication system is limited by the unchangeable characteristics of Switching. There are three major quality issues to be overcome: Delay time, and the jitter of the time between the transmission of neighboring packets and their delivery. And packet loss (Packet L0ss). Therefore, quite a lot of research has been conducted on the service quality of the packet data network in recent years. = Most of them focus on the reserved technology of the existing bandwidth, and cannot be applied to 2 Differentiated Services (Differentiated Serv | _ce). Based on the US ⑽π organization, the popular applications on the Internet are classified according to timeliness and quality and their needs are analyzed. The application services are roughly divided into four categories: The first category: conversational level (conversational c 丨 ass), such as voice services, shirts, phones, etc. signal type. This type of session-level service is mainly used to provide two-way real-time communication. Therefore, this service is useful for the delay time of packets and the adjacent packets.

The delay time between them will be quite sensitive (De | Sensitivity) 5 M. In other words, when the delay time exceeds about 300ms, it is defined as a bad call σ 口 口 口, conversely, a few of them are lost during transmission The packet can still be judged by the sibling | a humming signal is produced, so this session level can tolerate the arrival accuracy of the packet transmission (packet loss). The second category: Zi Liu, production taste phase _, ’Streaming class, such as Video kbluff type. The service type at the sub-shell level has a continuous and stable requirement for packet flow of 12462281 miles (Packet Flow), so it is very sensitive to the gap between the time interval between transmission and reception of adjacent packets; otherwise, the The delay time (Delay Time) has a higher tolerance. If it is applied to transmitting audiovisual data, it can also tolerate packet 丨 0ss. The second category: data transmission interface level (丨 nteractive class), such as Internet browsing (WWW / Telnet / FTP, etc.). The fourth category: Background dass, such as the type of download data (E-Mail). The second and fourth types of services are data communication services, and do not need to be transmitted on the same day. Therefore, it can tolerate longer data transmission time, but requires accurate shell material transmission, which is a high error sensitivity (Error Sensitivity). )Service type. Because the network has added multimedia data types, in order to transmit different traffic types and service requirements, ETF has developed two mechanisms, integrated service and Diffserv (djfferentiated), to provide services for differential networks. A quality-assured environment allows different data types to be transmitted smoothly (such as video〇 / audi〇). Ntserv uses RSVP (Resource Reservatj〇n pr〇) before the data stream (Traffjc F | 〇w) begins to transmit. t〇c〇) technology is to find a suitable path in advance for the service quality of a specific data type, and after the search is completed, the entire f stream is started to be transmitted, such as & The part of the time spent will be wasted on the path search. The length of the distance between the two services will affect the speed of the transmission time. In addition, the core router that supports ntse "v must be 1246281. Record the forwarding information of each data flow route. Once the number of data flows increases, the information to be recorded by the core router will increase relatively, so ntserv has a large amount of data. There are difficulties in implementation when it is supported by a large range. Wang uiTTsei divides its packet into three different sem.ce classes: EF, AF, and BE. 'Each sem_ce C | ass is represented by DSCp (d PointCodepoint), when a packet enters a router that supports Diffserv, the ingress router (丨 ngress router) will classify and mark the packet, record the DSCP in the DS f_ of the packet, and support the core router Different delivery quality services are adopted for different service levels. Η,-: generation, and '罔 ^ The data type of different service levels will be marked on the network, so there is this single | in the router. That is: =: Column structure 'and implement it 2 = Different packet transmission and distribution methods are implemented. First, the specific :: medium, packet type or data type are classified, and this is temporarily stored:;:, and then by the router Send all the packets up to now. It is based on the type of data that has been used in the queue structure .: Heterogeneous network transmission of different quality requirements-a remarkable issue: this type of multi-layered queue However, the architecture also causes a sequencer to ensure that each row is effectively allocated channel bandwidth to the transmission quality of each symbol. The problem will be exacerbated for bandwidth bandwidth. The knife restricts more restrictive mobile communication systems to achieve remote videoconferencing through wireless networks. 1246281 Use: Need to endure more serious delays than the Internet-Implement the Internet's multi-tier queue architecture in wireless =. It effectively solves the problem of packet delay control. Calling ... [Summary of the invention] To this end, the main object of the present invention is to effectively distribute the time slot network to each of the weeping crows; to effectively solve the time-division multiple access wireless packet transmission Severe delay out of sync issues. Method: ΐ The main technical means used for the above purpose is to make the allocation time slot == a multi-layer piece structure, and the multi-layer structure is divided :; the number of time slots for each ㈣11 with 1 The divider can maintain a stable number of temporarily stored packets, so that: the incoming and outgoing data string traffic is constant, thereby avoiding packet transmission delays; for example, by implementing time-sharing multiple access on a wireless network, complete synchronous viewing But it can improve the problem of serious delay of video or audio signals. [Embodiment] The present invention is a wireless network that applies multi-tenth row structure to a wireless network that implements time-division multiple access technology. People are ancient and matched. There is a new time slot allocation method, in which the multi-layer queue architecture (1 0) includes:: packet type classification unit (11), which receives packets from various lean types on the channel, and classifies them according to their types To classify; a multi-level queue unit (1 unit, containing a complex queue " ^ 'is linked to the packet type classification (Q 1 ~ Q m), and the completed 12462281 packets are classified according to category Temporarily stored in Latin America

Namely, the special queue (Q-time slot allocation unit (丄 3) is dry, .Ί 0. 'Recognize 1 is connected to the multi-layer queue unit (12), to know the current number of each queue , And provide a decision packet temporarily stored in the queue: Q m) ~ temporary packet variables; and 1 Q m) time

A packet scheduling unit (1 4), the total A series and each queue (Q) ~, this C1 1 Qm) of the multi-layer queue unit [2], the time slot allocation unit (丄 3), the knot , Allocating units according to the time slot (Ί qj 连

d) is the time slot allocated to each queue device (QQ m), send the queue to the payday 6 ~ 1, and temporarily store the packet to the same—the wireless network capture point (2) sending the meat . The above-mentioned time slot allocation unit (1 3) controls the number of packets temporarily stored in the queue (q d) to the same degree of stability, so that ^ packets received by different receivers at the same time and then received every W steps. Objective 0 The multi-layered work of the present invention is to enumerate that the Dingmu wood system is applied to the wireless network of the guaranteed type. In order to be compatible with the traditional hard-working network services, as shown in the figure, an additional server is added to the multi-tiered queue architecture (10).

m + 1) for the use of Q channels without specific requirements. The time-slot allocation unit (13) described above is referred to as a storage-for-exhaustion-type service-type network: = ^ L_, where ... "Angle poverty indicates that: This V is a first / queuing queue; ~ -Fang; the data stream of the distribution loop of the brother, where A is a variable of the Ζth queue; and Γ is a distribution cycle, and the meaning of "轮" is to poll all the queues. * 10 1246281 The number of valid time slots is combined. The user can set each packet suppression schedule unit to send a variable value of each item. It is determined that the amount of storage is a -stable value. The rotation and output of the Temporary Temporary Temporary Announcer explains that it is too late. Here are some examples-the number of packets accepted is, "Ding Liyi benefits from this per unit time, and set its parameter to 0.5, then The following sequencer passes through the time slot of the present invention.

From the above, it can be seen that the queuing queue structure of the present ~ 11 ^ month passes the algorithm of the time sample and can temporarily pass through, and can be used for a while, 9 — 'Silly, each queue can keep a certain number of packets In this way, each piece of crying heart A A / Ding 1 is the reverse transmission of the stored packet of the same type-the delay can be effectively controlled, and it will not be because of the use of the first-come-first-delivery distributor: The problem of transmission delay is serious, resulting in the formation of multi-party data. Acceptance occurs. Please match it with 夂 哲 门 Λ ^ /: Yuejiaguling reads the four pictures A to D, hurting the fish. ΙλΓ ^ 〆1246281 Invention actual measurement setting input data flow of different variable queue, time slot allocation ratio The time state diagram of the temporary storage packet data amount and delay time of the queuer can be seen from the figure. With the setting of different variables, there will be a sequence of steady-state time for the same input data flow. Therefore, the user Depending on the required transmission requirements, appropriate variable settings can be made. In addition, since the present invention is mainly applied to a wireless network technology, a wireless channel has a more unstable continuous state than a wired channel. Therefore, when sending a packet, the packet schedule 2 needs to further consider the channel connection state (that is, the channel). quality). In the present invention, the channel quality is expressed as. ", and the time slot allocation Ψ aj ^ m m m King called the number of times and the channel quality is changed, ’so’ the time slot allocation unit includes ----

Calculation formulas for calculating the number of valid time slots

\ rkT ㈣ gt > 0 〇 otherwise ^ ^ ^ ^ Βη Bf m amount. _! When the current channel quality is higher than a certain value, increase the channel quality by Λ

The calculation counts the number of valid time slots required to send a packet. Conversely, if the number of channels is equal to zero (the channel is in an interrupted state), the number of slots for the right pass is set. Therefore, when the time slot is assigned Qin ^ 4, and the quality of the channel is higher than — (in a connected state), then each rune is calculated based on the previous step, #thickness, and Gudan. "," Shake ... Calculate the number of effective time slots with the current channel status, and then add all the time slots to °. And the spear table takes a large number of valid time slots # θ 疋 contains j, J right 疋, then β α cycle can satisfy the number of time slots allocated in the first step, ~~ minutes, and can send packets 12 1246281 Procedure, that is, notify the packet scheduling unit of the number of packets that should be allocated and sent by each queue to the packet scheduling unit to send the program; otherwise, if the number of valid time slots is greater than the maximum number of valid time slots, then On behalf of this-the allocation cycle does not provide enough time slots for the number of time slots of each queue allocated in the first step. In this way, the present invention cooperates with a fair distribution rule (max-min fairness "uIp ,,, —-Shi 丄 s-⑴ ratio), to carry out the allocation of a limited time slot, and try to allocate the number of limited time slots to each rank fairly. The number of time slots allocated to the router is required. Please cooperate with the fifth chart A to D to show the time state diagram of the parameters related to the packet flow of the actual measurement list of the present invention. The fifth chart A reveals this The flow of the input data of the queuer is the state of the quality of the wireless channel. When we invented the invention, the blade configuration calculates the state of the number of time slots allocated according to the input data flow change and the set variables.

Figure 5 and Figure 5 are from the fifth figure. Figure 5 considers the packet sent by the fifth figure B. The state diagram of the number of packets is' because the wireless channel is disconnected only momentarily. The time slot of time-division multiplexing access is as follows: The heavy packet congestion is, as shown in the fifth figure. 0: The number of packets is strictly controlled in a stable range. The value is two. The situation happened. The text suppresses severe transmission delays. Please also cooperate with the sixth diagrams A to D. Each phase M of the variable AA is also at θXJ. . Different knives are determined by the _ of the 1 ::: number, that is, set to ~, respectively. It can be known that ‘these two queues are the ones with larger setting values. 13 1246281’ The delay time is relatively smaller than the children ’s + children ’s quarters—the queues with smaller values are smaller. It can be known from the above description that, for example, when the network is in use, the eight-b invention of the invention is applied to the wireless wireless network. The Cao distribution method includes the following steps: (2 .;: = :: Γ transmission in the next distribution cycle Data flow, first take the value of the loop number currently stored in each queue and set the loop cycle value, 廿 M — one minute earlier and 4,000 疋 — variable value, and then multiply the packet volume and then multiply the product With a single distribution cycle value to calculate the data flow of each queue in the value cycle; ten, out in the early-distribution 2 · leaf calculation of the number of time slots required by each queue ⑺) value multiplication: Erya : The data flow of the serializer and the single-distribution cycle ^ 'Is the number of time slots required to break the last leaf count small? &Amp;% ^ When the maximum effective time slot number is Jin, R, J, Fang; or find and execute Finally-the channel mu / 'execute the next step, if yes, the required time slot. Take the large effective time slot allocated to each queue-3' Equally allocate the effective time slot to each queue (23), proceed Developed procedures for sealing spoons can be taken into the package rule); and A-knife rules (max-min fa 丨 · rne ss According to the == sending program (24), that is, the packet sending program is the time slot or the third step (22). According to the foregoing description, the number of packets sent by this packet is allocated with eight temporarily stored in each queue. The number of packets is proportional to the number of time slots assigned to the queues of each layer based on the variables of the second order, and the flow of the input and round-out packets of each layer of the two is more effective than the monthly packet to solve the packet delay problem. In this way, this issue 14 1 246 281 can be applied to the application of the network with the cow phase a, uv, and alum. To this end, 'this creative peak is in line with novelty and progressiveness. An application for a new type of temple element, Mai Yifa, filed an application. [Simplified illustration of the drawing] 3 A picture is a block diagram of the present invention-a preferred embodiment. F A picture is a block diagram of another-a preferred embodiment of the present invention. —Picture system, method of the present invention—Method flow chart. Figure 4A ~ II · Tech4> Steady state diagram. The present invention detects the transient state of different set variables and the fifth diagram A ~ D: It is the invention. Remaining number state chart. ^ Month ^ then the relevant parameters of the early-child trainer cry: 夂; AD • The present invention detects two The state diagram of the related parameters of 伫 歹 J 口 with the same setting variables. 5 "Ding Di [: Picture: is a block diagram of the architecture of a third-generation mobile communication system. L 芏 Description of essential component symbols] (1〇) Multi-layer 伫Column architecture (1 1) Packet type classification unit (1 2) Multi-layer queue unit (1 3) Time slot allocation unit (1 4) Packet scheduling unit < 2 〇) Wireless network capture point (5 〇) Wireless Network Capture Point 15

Claims (1)

1246281 10. Scope of patent application: Method, a kind of time slot allocator applied to time-sharing multiple access wireless networks. The wireless network that differentiates the service first, that is, enter the packet data: classify the daggers and store them separately. In the specific queue in the multi-layer queue architecture, the time slot allocation method includes: calculating the data flow of each queue in the μ wooden structure: the number of packets stored and I ν fetch first to pay the current queue Then multiply the packet receiving disk variable value by the j value and ... multiply the variable value, 、,, and the value, and then multiply the product with a single value of 邴 Μ ρ to calculate the value in the single-eighth & γ & Knife distribution% Calculate the data flow of each queue in the knife distribution area; Count the number of time slots required for each queue: first quality, and divide by the data flow and single line of each queue Channel product! Determine whether the number of slots at the time of the last calculated request is less than :: value: product, the number of day slots, if not, go to the next step, ^ square, whichever is the most effective allocation is effective:; Γ required by each sequencer Time slot; inch slot to each queue, and execute packet sending In the second or third step, the packet sending procedure is to send the packet in accordance with the above 2. The first step applied to time-sharing multiple access at the time of wireless network can be expressed by -calculation formula 114 data flow of different serializers / Ir ', among which ·············· ^, The resource called by the younger brother Dingliu at the η-solid distribution is called the variable of the younger η-solid queue, and the Beco flow; the T is a distribution cycle. 3. The library as described in item 1 or 2 of the scope of the patent application ... ~ For time-sharing multiple 16 1246281 Time slot allocation method for accessing the wireless network, the number of time slots is calculated when the material is loaded. ： L and> 0 Φ 〇otherMnse 'where 4 is the number of timeslots in the / th queue of the / th queue. 4 The time slot allocation applied to time-sharing multiple access wireless networks as described in item 1 or 2 of the patent scope. The above average allocation is valid for the time slot. _ Each queue step adopts a fair allocation rule (max_min rule ) 〇5. As described in item 3 of the scope of the patent application, it is applied to time division multiple access without network: time slot allocation method of the network. The above average allocation is valid for each step. A fair allocation rule (max -min fairness I Ding Yi, schema: as the next page