CN100518121C - Communication band width dynamic distributing method in chain type group network - Google Patents

Communication band width dynamic distributing method in chain type group network Download PDF

Info

Publication number
CN100518121C
CN100518121C CN 200710088840 CN200710088840A CN100518121C CN 100518121 C CN100518121 C CN 100518121C CN 200710088840 CN200710088840 CN 200710088840 CN 200710088840 A CN200710088840 A CN 200710088840A CN 100518121 C CN100518121 C CN 100518121C
Authority
CN
China
Prior art keywords
bandwidth
node
step
state
applications
Prior art date
Application number
CN 200710088840
Other languages
Chinese (zh)
Other versions
CN101022387A (en
Inventor
张亚娥
罗文胜
陈石良
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to CN 200710088840 priority Critical patent/CN100518121C/en
Publication of CN101022387A publication Critical patent/CN101022387A/en
Application granted granted Critical
Publication of CN100518121C publication Critical patent/CN100518121C/en

Links

Abstract

本发明涉及一种链型组网中通信带宽动态分配的方法,在正常状态时,在各个从节点之间平均分配带宽;在突发状态并且资源允许时,某些节点抢占其它节点的部分带宽,进而占用一个较大的带宽,通信告一段落后,释放抢占的带宽。 The present invention relates to a method in chain networking communication bandwidth is dynamically allocated, in the normal state, the average allocated bandwidth from the respective nodes between; in burst state and when resources permit, certain nodes occupy part of the bandwidth of other nodes , and thus occupies a large bandwidth, the communication ended after releasing seize bandwidth. 本发明所述的方法解决流量不均匀的链型网中,节点之间带宽资源的供求矛盾,以及整条链路的带宽资源的浪费问题。 The method of the present invention to solve the uneven traffic chain networks, supply and demand of bandwidth resources between nodes, and the waste of bandwidth resources of the whole link.

Description

—种链型组网中通信带宽动态分配的方法 - The method of the kind of chain networking communication bandwidth dynamically allocated

技术领域 FIELD

本发明涉及通信系统中链型组网时带宽的分配方法,特別是涉及一种流量不均匀的链型网中带宽的动态分配方法。 The present invention relates to a method for allocating communication bandwidth chain networking systems, more particularly to a method for dynamic allocation uneven chain A flow network bandwidth.

背景技术 Background technique

在通信系统中,为了满足容量或覆盖等方面的需求,需要将通信子系统或节点进行组网,常见的拓朴结构有链型、星形、环形、树形等,其中链型是一种基本的拓朴,可以扩展成环形、树形等。 In the communication system, in order to meet the needs of capacity or coverage, etc., the need for networking communications subsystem, or node, has a common topology chain, star, ring, tree, etc., which is a chain the basic topology can be extended in a ring, like a tree.

链型组网时,根据资源的重要程度或者操作的主从关系,常将节点分为主、从两类。 Chain-type network, or in accordance with the degree of importance of the resource from the main operating relationships often divided into the main node, from the two. 最典型的链型网由一个主节点和多个从节点构成,主节点处理核心业务,并对从节点进行管理,从节点完成特定的功能,各个从节点与主节点之间的通道构成一条共享的链路,如何分配各个从节点的带宽,成为首当其冲的问题。 The most typical chain is composed of a network node from the master node and a plurality of master nodes core business, and manages the nodes, from the nodes perform specific functions, each constituting a channel from the shared between the node and the master node link, how to allocate the bandwidth from each node, bear the brunt of the problem. 现有方法中,常见的是有平均分配、阶梯分配等,它 Existing methods, it is common that there is equal distribution, distribution of the ladder, it

们有一个共同点: 一旦分配,就基本固定下来。 They have one thing in common: Once assigned, it basically fixed. 定义主节点到从节点的方向为下行,反之为上行。 It is defined as the direction from the master node to the downstream node, and vice versa for the uplink. 以一个有N个从节点的链型网为例,假设每个从节点的上行的带宽都为B,那么整条链路总的上行带宽为BxN (记为W)。 In a chain of N from the network node as an example, assuming each uplink bandwidth from the node are B, then the whole upstream bandwidth is total link BxN (referred to as W). 实际的通信系统中,因为业务的突发性和周期性,各个节点的流量并不均匀。 Actual communication system, since the periodic traffic and bursty traffic of each node is not uniform. 考虑一个从节点的上行流量,在一个合适的周期内,流量在一定水平(B之下的某个点)上波动,达到B的比例并不高。 Consider, within an appropriate period, the flow rate at a certain level (below a point B) from the fluctuation of the upstream traffic node, the proportion of B is not high. 考虑整条链路的上行流量,在某一个时刻,各个从节点的流量参差不齐,总流量并不大;在一个合适的周期内,各个节点此消彼长,总流量在一定水平(W之下的某个点)上波动,达到W的比例也不高。 Consider the whole link upstream traffic, at a certain moment, the respective nodes from uneven flow, the total flow rate is not large; in a suitable cycle, the shift in each node, the total flow rate at a certain level (W fluctuations) below a certain point, the proportion of W is not high. 下行带宽的情况,与上行类似。 The case of downstream bandwidth, similar to the uplink. 显然,流量不均匀的链型网中,固定地分配带宽,将带来两个问题, 一是某些节点的带宽在业务繁忙时供不应求,同一时刻其它节点的带宽却又可能供过于求;二是组网时要求整条链路的带宽根据峰值流量设计,在---定程度上存在资源浪费问题。 Clearly, the uneven flow of chain network, the fixed allocation of bandwidth will bring the two issues, one is the bandwidth of certain nodes in short supply in the busy business, the same time the bandwidth of other nodes but may oversupply; Second group when the whole link requires network bandwidth, the peak design flow rate, problems in waste of resources --- certain extent.

发明内容 SUMMARY

本发明所要解决的技术问题是:针对现有技术中的问题,提供一'种链型组网中通信带宽动态分配的方法,解决流量不均匀的链型网中,节点之间带宽资-源的供求矛盾,以及整条链路的带宽资源的浪费问题。 The present invention solves the technical problem: for the problems of the prior art, there is provided a method of the 'kind in chain networking communication bandwidth dynamically allocated, to solve the uneven traffic chain network bandwidth resources between nodes - Source the contradiction between supply and demand, as well as the waste of bandwidth resources of the entire link.

本.发明为解决上述技术问题所采用的技术方案是提出一种动态分配带宽的方法,在正常状态时,在各个从节点之间早均分配带宽;在突发状态并'、且资源允许时',某些节点抢占其它节点的部分带宽,进:.而占用一个较大.. 的带宽,通信告一段落后,释放抢占的带宽。 The present invention solves the above-described aspect of technical problem is to provide a dynamic bandwidth allocation method, in the normal state, the respective average early dispensed from the bandwidth between nodes; state and when the burst ', and resources permit ', some portion of bandwidth to seize the node to other nodes, into:. .. occupied a larger bandwidth, the communication ended after releasing seize bandwidth. 具体方案包括以下步骤: Specific programs comprising the steps of:

步骤一:根据链型組网的从节点数N (N大于或等于2),为从节点选择合适的带宽序列,由小到大依次为B;, B2,…,Bk。 Step a: The number of nodes from a chain networking N (N is greater than or equal to 2), to select the appropriate bandwidth from the node sequence, in ascending order of B ;, B2, ..., Bk. 这里合适的含义包括四个方面,一是与业务的匹配姓较好;二是各种带宽之间有一定的梯,变或倍数关系;三是各种带宽之间能进行平滑切换;四是各种带宽的物理实现难度不会太大。 Suitable herein is meant to include four sides, namely preferably with business name matching; Second, there is a certain gradient between the various bandwidths, or multiple of change; Third smooth switching can be performed among various bandwidths; Fourth various bandwidths physical implementation will not be much difficulty.

步骤二:根据步骤一的带宽系列,选择合适的整条链路的总带宽W,进而得到每个节点的平均带宽BW/N。 Step two: a series of the steps of the bandwidth, the total bandwidth of W select the appropriate whole link, thereby to obtain an average of each node bandwidth BW / N. 这里合适的含义指,大多数时候,既可以满足各个节点正常性的小流量传输,又可以满足部分节点突发性的大流量传输。 Here the meaning refers to the right, most of the time, only to meet the small flow of normal transmission of each node, but also to meet a large portion of traffic transmission sudden node. W的取值范围是一个开放的区间,上限不能等于从节点的最大带宽之和,即NxBk,下限不能等于从节点的最小带宽之和,即N x B卜 W is a range of open section, the upper limit is not equal to the maximum bandwidth and the node, i.e. NxBk, the lower limit is not equal to the sum of the minimum bandwidth node, i.e. N x B Bu

步骤三:根据步骤二选择的平均带宽B,以及从节点当前使用的带宽,定义从节点的状态及其变化。 Step Three: The two step selection average bandwidth B, and the bandwidth from the node currently used, state of the node from the definition of its changes. 初始化完成后,进入温饱状态(记为SM),使用平均带宽B。 After initialization, the state enters subsistence (referred to as SM), using the average bandwidth B. 需要进行大流量的传输时,发起宽带申请,进入^L渴状态(记为SM0RE)。 When transmitting a large flow rate is required to initiate broadband applications, thirst ^ L enters state (referred to as SM0RE). 宽带申请成功确认后,开始使用大于B的带宽,进入小康状态(记为SJ。完成大流量的传输后,发起窄带申请,进入大康状态(记为S^ss)。窄带申请成功确认后,释放部分带宽,恢复到温饱状态SM。当部分带宽被其它节点征用时,使用的带宽小于B,进入贫困状态(记为Ss)。 After the broadband application is successful confirmation, start using more bandwidth than B, the well-off state (referred to as SJ. To complete the transfer of large flow, initiated narrowband applications, into the big health status (denoted by S ^ ss). Narrowband application is successful confirmation, Bandwidth release portion, to restore the state of food and clothing SM. when a part of the bandwidth is requisitioned other nodes, the bandwidth used is less than B, into the poor state (referred to as Ss).

步骤四:主节点上启动一个定时调度任务,处理从节点的宽带申请和窄带申请,时间片(记为T)的取值应该在一个合适的水平上,在占用最大带宽时,从节点正常的大流量传输可以在一个时间片内完成。 Step Four: Start a timer on the primary node scheduled task, the processing broadband and narrowband applications from the application node, the value of the time slice (referred to as T) should be at an appropriate level, while holding the maximum bandwidth, the node from the normal large traffic transmission may be completed within a time slice. 主节点收到从节点的窄带申请和宽带申请时,根据先进先出的原则分别进行排队。 When the master node receives the narrowband and wideband applications from the application node, according to the FIFO principle are queued separately. 定时调度任务的时间片到达时,先处理窄带申请队列,接着处理宽带申请队列。 When the time reaches the scheduled task chip timing, the first request queue handling narrowband, broadband applications followed by treatment queue.

步骤五:主节点处理窄带申请队列时,依次进行记录。 Step Five: the master node queue handling narrowband applications, sequentially recorded. 各从节点可供出让的带宽进入一个虛拟的自由资源池:此时并没有发生实际的带宽调整。 Each node bandwidth is available for transfer from the freedom to enter a virtual resource pool: At this point the actual bandwidth adjustment did not happen.

步骤六:主节点处理宽带申请队列时,首先,从歩骤五的获取带宽,直到自由资源池为空;其次,搜索是否还有处于温饱状态的从节点,如果有,使其出让部分带宽;如果同时有多个从节点处于温饱状态,应该有一个优先选择的机制,如靠近主节点的从节点优先;最后,如果队列中还有未处理的宽带申请,标志其失败状态。 Step Six: the master node when handling wide application queue, first, the bandwidth acquired from five ho step, until the free resource pool is empty; Secondly, searches whether there is a state of food and clothing from the node, if any, so that the transfer portion of bandwidth; If more than one node in the food and clothing from the state, there should be a preference mechanisms, such as near the master node from the node priority; Finally, if the queue unprocessed broadband applications, the failure flag state.

步骤七:根据步骤五中的记最和步骤六的调度^主节点发起带宽重配广播,启动实际的带宽调整、各-4'、从节点根据新的分配方1t,开始使用新的带IL Step 7: The fifth step of scheduling the step VI and the most referred ^ master node initiates reconfiguration of bandwidth broadcast, start the actual bandwidth adjustment, each of the 4 ', according to the new node from the distribution side 1t, start using the new tape IL

步骤/、、:下'一■个时间片到达之.前,从书'点根据业务需求,按照步骤三 Step / ,,: '. ■ before a time slice arrival, from the book' business needs at the point, according to three steps

的原则:,发起相应申请。 Principles: to launch the appropriate application. 下一个时间片到达之后,主节点根据步骤四~步骤七,处理从节点的申请,开始新一轮的动态带宽分配。 After reaching the next time slice, the master node according to Step seven step four, the process from the application node, start a new round of dynamic bandwidth allocation.

本发明所述的方法,与现有技术相比,首先,对带宽资源进行动态调度,对于流量不均匀的链型网络,尤其是流量周期性变化的链型网络,提高了带 The method according to the present invention, as compared with the prior art, first, the dynamic bandwidth resource scheduling for non-uniform traffic chain networks, in particular the flow rate periodically varying chain network, with improved

宽资源的利用率,在一定程度上实现了按需分配;其次,引入平均带宽的概念,链路的总的带宽小于各节点最大带宽之和,降低了组网成本。 Wide utilization of resources, to achieve a certain extent on demand; Second, the introduction of the concept of average bandwidth, the total bandwidth of the link is less than the maximum bandwidth of each node and, networking cost is reduced.

附图说明 BRIEF DESCRIPTION

图1是本发明所述的链型网中从节点的状态变化示意图; 图2是本发明所述的主节点定时调度任务对窄带申请、宽带申请的处理示意图; FIG 1 is a chain network according to the present invention in a schematic view of a change from a state of the node; FIG schematic handle broadband applications the master node 2 is the timing of the scheduled task of the present invention narrowband application;

图3是本发明所述的链型网带宽动态分配的示意图。 3 is a schematic of the bandwidth of the network chain of the present invention is dynamically allocated.

具体实施方式 Detailed ways

以下描述的是,在一个主节点和四个从节点构成的链型网中,带宽的动态分配方法实施例。 The following describes, in a master node and slave node chain network configuration of four, Dynamic Assignment Example bandwidth.

参见附图,图1中所示的各状态之间的跃迁情况为: Referring to the drawings, where transitions between states is shown in Figure 1:

1:发起宽带申请 1: apply for broadband launched

2:宽带申请失败,返回 2: broadband application fails, the return

3:宽带申请成功,进入小康状态 3: Broadband application is successful, well-off state

4:发起窄带申请,进入大康状态 4: initiating a narrow band application, enter the big health status

5:释放平均带宽之外的带宽,进入温饱状态 5: freeing up bandwidth than the average bandwidth into the state of food and clothing

6:释放大部分带宽:进入贫困状态 6: release most of the bandwidth: Go to poverty

7:收回之前被占用的带宽,进入温饱状态 7: Before you recover the occupied bandwidth, food and clothing into the state

8:部分带宽被占用,进入贫困状态。 8: part of the bandwidth is occupied, enter poverty.

四个从节点使用的带宽系列选取1B,, 2B 、 4B:平均带宽选取2—B,总的链路带宽为4 x 2B = 8B。 Using four series of bandwidth from the node selected 1B ,, 2B, 4B: Select average bandwidth 2B, the total link bandwidth is 4 x 2B = 8B. 对于1B、 2B的从节点,可以发起宽带申请;对于4B的从.节点,可'以发起窄带申谨。 For 1B, 2B slave node may initiate broadband applications; for from node 4B, can 'wish to initiate narrowband application. 四个从节点需要周期性的进行文件-F' 载和数据上掘,.,占用4B带宽时,••••--次传输的时间在10G秒内,,此类传输的间隔时间(周期)是600秒。 Four require periodic leg from the node file -F 'and upload data, while holding the bandwidth of 4B, •••• -. Transmissions time in seconds 10G ,, such transmission intervals (periods ) is 600 seconds. 主.节点上定时调度任务的时"间片选为100秒,, Between when the master timing schedule tasks on the nodes' chip select 100 seconds ,,

初始化完成后,主节点启动定时调度任务、四个从节点使用2B的带宽; 进入温饱状态。 After initialization, the master node starts the timing of scheduled tasks, from four nodes of bandwidth 2B; state into the food and clothing.

在第m个时间片内,靠近主节点的第-一个从节点需要从..主节点下载丈件,发.出宽带申请„ In the m-th time slots, close to the first primary node - a member need to be downloaded from the husband .. master node from the node, issued broadband applications. "

5第IT1+ 1个时间片到,主节点定时调度任务开始处理窄带申请队列,此 5, IT1 + 1 to the time slice, the master node starts the timing process a scheduled task queue narrowband applications, this

时窄带申请队列为空,虚拟的自由资源池为空;接着处理宽带申请队列,只有一个宽带申请,处于温饱状态的从节点有三个,根据就近原则,征用靠近主节点的第二、第三从节点的各1B的带宽;主节点发起带宽重配广播,第一、二、三从节点的带宽分别切换到4B、 iB、 1B、 2B。 Narrowband application queue is empty, free virtual resource pool is empty; followed by treatment queue broadband applications, only a broadband applications in food and clothing from node has three states, according to the principle of proximity, close to the main requisition second node, from the third 1B bandwidth of each node; master node initiates reconfiguration bandwidth of the broadcast, the first, second and third switching bandwidth from nodes respectively to 4B, iB, 1B, 2B.

在第m+ 1个时间片内,第一个从节点完成文件下载,发出窄带申请;第二个从节点需要下载文件,发出宽带申请。 M + 1 in the first time slice, the first to complete a file download from the node, issued narrowband applications; second node needs to download files from the issuing broadband applications.

第m + 2个时间片到,主节点处理窄带和宽带申请,进行带宽重配,第—、二、三、四从节点的带宽分别切换到1B、 4B、 1B、 2B。 M + 2 of the time slices, the master node processes the narrowband and wideband applications, the bandwidth reconfiguration, - of, two, three, four switching bandwidth from node to respectively 1B, 4B, 1B, 2B.

在第m + 2个时间片内,第二个从节点完成文件下载,发出窄带申请;第三个从节点需要下载文件,发出宽带申请。 M + 2 in the first time slice, the second node from the file download is completed, issued narrowband applications; the third node needs to download files from the issuing broadband applications. '第m + 3个时间片到,开始新一轮的带宽重配。 'M + 3 of the time slices to start a new round bandwidth reconfiguration.

6 6

Claims (2)

1.一种链型组网中通信带宽动态分配的方法,其特征在于该方法包括如下步骤: 步骤一:根据链型组网的从节点数N,为从节点选择带宽序列; 步骤二:根据步骤一的带宽序列,选择整条链路的总带宽W,进而得到每个节点的平均带宽B=W/N,W的取值范围是一个开放的区间,上限不等于从节点的最大带宽之和,下限不等于从节点的最小带宽之和; 步骤三:根据步骤二得到的平均带宽B,以及从节点当前使用的带宽,定义从节点的状态及其变化;初始化完成后,进入温饱状态,使用平均带宽B;要进行大流量的传输时,发起宽带申请,进入饥渴状态;宽带申请成功确认后,开始使用大于B的带宽,进入小康状态;完成大流量的传输后,发起窄带申请,进入大康状态;窄带申请成功确认后,释放部分带宽,恢复到温饱状态;当部分带宽被其它节点征用时,使 A method in chain networking communication bandwidth dynamically allocated, characterized in that the method comprises the following steps: Step 1: N according to the number of nodes in the chain networking, the bandwidth of a sequence selected from the node; Step II: The the bandwidth of a sequence of steps of selecting the total width W of the entire link, thereby to obtain the average bandwidth per node B = W / N, W is a range of open interval upper limit is not equal to the maximum bandwidth of the node and, the lower limit is not equal to the minimum bandwidth, and the node; step three: the average bandwidth B obtained in step two, from the node and the bandwidth currently used, and the definition of the state of the node changes; after initialization, the state enters the food and clothing, average bandwidth B; to transmit large flow, launched a broadband application, enter hungry state; broadband application after successful validation, start using a bandwidth greater than B, the well-off state; after completing the transfer of large flow, initiated narrowband applications, Roland enters state; narrowband application after successful validation, a bandwidth release portion, to restore the state of food and clothing; when part of the bandwidth is requisitioned other nodes, so that 的带宽小于B,进入贫困状态; 步骤四:主节点上启动一个定时调度任务,处理从节点的宽带申请和窄带申请,时间片的取值应该在一个合适的水平上,在占用最大带宽时,从节点正常的大流量传输能够在一个时间片内完成; 步骤五:主节点处理窄带申请队列时,依次进行记录,各从节点可供出让的带宽进入一个虚拟的自由资源池; 步骤六:主节点处理宽带申请队列时,首先,从步骤五虚拟的自由资源池获取带宽,直到自由资源池为空;其次,搜索是否还有处于温饱状态的从节点,如果有,使其出让部分带宽,如果同时有多个从节点处于温饱状态,有一个优先选择的机制;最后,如果队列中还有未处理的宽带申请,标志其失败状态; 步骤七:根据步骤五中的记录和步骤六的调度,主节点发起带宽重配广播,启动实际的带宽调整,各个从节点根据 The bandwidth is less than B, enter poverty; Step Four: Start a timer on the primary node scheduled task, the node application processing request from the broadband and narrowband, the time slice value should be at a suitable level, when the maximum bandwidth occupied, completion of the normal high flow rate can be transmitted from a node in a time slice; step five: the master node queue handling narrowband applications, sequentially recording each of the bandwidth available for transfer from node to enter a virtual free resource pool; step six: main when applying for broadband node processing queue, first of all, get free from step five virtual resource pool of bandwidth, until the free resource pool is empty; secondly, whether there is in search of food and clothing from the state of the node, if there is, so to sell part of the bandwidth, if food and clothing while in state from a plurality of nodes, a mechanism for preference; Finally, if the queue unprocessed broadband applications, the failure flag state; step 7: the scheduling step 5 and the step of recording the six, the master node initiates reconfiguration of bandwidth broadcast, start the actual bandwidth adjustment in accordance with the respective slave node 新的分配方案,使用新的带宽; 步骤八:下一个时间片到达之前,从节点根据业务需求,按照步骤三的原则,发起相应申请;下一个时间片到达之后,主节点根据步骤四~步骤七,处理从节点的申请,开始新一轮的动态带宽分配。 The new allocation scheme using the new bandwidth; Step Eight: before the next time slice arrives, the node according to business needs, according to the principle step three, initiating respective applications; after the next time slice arrives, the master node according to step four to Step seven, the processing of applications from the node to begin a new round of dynamic bandwidth allocation.
2. 根据权利要求1所述的链型组网中通信带宽动态分配的方法,其特征在于主节点收到从节点的窄带申请和宽带申请时,根据先进先出的原则分别进行排队;定时调度任务的时间片到达时,先处理窄带申请队列,接着处理宽带申请队列。 2. The method of claim 1 chain networking dynamic bandwidth allocation in a communication claim, wherein the master node receives the request from the node narrowband and broadband applications, according to the FIFO principle are queuing; Scheduling Timing when the task reaches the time slice, the first narrowband application processing queue, the queue is then processed wideband applications.
CN 200710088840 2007-03-28 2007-03-28 Communication band width dynamic distributing method in chain type group network CN100518121C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 200710088840 CN100518121C (en) 2007-03-28 2007-03-28 Communication band width dynamic distributing method in chain type group network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 200710088840 CN100518121C (en) 2007-03-28 2007-03-28 Communication band width dynamic distributing method in chain type group network

Publications (2)

Publication Number Publication Date
CN101022387A CN101022387A (en) 2007-08-22
CN100518121C true CN100518121C (en) 2009-07-22

Family

ID=38710042

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 200710088840 CN100518121C (en) 2007-03-28 2007-03-28 Communication band width dynamic distributing method in chain type group network

Country Status (1)

Country Link
CN (1) CN100518121C (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101252789B (en) 2008-03-20 2011-04-06 华为技术有限公司 Method and apparatus for allocating multi-frame dynamic band width
CN101977159A (en) * 2010-11-26 2011-02-16 重庆金美通信有限责任公司 Management method of bandwidth resources of narrow band network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5673253A (en) 1996-02-29 1997-09-30 Siemens Business Communication Systems Dynamic allocation of telecommunications resources
CN1206526A (en) 1996-12-23 1999-01-27 德纳克公司 Method and arrangement for network resource administration
CN1498461A (en) 2001-02-06 2004-05-19 哈里公司 System and method for dynamic bandwidth allocation
CN1610279A (en) 2003-10-21 2005-04-27 华为技术有限公司 Passive optical network dynamic bandwide distributing apparatus and method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5673253A (en) 1996-02-29 1997-09-30 Siemens Business Communication Systems Dynamic allocation of telecommunications resources
CN1206526A (en) 1996-12-23 1999-01-27 德纳克公司 Method and arrangement for network resource administration
CN1498461A (en) 2001-02-06 2004-05-19 哈里公司 System and method for dynamic bandwidth allocation
CN1610279A (en) 2003-10-21 2005-04-27 华为技术有限公司 Passive optical network dynamic bandwide distributing apparatus and method

Also Published As

Publication number Publication date
CN101022387A (en) 2007-08-22

Similar Documents

Publication Publication Date Title
US6198728B1 (en) Medium access control (MAC) protocol for wireless ATM
Capetanakis Generalized TDMA: The multi-accessing tree protocol
Young USAP multiple access: dynamic resource allocation for mobile multihop multichannel wireless networking
Chowdhury et al. Efficient coflow scheduling with varys
US6940861B2 (en) Data rate limiting
JP4707912B2 (en) The method of code distribution to different data rates in Cdma system, apparatus and computer program
US20070030807A1 (en) System and method for combining requests for data bandwidth by a data source for transmission of data over a wireless communication medium
CN1717879A (en) Method and device for establishing links in an ad hoc wireless system
CN104158631B (en) A method and apparatus for transmitting a data stream
CN100558080C (en) Cluster message transmitting method and distributed cluster system
RU2007137009A (en) Controlling access to the uplink multicarrier environment and a plurality of streams for a communication system
Chandra et al. An efficient call admission control for IEEE 802.16 networks
RU2010118325A (en) The method of the upstream power control in a telecommunications network system that supports both general and individual TPC commands
EP1257514B1 (en) System and method for combining data bandwidth requests by a data provider for transmission of data over an asynchronous communication medium
CN1714580A (en) Method and device for establishing communication links with parallel scheduling operations in a communication system
WO2007056260A3 (en) Bandwidth allocation for video-on-demand networks
CN101480077B (en) Dynamic resource reuse pattern selection in a cellular communication system
JP5206256B2 (en) Bandwidth allocation method and a band allocation device
WO2007052249B1 (en) Dynamic time-slot allocation and qos priority access in a mobile ad hoc network
CN101978367A (en) System and method for scheduling reservation requests for a communication network
CN100387066C (en) Method for scheduling up service resource
JP5575255B2 (en) Cooperative scheduling method and system based on the priority of the cell
KR20070105576A (en) Method for using resource in a multi-cell communication system
CN101489304B (en) Media access control method based on differentiate service of wireless multimedia sensor network
TW201244518A (en) Prioritized random access method, resource allocation method and collision resolution method

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination
C14 Grant of patent or utility model
EXPY Termination of patent right or utility model