Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: It is important for network service providers todesign and operate reliable network which is robust againstnetwork failures. Especially, a network must be sufficientlyconnected, even if link failures occur. There are many methodsto design a robust network. One is a method based on aserver location problem. As the location of mirror serversaffects the performance of a content delivery service, it isnecessary to find a better server placement. Another methodis based on link protection. It is desirable to protect all linksso that the failure probability of a link is sufficiently small bysufficient backup resource and rapid recovery system. Hover, link protection costs are high, therefore, it is important tofind the smallest number of links to be protected so that anetwork resulting from failures of any non-protected linksprovides users connectivity. ,  address a networkdesign method by combining server placement method and linkprotection method. Even if a network cannot be made reliablesimply by server placement method or simply by link protectionmethod, the combination of them may make the networkreliable. Thus, our purpose is to find a server placement and aset of links to be protected such that, even if any non-protectedlinks fail, all connected components include specified servers inthe resulting network. First,  formulate this reliable networkdesign method by combining server placement method and linkprotection method and show that this problem is NP-hard. Inaddition,  propose a polynomial-time algorithm to solve theproblem that the number of the protected links is restrictedto zero, and a polynomial-time algorithm to solve the problemthat the number of the simultaneous link failures is restrictedto one. Furthermore,  evaluate the algorithm by applying itto the topology of actual networks and show that the proposedalgorithms work ll.
['Daishi Irie', 'Hiroyoshi Miwa']
I am writing a research paper on a idea Network Design Method by Finding Server Placement and Protected Links to Keep Connectivity to Servers Against Link Failures
[{"from": "human", "value": "I am writing a research paper on a idea Network Design Method by Finding Server Placement and Protected Links to Keep Connectivity to Servers Against Link Failures"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: It is important for network service providers todesign and operate reliable network which is robust againstnetwork failures. Especially, a network must be sufficientlyconnected, even if link failures occur. There are many methodsto design a robust network. One is a method based on aserver location problem. As the location of mirror serversaffects the performance of a content delivery service, it isnecessary to find a better server placement. Another methodis based on link protection. It is desirable to protect all linksso that the failure probability of a link is sufficiently small bysufficient backup resource and rapid recovery system. Hover, link protection costs are high, therefore, it is important tofind the smallest number of links to be protected so that anetwork resulting from failures of any non-protected linksprovides users connectivity. ,  address a networkdesign method by combining server placement method and linkprotection method. Even if a network cannot be made reliablesimply by server placement method or simply by link protectionmethod, the combination of them may make the networkreliable. Thus, our purpose is to find a server placement and aset of links to be protected such that, even if any non-protectedlinks fail, all connected components include specified servers inthe resulting network. First,  formulate this reliable networkdesign method by combining server placement method and linkprotection method and show that this problem is NP-hard. Inaddition,  propose a polynomial-time algorithm to solve theproblem that the number of the protected links is restrictedto zero, and a polynomial-time algorithm to solve the problemthat the number of the simultaneous link failures is restrictedto one. Furthermore,  evaluate the algorithm by applying itto the topology of actual networks and show that the proposedalgorithms work ll."}]