CN104270723A - Broadcast Scheduling Method for Multi-channel Big Data Items Based on Two-layer Scheduling Strategy - Google Patents
Broadcast Scheduling Method for Multi-channel Big Data Items Based on Two-layer Scheduling Strategy Download PDFInfo
- Publication number
- CN104270723A CN104270723A CN201410473490.7A CN201410473490A CN104270723A CN 104270723 A CN104270723 A CN 104270723A CN 201410473490 A CN201410473490 A CN 201410473490A CN 104270723 A CN104270723 A CN 104270723A
- Authority
- CN
- China
- Prior art keywords
- channel
- data item
- data
- item
- data items
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
技术领域 technical field
本发明属于数据传输通信技术,具体涉及一种基于双层调度策略的多信道大数据项广播调度方法。 The invention belongs to data transmission communication technology, and in particular relates to a multi-channel large data item broadcast scheduling method based on a two-layer scheduling strategy.
背景技术 Background technique
通过无线信道广播数据,不仅可以克服移动无线通信的非对称、低宽带等劣势;而且可支持大量移动设备同时高效访问服务器端的数据库,发送数据的代价与接收者数量基本无关。由于移动设备能耗有限,数据广播可以减少其获取数据电量的消耗。无线数据广播是目前无线网络传输数据的主流方式,广播服务器通过公共信道发送数据,移动终端用户侦听广播信道并及时下载自己需求的数据。 Broadcasting data through wireless channels can not only overcome the asymmetry and low bandwidth disadvantages of mobile wireless communication, but also support a large number of mobile devices to efficiently access the server-side database at the same time, and the cost of sending data is basically independent of the number of receivers. Due to the limited energy consumption of mobile devices, data broadcasting can reduce the power consumption of acquiring data. Wireless data broadcasting is currently the mainstream method of wireless network data transmission. The broadcast server sends data through the public channel, and the mobile terminal users listen to the broadcast channel and download the data they need in time.
如何快速的获取访问数据和减少移动设备电量的消耗,是无线数据广播研究的两个关键。相应地,衡量广播性能的两个主要参数为:访问时间(Access time)和调谐时间(Tuning time)。访问时间指从用户提出请求到得到请求数据所消耗的时间。调谐时间指从用户提出请求到得到请求数据前监听信道所消耗的时间。 How to quickly obtain and access data and reduce the power consumption of mobile devices are two key points in the research of wireless data broadcasting. Correspondingly, the two main parameters to measure broadcast performance are: access time (Access time) and tuning time (Tuning time). Access time refers to the time consumed from the user making a request to obtaining the requested data. Tuning time refers to the time spent listening to the channel from when the user makes a request to when the requested data is obtained.
目前主流的广播调度算法有针对单数据项(每次用户只请求一个数据项)的平坦调度(Flat Broadcast)、基于访问概率的调度(Probabilistic based Broadcast)等。针对多数据项请求的有QEM调度算法、改进型QEM调度算法、GCM算法等。对多数据项的各调度算法而言,QEM算法是最早提出的详细讨论多数据项的广播算法,相比随机调度算法平均访问时间减少了25%左右;改进型的QEM算法在任何情况下平均访问时间都较QEM算法短,但复杂度较高;GCM算法在各种情况下平均访问时间都较QEM算法长,但复杂程度较低。 Currently, the mainstream broadcast scheduling algorithms include flat broadcast (Flat Broadcast) and access probability-based scheduling (Probabilistic based Broadcast) for single data items (only one data item is requested each time). For multiple data item requests, there are QEM scheduling algorithm, improved QEM scheduling algorithm, GCM algorithm, etc. For each scheduling algorithm of multiple data items, the QEM algorithm is the first broadcast algorithm to discuss multiple data items in detail. Compared with the random scheduling algorithm, the average access time is reduced by about 25%; the improved QEM algorithm averages The access time is shorter than the QEM algorithm, but the complexity is higher; the average access time of the GCM algorithm is longer than the QEM algorithm in all cases, but the complexity is lower.
多信道无线数据广播指多个信道同时进行数据广播。同单信道数据广播相比,提高了效率,减少了访问时间。虽然近年来已有许多研究者提出了一些多信道单数据项请求的数据广播调度算法,如两层调度策略(two level optimization scheduling algorithm,TOSA)。但是多信道下多数据项请求的调度还处于尝试阶段。针对数据长度较长的大数据项而言,若直接将该数据项视为一个整体,则会导致该大数据项在信道进行数据推送期间,若有其他用户需求该数据项并开始监听信道,则需等待至这次数据推送周期结束到下个周期开始推送该数据项,才能开始接收。不仅大大增加了调谐时间,同时也增加了访问时间。 Multi-channel wireless data broadcasting refers to simultaneous data broadcasting on multiple channels. Compared with single-channel data broadcasting, efficiency is improved and access time is reduced. Although in recent years, many researchers have proposed some data broadcast scheduling algorithms for multi-channel single data item requests, such as two-level optimization scheduling algorithm (TOSA). However, the scheduling of multiple data item requests under multiple channels is still in the experimental stage. For a large data item with a long data length, if the data item is directly regarded as a whole, it will cause the large data item to be pushed during the channel. If other users demand the data item and start listening to the channel, You need to wait until the end of this data push cycle and start to push the data item in the next cycle before you can start receiving it. Not only the tuning time is greatly increased, but also the access time.
发明内容 Contents of the invention
本发明的目的是针对能耗受限的移动设备在非对称无线网络情况下如何高效、迅速地获得含有大数据项的多数据项而提出一种基于双层调度策略的多信道大数据项广播调度方法。 The purpose of the present invention is to propose a multi-channel large data item broadcast based on a two-layer scheduling strategy for how to efficiently and quickly obtain multiple data items containing large data items for mobile devices with limited energy consumption in the case of asymmetric wireless networks Scheduling method.
为达到上述目的,本发明的构思是: To achieve the above object, design of the present invention is:
提出了针对数据项长度较长的大数据项进行分包预处理后,再利用信道分配算法将多个数据包进行信道分配。实现了在大数据项推送下,周期广播数据期间有其他用户实时需求数据时,分包应用使得用户无需等待过长时间即可得到数据,减少了平均访问时间。同时,实现了多信道多数据项的请求,通过减少了数据访问冲突和信道跳转减少了平均访问时间。 A channel allocation algorithm is used to allocate multiple data packets to channels after subpacket preprocessing for large data items with long data item lengths. Realized that under the push of big data items, when other users need real-time data during the periodic broadcast data period, the subcontracting application enables users to get the data without waiting for a long time, reducing the average access time. At the same time, the request of multi-channel and multi-data items is realized, and the average access time is reduced by reducing data access conflicts and channel jumps.
根据上述发明构思,本发明采用下述技术方案: According to above-mentioned inventive concept, the present invention adopts following technical scheme:
一种基于双层调度策略的多信道大数据项广播调度方法,包括大数据项数据分包、高层数据项信道分配、低层单信道数据项分配三个过程,具体步骤如下: A multi-channel big data item broadcast scheduling method based on a two-layer scheduling strategy, including three processes of big data item data packetization, high-level data item channel allocation, and low-level single-channel data item allocation. The specific steps are as follows:
a、大数据项数据分包,包括如下步骤: a. Data subcontracting of large data items, including the following steps:
(a-1)、初始化,服务器端获取所有请求数据的移动设备的唯一标识,要求每个移动设备拥有一个独立的身份标识号; (a-1), initialization, the server obtains the unique identification of all mobile devices requesting data, requiring each mobile device to have an independent identification number;
(a-2)、服务器端获取可用信道的总数计为K,并对所有信道进行编号,要求每个信道拥有一个独立的编号; (a-2), the total number of available channels obtained by the server is counted as K, and all channels are numbered, requiring each channel to have an independent number;
(a-3)、服务器端获取所有移动用户访问的数据项,总数计为N,并对所有数据项进项编号,要求每个数据项拥有一个唯一的编号; (a-3), the server obtains all data items accessed by mobile users, the total number is N, and numbers all data items, requiring each data item to have a unique number;
(a-4)、依据步骤(a-2)各个信道的编号,获取相对应的可用信道带宽计为 ,其中; (a-4), according to the number of each channel in step (a-2), obtain the corresponding available channel bandwidth as ,in ;
(a-5)、依据步骤(a-3)各个数据项的编号,统计获得各个数据项的被访问概率计为p,以及各个数据项的数据包长度计为l; (a-5), according to the number of each data item in step (a-3), count the access probability of each data item as p, and the data packet length of each data item as l;
(a-6)、依据各个可用信道的带宽和各个数据项的数据包长度,判断需求数据项中是否含有大数据项,若含有则需进行大数据项预分包处理,若无则直接依据信道分配法对各数据项进行信道分配; (a-6), according to the bandwidth of each available channel and the data packet length of each data item, determine whether the required data item contains a large data item, if it contains, it needs to pre-packet the large data item, if not, directly according to The channel allocation method allocates channels to each data item;
(a-7)、依据最大可用信道的带宽,对大数据项进行预分包处理,并对所有数据包进行编号,要求该数据项的各个数据包拥有一个唯一的标识,且编号含有该数据项的标识信息; (a-7), according to the bandwidth of the largest available channel, pre-package large data items, and number all data packets, requiring each data packet of the data item to have a unique identifier, and the number contains the data Item identification information;
(a-8)、选取可用信道带宽较大的信道,并预留该信道; (a-8), select a channel with a larger available channel bandwidth, and reserve the channel;
b、高层数据项信道分配,包括如下步骤: b. High-level data item channel allocation, including the following steps:
(b-1)、选取已预留具有最大可用信道带宽的信道,将大数据项划分好的各个数据包分配至该信道; (b-1), select the reserved channel with the largest available channel bandwidth, and allocate each data packet divided by the big data item to the channel;
(b-2)、依据各数据项的被访问概率和其数据长度的乘积,划分除已分配好的大数据项之外的其余数据项,并按照获得的乘积从大到小排列各数据项; (b-2) According to the product of the access probability of each data item and its data length, divide the remaining data items except the allocated large data items, and arrange the data items according to the obtained product from large to small ;
(b-3)、依据除已分配好的信道之外其余信道的信道带宽,并按照信道的带宽从小到大排列各信道,记剩余可用信道总数为; (b-3), according to the channel bandwidth of the other channels except the channel that has been allocated, and arrange the channels according to the bandwidth of the channel from small to large, record the total number of remaining available channels as ;
(b-4)、令 ,其中表示第i个可用信道的信道带宽,表示第个可用信道的信道带宽; (b-4), order ,in Indicates the channel bandwidth of the i-th available channel, Indicates the first The channel bandwidth of available channels;
(b-5)、将已排序好的每2B个数据项作为一组,前B个数据项顺序分配到1至中,后B个数据项顺序分配到至1中,分配到各信道的数据项的数量与此信道可用带宽的平方根成正比; (b-5), each sorted 2B data items are taken as a group, and the first B data items are assigned to 1 to , the last B data items are sequentially assigned to to 1, the number of data items allocated to each channel is proportional to the square root of the channel's available bandwidth;
(b-6)、令 等于分配至第i个信道的所有数据项被访问频率与长度乘积二次方根的总和,依次递归比较各信道的 的值,找到该值最大和最小的信道并计为 ; (b-6), order It is equal to the sum of the square root of the product of the access frequency and the length of all data items assigned to the i-th channel, and recursively compares each channel in turn The value of , find the channel with the largest and smallest value and calculate it as ;
(b-7)、从 中依次递归调用各数据项,找到值 最小的数据项计为 ; (b-7), from Call each data item recursively in turn to find the value The smallest data item counts as ;
(b-8)、对信道 ,比较 和 的值的大小,若前者大于后者则将信道 中最小的数据项 移至信道 ,若前者小于等于后者,则保持原状; (b-8), pair channel ,Compare and The size of the value, if the former is greater than the latter, the channel The smallest data item in move to channel , if the former is less than or equal to the latter, keep the original state;
(b-9)、完成高层数据项信道分配算法; (b-9), complete the high-level data item channel allocation algorithm;
c、低层单信道数据项分配,包括如下步骤: c. Allocation of low-level single-channel data items, including the following steps:
(c-1)、初始化阶,去除传输大数据项的信道,对任意已分配数据信道i,取当前时刻T=0,令 分别计算该信道上所有数据项的被访问频率记为 和长度记为 ,数据项 的间隔为 ,其中M为信道i分配数据项总和且 ; (c-1), initialization stage, remove the channel for transmitting large data items, for any allocated data channel i, take the current time T=0, let Calculate the access frequency of all data items on the channel respectively as and the length is denoted as ,data item The interval is , where M is the sum of allocated data items for channel i and ;
(c-2)、规定各信道数据项传输顺序集合为 ; (c-2), stipulate that the transmission sequence set of each channel data item is ;
(c-3)、比较各信道各数据项 的值,找到该值最小的数据项并记为 , 并且 ; (c-3), compare the data items of each channel The value of , find the data item with the smallest value and record it as , and ;
(c-4)、每次集合S添加完成一个数据项后,令 代表当前时刻; (c-4), each time a data item is added to the set S, let represents the current moment;
(c-5)、当前时刻T,令 ,满足 且 最小的那个数据项放入数据集S中; (c-5), the current time T, let ,satisfy and The smallest data item is put into the data set S;
(c-6)、对该信道上所有数据项依次递归上述算法,直至该信道上被分配的所有数据项均调度完成。 (c-6). Recursively recursively the above algorithm for all data items on the channel until all data items allocated on the channel are scheduled.
本发明与现有技术相比,具有如下显而易见的突出实质性特点和显著技术进步: Compared with the prior art, the present invention has the following obvious outstanding substantive features and significant technical progress:
本发明方法引入多数据项中含有大数据项,并根据最大信道容量预分包处理再分包推送的思想,减少了数据项的平均访问时间,同时减少了信道跳转次数和数据访问冲突,减少了移动终端电能的消耗。本发明吸收了两层调度策略的优点,改进了多信道单数据项请求两层调度策略的算法(包括信道分配算法和log-time算法)。采用本发明的方法,可以实现在推送大数据项周期内,其他移动设备实时需求获取该数据项,无需等待过长时间,减少了平均访问时间。 The method of the present invention introduces the idea that multiple data items contain large data items, and according to the maximum channel capacity, the idea of pre-packetizing and then sub-packetizing and pushing reduces the average access time of data items, and at the same time reduces the number of channel jumps and data access conflicts. The power consumption of the mobile terminal is reduced. The invention absorbs the advantages of the two-layer scheduling strategy, and improves the algorithm (including the channel allocation algorithm and the log-time algorithm) of the multi-channel single data item request two-layer scheduling strategy. By adopting the method of the present invention, it can be realized that other mobile devices need to obtain the data item in real time during the period of pushing the big data item, without waiting for too long, and the average access time is reduced.
附图说明 Description of drawings
图1为数据广播系统体系结构图。 Figure 1 is a structural diagram of the data broadcasting system.
图2为本发明预分包处理示意图。 Fig. 2 is a schematic diagram of prepacketization processing in the present invention.
图3为本发明大数据预分包处理流程图。 Fig. 3 is a flow chart of big data prepacketization processing in the present invention.
图4为本发明高层数据项信道分配流程图。 Fig. 4 is a flowchart of high-level data item channel allocation in the present invention.
图5为本发明单信道数据项分配算法结果示意图。 Fig. 5 is a schematic diagram of the results of the single-channel data item allocation algorithm of the present invention.
图6为本发明单信道数据项分配算法流程图。 Fig. 6 is a flow chart of the single channel data item allocation algorithm of the present invention.
具体实施方式 Detailed ways
本发明的优选实施例结合附图详述如下: Preferred embodiments of the present invention are described in detail as follows in conjunction with accompanying drawings:
一种基于双层调度策略的多信道大数据项广播调度方法,包括大数据项数据分包、高层数据项信道分配、低层单信道数据项分配三个过程,具体步骤如下: A multi-channel big data item broadcast scheduling method based on a two-layer scheduling strategy, including three processes of big data item data packetization, high-level data item channel allocation, and low-level single-channel data item allocation. The specific steps are as follows:
a、大数据项数据分包,包括如下步骤: a. Data subcontracting of large data items, including the following steps:
(a-1)、初始化,服务器端获取所有请求数据的移动设备的唯一标识,要求每个移动设备拥有一个独立的身份标识号; (a-1), initialization, the server obtains the unique identification of all mobile devices requesting data, requiring each mobile device to have an independent identification number;
(a-2)、服务器端获取可用信道的总数计为K=3,并对所有信道进行编号,要求每个信道拥有一个独立的编号,分别计为、、; (a-2), the total number of available channels obtained by the server is counted as K=3, and all channels are numbered, each channel is required to have an independent number, which is counted as , , ;
(a-3)、服务器端获取所有移动用户访问的数据项,总数计为N=7,并对所有数据项进项编号,要求每个数据项拥有一个唯一的编号,分别计为、、、、、、; (a-3). The server obtains all the data items accessed by mobile users. The total count is N=7, and all data items are numbered. Each data item is required to have a unique number, which is counted as , , , , , , ;
(a-4)、依据步骤(a-2)各个信道的编号,获取相应的信道带宽分别计为=10、=10、=20,如=20表示信道可传输20个单元长度的数据项; (a-4), according to the number of each channel in step (a-2), obtain the corresponding channel bandwidth and count as =10, =10, =20, such as =20 means channel Data items with a length of 20 units can be transmitted;
(a-5)、依据步骤(a-3)各个数据项的编号,统计获得各个数据项的被访问概率分别计为=0.5、=0.2、=0.1、=0.1、=0.07、=0.05、=0.01,以及各个数据项的数据包长度分别计为=1、=16、=3、=3、=2、=3、=2,如表示数据项的长度为2个单元长度; (a-5), according to the number of each data item in step (a-3), the access probability of each data item is calculated as =0.5, =0.2, =0.1, =0.1, =0.07, =0.05, =0.01, and the packet length of each data item is calculated as =1, =16, =3, =3, =2, =3, =2, such as Represents a data item The length of is 2 unit lengths;
(a-6)、依据各个可用信道的带宽和各个数据项的数据包长度,判断需求数据项中是否含有大数据项,由,确定为大数据项,; (a-6), according to the bandwidth of each available channel and the data packet length of each data item, determine whether the required data item contains a large data item, by ,Sure is a big data item,;
(a-7)、依据最大可用信道的带宽=20,对大数据项进行预分包处理,并对所有数据包进行编号,将以每四个单元数据长度为一个数据包进行分组,数据包分别计为、、、; (a-7), based on the bandwidth of the largest available channel =20, for large data items Perform pre-packet processing, and number all data packets, will Each four-unit data length is used as a data packet for grouping, and the data packets are counted as , , , ;
(a-8)、预留信道用于传输数据项的各个数据包; (a-8), reserved channel for transferring data items Each data packet of
b、高层数据项信道分配,包括如下步骤: b. High-level data item channel allocation, including the following steps:
(b-1)、选取信道,将大数据项划分好的各个数据包、、、分配至该信道; (b-1), select the channel , the big data item Divided data packets , , , assigned to the channel;
(b-2)、依据各数据项的值,划分除已分配好的大数据项之外的其余数据项,并按照获得的乘积从小到大排列各数据项依次为、、、、、; (b-2), according to each data item The value of , dividing the allocated large data item The rest of the data items, and according to the product obtained from small to large, the data items are arranged in order as , , , , , ;
(b-3)、除去信道,其余信道按照带宽从小到大排列依次为、,排序完成的可用信道总数计为; (b-3), remove the channel , and the remaining channels are arranged in ascending order of bandwidth as follows: , , the total number of available channels after sorting is counted as ;
(b-4)、依据步骤(b-3)令 2,其中表示第i()个可用信道的信道带宽,表示(b-3)中信道带宽的最大值; (b-4), pursuant to step (b-3) order 2, of which Indicates the i-th ( ) the channel bandwidth of available channels, Indicates the maximum value of the channel bandwidth in (b-3);
(b-5)、将已排序好的每2B=4个数据项作为一组,在保证各信道带宽充足的前提下,前2个数据项顺序分配到1至中,后2个数据项顺序分配到至1中,结果为、、分配至,、、分配至; (b-5). Each 2B=4 data items that have been sorted are taken as a group. On the premise of ensuring that the bandwidth of each channel is sufficient, the first 2 data items are sequentially allocated to 1 to , the last 2 data items are sequentially assigned to to 1, the result is , , assigned to , , , assigned to ;
(b-6)、令 等于分配至第i个信道的所有数据项被访问频率与长度乘积二次方根的总和,递归比较各信道的值得,记 ; (b-6), order is equal to assigning to the i-th The sum of the quadratic root of the product of the access frequency and the length of all data items of a channel, recursively compare each channel worthy of ,remember ;
(b-7)、从 中依次递归调用各数据项,找到值 最小的数据项计为 ; (b-7), from Call each data item recursively in turn to find the value The smallest data item counts as ;
(b-8)、对信道 ,比较 和 值的大小结果为:,则无需将数据项移至信道; (b-8), pair channel ,Compare and The magnitude of the value results in: , there is no need to put the data item move to channel ;
(b-9)、完成高层数据项信道分配算法,结果为数据项、、分配至信道,数据项、、分配至信道; (b-9), complete the high-level data item channel allocation algorithm, and the result is the data item , , assigned to channel, data item , , assigned to channel;
c、低层单信道数据项分配,包括如下步骤: c. Allocation of low-level single-channel data items, including the following steps:
(c-1)、初始化阶段,信道分别取当前时刻T=0、,分别计算各信道数据项 的间隔为 ,其中M为各信道i分配数据项总和且 。信道:、、,信道:、、; (c-1), initialization phase, The channels respectively take the current time T=0, , respectively calculate each channel data item The interval is , where M is the sum of data items assigned to each channel i and . channel: , , , channel: , , ;
(c-2)、规定各信道数据项传输顺序集合为 ,当前时刻,信道S集合均全集; (c-2), stipulate that the transmission sequence set of each channel data item is , the current moment, Channel S sets are all sets;
(c-3)、分别比较各信道各数据项 的值,找到该值最小的数据项并记为 , 并且 ,当前时刻信道,信道; (c-3), compare each data item of each channel separately The value of , find the data item with the smallest value and record it as , and , the current moment channel , channel ;
(c-4)、信道仅剩余数据项则信道的数据传输调度顺序为,信道当前时刻; (c-4), Channel only remaining data items but The data transmission scheduling sequence of the channel is , channel current moment ;
(c-5)、信道当前时刻T=1,令 ,则、,满足 且 ,则S数据集中添加数据项; (c-5), Channel current time T=1, let ,but , ,satisfy and , then add data item in S data set ;
(c-6)、信道仅剩余数据项则信道的数据传输调度顺序为; (c-6), Channel only remaining data items but The data transmission scheduling sequence of the channel is ;
(c-7)、综上信道S数据集为,信道S数据集为。 (c-7), to sum up The channel S dataset is , The channel S dataset is .
在实际的系统设计过程中,通常存在许多移动终端用户需求访问一个或多个相同的数据项。参见图1数据广播系统体系结构图,信息服务器和广播服务器均可使用有线网络与数据库相连直接检索数据,移动终端需通过无线网络监听广播服务器推送数据的无线信道。实际中,许多移动终端需求获得基于该地理位置的大量相关用户的信息,若将所有数据整体视作一个数据项,则在广播该数据项时有其他需求该数据项的移动终端开始监听信道,则需等待很长的时间。若将该大数据项预分包,则其他用户可先开始接收部分数据。该对比过程如图2预分包处理示意图所示。 In the actual system design process, there are usually many mobile terminal users who need to access one or more same data items. Referring to Figure 1, the architecture diagram of the data broadcasting system, both the information server and the broadcasting server can use a wired network to connect to the database to directly retrieve data, and the mobile terminal needs to listen to the wireless channel through which the broadcasting server pushes data through the wireless network. In practice, many mobile terminals need to obtain a large number of relevant user information based on the geographic location. If all the data is regarded as a data item as a whole, when the data item is broadcast, other mobile terminals that need the data item will start to monitor the channel. It takes a long time to wait. If the large data item is prepackaged, other users can start receiving part of the data first. The comparison process is shown in Figure 2, a schematic diagram of pre-packetization processing.
在实际推送数据的过程中,多个移动终端为获得同一数据需监听同一可用信道,且不同的移动用户会在不同的时间接入该信道。大数据预分包处理流程图如图3所示,首先,服务器端获取各可用信道的信道容量,如该信道最大允许传输多少比特的数据包,最大允许传输多少个数据项。其次,服务器端获取所有被请求的数据项的长度。根据所有可用信道的信道容量和数据项的长度,判断是否存在大数据项。若存在大数据项,则需选取信道容量最大的信道,根据其信道容量判断分包策略,对大数据项进行预分包处理。为每一个数据包编号,要求每一数据包有唯一标识,且编号含有该数据项标识。再按照包序列号进行排序。 In the process of actually pushing data, multiple mobile terminals need to monitor the same available channel in order to obtain the same data, and different mobile users will access the channel at different times. The flow chart of big data pre-packetization processing is shown in Figure 3. First, the server obtains the channel capacity of each available channel, such as the maximum number of data packets allowed to be transmitted by the channel, and the maximum number of data items allowed to be transmitted. Second, the server gets the length of all requested data items. Based on the channel capacity of all available channels and the length of the data item, it is judged whether there is a large data item. If there are large data items, it is necessary to select the channel with the largest channel capacity, determine the packetization strategy according to its channel capacity, and pre-package the large data items. To number each data packet, each data packet is required to have a unique identifier, and the number contains the identifier of the data item. Then sort by package serial number.
高层数据项信道分配流程图如图4所示,首先服务器端判断是否存在大数据项。若不存,在则直接执行可用信道数据项分配算法;若存在,服务器端需判断是否已完成大数据项的预分包处理。若已经完成,则需将大数据项的数据包按照已排序好的顺序分配至预留的信道容量最大的信道上,继而执行信道分配算法;若还为完成,则等待该机制执行完成。可用信道数据项分配算法执行完成后,服务器端还需优化该算法,服务器端需统计不同用户访问的所有数据项,并按照用户分类,微调已分配完成的数据项,使同一用户需求的数据项较多的分配至同一信道上,避免了因为访问的各数据项在不同的信道上而需信道跳转,增加了移动终端的平均访问时间。 The high-level data item channel allocation flow chart is shown in Figure 4. First, the server side judges whether there is a large data item. If it does not exist, it will directly execute the allocation algorithm of the available channel data items; if it exists, the server side needs to judge whether the pre-packet processing of large data items has been completed. If it has been completed, it is necessary to allocate the data packets of the large data items to the channel with the largest reserved channel capacity according to the sorted order, and then execute the channel allocation algorithm; if it is not yet completed, wait for the mechanism to complete. After the allocation algorithm of the available channel data items is completed, the server needs to optimize the algorithm. The server needs to count all the data items accessed by different users, and fine-tune the allocated data items according to the user classification, so that the data items required by the same user More allocation to the same channel avoids the need for channel jumping because the accessed data items are on different channels, and increases the average access time of the mobile terminal.
执行完成高层数据项分配算法后,最在每一信道上执行单信道数据项分配算法。该算法的结果示意图如图5所示,在实际应用中不同移动终端会在不同的时间接入该信道,故访问频率大的数据项应平均分配在该信道上,当有其他移动用户需要获取该数据项时,无需等待该广播周期结束,即可接收该数据项,节省了平均访问时间,减少了移动终端的能耗。该算法流程图如图6所示,在实际应用中,服务器端首先需要进入初始化阶段,获取该信道上分配的所有数据项的长度及被访问频率,根据实际算法需求规定满足条件的数据集,每次递归log-time算法将满足条件的数据项逐一添加至该数据集。判断分配数据项的信道是否均需执行完成该算法,若完成则双层数据项调度算法即可结束。若无则需未执行完成的信道均完成。 After the high-level data item allocation algorithm is executed, the single-channel data item allocation algorithm is finally executed on each channel. The result diagram of this algorithm is shown in Figure 5. In practical applications, different mobile terminals will access the channel at different times, so the data items with high access frequency should be evenly distributed on the channel. When other mobile users need to obtain When the data item is received, the data item can be received without waiting for the end of the broadcast period, which saves the average access time and reduces the energy consumption of the mobile terminal. The algorithm flow chart is shown in Figure 6. In practical applications, the server first needs to enter the initialization phase to obtain the length and access frequency of all data items allocated on the channel, and specify the data sets that meet the conditions according to the actual algorithm requirements. Each time the recursive log-time algorithm adds the data items satisfying the condition to the data set one by one. It is judged whether all the channels that allocate data items need to complete the algorithm, and if it is completed, the two-layer data item scheduling algorithm can end. If not, all unfinished channels need to be completed.
基于双层调度策略的多信道大数据项广播调度算法执行完成后,满足在多移动终端用户访问多数据项的背景条件下,当所需数据项中含有大数据时,通过大数据预分包处理可以减少移动终端用户平均等待时间,上层数据项信道分配算法的优化避免了各移动用户在获取多数据项时的多次信道跳转,也减少了平均访问时间。在实际应用中低层单信道数据项调度策略可引入反馈机制,当各移动终端用户收到该数据时给予服务器端反馈,若某一项数据不再需求,可在下一推送周期去除该数据,大大减少了平均访问时间。 After the execution of the multi-channel big data item broadcast scheduling algorithm based on the two-layer scheduling strategy is completed, under the background conditions of multiple mobile terminal users accessing multiple data items, when the required data item contains big data, pre-package through big data The processing can reduce the average waiting time of mobile terminal users, and the optimization of the channel allocation algorithm of upper layer data items avoids multiple channel jumps when each mobile user obtains multiple data items, and also reduces the average access time. In practical applications, the low-level single-channel data item scheduling strategy can introduce a feedback mechanism. When each mobile terminal user receives the data, it will give the server feedback. If a certain item of data is no longer needed, the data can be removed in the next push cycle, greatly Reduced average access time. the
Claims (1)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410473490.7A CN104270723B (en) | 2014-09-17 | 2014-09-17 | Multichannel big data item broadcast scheduling method based on double-deck scheduling strategy |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410473490.7A CN104270723B (en) | 2014-09-17 | 2014-09-17 | Multichannel big data item broadcast scheduling method based on double-deck scheduling strategy |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104270723A true CN104270723A (en) | 2015-01-07 |
CN104270723B CN104270723B (en) | 2018-01-02 |
Family
ID=52162199
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410473490.7A Expired - Fee Related CN104270723B (en) | 2014-09-17 | 2014-09-17 | Multichannel big data item broadcast scheduling method based on double-deck scheduling strategy |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104270723B (en) |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103248500A (en) * | 2013-05-22 | 2013-08-14 | 武汉大学 | Real-time on-demand data broadcast scheduling method in consideration of size of data item |
-
2014
- 2014-09-17 CN CN201410473490.7A patent/CN104270723B/en not_active Expired - Fee Related
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103248500A (en) * | 2013-05-22 | 2013-08-14 | 武汉大学 | Real-time on-demand data broadcast scheduling method in consideration of size of data item |
Non-Patent Citations (3)
Title |
---|
AGUSTINUS BORGY WALUYO, FENG ZHU, DAVID TANIAR, BALA SRINIVASAN: "Design and Implementation of", 《IEEE 28TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS》 * |
HAO LIANG,WEIHUA ZHUANG: "Efficient On-Demand Data Service Delivery to High-Speed Trains in Cellular/Infostation Integrated Networks", 《IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS》 * |
THADPONG PONGTHAWORNKAMOL, KLARA NAHRSTEDT,GUIJUN WANG: "HybridCast: A Hybrid Probabilistic/Deterministic Approach for Adjustable Broadcast Reliability in Mobile Wireless Ad Hoc Networks", 《IEEE ICC 2009 PROCEEDINGS》 * |
Also Published As
Publication number | Publication date |
---|---|
CN104270723B (en) | 2018-01-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN106789726B (en) | A kind of high concurrent service resource allocation method based on service priority | |
US8031598B2 (en) | Flow-rate-regulated burst switches | |
JP5324637B2 (en) | Dynamic flowlet scheduling system, flow scheduling method, and flow scheduling program | |
US7369491B1 (en) | Regulating data-burst transfer | |
WO2019072162A1 (en) | Virtual network mapping method, device and storage medium | |
CN110336885A (en) | Edge node allocation method, device, scheduling server and storage medium | |
CN109962760A (en) | A kind of business scheduling method suitable for wireless TDMA ad hoc network | |
CN103781081B (en) | Opportunity sharing-based wireless virtual resource allocation method | |
CN107135056B (en) | Anycast service resource allocation method for reducing frequency spectrum fragments and time delay | |
CN102904836B (en) | Real-time service time slot encapsulating method for multi-frequency time-division multiple-address access system | |
CN104202386B (en) | A kind of high concurrent amount distributed file system and its secondary load equalization methods | |
CN108055701A (en) | A kind of resource regulating method and base station | |
CN106102167A (en) | Real-time on-demand data broadcast scheduling adaptive channel divides and distribution system and method | |
CN106028453B (en) | Wireless dummy network resource cross-layer scheduling mapping method based on queueing theory | |
CN102098217A (en) | Probability-based multipriority queue scheduling method | |
CN104994508A (en) | Cognitive radio mesh network resource distribution and routing method | |
CN107493485A (en) | A kind of resource control method, device and IPTV server | |
CN103179578B (en) | Frequency spectrum switching method in a kind of CR system and device | |
CN104270723B (en) | Multichannel big data item broadcast scheduling method based on double-deck scheduling strategy | |
CN101729941A (en) | Novel fairness resource allocation system for unidirectional light bus network | |
CN116233200B (en) | Electric energy meter communication method and system based on subsequent frame dynamic registration | |
CN102377576B (en) | Multicast realization method | |
CN110233803B (en) | A scheduling device and method for a transmission network node | |
SE522876C2 (en) | Method for assigning time slots in a data communication system | |
CN109361928B (en) | Information center network system and video transmission method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180102 Termination date: 20200917 |