Management is a complex task in today's heterogeneous and large scale networks like Cloud, IoT, vehicular and MPLS networks. Likewise, researchers and developers envision the use of artificial intelligence techniques to create cognitive and autonomic management tools that aim better assist and enhance the management process cycle. Bandwidth allocation models (BAMs) are a resource allocation solution for networks that need to share and optimize limited resources like bandwidth, fiber or optical slots in a flexible and dynamic way. This paper proposes and evaluates the use of Case-Based Reasoning (CBR) for the cognitive management of BAM reconfiguration in MPLS networks. The results suggest that CBR learns about bandwidth request profiles (LSPs requests) associated with the current network state and is able to dynamically define or assist in BAM reconfiguration. The BAM reconfiguration approach adopted is based on switching among available BAM implementations (MAM, RDM and ATCS). The cognitive management proposed allows BAMs self-configuration and results in optimizing the utilization of network resources.
Resource allocation management for communications has been researched for many years @cite_26 . Despite years of struggle, investment and results achieved, the subject keeps its importance mainly due to the communication network's evolution.
@cite_26
2068193298
Scientific research is highly dynamic. New areas of science continually evolve; others gain or lose importance, merge, or split. Due to the steady increase in the number of scientific publications, it is hard to keep an overview of the structure and dynamic development of one's own field of science, much less all scientific domains. However, knowledge of "hot" topics, emergent research frontiers, or change of focus in certain areas is a critical component of resource allocation decisions in research laboratories, governmental institutions, and corporations. This paper demonstrates the utilization of Kleinberg's burst detection algorithm, co-word occurrence analysis, and graph layout techniques to generate maps that support the identification of major research topics and trends. The approach was applied to analyze and map the complete set of papers published in PNAS in the years 1982-2001. Six domain experts examined and commented on the resulting maps in an attempt to reconstruct the evolution of major research areas covered by PNAS. We review the rationale behind the current design of the Delay Disruption Tolerant Networking (DTN) Architecture and highlight some remaining open issues. Its evolution, from a focus on deep space to a broader class of heterogeneous networks that may suffer disruptions, affected design decisions spanning naming and addressing, message formats, data encoding methods, routing, congestion management and security. Having now achieved relative stability with the design, additional experience is required in long-running operational environments in order to fine tune our understanding of DTN concepts and the types of capabilities that are worth the investment in implementation complexity. We expect key management, handling of congestion, multicasting capability, and routing to remain active areas of research and development, and that DTN may continue to be an active research endeavor for at least the next few years. In recent years, the paradigm of cloud computing has gained an increasing interest from the academic community as well as from the commercial point of view. The cloud is a very appealing concept both for the providers (who can benefit from hiring out their extra computation and storage resources) and for the users (who can avoid the initial investment on resources by outsourcing their processes and data to a cloud). Previous research on Recommender Systems (RS), especially the continuously popular approach of Collaborative Filtering (CF), has been mostly focusing on the information resource of explicit user numerical ratings or implicit (still numerical) feedbacks. However, the ever-growing availability of textual user reviews has become an important information resource, where a wealth of explicit product attributes features and user attitudes sentiments are expressed therein. This information rich resource of textual reviews have clearly exhibited brand-new approaches to solving many of the important problems that have been perplexing the research community for years, such as the paradox of cold-start, the explanation of recommendation, and the automatic generation of user or item profiles. However, it is only recently that the fundamental importance of textual reviews has gained wide recognition, perhaps mainly because of the difficulty in formatting, structuring and analyzing the free-texts. In this research, we stress the importance of incorporating textual reviews for recommendation through phrase-level sentiment analysis, and further investigate the role that the texts play in various important recommendation tasks. Large-scale deployments of massive machine type communications involve several challenges on cellular networks. To address the challenges of massive machine-type communications, or more generally, the Internet of Things (IoT), the 3GPP has developed Narrowband IoT (NB-IoT) as part of Release 13. NB-IoT is designed to provide better indoor coverage, support of a massive number of low-throughput devices, with relaxed delay requirements, and lower energy consumption. NB-IoT reuses Long Term Evolution functionality with simplifications and optimizations. Particularly for small data transmissions, NB-IoT specifies two procedures to reduce the required signaling: one of them based on the control plane and the other on the user plane (UP). In this work, we provide an overview of these procedures as well as an evaluation of their performance. The results of the energy consumption show both optimizations achieve a battery lifetime extension of more than two years for a large range in the considered cases, and up to eight years for CP with good coverage. In terms of cell capacity relative to Service Request, CP achieves gains from 26 to 224 percent, and UP ranges from 36 to 165 percent. The comparison of CP and UP optimizations yields similar results, except for some specific configurations. It has long been realized that social network of scientific collaborations provides a window on patterns of collaboration within the academic community. Investigations and studies about static and dynamic properties of co-authorship network have also been done in the recent years. However, the accent of most of the research is on the analysis about the macroscopic structure of the whole network or community over time such as distance, diameter shrinking and densication phenomenon and microscopic formation analysis of links,groups or communities over time. But in fact, how an individual or a community grows over time may not only provide a new view point to mine copious and valuable information about scientific networks but also reveal important factors that influence the growth process. In this paper,from a temporal and microscopic analytical perspective, we propose a method to trace scientific individual's and community's growth process based on community's evolution path combination with quantifiable measurements. During the process of tracing, we find out that it is the fact that the lifespan of community is related to the ability of altering its membership, but what's more and complementary, we find out that the lifespan of community is also related to the ability of maintaining its core members meaning that community may last for a longer lifespan if its core members are much more stable. Meanwhile, we also trace the growth process of research individuals based on the evolution of communities. Radio resource allocation for downlink transmissions in a cellular system based on orthogonal frequency-division multiple access (OFDMA) has been the subject of many research studies over the past few years. Nowadays, increasing attention has turned to cellular systems with relays, but only a few algorithms have been designed for OFDMA-based relay systems. In this paper, resource-allocation schemes are proposed for the cases of one relay station (RS) and multiple RSs in the cell. Due to the specific design of these algorithms, which operate in an RS-aided base station centralized manner, the amount of required channel-state information and algorithm complexity are minimized, making them suited for practical use. The idea of adaptive RS activation is introduced, where the frame structure is adapted depending on the active RS. Different numbers of relays are considered, and the corresponding algorithms are accordingly adapted. Simulation results show that our algorithms achieve a very good throughput outage tradeoff. After more than 40 years of life, software evolution should be considered as a mature field. However, despite such a long history, many research questions still remain open, and controversial studies about the validity of the laws of software evolution are common. During the first part of these 40 years, the laws themselves evolved to adapt to changes in both the research and the software industry environments. This process of adaption to new paradigms, standards, and practices stopped about 15 years ago, when the laws were revised for the last time. However, most controversial studies have been raised during this latter period. Based on a systematic and comprehensive literature review, in this article, we describe how and when the laws, and the software evolution field, evolved. We also address the current state of affairs about the validity of the laws, how they are perceived by the research community, and the developments and challenges that are likely to occur in the coming years. The design, management, and operation of network infrastructure have evolved during the last few years, leveraging on innovative technologies and architectures. With such a huge trend, due to the flexibility and significant economic potential of these technologies, software-defined networking (SDN) and network functions virtualization (NFV) are emerging as the most indispensable key catalysers. SDN NFV enhancing the infrastructure agility, thus network operators and service providers are able to program their own network functions (e.g., gateways, routers, load balancers) on vendor-independent hardware substrate. One of the most important considerations in NFV deployment is how to allocate the virtual resources that are needed to provide flexible virtual network services in an NFV-based network infrastructure. Thus, the most important prerequisite for NFV deployment is achieved fast, scalable and dynamic composition and allocation of networks functions (NFs) to implement network services (NSs). We have proposed a revised RA algorithm that integrates embedding and scheduling of virtual network functions (VNFs) simultaneously. In this paper, performance evaluation of the revised RA algorithm is performed and the proposed algorithm is applied more effectively in NFV environment where the demand for resources is flexible and concentrated. SUMO is an open source traffic simulation package including the simulation application itself as well as supporting tools, mainly for network import and demand modeling. SUMO helps to investigate a large variety of research topics, mainly in the context of traffic management and vehicular communications. We describe the current state of the package, its major applications, both by research topic and by example, as well as future developments and extensions. Keywords-microscopic traffic simulation; traffic management; open source; software The significant advances of hardware manufacturing technology and the development of efficient software algorithms make technically and economically feasible a network composed of numerous, small, low-cost sensors using wireless communications, that is, a wireless sensor network. WSNs have attracted intensive interest from both academia and industry due to their wide application in civil and military scenarios. In hostile scenarios, it is very important to protect WSNs from malicious attacks. Due to various resource limitations and the salient features of a wireless sensor network, the security design for such networks is significantly challenging. In this article, we present a comprehensive survey of WSN security issues that were investigated by researchers in recent years and that shed light on future directions for WSN security. In the past few years, Reddit -- a community-driven platform for submitting, commenting and rating links and text posts -- has grown exponentially, from a small community of users into one of the largest online communities on the Web. To the best of our knowledge, this work represents the most comprehensive longitudinal study of Reddit's evolution to date, studying both (i) how user submissions have evolved over time and (ii) how the community's allocation of attention and its perception of submissions have changed over 5 years based on an analysis of almost 60 million submissions. Our work reveals an ever-increasing diversification of topics accompanied by a simultaneous concentration towards a few selected domains both in terms of posted submissions as well as perception and attention. By and large, our investigations suggest that Reddit has transformed itself from a dedicated gateway to the Web to an increasingly self-referential community that focuses on and reinforces its own user-generated image- and textual content over external sources. Next generation cellular networks are envisioned to widely enable machine-to-machine (M2M) communication. For many applications in the M2M domain, deterministic communication latencies and high reliability are of very high importance. As a consequence, device-to-device (D2D) communication is a expected to play a key role in order to avoid from having to route the entire data through a centralized base station. Considering the large number of devices but relatively small payload lengths of many M2M applications, LTE currently fails to efficiently utilize the available radio resources. This is primarily because the granularity of resources that can be allocated to a single user is too coarse, resulting in parts of the allocation being wasted. In this paper, we present a hierarchical radio resource management scheme that allows ordinary cellular users to reuse and exploit the otherwise unused portion of a D2D scheduling grant. We show that our resource reuse scheme improves the uplink throughput of cellular users between 10 and 30 , depending on the actual number of D2D users, compared to current allocation schemes. The last years we are witnessing of rapid advances in the industrial automation domain, mainly driven by business needs towards agility and supported by new disruptive technologies. Future factories will rely on multi-system interactions and collaborative cross-layer management and automation approaches. Such a factory, configured and managed from architectural and behavioural viewpoints, under the service-oriented architecture (SOA) paradigm is virtualized by services exposed by its key components (both HW and SW). One of the main results of this virtualization is that the factory is transformed into a “cloud of services”, where dynamic resource allocation and interactions take place. This paper presents a view on such architecture, its specification, the main motivation and considerations, as well as the preliminary services it may need to support. Network slicing is a technique for flexible resource provisioning in future wireless networks. With the powerful SDN and NFV technologies available, network slices can be quickly deployed and centrally managed, leading to simplified management, better resource utilization, and cost efficiency by commoditization of resources. Departing from the one-type-fits-all design philosophy, future wireless networks will employ the network slicing methodology in order to accommodate applications with widely diverse requirements over the same physical network. On the other hand, deciding how to efficiently allocate, manage, and control the slice resources in real time is very challenging. This article focuses on the algorithmic challenges that emerge in efficient network slicing, necessitating novel techniques from the communities of operation research, networking, and computer science. For years the PC community has struggled to provide secure solutions on open platforms. Intel has developed innovative new technology to enable SW developers to develop and deploy secure applications on open platforms. The technology enables applications to execute with confidentiality and integrity in the native OS environment. It does this by providing ISA extensions for generating hardware enforceable containers at a granularity determined by the developer. These containers while opaque to the operating system are managed by the OS. This paper analyzes the threats and attacks to applications. It then describes the ISA extension for generating a HW based container. Finally it describes the programming model of this container. In recent years research in the planning community has moved increasingly towards application of planners to realistic problems involving both time and many types of resources. For example, interest in planning demonstrated by the space research community has inspired work in observation scheduling, planetary rover exploration and spacecraft control domains. Other temporal and resource-intensive domains including logistics planning, plant control and manufacturing have also helped to focus the community on the modelling and reasoning issues that must be confronted to make planning technology meet the challenges of application. The International Planning Competitions have acted as an important motivating force behind the progress that has been made in planning since 1998. The third competition (held in 2002) set the planning community the challenge of handling time and numeric resources. This necessitated the development of a modelling language capable of expressing temporal and numeric properties of planning domains. In this paper we describe the language, PDDL2.1, that was used in the competition. We describe the syntax of the language, its formal semantics and the validation of concurrent plans. We observe that PDDL2.1 has considerable modelling power -- exceeding the capabilities of current planning technology -- and presents a number of important challenges to the research community. Abstract Project scheduling is concerned with single-item or small batch production where scarce resources have to be allocated to dependent activities over time. Applications can be found in diverse industries such as construction engineering, software development, etc. Also, project scheduling is increasingly important for make-to-order companies where the capacities have been cut down in order to meet lean management concepts. Likewise, project scheduling is very attractive for researchers, because the models in this area are rich and, hence, difficult to solve. For instance, the resource-constrained project scheduling problem contains the job shop scheduling problem as a special case. So far, no classification scheme exists which is compatible with what is commonly accepted in machine scheduling. Also, a variety of symbols are used by project scheduling researchers in order to denote one and the same subject. Hence, there is a gap between machine scheduling on the one hand and project scheduling on the other with respect to both, viz. a common notation and a classification scheme. As a matter of fact, in project scheduling, an ever growing number of papers is going to be published and it becomes more and more difficult for the scientific community to keep track of what is really new and relevant. One purpose of our paper is to close this gap. That is, we provide a classification scheme, i.e. a description of the resource environment, the activity characteristics, and the objective function, respectively, which is compatible with machine scheduling and which allows to classify the most important models dealt with so far. Also, we propose a unifying notation. The second purpose of this paper is to review some of the recent developments. More specifically, we review exact and heuristic algorithms for the single-mode and the multi-mode case, for the time–cost tradeoff problem, for problems with minimum and maximum time lags, for problems with other objectives than makespan minimization and, last but not least, for problems with stochastic activity durations. Previous research indicates that during the past 20 years, the highest-quality work has been published in an increasingly diverse and larger group of journals. In this article, we examine whether this diversification has also affected the handful of elite journals that are traditionally considered to be the best. We examine citation patterns during the past 40 years of seven long-standing traditionally elite journals and six journals that have been increasing in importance during the past 20 years. To be among the top 5 or 1 cited papers, papers now need about twice as many citations as they did 40 years ago. Since the late 1980s and early 1990s, elite journals have been publishing a decreasing proportion of these top-cited papers. This also applies to the two journals that are typically considered as the top venues and often used as bibliometric indicators of "excellence": Science and Nature. On the other hand, several new and established journals are publishing an increasing proportion of the most-cited papers. These changes bring new challenges and opportunities for all parties. Journals can enact policies to increase or maintain their relative position in the journal hierarchy. Researchers now have the option to publish in more diverse venues knowing that their work can still reach the same audiences. Finally, evaluators and administrators need to know that although there will always be a certain prestige associated with publishing in "elite" journals, journal hierarchies are in constant flux. In this paper, we discuss symmetric-key and public-key protocols for key management in electricity transmission and distribution substations — both for communication within substations, and between substations and the network control center. Key management in the electricity network is widely regarded as a challenging problem, not only because of the scale, but also due to the fact that any mechanism must be implemented in resource-constrained environments. NISTIR 7628, the foundation document for the architecture of the US Smart Grid, mentions key management as one of the most important research areas, and the IEC 62351 standards committee has already initiated a new specification dedicated to key management. In this document, we describe different variants of symmetric-key and public-key protocols. Our design is motivated by the need to keep the mechanism simple, robust, usable and still cost effective. It is important to take into account the complexity and the costs involved not just in the initial bootstrapping of trust but also in subsequent key management operations like key update and revocation. It is vital to determine the complexity and the cost of recovery mechanisms — recovery not only from malicious, targeted attacks but also from unintentional failures. We present a detailed threat model, analysing a range of scenarios from physical intrusion through disloyal maintenance personnel to supply-chain attacks, network intrusions and attacks on central systems. We conclude that while using cryptography to secure wide area communication between the substation and the network control center brings noticeable benefits, the benefits of using cryptography within the substation bay are much less obvious; we expect that any such use will be essentially for compliance. The protocols presented in this paper are informed by this threat model and are optimised for robustness, including simplicity, usability and cost.