WO2012075836A1 - 时隙分配管理方法及装置 - Google Patents
时隙分配管理方法及装置 Download PDFInfo
- Publication number
- WO2012075836A1 WO2012075836A1 PCT/CN2011/078888 CN2011078888W WO2012075836A1 WO 2012075836 A1 WO2012075836 A1 WO 2012075836A1 CN 2011078888 W CN2011078888 W CN 2011078888W WO 2012075836 A1 WO2012075836 A1 WO 2012075836A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- time slot
- available
- node
- linked list
- request
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/16—Time-division multiplex systems in which the time allocation to individual channels within a transmission cycle is variable, e.g. to accommodate varying complexity of signals, to vary number of channels transmitted
- H04J3/1682—Allocation of channels according to the instantaneous demands of the users, e.g. concentrated multiplexers, statistical multiplexers
Definitions
- the present invention relates to the field of optical communications, and in particular, to a time slot allocation management method and apparatus in an ASON (Automatic Switched Optical Network). Background technique
- the ASON network is intelligent and personalized. Its intelligence is mainly reflected in the ability to automatically discover network resources and configure the link. It can pass standard signaling and routing exchange instead of manual or private protocol. The establishment, update, and release of the bandwidth connection can provide the required protection for the service and timely recovery in the event of a network failure. Its personalization is mainly reflected in the service-oriented bandwidth transaction feature, which can allocate bandwidth according to demand and provide differentiated services for customers.
- time slot allocation For each independent ASON network node in the network, its time slot allocation can be divided into two types: upstream time slot allocation and downstream time slot allocation.
- the allocation of the upstream time slot is determined by the downstream time slot allocated by the upstream node, so that the existing time slot allocation can be considered as a mandatory allocation mode, and only the downstream time slot allocation has a network node for each ASON. A certain initiative.
- bandwidth allocation For the existing ASON network, since the hardware is still based on the traditional SDH device theory, most of the bandwidth allocation only supports standard cascading, that is, only VC4, VC4-4C, VC4-16C, VC4-64C, and VC4- are supported.
- Bandwidth allocation of 256C and other granularity For example, there is a link with a bandwidth of 64 VC4s. It only supports 16 consecutive time slot bandwidths of VC4 with start slots 1, 1, 33, and 49 as the available bandwidth of 16 cascades. Due to the above strict requirements, in many cases, after multiple times of time slot allocation and release, the total bandwidth of the link meets the requirements of the service, but cannot meet the cascading number requirement of the service.
- Chinese patent CN200610064662.0 discloses another method of allocating time slots by means of 4n time slot unit grouping as a lookup object. The method traverses the state of each time slot in each time slot allocation, which is inefficient, and cannot comprehensively consider the resource condition of the entire link, and cannot maintain the bearing capacity of the link to the large granularity service to the greatest extent.
- one TE link does not only contain one port, and the time slots of different ports cannot be the same.
- the search method of such an equal step is no longer applicable.
- the main object of the present invention is to provide a time slot allocation management method and apparatus, which aim to improve the bearer capacity of a link and the efficiency of time slot allocation.
- the present invention provides a time slot allocation management method, including: receiving an externally sent time slot allocation request;
- the time slot allocation is performed according to the time slot allocation request and the corresponding available time slot linked list.
- the node data of the available slot list includes the following three fields: a transmission port number, a cascading level, and a slot number.
- the step of generating a corresponding available slot list includes:
- the steps of slot allocation include:
- the time slot allocation request is a time slot request and specifies a transmission port number
- the steps of slot allocation include:
- time slot allocation request is a time slot release request
- a node corresponding to the transmission port number, the cascading level, and the time slot number specified by the time slot release request is inserted in the available time slot linked list of the corresponding TE link.
- the step of updating the available time slot linked list comprises: deleting the found node; or deleting the found node and inserting the remaining nodes of the same hierarchical level as the deleted node.
- the step of updating the available time slot linked list comprises:
- a node corresponding to the cascading level of the previous level is inserted in the available slot list, and the slot number of the node is the same as the slot number of the first node of the four nodes.
- the present invention also provides a time slot allocation management apparatus, including:
- a time slot allocation request receiving module configured to receive an externally sent time slot allocation request; and an available time slot linked list generating module, configured to determine whether a corresponding available time slot linked list exists in the TE link specified in the time slot allocation request, Generating a corresponding linked list of available time slots; the linked list performs time slot allocation.
- the available time slot linked list generating module includes:
- a linked list initialization unit configured to initialize an available slot list corresponding to the TE link
- a flag bit generating unit configured to generate a corresponding flag bit array according to a time slot resource state of each of the transmission ports in the TE link;
- a determining unit configured to sequentially determine, according to the value of the flag bit and the arrangement priority of the transmission port, whether all time slots of each level of each transmission port are available;
- the linked list generating unit is configured to insert a node of the corresponding cascading level into the available time slot linked list when all time slots of the cascading level are available, and set a flag of the corresponding time slot of the inserted node to zero.
- the time slot allocation module includes:
- an allocating unit configured to: when the time slot allocation request is a time slot request request and specify a transmission port number, query, in the available time slot linked list of the corresponding TE link, the specified transmission port number and the cascading level The first node; or when the time slot allocation request is a time slot request and the transmission port number is not specified, querying the first node corresponding to the specified cascading level in the available time slot list of the corresponding TE link Obtaining the slot number corresponding to the first node; or
- time slot allocation request is a time slot release request
- a node corresponding to the transmission port number, the cascading level, and the time slot number specified by the time slot release request is inserted in the available time slot linked list of the corresponding TE link.
- an updating unit configured to update the available time slot linked list. Delete the found node when it reaches the corresponding node; or delete the found node and insert the remaining nodes of the same cascade level as the deleted node; or
- the time slot allocation request is a time slot release request, and the transmission port number and the four nodes with the same cascade level and consecutive time slot numbers are found, the found four nodes are deleted; in the available time slot linked list A node corresponding to the cascade level of the previous level is inserted, and the slot number of the node is the same as the slot number of the first node of the four nodes.
- the method and device for managing time slot allocation according to the present invention generate a corresponding available time slot linked list when generating a TE link or when a time slot allocation request arrives, and only need to be available in the process of applying and releasing subsequent time slots.
- time slot linked list greatly improves the working efficiency; the time slot application adopts the method of querying the linked list instead of using the polling mode, which greatly reduces the time slot fragmentation brought by the time slot allocation process, and the maximum guarantee
- FIG. 1 is a schematic flow chart of an embodiment of a time slot allocation management method according to the present invention.
- FIG. 2 is a schematic diagram of a structure of a slot list that can be used in an embodiment of a time slot allocation management method according to the present invention
- FIG. 3 is a schematic diagram of a structure of an available slot list generated in an embodiment of a time slot allocation management method according to the present invention
- FIG. 4 is a schematic structural diagram of a time slot linked list of a time slot request request process in an embodiment of a time slot allocation management method according to the present invention
- FIG. 5 is a schematic structural diagram of a time slot linked list of a time slot release request process in an embodiment of a time slot allocation management method according to the present invention
- FIG. 6 is a flowchart of generating a corresponding available slot in an embodiment of a time slot allocation management method according to the present invention.
- FIG. 7 is a schematic flow chart of an implementation manner of time slot allocation according to a time slot allocation request and a corresponding available time slot linked list in an embodiment of a time slot allocation management method according to the present invention
- FIG. 8 is a schematic flowchart of another implementation manner of performing time slot allocation according to a time slot allocation request and a corresponding available time slot linked list according to an embodiment of the time slot allocation management method of the present invention
- FIG. 9 is a schematic structural diagram of an embodiment of a time slot allocation management apparatus according to the present invention.
- FIG. 10 is a schematic structural diagram of a slot list generation module in an embodiment of a time slot allocation management apparatus according to the present invention.
- FIG 11 is a block diagram showing the structure of a time slot allocating module in an embodiment of the time slot allocation management apparatus of the present invention. detailed description
- the solution of the embodiment of the present invention is to generate a corresponding available time slot linked list when the TE link is generated or when the time slot allocation request arrives, and query the corresponding available time slot linked list to perform time slot application and release time slot allocation.
- the bearer capability of the link for large-granular services is ensured to the greatest extent, and the problem of bundled link slot allocation is solved.
- an embodiment of the present invention provides a time slot allocation management method, including: Step S101: Receive an externally sent time slot allocation request;
- the method running environment of the embodiment involves an ASON network.
- the method is performed according to the time slot allocation request sent by the host in the ASON network.
- the time slot allocation management device in the ASON network is used to receive the time slot allocation request sent by the host in the ASON network, and the subsequent time allocation request is performed according to the time slot allocation request. Gap allocation processing.
- the slot allocation request includes a request type, a TE link ID, a cascading level, and/or a transmission port number and/or a slot number.
- Step S102 determining whether there is a corresponding available slot list in the TE link specified in the slot allocation request, and if yes, proceeding to step S104; otherwise, proceeding to step S103;
- Step S103 generating a corresponding available time slot linked list
- the time slot allocation management device when the time slot allocation management device receives the time slot allocation request sent by the external device, it determines whether the TE link has a corresponding available configuration according to the TE link information in the slot allocation request; if not, A corresponding available slot list is generated according to the available time slots of the TE link.
- the node data of the available slot list includes three fields: a transmission port number (ID), a cascading level, and a slot number, and the generated available slot list is respectively arranged according to the above three keywords.
- the available slot list corresponding to the TE link is initialized; if the available slot list is generated for the first time, the available slot list is directly blanked; if not for the first time and the available slot list is not empty, the clear is available.
- a corresponding flag bit array is generated according to the slot resource state of each transmission port in the TE link, and if the time slot is available, the flag position is set; if the time slot is not available, the flag position is set to 0.
- time slot allocation processing is performed according to whether the time slot allocation request is a time slot request request or a time slot release request. For the time slot allocation request, when the application request is implemented, it is also required according to the time. Whether the slot allocation request specifies the transmission port number for corresponding processing.
- the first node corresponding to the designated transmission port number and the cascading level is queried in the available time slot list of the corresponding TE link.
- the time slot allocation request is a time slot request request and the transmission port number is not specified
- the first node corresponding to the specified cascading level is queried in the available time slot list of the corresponding TE link;
- the slot number is updated simultaneously with the available slot list.
- the time slot allocation management device when it receives a time slot allocation request as a time slot request request, it first determines whether a transmission port number is specified in the implementation allocation request. If the transmission port number is not specified, the node in the available slot list that is equal to the number of cascading levels specified in the slot allocation request is preferentially searched, and if so, the slot number of the first found linked list node is directly returned; If not, then look for nodes with higher level of association. If the complete list is still not found, the return fails. Otherwise, the slot number of the first found linked list node is returned, and the corresponding lower-order node is added while the node is deleted in the linked list. If a transport port has been specified, in the above search process, only nodes with the same transfer port number in the linked list can be found.
- the time slot allocation request is a time slot release request
- a node corresponding to the transmission port number, the cascading level, and the time slot number specified by the time slot release request is inserted in the available time slot linked list of the corresponding TE link, and the available time is updated. Gap linked list.
- step S103 includes:
- Step S1031 Initialize an available slot list corresponding to the TE link.
- Step S1032 generating a corresponding flag bit array according to the slot resource state of each transmission port;
- the rate of a transport port is 64 VC4, you need to define an 8-bit array with 8 elements. Each bit identifies a time slot. If the time slot is available, the corresponding flag bit is set to 1, otherwise it is set to 0.
- Step S1035 according to the generated flag bit, sequentially determine whether the consecutive 4 k time slots that meet the requirements of the initial time slot in the port rate range are available, and if yes, go to step S1036; otherwise, go to step S1037;
- Step S1036 insert a node with a cascade number of 4 k in the linked list, and set the flag position of the corresponding slot of the inserted node to 0, and then go to step S1037;
- Step S1038 Determine whether the TE link further includes other transmission ports. If yes, go to step S1032. Otherwise, go to step S1039.
- step S1039 the processing of the time slot of the transmission port corresponding to the entire TE link is completed, and the generation process of the available time slot linked list is exited.
- the corresponding available slot list has six nodes, and the services of different time slots can be used for the sending and receiving direction. For each port, a linked list is generated according to the slot state of the sending and receiving direction.
- the step S104 includes: Step S1041, when the time slot allocation request is a time slot request, receiving a time slot request request with a cascaded number of 4 n ;
- the maximum possible number of concatenations of the TE link is 4 N , and N is determined according to the maximum transmission port rate included in the TE link.
- Step S1043 If the port number is specified in the time slot request request, the nodes in the available time slot linked list are searched for the same as the transmitting port of the application and the number of cascading is 4 k .
- Step S1045 determining whether k>N, if yes, proceeding to step S1046; otherwise, proceeding to step S1043;
- step S1046 the time slot application fails.
- step S1047 the time slot application is successful, and the slot number s of the first found node is returned, and the available time slot linked list is updated.
- the time slot assignment management apparatus receives a time slot request with an unspecified transmission port and a cascaded number of 4°. Then, according to the above method for querying the linked list in the embodiment, first, the node whose number of concatenations is equal to 4° in the linked list is found, and then the node ⁇ 102, 1 , 2 ⁇ is found, and the slot number 2 is returned.
- step S104 may further include:
- time slot allocation request is a time slot release request
- step S1051 If found, go to step S1051, otherwise go to step S1052;
- the TE link time slot allocation management method provided in this embodiment generates a corresponding available time slot linked list when the TE link is generated, and when the subsequent time slot allocation and time slot release requests are received, Simply maintain the linked list, which greatly improves the efficiency of time slot allocation;
- the method reduces the time slot fragmentation caused by the time slot allocation by combining and splitting the nodes of the time slot linked list in time; in addition, the method can satisfy the case that one TE link includes multiple transmission ports, and then
- the system running the method is also applicable to the case where the time slot allocation does not satisfy the standard cascade but satisfies a certain multiple.
- an embodiment of the present invention provides a time slot allocation management apparatus, including: a time slot allocation request receiving module 501, an available time slot linked list generating module 502, and a time slot allocating module 503, where:
- the time slot allocation request receiving module 501 is configured to receive an externally sent time slot allocation request; the time slot allocation request includes a request type, a TE link ID, a cascading level, and/or a transmission port number and/or a slot number.
- the available slot list generation module 502 is configured to determine whether there is an available slot list in the TE link specified in the slot allocation request, and if the result of the determination is no, generate a corresponding available slot list; in this embodiment, When receiving the time slot allocation request sent by the external device, the slot allocation management device determines whether the TE link has a corresponding available configuration according to the TE link information in the slot allocation request; if not, according to the time slot of the TE link Available, a corresponding list of available time slots is generated.
- the node data of the available slot list includes three fields: a transmission port number (ID), a cascading level, and a slot number, and the generated available slot list is respectively arranged according to the above three keywords.
- the process of generating a corresponding available slot list is: First, the available slot list corresponding to the TE link is initialized; if the available slot list is generated for the first time, the available slot list is directly blanked; if not for the first time and the available slot list is not empty, the clear is available. The nodes of the time slot linked list, and release the corresponding memory.
- a corresponding flag bit array is generated according to the slot resource state of each transmission port in the TE link, and if the time slot is available, the flag position is set; if the time slot is not available, the flag position is set to 0.
- the time slot allocating module 503 is configured to perform time slot allocation according to the time slot allocation request and the corresponding available time slot linked list.
- the processing is performed according to whether the time slot allocation request is a time slot request request or a time slot release request.
- the time slot allocation request is to implement the application request, it is also necessary to perform corresponding processing according to whether the time slot allocation request specifies the transmission port number.
- the first node corresponding to the designated transmission port number and the cascading level is queried in the available time slot list of the corresponding TE link.
- the time slot allocation request is a time slot request request and the transmission port number is not specified
- the first node corresponding to the specified cascading level is queried in the available time slot list of the corresponding TE link;
- the slot number is updated simultaneously with the available slot list.
- the time slot allocation management device when it receives a time slot allocation request as a time slot request request, it first determines whether a transmission port number is specified in the implementation allocation request. If the transmission port number is not specified, the node in the available slot list that is equal to the number of cascading levels specified in the slot allocation request is preferentially searched, and if so, the slot number of the first found linked list node is directly returned; No Yes, it searches for nodes with higher level of association in turn. If the complete list is still not found, it returns failure. Otherwise, it returns the slot number of the first linked list node, and deletes the node in the linked list, and increases the corresponding lower concatenation node. If the transport port has been specified, in the above search process, only nodes with the same transfer port number in the linked list can be found.
- the time slot allocation request is a time slot release request
- a node corresponding to the transmission port number, the cascading level, and the time slot number specified by the time slot release request is inserted in the available time slot linked list of the corresponding TE link, and the available time is updated. Gap linked list.
- the slot allocation management device receives a time slot allocation request as a time slot release request, the resource state of the corresponding time slot is updated.
- ⁇ generates a new node according to the released time slot resource, and inserts a linked list. Judging the four adjacent nodes of the linked list to see if it is possible to synthesize a node with a higher cascade level, and merge and merge until it can no longer be merged.
- the available slot list generation module 502 includes: a list initialization unit 5021, a flag generation unit 5022, a determination unit 5023, and a linked list generation unit 5024, wherein: the linked list initialization unit 5021 is configured to initialize the TE link. a time slot linked list; a flag bit generating unit 5022, configured to generate a corresponding flag bit array according to a time slot resource state of each transmission port in the TE link;
- the determining unit 5023 is configured to sequentially determine, according to the value of the flag bit and the arrangement priority of the transmission port, whether all time slots of each level of each transmission port are available;
- the linked list generating unit 5024 is configured to insert a node of the corresponding cascading level into the available time slot list when all time slots of the cascading level are available, and set a flag of the corresponding time slot of the inserted node to zero.
- the time slot assignment module 503 includes: an allocating unit 5031 and an updating unit 5032, where:
- the allocating unit 5031 is configured to: when the time slot allocation request is a time slot request request and specify a transmission port number, query the designated transmission port number in the available time slot list of the corresponding TE link, and The first node corresponding to the cascading level; or when the time slot allocation request is a time slot request and the transmission port number is not specified, the first time corresponding to the specified cascading level is queried in the available time slot list of the corresponding TE link.
- the updating unit 5032 is configured to update the available slot list.
- the updating unit 5032 is configured to delete the found node when the time slot allocation request is a time slot request and find the corresponding node; or delete the found node and insert the remaining nodes of the same level as the deleted node; or
- the time slot allocation request is a time slot release request, and the transmission port number is found, and the four nodes with the same cascade level and the time slot number are consecutive, the found four nodes are deleted; and the previous time slot table is inserted into the previous one.
- the node corresponding to the cascading level of the level, the slot number of the node is the same as the slot number of the first node of the four nodes.
- the time slot allocation management method and device in the embodiment of the present invention generates a corresponding available time slot linked list when generating a TE link or when a time slot allocation request arrives, and only needs available time slots in the subsequent time slot application and release process.
- the operation of the linked list greatly improves the working efficiency; the time slot application adopts the method of querying the linked list instead of using the polling method, which greatly reduces the slot fragmentation caused by the time slot allocation process, and maximizes the guaranteed link.
- the linked list is for a TE link rather than a transport interface, effectively solving the problem of bundled link time slot allocation.
- the method and device for managing time slot allocation proposed by the present invention generate a corresponding available time slot linked list, subsequent time slot application and release when generating a TE link or when a time slot allocation request arrives
- the time slot application adopts the method of querying the linked list instead of using the polling method, which greatly reduces the time brought by the time slot allocation process.
- Gap fragmentation the maximum guarantee of the bearer capacity of the link for large-grain services
- the linked list is for a TE link instead of a transport interface, effectively solving the problem of bundle link time slot allocation.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Description
时隙分配管理方法及装置 技术领域
本发明涉及光通信领域, 尤其涉及 ASON ( Automatic Switched Optical Network, 自动交换光网络) 中一种时隙分配管理方法及装置。 背景技术
ASON 网络具有智能化、 个性化等特点, 其智能化主要体现在能够自 动发现网络资源并进行链路的配置, 能够通过标准的信令、 路由交换方式, 而不是采用手工配置或私有协议方式来完成带宽连接的建立、 更新和释放, 能够为业务提供需要的保护, 在网络发生故障时进行及时的恢复。 其个性 化则主要体现在面向业务的带宽交易特性, 可以按需求进行带宽分配, 并 为客户提供差异化的服务。
对于网络中每个独立的 ASON的网络节点来说, 其时隙的分配可以分 为两种: 上游时隙分配和下游时隙分配。 上游时隙的分配 居上游节点分 配的下游时隙来确定, 因此可以认为现有的时隙分配为一种强制的分配方 式, 只有下游的时隙分配对于每个 ASON的网络节点来说才具有一定的主 动性。
对于现有的 ASON网络, 由于其硬件上仍基于传统的 SDH设备理论, 故对于带宽的分配大多只支持标准级联,即只支持 VC4、 VC4-4C、 VC4-16C、 VC4-64C和 VC4-256C等颗粒度的带宽分配。例如有一条带宽为 64个 VC4 的链路为例, 其只支持起始时隙为 1、 17、 33、 49号 VC4的连续 16个时隙 带宽来作为 16级联的可用带宽。由于上述严格的要求,导致在很多情况下, 经过多次的时隙分配和释放等过程中后, 链路的总带宽虽然满足业务的要 求, 却不能满足业务的级联数要求。
为了解决上述问题, 现有的技术方案多采用后期整理的方式, 即当出 现大量的不连续时隙时, 采用人工或者优化命令的方式, 对业务所占用的 时隙进行调整。 但这种方法实现复杂、 效率低下, 而且可能会影响业务的 正常工作。 中国专利 CN200610064662.0公开了另一种方法, 即采取以 4n 时隙单元分组作为查找对象的方式分配时隙。 该方法在每次时隙分配时都 要遍历每个时隙的状态, 效率低下, 而且并不能综合考虑整个链路的资源 情况, 不能最大程度的保持链路对大颗粒业务的承载能力。 特别是当有多 条数据链路汇聚成一条流量工程(TE, Traffic Engineering )链路(捆束链 路)时, 一个 TE链路不再只是包含一个端口, 不同端口的时隙不能作为同 一个级联包含的时隙来使用时, 这种等步长的查找方式则不再适用。 发明内容
本发明的主要目的在于提供一种时隙分配管理方法及装置, 旨在提高 链路的承载能力以及时隙分配效率。
为了达到上述目的, 本发明提出一种时隙分配管理方法, 包括: 接收外部发送的时隙分配请求;
判断所述时隙分配请求中指定的 TE链路是否存在对应的可用时隙链 表, 若判断结果为否, 则生成对应的所述可用时隙链表;
根据所述时隙分配请求以及所述对应的可用时隙链表进行时隙分配。 优选地, 所述可用时隙链表的节点数据包括以下三个字段: 传送端口 号、 级联等级以及时隙号。
优选地, 所述生成对应的可用时隙链表的步驟包括:
初始化 TE链路对应的可用时隙链表;
根据所述 TE链路中每个传送端口的时隙资源状态生成对应的标志位 数组;
根据所述标志位的值以及所述传送端口的排列优先级, 依次判断每个
传送端口上各级联等级的所有时隙是否可用;
当级联等级的所有时隙均可用时, 在所述可用时隙链表中插入对应的 级联等级的节点, 并将已插入节点对应时隙的标志位置为 0。 隙分配的步驟包括:
当所述时隙分配请求为时隙申请请求且指定传送端口号时, 在对应的
TE链路的可用时隙链表中查询与所述指定传送端口号以及级联等级对应的 第一个节点; 或者当所述时隙分配请求为时隙申请请求且未指定传送端口 号时,在对应的 TE链路的可用时隙链表中查询与指定级联等级对应的第一 个节点;
获取所述第一个节点对应的时隙号;
更新所述可用时隙链表。 隙分配的步驟包括:
当所述时隙分配请求为时隙释放请求时,在对应的 TE链路的可用时隙 链表中插入与所述时隙释放请求指定的传送端口号、 级联等级以及时隙号 对应的节点;
更新所述可用时隙链表。
优选地, 所述更新可用时隙链表的步驟包括: 删除找到的节点; 或者 删除找到的节点并插入与该删除的节点同级联等级的剩余节点。
优选地, 所述更新可用时隙链表的步驟包括:
当找到传送端口号以及级联等级相同且时隙号连续的四个节点时, 删 除找到的所述四个节点;
在所述可用时隙链表中插入上一级的级联等级对应的节点, 该节点的 时隙号与所述四个节点中第一个节点的时隙号相同。
本发明还提出一种时隙分配管理装置, 包括:
时隙分配请求接收模块, 用于接收外部发送的时隙分配请求; 可用时隙链表生成模块,用于判断所述时隙分配请求中指定的 TE链路 是否存在对应的可用时隙链表, 则生成对应的所述可用时隙链表; 链表进行时隙分配。
优选地, 所述可用时隙链表生成模块包括:
链表初始化单元, 用于初始化 TE链路对应的可用时隙链表;
标志位生成单元,用于根据所述 TE链路中每个传送端口的时隙资源状 态生成对应的标志位数组;
判断单元, 用于根据所述标志位的值以及所述传送端口的排列优先级, 依次判断每个传送端口上各级联等级的所有时隙是否可用;
链表生成单元, 用于当级联等级的所有时隙均可用时, 在所述可用时 隙链表中插入对应的级联等级的节点, 并将已插入节点对应时隙的标志位 置为 0。
优选地, 所述时隙分配模块包括:
分配单元, 用于当所述时隙分配请求为时隙申请请求且指定传送端口 号时,在对应的 TE链路的可用时隙链表中查询与所述指定传送端口号以及 级联等级对应的第一个节点; 或者当所述时隙分配请求为时隙申请请求且 未指定传送端口号时,在对应的 TE链路的可用时隙链表中查询与指定级联 等级对应的第一个节点; 获取所述第一个节点对应的时隙号; 或者
当所述时隙分配请求为时隙释放请求时,在对应的 TE链路的可用时隙 链表中插入与所述时隙释放请求指定的传送端口号、 级联等级以及时隙号 对应的节点;
更新单元, 用于更新所述可用时隙链表。
到对应的节点时, 删除找到的节点; 或者删除找到的节点并插入与该删除 的节点同级联等级的剩余节点; 或者
当所述时隙分配请求为时隙释放请求, 找到传送端口号以及级联等级 相同且时隙号连续的四个节点时, 删除找到的所述四个节点; 在所述可用 时隙链表中插入上一级的级联等级对应的节点, 该节点的时隙号与所述四 个节点中第一个节点的时隙号相同。 本发明提出的一种时隙分配管理方法及装置,通过在生成 TE链路时或 当时隙分配请求到达时, 生成对应的可用时隙链表, 后续时隙申请和释放 的过程中只需要对可用时隙链表进行操作, 大大提高了工作效率; 时隙申 请采用查询链表的方式, 而不是采用轮询的方式, 极大的减少了时隙分配 过程中带来的时隙碎片, 最大程度的保证链路对于大颗粒业务的承载能力; 链表是针对一个 TE链路而不是一个传送接口,有效的解决了捆束链路时隙 分配的问题。 附图说明
图 1是本发明时隙分配管理方法一实施例流程示意图;
图 2是本发明时隙分配管理方法一实施例中可用时隙链表结构示意图; 图 3是本发明时隙分配管理方法一实施例中生成的可用时隙链表结构 示意图;
图 4是本发明时隙分配管理方法一实施例中时隙申请请求过程可用时 隙链表结构示意图;
图 5是本发明时隙分配管理方法一实施例中时隙释放请求过程可用时 隙链表结构示意图;
图 6是本发明时隙分配管理方法一实施例中生成对应的可用时隙链表
的流程示意图;
图 7是本发明时隙分配管理方法一实施例中根据时隙分配请求以及对 应的可用时隙链表进行时隙分配的一种实施方式流程示意图;
图 8是本发明时隙分配管理方法一实施例中根据时隙分配请求以及对 应的可用时隙链表进行时隙分配的另一种实施方式流程示意图;
图 9是本发明时隙分配管理装置一实施例结构示意图;
图 10是本发明时隙分配管理装置一实施例中时隙链表生成模块的结构 示意图;
图 11是本发明时隙分配管理装置一实施例中时隙分配模块的结构示意 图。 具体实施方式
本发明实施例解决方案主要是通过在生成 TE链路时或当时隙分配请 求到达时, 生成对应的可用时隙链表, 通过查询对应的可用时隙链表进行 时隙申请和释放的时隙分配, 以减少时隙分配过程中带来的时隙碎片, 最 大程度的保证链路对于大颗粒业务的承载能力, 并解决捆束链路时隙分配 的问题。
如图 1所示, 本发明一实施例提出一种时隙分配管理方法, 包括: 步驟 S101 , 接收外部发送的时隙分配请求;
本实施例方法运行环境涉及 ASON网络, 在为 ASON网络中各网络节 点分配时隙时, 根据 ASON网络中主机发送的时隙分配请求进行。 本实施 例中, 具体通过 ASON网络中的时隙分配管理装置来实现, 由 ASON网络 中的时隙分配管理装置接收 ASON网络中主机发送的时隙分配请求, 并根 据时隙分配请求进行后续时隙分配处理。
时隙分配请求包括请求类型、 TE链路 ID、 级联等级和 /或传送端口号 和 /或时隙号。
步驟 S102, 判断时隙分配请求中指定的 TE链路是否存在对应的可用 时隙链表, 若是, 则进入步驟 S104; 否则, 进入步驟 S103;
步驟 S103 , 生成对应的可用时隙链表;
在本实施例中, 时隙分配管理装置收到外部发送过来的时隙分配请求 时, 根据隙分配请求中的 TE链路信息, 判断该 TE链路是否有对应的可用 配; 若没有, 则根据 TE链路的时隙可用情况, 生成对应的可用时隙链表。
如图 2所示,可用时隙链表的节点数据包括三个字段:传送端口号( ID )、 级联等级以及时隙号, 生成的可用时隙链表分别按上述三个关键字进行排 列。
其中, 生成对应的可用时隙链表的过程为:
首先, 初始化 TE链路对应的可用时隙链表; 若是第一次生成可用时隙 链表则直接将该可用时隙链表置空; 若非第一次且该可用时隙链表不为空, 则清空可用时隙链表的节点, 并释放对应的内存。
然后,根据 TE链路中每个传送端口的时隙资源状态生成对应的标志位 数组, 若时隙可用, 则将标志位置 1; 若时隙不可用, 则将标志位置 0。
之后, 根据标志位的值以及 TE链路中各传送端口的排列优先级,依次 判断每个传送端口上各级联等级的所有时隙是否可用; 当级联等级的所有 时隙均可用时, 在可用时隙链表中插入对应的级联等级的节点, 并将已插 入节点对应时隙的标志位置为 0。
当 TE链路中所有传送端口以及每个传送端口内所有的级联等级的时 隙均处理完毕, 则生成对应的可用时隙链表。 在进行时隙分配时, 根据时隙分配请求是时隙申请请求还是时隙释放 请求分别进行处理。 对于时隙分配请求为实现申请请求时, 还需根据该时
隙分配请求是否指定传送端口号进行相应处理。
在本实施例中, 当时隙分配请求为时隙申请请求且指定传送端口号时, 在对应的 TE链路的可用时隙链表中查询与指定传送端口号以及级联等级 对应的第一个节点; 或者当时隙分配请求为时隙申请请求且未指定传送端 口号时,在对应的 TE链路的可用时隙链表中查询与指定级联等级对应的第 一个节点; 获取第一个节点对应的时隙号, 同时更新可用时隙链表。
具体地, 当时隙分配管理装置收到一个时隙分配请求为时隙申请请求 时, 首先判断该实现分配请求中是否指定了传送端口号。 如果没有指定传 送端口号, 则优先查找可用时隙链表中与时隙分配请求中指定的级联等级 数相等的节点, 若有, 则直接返回第一个找到的链表节点的时隙号; 若没 有, 则依次查找更高级联等级的节点。 如果找完整个链表依然没有找到则 返回失败, 否则返回第一个找到的链表节点的时隙号, 并在链表中删除该 节点的同时, 增加对应的低级联数的节点。 如果已经指定了传送端口, 则 在上述的查找过程中, 只能查找链表中传送端口号与之相等的节点。
当时隙分配请求为时隙释放请求时,在对应的 TE链路的可用时隙链表 中插入与时隙释放请求指定的传送端口号、 级联等级以及时隙号对应的节 点, 同时更新可用时隙链表。
具体地, 当隙分配管理装置收到一个时隙分配请求为时隙释放请求时, 更新对应时隙的资源状态。 同时, ^^据释放的时隙资源生成一个新的节点, 并插入链表。 对链表的相邻的 4个节点进行判断, 看是否能合成一个更高 级联等级的节点, 能合并则合并, 直到不能再合并为止。 如图 6所示, 步驟 S103包括:
步驟 S1031 , 初始化 TE链路对应的可用时隙链表;
若是第一次生成链表则直接将链表置空; 若非第一次且链表不为空, 则清空链表的节点, 并释放对应的内存。
步驟 S1032, 根据每个传送端口的时隙资源状态生成对应的标志位数 组;
如一个传送端口的速率为 64个 VC4,则需要定义一个具有 8个元素的 8比特的数组。 每个比特标识一个时隙, 如果时隙可用, 则将对应的标志位 置 1 , 否则置 0。
步驟 S1033, 根据生成的标志位, 判断传送端口速率的所有 4N个时隙 是否均可用, 若是则转步驟 S1034; 否则初始化 k =N-l , 转步驟 S1035; 步驟 S1034, 在可用时隙链表中插入对应的级联数为 ^的节点, 并转 步驟 S1038;
步驟 S1035,根据生成的标志位,依次判断在端口速率范围内满足起始 时隙要求的连续 4k个时隙是否均可用, 若是, 则转步驟 S1036; 否则转步 驟 S1037;
步驟 S1036, 在链表中插入级联数为 4k的节点, 并将已经插入节点对 应时隙的标志位置为 0, 转步驟 S1037;
步驟 S1037, 判断是否1^<1; 若是, 则转步驟 S1038; 否则, 令 k = k-l , 转步驟 S1035;
若 k = 0, 则说明该端口所有可能对应的级联数都已经处理。
步驟 S1038, 判断 TE链路是否还包含其他传送端口, 若是, 则转步驟 S1032, 否则, 转步驟 S1039。
步驟 S1039, 完成整个 TE链路对应的传送端口的时隙的处理, 退出可 用时隙链表的生成流程。
如图 3所示,假设有一条 TE链路,只包含一条带宽为 64C的传送端口 101 , 其中 8— 16号时隙不可使用。 根据上面描述的方法和步驟, 则得到对 应的可用时隙链表包含 6个节点, 对于收发方向可以使用不同时隙的业务, 则需要对每一个端口, 根据收发方向的时隙状态分别生成链表。
如图 7所示,对应于时隙分配请求为实现申请请求时,步驟 S104包括: 步驟 S1041 , 当时隙分配请求为时隙申请请求时, 接收级联数为 4n的 时隙申请请求;
步驟 S1042, 判断是否 n〉N, 若是, 则转步驟 S1046; 否则, 令 k = n, 转步驟 S1043;
其中, TE链路的最大可能级联数为 4N, N根据 TE链路所包含的最大 的传送端口速率确定。
步驟 S1043, 若时隙申请请求中已指定端口号,则依次在可用时隙链表 中查找传送端口与申请的传送端口相同且级联数为 4k的节点;
若没有指定, 则无需考虑端口号, 直接查找, 其中 n < k < N。
步驟 S1044, 判断是否找到一个节点, 若是, 则转步驟 S1047; 否则, ^ k = k+l , 转步驟 S1045;
步驟 S1045, 判断是否 k〉N, 若是, 则转步驟 S1046; 否则, 转步驟 S1043;
步驟 S1046, 时隙申请申请失败。
步驟 S1047, 时隙申请成功, 并返回第一个找到的节点的时隙号 s, 同 时更新可用时隙链表。
更新可用时隙链表主要包括, 删除找到的节点 {TransportlD, k, s}, 如 果 k〉n, 则还需在链表中插入级联数为 i = n, η+l ...k-l , 时隙号为 + 4 ) 的节点 (j = l、 2、 3 ) 。
如图 4所示,对应于上述步驟,假设有一条 TE链路包含两个传送接口 101和 102, 经过一系列时隙分配和释放的操作后, 该 TE链路的可用时隙 链表如图 4所示。 此时时隙分配管理装置收到一个未指定传送端口, 级联 数为 4°的时隙申请。 那么, 按照本实施例上述的查询链表的方法, 首先查 找链表中级联数等于 4°的节点, 则找到节点 { 102, 1 , 2} , 则返回时隙号 2。
可见如果采用遍历连续 4n的可用时隙的方法, 则会选择端口 101的 1号时 隙, 这样会增加了 {101, 1, 2}、 {101, 1, 3}、 {101, 1, 4}三个时隙碎片, 降低了 TE链路对于 4级联业务的承载能力。 如图 8所示, 对应于时隙分配请求为时隙释放请求时, 步驟 S104还可 包括:
51048, 当时隙分配请求为时隙释放请求时, 接收级联数为 4n, 时隙号 为 s的时隙释放请求;
51049, 找到释放时隙请求指定的传送端口对应的 TE链路, 在该 TE 链路的可用时隙链表中插入级联数为 4n, 时隙号为 s的节点,初始化 k = n;
51050, 在可用时隙链表中查找传送端口号相同, 级联数为 4k, 时隙号 为 {[(s-l)/4k]x4k +l + (ix4k)} 的连续 4个节点,如果找到,则转步驟 S1051, 否则转步驟 S1052;
其中, i = 0, 1, 2, 3
51051, 删除找到的 4 个节点, 并插入一个级联数为 4k+1、 时隙号为 {[(s-l)/4k]x4k +1}的节点; 令 k = k+l, 转步驟 S1050;
51052, 退出链表更新, 时隙释放申请成功。
如图 3所示, 对应于上述步驟, 假设有如图 3所示的 TE链路, 现在收 到释放级联数为 1、 时隙号为 8的时隙资源。 首先在可用时隙链表中插入节 点 {101, 1, 8}, 此时, 链表中有级联数为 4°, 时隙号分别为 5、 6、 7、 8 的 4个节点; 删除这 4个节点, 同时在链表中插入级联数为 41、 时隙号为 5 的节点;继续查找没有找到级联数为 41的满足时隙要求的连续的 4个节点。 最后得到的 TE链路可用时隙链表如图 5所示。
由上述内容可见, 本实施例提供的 TE链路时隙分配管理方法, 采用了 在 TE链路生成时生成对应的可用时隙链表,在后续收到时隙分配和时隙释 放的请求时, 只需维护该链表即可, 极大提高了时隙分配的效率; 同时,
该方法通过及时地对时隙链表的节点进行合并和拆分, 减少了时隙分配带 来的时隙碎片;另夕卜,该方法可满足一个 TE链路包含多个传送端口的情况, 再者, 该运行该方法的系统同样适用于时隙分配不满足标准级联但满足按 一定倍数递增的情形。
与现有技术相比,本发明具有以下的优点: 只需要在生成 TE链路时生 成对应的可用时隙链表, 后续时隙申请和释放的过程中都只需要对链表进 行操作, 大大提高了工作效率; 时隙申请采用查询链表的方式, 而不是轮 询的方式, 极大的减少了时隙分配过程中带来的时隙碎片; 链表是针对一 个 TE链路而不是一个传送接口, 有效的解决了捆束链路时隙分配的问题。 如图 9所示, 本发明一实施例提出一种时隙分配管理装置, 包括: 时 隙分配请求接收模块 501、 可用时隙链表生成模块 502 以及时隙分配模块 503 , 其中:
时隙分配请求接收模块 501 , 用于接收外部发送的时隙分配请求; 时隙分配请求包括请求类型、 TE链路 ID、 级联等级和 /或传送端口号 和 /或时隙号。
可用时隙链表生成模块 502, 用于判断时隙分配请求中指定的 TE链路 是否存在可用时隙链表, 若判断结果为否, 则生成对应的可用时隙链表; 在本实施例中, 时隙分配管理装置收到外部发送过来的时隙分配请求 时, 根据隙分配请求中的 TE链路信息, 判断该 TE链路是否有对应的可用 配; 若没有, 则根据 TE链路的时隙可用情况, 生成对应的可用时隙链表。
如图 2所示,可用时隙链表的节点数据包括三个字段:传送端口号( ID )、 级联等级以及时隙号, 生成的可用时隙链表分别按上述三个关键字进行排 列。
其中, 生成对应的可用时隙链表的过程为:
首先, 初始化 TE链路对应的可用时隙链表; 若是第一次生成可用时隙 链表则直接将该可用时隙链表置空; 若非第一次且该可用时隙链表不为空, 则清空可用时隙链表的节点, 并释放对应的内存。
然后,根据 TE链路中每个传送端口的时隙资源状态生成对应的标志位 数组, 若时隙可用, 则将标志位置 1; 若时隙不可用, 则将标志位置 0。
之后,根据标志位的值以及 TE链路中各传送端口的排列优先级,依次 判断每个传送端口上各级联等级的所有时隙是否可用; 当级联等级的所有 时隙均可用时, 在可用时隙链表中插入对应的级联等级的节点, 并将已插 入节点对应时隙的标志位置为 0。
当 TE链路中所有传送端口以及每个传送端口内所有的级联等级的时 隙均处理完毕, 则生成对应的可用时隙链表。
时隙分配模块 503 ,用于根据所述时隙分配请求以及所述对应的可用时 隙链表进行时隙分配。
在进行时隙分配时, 根据时隙分配请求是时隙申请请求还是时隙释放 请求分别进行处理。 对于时隙分配请求为实现申请请求时, 还需根据该时 隙分配请求是否指定传送端口号进行相应处理。
在本实施例中, 当时隙分配请求为时隙申请请求且指定传送端口号时, 在对应的 TE链路的可用时隙链表中查询与指定传送端口号以及级联等级 对应的第一个节点; 或者当时隙分配请求为时隙申请请求且未指定传送端 口号时,在对应的 TE链路的可用时隙链表中查询与指定级联等级对应的第 一个节点; 获取第一个节点对应的时隙号, 同时更新可用时隙链表。
具体地, 当时隙分配管理装置收到一个时隙分配请求为时隙申请请求 时, 首先判断该实现分配请求中是否指定了传送端口号。 如果没有指定传 送端口号, 则优先查找可用时隙链表中与时隙分配请求中指定的级联等级 数相等的节点, 若有, 则直接返回第一个找到的链表节点的时隙号; 若没
有, 则依次查找更高级联等级的节点。 如果找完整个链表依然没有找到则 返回失败, 否则返回第一个找到的链表节点的时隙号, 并在链表中删除该 节点的同时, 增加对应的低级联数的节点。 如果已经指定了传送端口, 则 在上述的查找过程中, 只能查找链表中传送端口号与之相等的节点。
当时隙分配请求为时隙释放请求时,在对应的 TE链路的可用时隙链表 中插入与时隙释放请求指定的传送端口号、 级联等级以及时隙号对应的节 点, 同时更新可用时隙链表。
具体地, 当隙分配管理装置收到一个时隙分配请求为时隙释放请求时, 更新对应时隙的资源状态。 同时, ^^据释放的时隙资源生成一个新的节点, 并插入链表。 对链表的相邻的 4个节点进行判断, 看是否能合成一个更高 级联等级的节点, 能合并则合并, 直到不能再合并为止。
如图 10所示,可用时隙链表生成模块 502包括:链表初始化单元 5021、 标志位生成单元 5022、 判断单元 5023以及链表生成单元 5024, 其中: 链表初始化单元 5021 , 用于初始化 TE链路对应的可用时隙链表; 标志位生成单元 5022, 用于根据 TE链路中每个传送端口的时隙资源 状态生成对应的标志位数组;
判断单元 5023 ,用于根据标志位的值以及所述传送端口的排列优先级, 依次判断每个传送端口上各级联等级的所有时隙是否可用;
链表生成单元 5024, 用于当级联等级的所有时隙均可用时, 在可用时 隙链表中插入对应的级联等级的节点, 并将已插入节点对应时隙的标志位 置为 0。
如图 11所示, 时隙分配模块 503包括: 分配单元 5031以及更新单元 5032, 其中:
分配单元 5031 , 用于当时隙分配请求为时隙申请请求且指定传送端口 号时,在对应的 TE链路的可用时隙链表中查询与所述指定传送端口号以及
级联等级对应的第一个节点; 或者当时隙分配请求为时隙申请请求且未指 定传送端口号时,在对应的 TE链路的可用时隙链表中查询与指定级联等级 对应的第一个节点; 获取所述第一个节点对应的时隙号; 或者当时隙分配 请求为时隙释放请求时,在对应的 TE链路的可用时隙链表中插入与所述时 隙释放请求指定的传送端口号、 级联等级以及时隙号对应的节点;
更新单元 5032, 用于更新可用时隙链表。
进一步的, 更新单元 5032用于当时隙分配请求为时隙申请请求且找到 对应的节点时, 删除找到的节点; 或者删除找到的节点并插入与该删除的 节点同级联等级的剩余节点; 或者当时隙分配请求为时隙释放请求, 找到 传送端口号以及级联等级相同且时隙号连续的四个节点时, 删除找到的所 述四个节点; 在所述可用时隙链表中插入上一级的级联等级对应的节点, 该节点的时隙号与四个节点中第一个节点的时隙号相同。
本发明实施例时隙分配管理方法及装置,通过在生成 TE链路时或当时 隙分配请求到达时, 生成对应的可用时隙链表, 后续时隙申请和释放的过 程中只需要对可用时隙链表进行操作, 大大提高了工作效率; 时隙申请采 用查询链表的方式, 而不是采用轮询的方式, 极大的减少了时隙分配过程 中带来的时隙碎片, 最大程度的保证链路对于大颗粒业务的承载能力; 链 表是针对一个 TE链路而不是一个传送接口,有效的解决了捆束链路时隙分 配的问题。
以上所述仅为本发明的优选实施例, 并非因此限制本发明的专利范围 , 凡是利用本发明说明书及附图内容所作的等效结构或流程变换, 或直接或 间接运用在其它相关的技术领域, 均同理包括在本发明的专利保护范围内。 工业实用性
本发明提出的一种时隙分配管理方法及装置,通过在生成 TE链路时或 当时隙分配请求到达时, 生成对应的可用时隙链表, 后续时隙申请和释放
的过程中只需要对可用时隙链表进行操作, 大大提高了工作效率; 时隙申 请采用查询链表的方式, 而不是采用轮询的方式, 极大的减少了时隙分配 过程中带来的时隙碎片, 最大程度的保证链路对于大颗粒业务的承载能力; 链表是针对一个 TE链路而不是一个传送接口,有效的解决了捆束链路时隙 分配的问题。
Claims
1、 一种时隙分配管理方法, 其特征在于, 该方法包括:
接收外部发送的时隙分配请求;
判断所述时隙分配请求中指定的流量工程 TE链路是否存在对应的可 用时隙链表, 若判断结果为否, 则生成对应的所述可用时隙链表;
根据所述时隙分配请求以及所述对应的可用时隙链表进行时隙分配。
2、 根据权利要求 1所述的方法, 其中, 所述可用时隙链表的节点数据 包括以下三个字段: 传送端口号、 级联等级以及时隙号。
3、 根据权利要求 1所述的方法, 其中, 所述生成对应的可用时隙链表 的步驟包括:
初始化 TE链路对应的可用时隙链表;
根据所述 TE链路中每个传送端口的时隙资源状态生成对应的标志位 数组;
根据所述标志位的值以及所述传送端口的排列优先级, 依次判断每个 传送端口上各级联等级的所有时隙是否可用;
当级联等级的所有时隙均可用时, 在所述可用时隙链表中插入对应的 级联等级的节点, 并将已插入节点对应时隙的标志位置为 0。
4、 根据权利要求 1所述的方法, 其中, 所述根据时隙分配请求以及所 述对应的可用时隙链表进行时隙分配的步驟包括:
当所述时隙分配请求为时隙申请请求且指定传送端口号时, 在对应的 TE链路的可用时隙链表中查询与所述指定传送端口号以及级联等级对应的 第一个节点; 或者当所述时隙分配请求为时隙申请请求且未指定传送端口 号时,在对应的 TE链路的可用时隙链表中查询与指定级联等级对应的第一 个节点;
获取所述第一个节点对应的时隙号; 更新所述可用时隙链表。
5、 根据权利要求 1所述的方法, 其中, 所述根据时隙分配请求以及所 述对应的可用时隙链表进行时隙分配的步驟包括:
当所述时隙分配请求为时隙释放请求时,在对应的 TE链路的可用时隙 链表中插入与所述时隙释放请求指定的传送端口号、 级联等级以及时隙号 对应的节点;
更新所述可用时隙链表。
6、 根据权利要求 4所述的方法, 其中, 所述更新可用时隙链表的步驟 包括: 删除找到的节点; 或者删除找到的节点并插入与该删除的节点同级 联等级的剩余节点。
7、 根据权利要求 5所述的方法, 其中, 所述更新可用时隙链表的步驟 包括:
当找到传送端口号以及级联等级相同且时隙号连续的四个节点时, 删 除找到的所述四个节点;
在所述可用时隙链表中插入上一级的级联等级对应的节点, 该节点的 时隙号与所述四个节点中第一个节点的时隙号相同。
8、 一种时隙分配管理装置, 其特征在于, 该装置包括:
时隙分配请求接收模块, 用于接收外部发送的时隙分配请求; 可用时隙链表生成模块,用于判断所述时隙分配请求中指定的 TE链路 是否存在对应的可用时隙链表, 若判断结果为否, 则生成对应的所述可用 时隙链表; 链表进行时隙分配。
9、 根据权利要求 8所述的装置, 其中, 所述可用时隙链表生成模块包 括: 链表初始化单元 , 用于初始化 TE链路对应的可用时隙链表;
标志位生成单元,用于根据所述 TE链路中每个传送端口的时隙资源状 态生成对应的标志位数组;
判断单元, 用于根据所述标志位的值以及所述传送端口的排列优先级, 依次判断每个传送端口上各级联等级的所有时隙是否可用;
链表生成单元, 用于当级联等级的所有时隙均可用时, 在所述可用时 隙链表中插入对应的级联等级的节点, 并将已插入节点对应时隙的标志位 置为 0。
10、 根据权利要求 8所述的装置, 其中, 所述时隙分配模块包括: 分配单元, 用于当所述时隙分配请求为时隙申请请求且指定传送端口 号时,在对应的 TE链路的可用时隙链表中查询与所述指定传送端口号以及 级联等级对应的第一个节点; 或者当所述时隙分配请求为时隙申请请求且 未指定传送端口号时,在对应的 TE链路的可用时隙链表中查询与指定级联 等级对应的第一个节点; 获取所述第一个节点对应的时隙号; 或者
当所述时隙分配请求为时隙释放请求时,在对应的 TE链路的可用时隙 链表中插入与所述时隙释放请求指定的传送端口号、 级联等级以及时隙号 对应的节点;
更新单元, 用于更新所述可用时隙链表。
11、 根据权利要求 10所述的装置, 其中, 所述更新单元用于当所述时 隙分配请求为时隙申请请求且找到对应的节点时, 删除找到的节点; 或者 删除找到的节点并插入与该删除的节点同级联等级的剩余节点; 或者
当所述时隙分配请求为时隙释放请求, 找到传送端口号以及级联等级 相同且时隙号连续的四个节点时, 删除找到的所述四个节点; 在所述可用 时隙链表中插入上一级的级联等级对应的节点, 该节点的时隙号与所述四 个节点中第一个节点的时隙号相同。
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201010574883.9A CN102487303B (zh) | 2010-12-06 | 2010-12-06 | 时隙分配管理方法及装置 |
CN201010574883.9 | 2010-12-06 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2012075836A1 true WO2012075836A1 (zh) | 2012-06-14 |
Family
ID=46152760
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2011/078888 WO2012075836A1 (zh) | 2010-12-06 | 2011-08-25 | 时隙分配管理方法及装置 |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN102487303B (zh) |
WO (1) | WO2012075836A1 (zh) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2017088495A1 (zh) * | 2015-11-26 | 2017-06-01 | 中兴通讯股份有限公司 | 一种路由信息的获取方法及装置 |
CN112532499A (zh) * | 2020-11-13 | 2021-03-19 | 哲库科技(北京)有限公司 | 一种仲裁方法、装置、设备、存储介质、程序产品及芯片 |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105933092B (zh) * | 2016-06-14 | 2020-04-07 | Tcl移动通信科技(宁波)有限公司 | 一种基于电路交换的数据传输方法及系统 |
WO2018126650A1 (zh) * | 2017-01-06 | 2018-07-12 | 华为技术有限公司 | 一种发送上行信号的方法及终端 |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1430428A (zh) * | 2001-12-29 | 2003-07-16 | 厦门雅迅网络股份有限公司 | 一种为移动台动态分配无线信道资源的方法 |
CN101202602A (zh) * | 2007-12-27 | 2008-06-18 | 中兴通讯股份有限公司 | 一种Abis时隙资源的动态配置方法 |
CN101212289A (zh) * | 2006-12-30 | 2008-07-02 | 华为技术有限公司 | 一种时隙分配方法及网络通信设备 |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2002152813A (ja) * | 2000-11-09 | 2002-05-24 | Ntt Docomo Inc | 移動通信システムにおけるタイムスロット割り当て方法および移動通信システムにおけるタイムスロット割り当て装置 |
US7869378B2 (en) * | 2005-09-26 | 2011-01-11 | Interdigital Technology Corporation | Method and apparatus for sharing slot allocation schedule information amongst nodes of a wireless mesh network |
CN101820650B (zh) * | 2009-02-27 | 2012-11-28 | 中兴通讯股份有限公司 | 一种动态使用Abis时隙资源的方法和系统 |
-
2010
- 2010-12-06 CN CN201010574883.9A patent/CN102487303B/zh active Active
-
2011
- 2011-08-25 WO PCT/CN2011/078888 patent/WO2012075836A1/zh active Application Filing
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1430428A (zh) * | 2001-12-29 | 2003-07-16 | 厦门雅迅网络股份有限公司 | 一种为移动台动态分配无线信道资源的方法 |
CN101212289A (zh) * | 2006-12-30 | 2008-07-02 | 华为技术有限公司 | 一种时隙分配方法及网络通信设备 |
CN101202602A (zh) * | 2007-12-27 | 2008-06-18 | 中兴通讯股份有限公司 | 一种Abis时隙资源的动态配置方法 |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2017088495A1 (zh) * | 2015-11-26 | 2017-06-01 | 中兴通讯股份有限公司 | 一种路由信息的获取方法及装置 |
CN106803811A (zh) * | 2015-11-26 | 2017-06-06 | 中兴通讯股份有限公司 | 一种路由信息的获取方法及装置 |
CN112532499A (zh) * | 2020-11-13 | 2021-03-19 | 哲库科技(北京)有限公司 | 一种仲裁方法、装置、设备、存储介质、程序产品及芯片 |
Also Published As
Publication number | Publication date |
---|---|
CN102487303B (zh) | 2015-08-26 |
CN102487303A (zh) | 2012-06-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2017133623A1 (zh) | 一种数据流处理方法、装置和系统 | |
JP2682561B2 (ja) | プログラマブル回線アダプタ | |
JP4299461B2 (ja) | 回線切替チャネルへ時間スロットを割付ける方法および装置 | |
WO2021254330A1 (zh) | 内存管理方法、系统、客户端、服务器及存储介质 | |
EP3605975B1 (en) | Client service transmission method and device | |
JP2000115198A (ja) | 伝送システム,帯域管理装置,および帯域管理方法 | |
CN107948094A (zh) | 一种高速数据帧无冲突入队处理的装置及方法 | |
TW201101736A (en) | Method and system for low latency state transitions for energy efficiency | |
US20040081091A1 (en) | Priority-based efficient fair queuing for quality of service classificatin for packet processing | |
EP3672167B1 (en) | Packet forwarding method and device | |
WO2012075836A1 (zh) | 时隙分配管理方法及装置 | |
US11991083B2 (en) | Systems and methods for enhanced autonegotiation | |
WO2012100671A1 (zh) | 一种绑定物理网口的方法、网卡及通信系统 | |
Moradi et al. | Controller placement in software defined network using iterated local search | |
WO2010072122A1 (zh) | 一种传输报文的方法、端口和系统 | |
JP5610227B2 (ja) | 計算機及び識別子管理方法 | |
JP2000502855A (ja) | 動的同期転送モードネットワークにおける非細分化方法とその装置 | |
JP7513113B2 (ja) | 制御装置、リソース割当方法、及びプログラム | |
CN111970149B (zh) | 一种基于硬件防火墙qos的共享带宽实现方法 | |
CN114024844B (zh) | 数据调度方法、数据调度装置及电子设备 | |
US7339953B2 (en) | Surplus redistribution for quality of service classification for packet processing | |
US20240146433A1 (en) | Time slot allocation processing method, device and storage medium | |
CN112087395B (zh) | 一种服务形式的分级流量控制方法 | |
CN110601996B (zh) | 一种采用令牌保底分布式贪心算法的环网防饥饿流控方法 | |
Ofek | Integration of voice communication on a synchronous optical hypergraph |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 11847652 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 11847652 Country of ref document: EP Kind code of ref document: A1 |