01821nas a2200229   4500008004100000245011700041210006900158260000900227300001400236490000700250520106500257653001501322653001601337653002201353653002001375653001901395653001401414100001701428700001301445700001601458856011701474       2012                        eng d00aA strategic search method for requirement-aware functional-block selection and composition in a flexible network0 astrategic search method for requirementaware functionalblock sel  c2012  a194 - 2010 v103 aInternet applications have reached such a high complexity that the network stack concept introduced decades ago is not suitable anymore. Future Internet research activities try to increase the flexibility of the Internet in order to allow the network to adapt to present and future requirements and applications. A well known approach is to build protocol graphs, which will be used instead of inflexible network stacks, by connecting functional blocks together. A functional block encapsulates a particular network function. The protocol graph that should be used is the one most suitable to the application's requirements. To find the most suitable graph, all possible protocol graphs must be evaluated. However, the number of possible protocol graphs increases exponentially as the number of functional blocks increases. This article presents a method of modeling the protocol graph search space as a set of search trees and then using search strategies to manage the inherent complexity of the search process. We evaluate our proposed method by simulation.10aComplexity10aComposition10aFlexible networks10aFuture internet10aProtocol graph10aSelection1 aGünther, D.1 aKerr, N.1 aMüller, P.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866463034&partnerID=40&md5=b30673b530b454aa1a7fead4a7f771ad