Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Many large-scale applications in science and business domains require the transfer of big data over high-performance networks for remote operations. Such big data transfer is increasingly supported by bandwidth reservation services that discover feasible and efficient routing options in dynamic network environments with time-varying resources. By exploring the flexility and capacity of variable paths,  formulate a generic problem of Bandwidth Scheduling with Two Variable Node-Disjoint Paths (BS-2VNDP), in which,  further consider two variable paths of fixed or variable bandwidth with negligible or non-negligible switching delay, referred to as 2VPFB/VB-0/1.  show the NP-completeness and propose a heuristic approach for each of them.  implement and test these proposed scheduling algorithms in both simulated and real-life networks. Extensive results show that they significantly outperform greedy scheduling methods in large-scale networks.
['Aiqin Hou', 'Chase Q. Wu', 'Dingyi Fang', 'Yong‐Qiang Wang', 'Meng Wang', 'Tao Wang', 'Xiaoyang Zhang']
I am writing a research paper on a idea Bandwidth scheduling with multiple variable node-disjoint paths in high-performance networks
[{"from": "human", "value": "I am writing a research paper on a idea Bandwidth scheduling with multiple variable node-disjoint paths in high-performance networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Many large-scale applications in science and business domains require the transfer of big data over high-performance networks for remote operations. Such big data transfer is increasingly supported by bandwidth reservation services that discover feasible and efficient routing options in dynamic network environments with time-varying resources. By exploring the flexility and capacity of variable paths,  formulate a generic problem of Bandwidth Scheduling with Two Variable Node-Disjoint Paths (BS-2VNDP), in which,  further consider two variable paths of fixed or variable bandwidth with negligible or non-negligible switching delay, referred to as 2VPFB/VB-0/1.  show the NP-completeness and propose a heuristic approach for each of them.  implement and test these proposed scheduling algorithms in both simulated and real-life networks. Extensive results show that they significantly outperform greedy scheduling methods in large-scale networks."}]