Bøger af Xiaoming Fu

Network Function Virtualization (NFV) has recently attracted considerable attention from both research and industrial communities. Numerous papers have been published regarding solving the resource- allocation problems in NFV, from various perspectives, considering different constraints, and adopting a range of techniques. However, it is difficult to get a clear impression of how to understand and classify different kinds of resource allocation problems in NFV and how to design solutions to solve these problems efficiently.This book addresses these concerns by offering a comprehensive overview and explanation of different resource allocation problems in NFV and presenting efficient solutions to solve them. It covers resource allocation problems in NFV, including an introduction to NFV and QoS parameters modelling as well as related problem definition, formulation and the respective state-of-the-art algorithms.This book allows readers to gain a comprehensive understanding of and deep insights into the resource allocation problems in NFV. It does so by exploring (1) the working principle and architecture of NFV, (2) how to model the Quality of Service (QoS) parameters in NFV services, (3) definition, formulation and analysis of different kinds of resource allocation problems in various NFV scenarios, (4) solutions for solving the resource allocation problem in NFV, and (5) possible future work in the respective area.

In recent years, the tremendous growth of the Internet and the increasing demand of user applications have resulted in a number of architectural changes to the Internet infrastructure. By its original, the Internet based on the packet-switched technology has been designed for delivering packets in a best effort fashion: the end systems do not need to inform the network prior to transmitting their IP packets, whole routers simply perform routing and forwarding of these packets without distinguishing from each other. However, this design has been challenged due to the new requirements which have been dramatically different from over 30 years ago. For example, to realize the bandwidth and connectivity on demand for the service providers, a signaling protocol seems to be critical.Signaling is not a new topic. In the telecommunication industry, signaling is common and can be dated back to when circuit switches first replaced human telephone operators. Even the modern Signaling System No. 7 (SS7) [187] began its development in the mid 1970¿s, based on the idea that relies on a separate control element (i.e., the SS6 signal switches) to signal to other control element to set up, manage and release voice trunk lines required to make a call. Based on the signaling standard for ISDN [8], ITU-T standardized a Q.2931 signaling protocol [9] which allows ATM nodes to exchange control of information, request the use of network resources, or negotiate for the use of circuit parameters, for instance, mapping between an input set and an output set of virtual circuit parameters, for instance, mapping between an input set and an output set of virtual circuit identifiers (VCIs) and virtual path identifiers (VPIs). Essentially, signaling protocols manages states in network nodes. They generally reflect some requirements of an end-to-end session/call to the traverses nodes. Thus, they need to be maintained properly, especially when network ¿conditions¿ change (e.g., some link or node fails, or the traversing route changes). The task of a signaling protocol involves establishing, maintaining and removing network control states, traversing from one end system to another through the network. Hence, the concept of signaling protocol discussed in this book mainly targets at network control state singnaling.

The book addresses the issue of interdisciplinary understanding of collaboration on the topic of social network studies. Researchers and practitioners from various disciplines including sociology, computer science, socio-psychology, public health, complex systems, and management science have worked largely independently, each with quite differen