WO2017096738A1 - 一种基于网络休眠的用户自主路由方法 - Google Patents

一种基于网络休眠的用户自主路由方法 Download PDF

Info

Publication number
WO2017096738A1
WO2017096738A1 PCT/CN2016/078416 CN2016078416W WO2017096738A1 WO 2017096738 A1 WO2017096738 A1 WO 2017096738A1 CN 2016078416 W CN2016078416 W CN 2016078416W WO 2017096738 A1 WO2017096738 A1 WO 2017096738A1
Authority
WO
WIPO (PCT)
Prior art keywords
network
user
price
path
network node
Prior art date
Application number
PCT/CN2016/078416
Other languages
English (en)
French (fr)
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 华南理工大学
Publication of WO2017096738A1 publication Critical patent/WO2017096738A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/124Shortest path evaluation using a combination of metrics
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/14Routing performance; Theoretical aspects

Definitions

  • the present invention relates to the field of network control and management, network device sleep scheduling, and network path computation, and in particular, to a user autonomous routing method based on network sleep.
  • the network dormancy scheduling method schedules traffic in a part of network devices by controlling the network, and regulates other idle network devices to enter dormancy.
  • the centralized sleep scheduling of the network belongs to the NP problem, and the complexity of the scheduling calculation is high, which may cause the speed of the dormant scheduling to keep up with the speed of the traffic change, and may even cause packet loss and network link interruption.
  • how to accurately and accurately obtain network traffic demand is also an urgent problem to be solved.
  • the purpose of the present invention is to overcome the shortcomings and shortcomings of the prior art, and to provide a user self-routing method based on network dormancy, which is a method.
  • User and network collaboration mechanism specifically the solution to the problem of user participation in network path selection
  • a user autonomous routing method based on network dormancy comprising the following steps: [0006] Sl, the network controller periodically advertises the topology of the network to the user with the service request, including the network node and the network link information, the existing bandwidth and total bandwidth of each network link, and the Used bandwidth and total bandwidth, the price of the network link, the price of the network node, and the pricing rules;
  • Each user calculates a price at which each service source to the destination can reach the path according to a pricing rule published by the network controller, and then independently selects a path in which the price is appropriately cheap, and submits the selection result to the network control.
  • the network controller regulates the network node and the network link in a stable and idle state to enter the dormant; [0010] S5. The network controller forwards the user service according to the received user path selection result, and updates the network topology.
  • the network controller After receiving the notification of the end of the user service, the network controller periodically reclaims the idle user path bandwidth that is not forwarded by the service, and recalculates the used bandwidth of the path and the network node, and then repeats steps S1 and S4.
  • the pricing rule is a cooperative mechanism for facilitating users to share network links and network nodes to save energy, that is, the greater the amount of user traffic carried by the same network link, the unit traffic The lower the price, specifically: For users using the same network link, the price per unit of traffic is the price of the network link divided by the used bandwidth of the network link.
  • the pricing rule is a cooperative mechanism for facilitating users to share network links and network nodes to save energy, that is, the greater the amount of user traffic carried by the same network node, the unit traffic The lower the price, the specific is: For users using the same network node, the price of the unit traffic is the usage price of the network node divided by the used bandwidth of the network node.
  • the unit of measure of the unit traffic is bit/sec.
  • step S3 the price calculation process of the path is as follows: Adding the price of the network link and the network node involved in the path selected by one user is the price at which the user selects the path.
  • step S3 the reason that the price is appropriately cheap is that the user selects the path ⁇ , and if the price of the re-selected path is lower than the original path price, the path is re-selected; otherwise, the original path is not changed.
  • the price of the reselected path is 10% lower than the original path price.
  • the network controller periodically issues network information and updates information; when the user receives the information issued by the network controller, the steps S2, S3, and S6 are repeated. .
  • the present invention proposes a cooperation mechanism between a user and a network to promote energy conservation between the user and the network. This mechanism can effectively and accurately obtain the user's demand for the network, and effectively reduces the network maintenance cost and the user.
  • the cost of using network services increases the energy efficiency of network devices, and skillfully solves the problem that it is difficult to obtain network traffic requirements in the prior art.
  • the network controller controls the idle network device to enter dormancy, instead of performing sleep scheduling according to the change of the traffic, and solves the problem that the dormant scheduling speed cannot keep up with the traffic in the prior art. The problem of speed of change.
  • the invention proposes a process in which a user participates in network routing, which distributes the calculation to the client, reduces the calculation amount of the network controller end, and effectively improves the operating efficiency of the network.
  • FIG. 1 is a flowchart of a method for autonomous routing of a user based on network sleep according to the present invention.
  • FIG. 2 is a network structure diagram of the method of FIG. 1 under the control of a network controller.
  • a user autonomous routing method based on network dormancy includes the following steps:
  • the network controller periodically advertises the topology of the network to the user with the service request, including the network node and the network link information, the existing bandwidth and total bandwidth of each network link, and the Used bandwidth and total bandwidth, the use price of the network link, the use price of the network node, and pricing Rule
  • Each user calculates a price at which each service source to the destination end can reach a path according to a pricing rule published by the network controller, and then independently selects a path in which the price is appropriately cheap, and submits the selection result to the network control.
  • the network controller regulates the network node and the network link in a stable and idle state to enter the dormant; [0032] S5. The network controller forwards the user service according to the received user path selection result, and updates the network topology.
  • the network controller After receiving the user service end notification, the network controller periodically reclaims the idle user path bandwidth that is not forwarded by the service, and recalculates the used bandwidth of the path and the network node, and then repeats steps S1 and S4.
  • the pricing rule is a cooperative mechanism for facilitating users to share network links and network nodes to save energy, that is, the greater the amount of user traffic carried by the same network link, the unit traffic The lower the price, specifically: For users using the same network link, the price per unit of traffic is the price of the network link divided by the used bandwidth of the network link.
  • the pricing rule is a cooperative mechanism for facilitating users to share network links and network nodes to save energy, that is, the greater the amount of user traffic carried by the same network node, the unit traffic The lower the price, the specific is: For users using the same network node, the price of the unit traffic is the usage price of the network node divided by the used bandwidth of the network node.
  • the unit of measure of the unit traffic is bit/sec.
  • step S3 the price calculation process of the path is as follows: Adding the price of the network link and the network node involved in the path selected by one user is the price at which the user selects the path.
  • step S3 the reason that the price is appropriately cheap is that the user selects the path ⁇ , and if the price of the re-selected path is lower than the original path price, the path is re-selected; otherwise, the original path is not changed.
  • the price of the reselected path is 10% lower than the original path price.
  • the network controller periodically issues network information. And update the information; when the user receives the information released by the network controller, repeat steps S2, S3, and S6.
  • the network controller periodically advertises the topology of the network to the user with the service request (as shown in FIG. 2, including the network node and the network link information), and each network link has used the bandwidth we (assuming Ll, L2, L3 used bandwidth is 5M, L4, L5 are not used) and total bandwidth We (assumed to be 10M), the used bandwidth of each network node we (assuming Switch Dix, Switch Switch2, Switch3, Switch5 have used bandwidth 5M, switch Switch4 is not used) and total bandwidth We (assumed to be 10M), network link usage price ce (assumed to be 10 yuan), network node usage price cv (assumed to be 10 yuan), and pricing rules
  • the host Hostl and the host Host2 calculate the price of each service source end to the destination reachable path according to the pricing rule published by the network controller.
  • the calculation according to the pricing rule can be selected to take about 33.3.
  • the price of the yuan If you choose the path switch Switchl-Ll-switch Switch2-L2-switch Switch3-L3-switch Switch5, then the calculation can choose to take the path to bear about 11.7 yuan.
  • the re-selection path can reduce the cost by more than 10%, then the host Hostl will select the path switch Switchl-Ll-switch Switch2-L2-switch S witch3-L3-switch Switch5 (if the reduced cost is less than 10%, then select the original Path switch Sw itchl-L4-switch SwitcM-L5-switch Switch5) and submit the selection result to the network controller
  • the network controller regulates the network node and the network link in a stable and idle state to enter the dormant; [0048] S5. The network controller forwards the user service according to the received user path selection result, and updates the network topology.
  • Switch1, L1, Switch2, L2, Switch3, L3, and Switch S witch5 is updated to 6M.
  • S6 the user who has terminated the network service notifies the network controller or directly exits the network, and the user who continues to use the network service repeats steps S2, S3;
  • the network controller After receiving the user service end notification, the network controller periodically reclaims the idle user path bandwidth that is not forwarded by the service, and recalculates the used bandwidth of the network link and the network node, and then repeats step S1.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本发明公开了一种基于网络休眠的用户自主路由方法,步骤如下:S1、网络控制器周期性公布网络的拓扑信息以及定价规则;S2、用户获取信息;S3、用户计算各条业务源端到目的端可达路径的价格,独立地选择路径,并将选择结果提交给网络控制器;S4、网络控制器调控处于稳定且空闲状态的网络节点和网络链路进入休眠;S5、网络控制器更新网络拓扑信息;S6、判断用户是否已经结束网络服务,若是,通知网络控制器或直接退出网络;若否,重复步骤S1-S5。本发明使得用户集中选择一部分网络设备,通过调控空闲的网络设备进入休眠而达到提高网络设备能源利用率的目的,有效节省网络维护成本和用户使用网络服务的成本。

Description

说明书 发明名称:一种基于网络休眠的用户自主路由方法 技术领域
[0001] 本发明涉及网络的控制和管理、 网络设备休眠调度以及网络路径计算领域, 特 别涉及一种基于网络休眠的用户自主路由方法。
背景技术
[0002] 研究表明, 网络通信设备的能源消耗占全世界能源消耗的 10%, 而且 80%的二 氧化碳排放是由网络设备产生的, 降低网络设备的能源消耗, 提高网络设备能 源利用率成为当务之急。 然而, 当前网络环境在设计之初, 为了应对网络高峰 流量负载, 采用了冗余部署的策略, 甚至是过度部署, 事实表明在网络高峰吋 期网络设备的使用率只有 30%, 在闲吋低至 5%; 而且, 网络流量是动态变化的 , 在热点地区可能会导致网络设备拥塞而在偏远地区网络设备没有被充分利用
[0003] 网络设备的休眠可以有效降低网络的能耗。 网络休眠调度方法通过控制网络, 将流量调度在一部分网络设备中, 并调控其他的空闲的网络设备进入休眠。 然 而网络集中式的休眠调度属于 NP问题, 其调度计算的复杂度较高, 可能会导致 休眠调度的速度跟不上流量变化的速度, 甚至可能导致丢包和网络链路中断。 另外, 如何及吋准确地获取网络流量需求也是亟需解决的问题。
技术问题
[0004] 虽然网络流量需求难以获得, 但是用户却能够准确地知道自己的需求, 本发明 的目的在于克服现有技术的缺点与不足, 提供一种基于网络休眠的用户自主路 由方法, 是一种用户和网络的协作机制, 具体为用户参与网络路径选择的机制 问题的解决方案
技术解决方案
[0005] 本发明的目的通过如下技术方案实现: 一种基于网络休眠的用户自主路由方法 , 包括以下步骤: [0006] Sl、 网络控制器向有业务请求的用户周期性公布网络的拓扑, 包括网络节点和 网络链路信息, 现有的每条网络链路已用带宽和总带宽, 每个网络节点的已用 带宽和总带宽, 网络链路的使用价格, 网络节点的使用价格以及定价规则;
[0007] S2、 用户获取到网络控制器公布的信息;
[0008] S3、 每个用户根据网络控制器公布的定价规则计算各条业务源端到目的端能够 达到路径的价格, 然后独立地选择其中价格适当便宜的路径, 并将选择结果提 交给网络控制器;
[0009] S4、 网络控制器调控处于稳定且空闲状态的网络节点和网络链路进入休眠; [0010] S5、 网络控制器根据所收到的用户路径选择结果转发用户业务, 更新网络拓扑
, 以及网络链路和网络节点的已用带宽;
[0011] S6、 已结束网络服务的用户通知网络控制器或直接退出网络, 继续使用网络服 务的用户重复步骤 S2、 S3;
[0012] S7、 网络控制器在收到用户服务结束通知后, 周期性回收未有业务转发的空闲 用户路径带宽, 并重新计算路径和网络节点的已用带宽, 然后重复步骤 Sl、 S4
、 S5。
[0013] 优选的, 步骤 S1中, 所述的定价规则是一种促进用户共享网络链路与网络节点 以节约能源的协同机制, 即同一网络链路承载的用户业务量越大, 单位业务量 的价格越低, 具体为: 使用同一网络链路的用户, 单位业务量的价格为该网络 链路的使用价格除以该网络链路的已用带宽。
[0014] 优选的, 步骤 S1中, 所述的定价规则是一种促进用户共享网络链路与网络节点 以节约能源的协同机制, 即同一网络节点承载的用户业务量越大, 单位业务量 的价格越低, 具体为: 使用同一网络节点的用户, 单位业务量的价格为该网络 节点的使用价格除以该网络节点的已用带宽。
[0015] 优选的, 所述单位业务量的计量单位是比特位 /秒。
[0016] 优选的, 步骤 S3中, 所述路径的价格计算过程如下: 将一个用户所选择的路径 中涉及的网络链路和网络节点的价格加起来就是该用户选择该路径的价格。
[0017] 优选的, 步骤 S3中, 所述的价格适当便宜的路径是指用户选择路径吋, 如果重 选的路径的价格低于原有路径价格才重新选择路径; 否则, 不更改原路径。 [0018] 优选的, 所述重选的路径的价格比原有路径价格低 10%。
[0019] 优选的, 所述的步骤 Sl、 S4、 S5、 S7中, 网络控制器周期性地发布网络信息并 更新信息; 用户收到网络控制器发布的信息, 则重复步骤 S2、 S3、 S6。
发明的有益效果
有益效果
[0020] 本发明与现有技术相比, 具有如下优点和有益效果:
[0021] 1、 本发明提出一种用户与网络的协作机制以促进用户和网络共同节约能源, 采取这种机制, 能有效准确地获取用户对网络的需求, 有效地降低了网络维护 成本和用户使用网络服务的成本, 提高了网络设备的能源利用率, 巧妙地解决 了现有技术中难以获取网络流量需求的问题。
[0022] 2、 本发明提出用户选路达到均衡稳定后, 网络控制器调控空闲的网络设备进 入休眠, 而不是根据流量的变化进行休眠调度, 解决了现有技术中休眠调度速 度跟不上流量变化速度的问题。
[0023] 3、 本发明提出用户参与网络选路的过程, 将计算分散到客户端, 减少了网络 控制器端的计算量, 有效提高网络的运行效率。
对附图的简要说明
附图说明
[0024] 图 1为本发明所述的一种基于网络休眠的用户自主路由方法的流程图。
[0025] 图 2为图 1所述方法在网络控制器控制下的网络结构图。
实施该发明的最佳实施例
本发明的最佳实施方式
[0026] 下面结合实施例及附图对本发明作进一步详细的描述, 但本发明的实施方式不 限于此。
[0027] 一种基于网络休眠的用户自主路由方法, 如图 1所示, 包括以下步骤:
[0028] Sl、 网络控制器向有业务请求的用户周期性公布网络的拓扑, 包括网络节点和 网络链路信息, 现有的每条网络链路已用带宽和总带宽, 每个网络节点的已用 带宽和总带宽, 所述网络链路的使用价格, 所述网络节点的使用价格以及定价 规则;
[0029] S2、 用户获取到网络控制器公布的信息;
[0030] S3、 每个用户根据网络控制器公布的定价规则计算各条业务源端到目的端能够 达到路径的价格, 然后独立地选择其中价格适当便宜的路径, 并将选择结果提 交给网络控制器;
[0031] S4、 网络控制器调控处于稳定且空闲状态的网络节点和网络链路进入休眠; [0032] S5、 网络控制器根据所收到的用户路径选择结果转发用户业务, 更新网络拓扑
, 以及网络链路和网络节点的已用带宽;
[0033] S6、 已结束网络服务的用户通知网络控制器或直接退出网络, 继续使用网络服 务的用户重复步骤 S2、 S3;
[0034] S7、 网络控制器在收到用户服务结束通知后, 周期性回收未有业务转发的空闲 用户路径带宽, 并重新计算路径和网络节点的已用带宽, 然后重复步骤 Sl、 S4
、 S5。
[0035] 进一步的, 步骤 S1中, 所述的定价规则是一种促进用户共享网络链路与网络节 点以节约能源的协同机制, 即同一网络链路承载的用户业务量越大, 单位业务 量的价格越低, 具体为: 使用同一网络链路的用户, 单位业务量的价格为该网 络链路的使用价格除以该网络链路的已用带宽。
[0036] 进一步的, 步骤 S1中, 所述的定价规则是一种促进用户共享网络链路与网络节 点以节约能源的协同机制, 即同一网络节点承载的用户业务量越大, 单位业务 量的价格越低, 具体为: 使用同一网络节点的用户, 单位业务量的价格为该网 络节点的使用价格除以该网络节点的已用带宽。
[0037] 更进一步的, 所述单位业务量的计量单位是比特位 /秒。
[0038] 进一步的, 步骤 S3中, 所述路径的价格计算过程如下: 将一个用户所选择的路 径中涉及的网络链路和网络节点的价格加起来就是该用户选择该路径的价格。
[0039] 进一步的, 步骤 S3中, 所述的价格适当便宜的路径是指用户选择路径吋, 如果 重选的路径的价格低于原有路径价格才重新选择路径; 否则, 不更改原路径。
[0040] 更进一步的, 所述重选的路径的价格比原有路径价格低 10%。
[0041] 进一步的, 所述的步骤 Sl、 S4、 S5、 S7中, 网络控制器周期性地发布网络信息 并更新信息; 用户收到网络控制器发布的信息, 则重复步骤 S2、 S3、 S6。
[0042] 下面以一具体实例操作上述步骤。
[0043] Sl、 网络控制器向有业务请求的用户周期性公布网络的拓扑 (如图 2, 包括网 络节点和网络链路信息) , 每条网络链路已用带宽 we (假设 Ll、 L2、 L3已用带 宽为 5M, L4、 L5未被使用) 和总带宽 We (假设为 10M) , 每个网络节点的已用 带宽 we (假设交换机 Switchl、 交换机 Switch2、 交换机 Switch3、 交换机 Switch5 已用带宽为 5M, 交换机 Switch4未被使用) 和总带宽 We (假设为 10M) , 网络链 路的使用价格 ce (假设为 10元) , 网络节点的使用价格 cv (假设为 10元) , 以及 定价规则
[0044] [数]
:¾ W| ; s; 、 W
fe 翁響 镞素 ;te* fePi 響 冒
[0045] S2、 用户获取到网络控制器公布的信息;
[0046] S3、 主机 Hostl和主机 Host2根据网络控制器公布的定价规则计算各条业务源端 到目的端可达路径的价格。 对于主机 Hostl访问服务器 Server, 假设所需带宽是 1 M, 而且一幵始选择了路径交换机 Switchl-L4-交换机 Switch4-L5-交换机 Switch5 , 则根据定价规则进行计算可得选择该路径需要承担约 33.3元的价格; 若选择路 径交换机 Switchl-Ll-交换机 Switch2-L2-交换机 Switch3-L3-交换机 Switch5, 则计 算可得选择该路径需要承担约 11.7元。 通过比较可知重新选择路径能够减少费用 多于 10%, 则主机 Hostl会选择路径交换机 Switchl-Ll-交换机 Switch2-L2-交换机 S witch3-L3-交换机 Switch5 (若减少的费用小于 10%, 则选择原来的路径交换机 Sw itchl-L4-交换机 SwitcM-L5-交换机 Switch5) , 并将选择结果提交给网络控制器
[0047] S4、 网络控制器调控处于稳定且空闲状态的网络节点和网络链路进入休眠; [0048] S5、 网络控制器根据所收到的用户路径选择结果转发用户业务, 更新网络拓扑
, 其中交换机 Switchl、 Ll、 交换机 Switch2、 L2、 交换机 Switch3、 L3、 交换机 S witch5的已用带宽更新为 6M; [0049] S6、 已结束网络服务的用户通知网络控制器或直接退出网络, 继续使用网络服 务的用户重复步骤 S2、 S3;
[0050] S7、 网络控制器在收到用户服务结束通知后, 周期性回收未有业务转发的空闲 用户路径带宽, 并重新计算网络链路和网络节点的已用带宽, 然后重复步骤 S1
、 S4、 S5。
[0051] 上述实施例为本发明较佳的实施方式, 但本发明的实施方式并不受上述实施例 的限制, 其他的任何未背离本发明的精神实质与原理下所作的改变、 修饰、 替 代、 组合、 简化, 均应为等效的置换方式, 都包含在本发明的保护范围之内。

Claims

权利要求书
[权利要求 1] 一种基于网络休眠的用户自主路由方法, 其特征在于, 包括以下步骤
51、 网络控制器向有业务请求的用户周期性公布网络的拓扑, 包括网 络节点和网络链路信息, 现有的每条网络链路已用带宽和总带宽, 每 个网络节点的已用带宽和总带宽, 网络链路的使用价格, 网络节点的 使用价格以及定价规则;
52、 用户获取到网络控制器公布的信息;
53、 每个用户根据网络控制器公布的定价规则计算各条业务源端到目 的端能够达到路径的价格, 然后独立地选择其中价格便宜的路径, 并 将选择结果提交给网络控制器;
54、 网络控制器调控处于稳定且空闲状态的网络节点和网络链路进入 休眠;
55、 网络控制器根据所收到的用户路径选择结果转发用户业务, 更新 网络拓扑, 以及网络链路和网络节点的已用带宽;
56、 已结束网络服务的用户通知网络控制器或直接退出网络, 继续使 用网络服务的用户重复步骤 S2、 S3;
57、 网络控制器在收到用户服务结束通知后, 周期性回收未有业务转 发的空闲用户路径带宽, 并重新计算路径和网络节点的已用带宽, 然 后重复步骤 Sl、 S4、 S5。
[权利要求 2] 根据权利要求 1所述的基于网络休眠的用户自主路由方法, 其特征在 于: 步骤 S1中, 所述的定价规则是一种促进用户共享网络链路与网络 节点以节约能源的协同机制, 即同一网络链路承载的用户业务量越大 , 单位业务量的价格越低, 具体为: 使用同一网络链路的用户, 单位 业务量的价格为该网络链路的使用价格除以该网络链路的已用带宽。
[权利要求 3] 根据权利要求 1所述的基于网络休眠的用户自主路由方法, 其特征在 于: 步骤 S1中, 所述的定价规则是一种促进用户共享网络链路与网络 节点以节约能源的协同机制, 即同一网络节点承载的用户业务量越大 , 单位业务量的价格越低, 具体为: 使用同一网络节点的用户, 单位 业务量的价格为该网络节点的使用价格除以该网络节点的已用带宽。
[权利要求 4] 根据权利要求 2或 3所述的基于网络休眠的用户自主路由方法, 其特征 在于: 所述单位业务量的计量单位是比特位 /秒。
[权利要求 5] 根据权利要求 1所述的基于网络休眠的用户自主路由方法, 其特征在 于: 步骤 S3中, 所述路径的价格计算过程如下: 将一个用户所选择的 路径中涉及的网络链路和网络节点的价格加起来就是该用户选择该路 径的价格。
[权利要求 6] 根据权利要求 1所述的基于网络休眠的用户自主路由方法, 其特征在 于: 步骤 S3中, 所述的价格便宜的路径是指用户选择路径吋, 如果重 选的路径的价格低于原有路径价格才重新选择路径; 否则, 不更改原 路径。
[权利要求 7] 根据权利要求 6所述的基于网络休眠的用户自主路由方法, 其特征在 于: 所述重选的路径的价格比原有路径价格低 10%。
[权利要求 8] 根据权利要求 1所述的基于网络休眠的用户自主路由方法, 其特征在 于: 所述的步骤 Sl、 S4、 S5、 S7中, 网络控制器周期性地发布网络 信息并更新信息; 用户收到网络控制器发布的信息, 则重复步骤 S2、 S3、 S6。
PCT/CN2016/078416 2015-12-10 2016-04-05 一种基于网络休眠的用户自主路由方法 WO2017096738A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510918336.0A CN105553842B (zh) 2015-12-10 2015-12-10 一种基于网络休眠的用户自主路由方法
CN201510918336.0 2015-12-10

Publications (1)

Publication Number Publication Date
WO2017096738A1 true WO2017096738A1 (zh) 2017-06-15

Family

ID=55832781

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/078416 WO2017096738A1 (zh) 2015-12-10 2016-04-05 一种基于网络休眠的用户自主路由方法

Country Status (2)

Country Link
CN (1) CN105553842B (zh)
WO (1) WO2017096738A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114448873A (zh) * 2022-02-21 2022-05-06 华南理工大学 基于链路定价策略的流量分配方法、系统、装置及介质
CN114710437A (zh) * 2022-06-07 2022-07-05 南京邮电大学 一种结合区块链的物联网边缘网络路由架构

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012147271A (ja) * 2011-01-12 2012-08-02 Nippon Telegr & Teleph Corp <Ntt> 監視制御装置及び通信経路設定方法及びプログラム
CN103124241A (zh) * 2011-11-21 2013-05-29 华为技术有限公司 一种网络拓扑结构调整方法和装置

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9014016B2 (en) * 2008-06-20 2015-04-21 Microsoft Corporation Techniques to manage presence information based on routing rules
CN104038420A (zh) * 2014-06-05 2014-09-10 杭州华三通信技术有限公司 一种路由计算方法和设备
CN104253749B (zh) * 2014-09-18 2018-04-13 华南理工大学 一种基于软件定义网络架构的用户端分布式路径计算方法
CN104283790B (zh) * 2014-10-09 2017-09-15 新华三技术有限公司 Sdn中弹性分组环rpr的拓扑发现方法和设备
CN104852853B (zh) * 2015-04-30 2017-12-01 苏州经贸职业技术学院 一种共享型无线路由器及其动态调整方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012147271A (ja) * 2011-01-12 2012-08-02 Nippon Telegr & Teleph Corp <Ntt> 監視制御装置及び通信経路設定方法及びプログラム
CN103124241A (zh) * 2011-11-21 2013-05-29 华为技术有限公司 一种网络拓扑结构调整方法和装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
TIANYU CHEN ET AL.: "User-Motivated Topology Formation for Green Communication Networks", 2013 2ND IEEE /CIC INTERNATIONAL CONFERENCE ON COMMUNICATIONS IN CHINA WORKSHOPS (ICCC): THE FIRST IEEE ICCC INTERNATIONAL WORKSHOP ON GREEN MOBILE COMPUTING NETWORKS (GMCN 2013, 31 December 2013 (2013-12-31), XP055536724 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114448873A (zh) * 2022-02-21 2022-05-06 华南理工大学 基于链路定价策略的流量分配方法、系统、装置及介质
CN114710437A (zh) * 2022-06-07 2022-07-05 南京邮电大学 一种结合区块链的物联网边缘网络路由架构

Also Published As

Publication number Publication date
CN105553842A (zh) 2016-05-04
CN105553842B (zh) 2019-04-09

Similar Documents

Publication Publication Date Title
US8811208B2 (en) Method and apparatus for reducing power consumption in a telecommunication network
CN106817738B (zh) 一种基于联盟博弈的路由方法
Nguyen et al. Two energy-efficient cluster head selection techniques based on distance for wireless sensor networks
CN103297341A (zh) 在域内路由器节点上配置流量的方法
Cui et al. A virtual network embedding algorithm based on virtual topology connection feature
WO2017096738A1 (zh) 一种基于网络休眠的用户自主路由方法
CN113660710B (zh) 一种基于强化学习的移动自组织网络路由方法
Rajeshkanna et al. Energy Efficient Enhanced AODV Routing Protocol for maximize the lifetime of Mobile Ad hoc Networks
CN105490941B (zh) 一种基于网络与用户协作休眠的路由方法
Dubey et al. Energy consumption using traffic models for MANET routing protocols
Yao et al. Deadline-aware and energy-efficient dynamic flow scheduling in data center network
Yonezu et al. Network power saving topology calculation method by powering off links considering QoS
Yin et al. Load-adaptive energy-saving strategy based on matching game in edge-enhanced metro FiWi
Sengul et al. Conserving energy with on-demand topology management
Yu et al. Survivable routing protocol for green wireless mesh networks based on energy efficiency
CN105120501A (zh) 一种能量可再生无线Mesh网络绿色通信方法
Takeuchi et al. An improved power saving mechanism for MAC protocol in ad hoc networks
Femila et al. Transmission power control in mobile ad hoc network using network coding and co-operative communication
Xu et al. QoS‐aware cross‐domain collaborative energy‐saving mechanism for FiWi virtual networks
Sengul et al. TITAN: On-demand topology management in ad hoc networks
Yang et al. Improvement and analysis of multipath routing protocol AOMDV based on CMMBCR
Gupta et al. DBET: demand based energy efficient topology for MANETs
Gambhir et al. Optimal path selection routing protocol in MANETs
Mao et al. On a Cooperative Deep Reinforcement Learning-Based Multi-Objective Routing Strategy for Diversified 6 G Metaverse Services
Sengul et al. Heuristic approaches to energy-efficient network design problem

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: 16871944

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 01/10/2018)

122 Ep: pct application non-entry in european phase

Ref document number: 16871944

Country of ref document: EP

Kind code of ref document: A1