Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study scheduling algorithms in WDM optical interconnects with recirculating buffering. The interconnect  consider has wavelength conversion capabilities.  focus on limited range wavelength conversion while considering full range wavelength conversion as a special case.  formalize the problem of maximizing throughput and minimizing packet delay in such an interconnect as a matching problem in a bipartite graph and give an optimal parallel algorithm that runs in O(Bk/sup 2/), as compared to O((N+B)/sup 3/k/sup 3/) time if directly applying other existing matching algorithms, where N is the number of input/output fibers, B is the number of fiber delay lines and k is the number of wavelengths per fiber.
['Zhenghao Zhang', 'Yuanyuan Yang']
I am writing a research paper on a idea Optimal parallel scheduling algorithm for WDM optical interconnects with recirculating buffering
[{"from": "human", "value": "I am writing a research paper on a idea Optimal parallel scheduling algorithm for WDM optical interconnects with recirculating buffering"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study scheduling algorithms in WDM optical interconnects with recirculating buffering. The interconnect  consider has wavelength conversion capabilities.  focus on limited range wavelength conversion while considering full range wavelength conversion as a special case.  formalize the problem of maximizing throughput and minimizing packet delay in such an interconnect as a matching problem in a bipartite graph and give an optimal parallel algorithm that runs in O(Bk/sup 2/), as compared to O((N+B)/sup 3/k/sup 3/) time if directly applying other existing matching algorithms, where N is the number of input/output fibers, B is the number of fiber delay lines and k is the number of wavelengths per fiber."}]