On the Tradeoff between Performance and Programmability for Software Defined WiFi Networks

Directory of Open Access Journals (Sweden)

Tausif Zahid

2018-01-01

Full Text Available WiFi has become one of the major network access networks due to its simple technical implementation and high-bandwidth provisioning. In this paper, we studied software defined WiFi networks (SDWN against traditional WiFi networks to understand the potential benefits, such as the ability of SDWN to effectively hide the handover delay between access points (AP of the adoption of the SDWN architecture on WiFi networks and identify representative application scenarios where such SDWN approach could bring additional benefits. This study delineated the performance bottlenecks such as the throughput degradation by around 50% compared with the conventional WiFi networks. In addition, our study also shed some insights into performance optimization issues. All of the performance measurements were conducted on a network testbed consisting of a single basic service set (BSS and an extended service set (ESS managed by a single SDN controller deployed with various laboratory settings. Our evaluation included the throughput performance under different traffic loads with different number of nodes and packet sizes for both TCP and UDP traffic flows. Handover delays were measured during the roaming phase between different APs against the traditional WiFi networks. Our results have demonstrated the tradeoff between performance and programmability of software defined APs.

dSDiVN: a distributed Software-Defined Networking architecture for Infrastructure-less Vehicular Networks

OpenAIRE

Alioua, Ahmed; Senouci, Sidi-Mohammed; Moussaoui, Samira

2017-01-01

In the last few years, the emerging network architecture paradigm of Software-Defined Networking (SDN), has become one of the most important technology to manage large scale networks such as Vehicular Ad-hoc Networks (VANETs). Recently, several works have shown interest in the use of SDN paradigm in VANETs. SDN brings flexibility, scalability and management facility to current VANETs. However, almost all of proposed Software-Defined VANET (SDVN) architectures are infrastructure-based. This pa...

Traffic Policing in Dynamic Military Networks Using Software Defined Networking

OpenAIRE

Skappel, Hans Fredrik

2016-01-01

This thesis looks at how Software Defined Networking (SDN) can be used to provide traffic engineering and to police traffic in an Operational Military Network (OMN). SDN is a concept where the control plane is separated from the forwarding plane, and the control plane is capable of controlling forwarding plane elements located on multiple network nodes using the OpenFlow protocol. Specifically, we have discussed the problems in OMNs, and possible SDN approaches to mitigate the challenges. Bas...

Software-Defined Congestion Control Algorithm for IP Networks

Directory of Open Access Journals (Sweden)

Yao Hu

2017-01-01

Full Text Available The rapid evolution of computer networks, increase in the number of Internet users, and popularity of multimedia applications have exacerbated the congestion control problem. Congestion control is a key factor in ensuring network stability and robustness. When the underlying network and flow information are unknown, the transmission control protocol (TCP must increase or reduce the size of the congestion window to adjust to the changes of traffic in the Internet Protocol (IP network. However, it is possible that a software-defined approach can relieve the network congestion problem more efficiently. This approach has the characteristic of centralized control and can obtain a global topology for unified network management. In this paper, we propose a software-defined congestion control (SDCC algorithm for an IP network. We consider the difference between TCP and the user datagram protocol (UDP and propose a new method to judge node congestion. We initially apply the congestion control mechanism in the congested nodes and then optimize the link utilization to control network congestion.

Software Defined Network Monitoring Scheme Using Spectral Graph Theory and Phantom Nodes

Science.gov (United States)

2014-09-01

networks is the emergence of software - defined networking ( SDN ) [1]. SDN has existed for the...Chapter III for network monitoring. A. SOFTWARE DEFINED NETWORKS SDNs provide a new and innovative method to simplify network hardware by logically...and R. Giladi, “Performance analysis of software - defined networking ( SDN ),” in Proc. of IEEE 21st International Symposium on Modeling, Analysis

Enabling software defined networking experiments in networked critical infrastructures

Directory of Open Access Journals (Sweden)

Béla Genge

2014-05-01

Full Text Available Nowadays, the fact that Networked Critical Infrastructures (NCI, e.g., power plants, water plants, oil and gas distribution infrastructures, and electricity grids, are targeted by significant cyber threats is well known. Nevertheless, recent research has shown that specific characteristics of NCI can be exploited in the enabling of more efficient mitigation techniques, while novel techniques from the field of IP networks can bring significant advantages. In this paper we explore the interconnection of NCI communication infrastructures with Software Defined Networking (SDN-enabled network topologies. SDN provides the means to create virtual networking services and to implement global networking decisions. It relies on OpenFlow to enable communication with remote devices and has been recently categorized as the “Next Big Technology”, which will revolutionize the way decisions are implemented in switches and routers. Therefore, the paper documents the first steps towards enabling an SDN-NCI and presents the impact of a Denial of Service experiment over traffic resulting from an XBee sensor network which is routed across an emulated SDN network.

Employing Deceptive Dynamic Network Topology Through Software-Defined Networking

Science.gov (United States)

2014-03-01

actions. From [64] . . . . . 37 xi THIS PAGE INTENTIONALLY LEFT BLANK xii List of Acronyms and Abbreviations ACL Access Control List API Application...can be extremely useful in topology mapping through various latency-based geolocation methods [35], [36], [37]. PING 1 7 2 . 2 0 . 5 . 2 ( 1 7 2 . 2 0...defined northbound Applica- tion Programming Interfaces ( APIs ). Figure 3.1: Software-Defined Network Architecture. From [8] 29 3.3 SDN OpenFlow

Service-oriented Software Defined Optical Networks for Cloud Computing

Science.gov (United States)

Liu, Yuze; Li, Hui; Ji, Yuefeng

2017-10-01

With the development of big data and cloud computing technology, the traditional software-defined network is facing new challenges (e.g., ubiquitous accessibility, higher bandwidth, more flexible management and greater security). This paper proposes a new service-oriented software defined optical network architecture, including a resource layer, a service abstract layer, a control layer and an application layer. We then dwell on the corresponding service providing method. Different service ID is used to identify the service a device can offer. Finally, we experimentally evaluate that proposed service providing method can be applied to transmit different services based on the service ID in the service-oriented software defined optical network.

Graphs for information security control in software defined networks

Science.gov (United States)

Grusho, Alexander A.; Abaev, Pavel O.; Shorgin, Sergey Ya.; Timonina, Elena E.

2017-07-01

Information security control in software defined networks (SDN) is connected with execution of the security policy rules regulating information accesses and protection against distribution of the malicious code and harmful influences. The paper offers a representation of a security policy in the form of hierarchical structure which in case of distribution of resources for the solution of tasks defines graphs of admissible interactions in a networks. These graphs define commutation tables of switches via the SDN controller.

In-network adaptation of SHVC video in software-defined networks

Science.gov (United States)

Awobuluyi, Olatunde; Nightingale, James; Wang, Qi; Alcaraz Calero, Jose Maria; Grecos, Christos

2016-04-01

Software Defined Networks (SDN), when combined with Network Function Virtualization (NFV) represents a paradigm shift in how future networks will behave and be managed. SDN's are expected to provide the underpinning technologies for future innovations such as 5G mobile networks and the Internet of Everything. The SDN architecture offers features that facilitate an abstracted and centralized global network view in which packet forwarding or dropping decisions are based on application flows. Software Defined Networks facilitate a wide range of network management tasks, including the adaptation of real-time video streams as they traverse the network. SHVC, the scalable extension to the recent H.265 standard is a new video encoding standard that supports ultra-high definition video streams with spatial resolutions of up to 7680×4320 and frame rates of 60fps or more. The massive increase in bandwidth required to deliver these U-HD video streams dwarfs the bandwidth requirements of current high definition (HD) video. Such large bandwidth increases pose very significant challenges for network operators. In this paper we go substantially beyond the limited number of existing implementations and proposals for video streaming in SDN's all of which have primarily focused on traffic engineering solutions such as load balancing. By implementing and empirically evaluating an SDN enabled Media Adaptation Network Entity (MANE) we provide a valuable empirical insight into the benefits and limitations of SDN enabled video adaptation for real time video applications. The SDN-MANE is the video adaptation component of our Video Quality Assurance Manager (VQAM) SDN control plane application, which also includes an SDN monitoring component to acquire network metrics and a decision making engine using algorithms to determine the optimum adaptation strategy for any real time video application flow given the current network conditions. Our proposed VQAM application has been implemented and

Using Cognitive Control in Software Defined Networking for Port Scan Detection

Science.gov (United States)

2017-07-01

ARL-TR-8059 ● July 2017 US Army Research Laboratory Using Cognitive Control in Software -Defined Networking for Port Scan...Cognitive Control in Software -Defined Networking for Port Scan Detection by Vinod K Mishra Computational and Information Sciences Directorate, ARL...Technical Report 3. DATES COVERED (From - To) 15 June–31 July 2016 4. TITLE AND SUBTITLE Using Cognitive Control in Software -Defined Networking for

Software Defined Networking Demands on Software Technologies

DEFF Research Database (Denmark)

Galinac Grbac, T.; Caba, Cosmin Marius; Soler, José

2015-01-01

Software Defined Networking (SDN) is a networking approach based on a centralized control plane architecture with standardised interfaces between control and data planes. SDN enables fast configuration and reconfiguration of the network to enhance resource utilization and service performances....... This new approach enables a more dynamic and flexible network, which may adapt to user needs and application requirements. To this end, systemized solutions must be implemented in network software, aiming to provide secure network services that meet the required service performance levels. In this paper......, we review this new approach to networking from an architectural point of view, and identify and discuss some critical quality issues that require new developments in software technologies. These issues we discuss along with use case scenarios. Here in this paper we aim to identify challenges...

Software-defined Quantum Networking Ecosystem

Energy Technology Data Exchange (ETDEWEB)

2017-01-01

The software enables a user to perform modeling and simulation of software-defined quantum networks. The software addresses the problem of how to synchronize transmission of quantum and classical signals through multi-node networks and to demonstrate quantum information protocols such as quantum teleportation. The software approaches this problem by generating a graphical model of the underlying network and attributing properties to each node and link in the graph. The graphical model is then simulated using a combination of discrete-event simulators to calculate the expected state of each node and link in the graph at a future time. A user interacts with the software by providing an initial network model and instantiating methods for the nodes to transmit information with each other. This includes writing application scripts in python that make use of the software library interfaces. A user then initiates the application scripts, which invokes the software simulation. The user then uses the built-in diagnostic tools to query the state of the simulation and to collect statistics on synchronization.

Towards Effective Intra-flow Network Coding in Software Defined Wireless Mesh Networks

OpenAIRE

Donghai Zhu; Xinyu Yang Yang; Peng Zhao; Wei Yu

2016-01-01

Wireless Mesh Networks (WMNs) have potential to provide convenient broadband wireless Internet access to mobile users.With the support of Software-Defined Networking (SDN) paradigm that separates control plane and data plane, WMNs can be easily deployed and managed. In addition, by exploiting the broadcast nature of the wireless medium and the spatial diversity of multi-hop wireless networks, intra-flow network coding has shown a greater benefit in comparison with traditional routing paradigm...

Resilient Disaster Network Based on Software Defined Cognitive Wireless Network Technology

Directory of Open Access Journals (Sweden)

Goshi Sato

2015-01-01

Full Text Available In order to temporally recover the information network infrastructure in disaster areas from the Great East Japan Earthquake in 2011, various wireless network technologies such as satellite IP network, 3G, and Wi-Fi were effectively used. However, since those wireless networks are individually introduced and installed but not totally integrated, some of networks were congested due to the sudden network traffic generation and unbalanced traffic distribution, and eventually the total network could not effectively function. In this paper, we propose a disaster resilient network which integrates various wireless networks into a cognitive wireless network that users can use as an access network to the Internet at the serious disaster occurrence. We designed and developed the disaster resilient network based on software defined network (SDN technology to automatically select the best network link and route among the possible access networks to the Internet by periodically monitoring their network states and evaluate those using extended AHP method. In order to verify the usefulness of our proposed system, a prototype system is constructed and its performance is evaluated.

Multiple Social Networks, Data Models and Measures for

DEFF Research Database (Denmark)

Magnani, Matteo; Rossi, Luca

2017-01-01

Multiple Social Network Analysis is a discipline defining models, measures, methodologies, and algorithms to study multiple social networks together as a single social system. It is particularly valuable when the networks are interconnected, e.g., the same actors are present in more than one...

Protocol independent transmission method in software defined optical network

Science.gov (United States)

Liu, Yuze; Li, Hui; Hou, Yanfang; Qiu, Yajun; Ji, Yuefeng

2016-10-01

With the development of big data and cloud computing technology, the traditional software-defined network is facing new challenges (e.i., ubiquitous accessibility, higher bandwidth, more flexible management and greater security). Using a proprietary protocol or encoding format is a way to improve information security. However, the flow, which carried by proprietary protocol or code, cannot go through the traditional IP network. In addition, ultra- high-definition video transmission service once again become a hot spot. Traditionally, in the IP network, the Serial Digital Interface (SDI) signal must be compressed. This approach offers additional advantages but also bring some disadvantages such as signal degradation and high latency. To some extent, HD-SDI can also be regard as a proprietary protocol, which need transparent transmission such as optical channel. However, traditional optical networks cannot support flexible traffics . In response to aforementioned challenges for future network, one immediate solution would be to use NFV technology to abstract the network infrastructure and provide an all-optical switching topology graph for the SDN control plane. This paper proposes a new service-based software defined optical network architecture, including an infrastructure layer, a virtualization layer, a service abstract layer and an application layer. We then dwell on the corresponding service providing method in order to implement the protocol-independent transport. Finally, we experimentally evaluate that proposed service providing method can be applied to transmit the HD-SDI signal in the software-defined optical network.

Critical field measurements in a superconducting networks

International Nuclear Information System (INIS)

Pannetier, B.; Chaussy, J.; Rammal, R.

1984-01-01

We have measured the critical field of a periodic two-dimensional network of superconducting indium. At low fields, the critical line Hsub(c)(T) reflects the network topology and exhibits well-defined cusps due to flux quantization corresponding to both integer and rational number of flux quanta phi 0 = h/2e per unit loop of the network [fr

Software Defined Networking for Next Generation Converged Metro-Access Networks

Science.gov (United States)

Ruffini, M.; Slyne, F.; Bluemm, C.; Kitsuwan, N.; McGettrick, S.

2015-12-01

While the concept of Software Defined Networking (SDN) has seen a rapid deployment within the data center community, its adoption in telecommunications network has progressed slowly, although the concept has been swiftly adopted by all major telecoms vendors. This paper presents a control plane architecture for SDN-driven converged metro-access networks, developed through the DISCUS European FP7 project. The SDN-based controller architecture was developed in a testbed implementation targeting two main scenarios: fast feeder fiber protection over dual-homed Passive Optical Networks (PONs) and dynamic service provisioning over a multi-wavelength PON. Implementation details and results of the experiment carried out over the second scenario are reported in the paper, showing the potential of SDN in providing assured on-demand services to end-users.

Software-defined network abstractions and configuration interfaces for building programmable quantum networks

Energy Technology Data Exchange (ETDEWEB)

Dasari, Venkat [U.S. Army Research Laboratory, Aberdeen Proving Ground, MD; Sadlier, Ronald J [ORNL; Geerhart, Mr. Billy [U.S. Army Research Laboratory, Aberdeen Proving Ground, MD; Snow, Nikolai [U.S. Army Research Laboratory, Aberdeen Proving Ground, MD; Williams, Brian P [ORNL; Humble, Travis S [ORNL

2017-01-01

Well-defined and stable quantum networks are essential to realize functional quantum applications. Quantum networks are complex and must use both quantum and classical channels to support quantum applications like QKD, teleportation, and superdense coding. In particular, the no-cloning theorem prevents the reliable copying of quantum signals such that the quantum and classical channels must be highly coordinated using robust and extensible methods. We develop new network abstractions and interfaces for building programmable quantum networks. Our approach leverages new OpenFlow data structures and table type patterns to build programmable quantum networks and to support quantum applications.

So ware-Defined Network Solutions for Science Scenarios: Performance Testing Framework and Measurements

Energy Technology Data Exchange (ETDEWEB)

Settlemyer, Bradley [Los Alamos National Laboratory (LANL); Kettimuthu, R. [Argonne National Laboratory (ANL); Boley, Josh [Argonne National Laboratory (ANL); Katramatos, Dimitrios [Brookhaven National Laboratory (BNL); Rao, Nageswara S. [ORNL; Sen, Satyabrata [ORNL; Liu, Qiang [ORNL

2018-01-01

High-performance scientific work flows utilize supercomputers, scientific instruments, and large storage systems. Their executions require fast setup of a small number of dedicated network connections across the geographically distributed facility sites. We present Software-Defined Network (SDN) solutions consisting of site daemons that use dpctl, Floodlight, ONOS, or OpenDaylight controllers to set up these connections. The development of these SDN solutions could be quite disruptive to the infrastructure, while requiring a close coordination among multiple sites; in addition, the large number of possible controller and device combinations to investigate could make the infrastructure unavailable to regular users for extended periods of time. In response, we develop a Virtual Science Network Environment (VSNE) using virtual machines, Mininet, and custom scripts that support the development, testing, and evaluation of SDN solutions, without the constraints and expenses of multi-site physical infrastructures; furthermore, the chosen solutions can be directly transferred to production deployments. By complementing VSNE with a physical testbed, we conduct targeted performance tests of various SDN solutions to help choose the best candidates. In addition, we propose a switching response method to assess the setup times and throughput performances of different SDN solutions, and present experimental results that show their advantages and limitations.

Big data and software defined networks

CERN Document Server

Taheri, Javid

2018-01-01

Big Data Analytics and Software Defined Networking (SDN) are helping to drive the management of data usage of the extraordinary increase of computer processing power provided by Cloud Data Centres (CDCs). This new book investigates areas where Big-Data and SDN can help each other in delivering more efficient services.

A Security Assessment Mechanism for Software-Defined Networking-Based Mobile Networks

Directory of Open Access Journals (Sweden)

Shibo Luo

2015-12-01

Full Text Available Software-Defined Networking-based Mobile Networks (SDN-MNs are considered the future of 5G mobile network architecture. With the evolving cyber-attack threat, security assessments need to be performed in the network management. Due to the distinctive features of SDN-MNs, such as their dynamic nature and complexity, traditional network security assessment methodologies cannot be applied directly to SDN-MNs, and a novel security assessment methodology is needed. In this paper, an effective security assessment mechanism based on attack graphs and an Analytic Hierarchy Process (AHP is proposed for SDN-MNs. Firstly, this paper discusses the security assessment problem of SDN-MNs and proposes a methodology using attack graphs and AHP. Secondly, to address the diversity and complexity of SDN-MNs, a novel attack graph definition and attack graph generation algorithm are proposed. In order to quantify security levels, the Node Minimal Effort (NME is defined to quantify attack cost and derive system security levels based on NME. Thirdly, to calculate the NME of an attack graph that takes the dynamic factors of SDN-MN into consideration, we use AHP integrated with the Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS as the methodology. Finally, we offer a case study to validate the proposed methodology. The case study and evaluation show the advantages of the proposed security assessment mechanism.

A Security Assessment Mechanism for Software-Defined Networking-Based Mobile Networks.

Science.gov (United States)

Luo, Shibo; Dong, Mianxiong; Ota, Kaoru; Wu, Jun; Li, Jianhua

2015-12-17

Software-Defined Networking-based Mobile Networks (SDN-MNs) are considered the future of 5G mobile network architecture. With the evolving cyber-attack threat, security assessments need to be performed in the network management. Due to the distinctive features of SDN-MNs, such as their dynamic nature and complexity, traditional network security assessment methodologies cannot be applied directly to SDN-MNs, and a novel security assessment methodology is needed. In this paper, an effective security assessment mechanism based on attack graphs and an Analytic Hierarchy Process (AHP) is proposed for SDN-MNs. Firstly, this paper discusses the security assessment problem of SDN-MNs and proposes a methodology using attack graphs and AHP. Secondly, to address the diversity and complexity of SDN-MNs, a novel attack graph definition and attack graph generation algorithm are proposed. In order to quantify security levels, the Node Minimal Effort (NME) is defined to quantify attack cost and derive system security levels based on NME. Thirdly, to calculate the NME of an attack graph that takes the dynamic factors of SDN-MN into consideration, we use AHP integrated with the Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) as the methodology. Finally, we offer a case study to validate the proposed methodology. The case study and evaluation show the advantages of the proposed security assessment mechanism.

Stateless multicast switching in software defined networks

OpenAIRE

Reed, Martin J.; Al-Naday, Mays; Thomos, Nikolaos; Trossen, Dirk; Petropoulos, George; Spirou, Spiros

2016-01-01

Multicast data delivery can significantly reduce traffic in operators' networks, but has been limited in deployment due to concerns such as the scalability of state management. This paper shows how multicast can be implemented in contemporary software defined networking (SDN) switches, with less state than existing unicast switching strategies, by utilising a Bloom Filter (BF) based switching technique. Furthermore, the proposed mechanism uses only proactive rule insertion, and thus, is not l...

New value added to network services through software-defined optical core networking

Science.gov (United States)

Yamada, Akiko; Nakatsugawa, Keiichi; Yamashita, Shinji; Soumiya, Toshio

2016-02-01

If an optical core network can be handled flexibly, it can be used not only as network infrastructure but also as a temporary broadband resource when customers have to transfer a large volume of data quickly, which will in turn lead to new WAN services. We propose "software-defined optical core networking", which achieves flexible optical network control, meaning it virtualizes optical transport network/wavelength-division multiplexing resources and controls them with resources from other layers, such as Ether/MPLS. We developed a testbed system and verified that users could request broadband resources easily, and our controller could quickly set up an optical channel data unit path for the request.

Urban Green Network Design: Defining green network from an urban planning perspective

OpenAIRE

Andrea Tulisi

2017-01-01

From the theoretical context of Smart City various studies have emerged that adopt an analytical approach and description of urban phenomena based on the principles of “network design”; this line of research uses the network systems theory to define the principles that regulate the relationships among the various elements of urban sub-systems in order to optimize their functionality. From the same theoretical basis, urban greenspaces have also been studied as networks, by means of the creatio...

Clustering and Flow Conservation Monitoring Tool for Software Defined Networks

Directory of Open Access Journals (Sweden)

Jesús Antonio Puente Fernández

2018-04-01

Full Text Available Prediction systems present some challenges on two fronts: the relation between video quality and observed session features and on the other hand, dynamics changes on the video quality. Software Defined Networks (SDN is a new concept of network architecture that provides the separation of control plane (controller and data plane (switches in network devices. Due to the existence of the southbound interface, it is possible to deploy monitoring tools to obtain the network status and retrieve a statistics collection. Therefore, achieving the most accurate statistics depends on a strategy of monitoring and information requests of network devices. In this paper, we propose an enhanced algorithm for requesting statistics to measure the traffic flow in SDN networks. Such an algorithm is based on grouping network switches in clusters focusing on their number of ports to apply different monitoring techniques. Such grouping occurs by avoiding monitoring queries in network switches with common characteristics and then, by omitting redundant information. In this way, the present proposal decreases the number of monitoring queries to switches, improving the network traffic and preventing the switching overload. We have tested our optimization in a video streaming simulation using different types of videos. The experiments and comparison with traditional monitoring techniques demonstrate the feasibility of our proposal maintaining similar values decreasing the number of queries to the switches.

Clustering and Flow Conservation Monitoring Tool for Software Defined Networks.

Science.gov (United States)

Puente Fernández, Jesús Antonio; García Villalba, Luis Javier; Kim, Tai-Hoon

2018-04-03

Prediction systems present some challenges on two fronts: the relation between video quality and observed session features and on the other hand, dynamics changes on the video quality. Software Defined Networks (SDN) is a new concept of network architecture that provides the separation of control plane (controller) and data plane (switches) in network devices. Due to the existence of the southbound interface, it is possible to deploy monitoring tools to obtain the network status and retrieve a statistics collection. Therefore, achieving the most accurate statistics depends on a strategy of monitoring and information requests of network devices. In this paper, we propose an enhanced algorithm for requesting statistics to measure the traffic flow in SDN networks. Such an algorithm is based on grouping network switches in clusters focusing on their number of ports to apply different monitoring techniques. Such grouping occurs by avoiding monitoring queries in network switches with common characteristics and then, by omitting redundant information. In this way, the present proposal decreases the number of monitoring queries to switches, improving the network traffic and preventing the switching overload. We have tested our optimization in a video streaming simulation using different types of videos. The experiments and comparison with traditional monitoring techniques demonstrate the feasibility of our proposal maintaining similar values decreasing the number of queries to the switches.

Instantiating a Global Network Measurement Framework

Energy Technology Data Exchange (ETDEWEB)

Tierney, Brian L.; Boote, Jeff; Boyd, Eric; Brown, Aaron; Grigoriev, Maxim; Metzger, Joe; Swany, Martin; Zekauskas, Matt; Zurawski, Jason

2008-12-15

perfSONAR is a web services-based infrastructure for collecting and publishing network performance monitoring. A primary goal of perfSONAR is making it easier to solve end-to-end performance problems on paths crossing several networks. It contains a set of services delivering performance measurements in a federated environment. These services act as an intermediate layer, between the performance measurement tools and the diagnostic or visualization applications. This layer is aimed at making and exchanging performance measurements across multiple networks and multiple user communities, using well-defined protocols. This paper summarizes the key perfSONAR components, and describes how they are deployed by the US-LHC community to monitor the networks distributing LHC data from CERN. All monitoring data described herein is publicly available, and we hope the availability of this data via a standard schema will inspire others to contribute to the effort by building network data analysis applications that use perfSONAR.

Software Defined Networks in Wireless Sensor Architectures

Directory of Open Access Journals (Sweden)

Jesús Antonio Puente Fernández

2018-03-01

Full Text Available Nowadays, different protocols coexist in Internet that provides services to users. Unfortunately, control decisions and distributed management make it hard to control networks. These problems result in an inefficient and unpredictable network behaviour. Software Defined Networks (SDN is a new concept of network architecture. It intends to be more flexible and to simplify the management in networks with respect to traditional architectures. Each of these aspects are possible because of the separation of control plane (controller and data plane (switches in network devices. OpenFlow is the most common protocol for SDN networks that provides the communication between control and data planes. Moreover, the advantage of decoupling control and data planes enables a quick evolution of protocols and also its deployment without replacing data plane switches. In this survey, we review the SDN technology and the OpenFlow protocol and their related works. Specifically, we describe some technologies as Wireless Sensor Networks and Wireless Cellular Networks and how SDN can be included within them in order to solve their challenges. We classify different solutions for each technology attending to the problem that is being fixed.

A Preliminary Survey on the Security of Software-Defined Networks

OpenAIRE

Akbaş, Muhammet Fatih; Karaarslan, Enis; Güngör, Cengiz

2016-01-01

The number of devices connected to theInternet is increasing, data centers are growing continuously and computernetworks are getting more complex. Traditional network management approach isbecoming more difficult and insufficient. Software-Defined Networks (SDN) is anew generation networking approach which is expected to take place of thetraditional computer networks. SDN architecture provides effective managementof the large and complex networks. Although SDN have benefits from the network s...

Towards a distributed control system for software defined wireless sensor networks

CSIR Research Space (South Africa)

Kobo, Hlabishi I

2017-10-01

Full Text Available on the network device. The coupling stifles innovation and evolution because the network often becomes rigid. Software Defined Wireless Sensor Networks (SDWSN) is also an emerging network paradigm that infuses the SDN model into Wireless Sensor Networks (WSNs...

Linear Programming Approaches for Power Savings in Software-defined Networks

NARCIS (Netherlands)

Moghaddam, F.A.; Grosso, P.

2016-01-01

Software-defined networks have been proposed as a viable solution to decrease the power consumption of the networking component in data center networks. Still the question remains on which scheduling algorithms are most suited to achieve this goal. We propose 4 different linear programming

Mitigating the controller performance bottlenecks in Software Defined Networks

DEFF Research Database (Denmark)

Caba, Cosmin Marius; Soler, José

2016-01-01

The centralization of the control plane decision logic in Software Defined Networking (SDN) has raised concerns regarding the performance of the SDN Controller (SDNC) when the network scales up. A number of solutions have been proposed in the literature to address these concerns. This paper...

SONEP: A Software-Defined Optical Network Emulation Platform

DEFF Research Database (Denmark)

Azodolmolky, Siamak; Petersen, Martin Nordal; Fagertun, Anna Manolova

2014-01-01

Network emulation has been one of the tools of choice for conducting experiments on commodity hardware. In the absence of an easy to use optical network test-bed, researchers can significantly benefit from the availability of a flexible/programmable optical network emulation platform. Exploiting...... the lightweight system virtualization, which is recently supported in modern operating systems, in this work we present the architecture of a Software-Defined Network (SDN) emulation platform for transport optical networks and investigate its usage in a use-case scenario. To the best of our knowledge......, this is for the first time that an SDN-based emulation platform is proposed for modeling and performance evaluation of optical networks. Coupled with recent trend of extension of SDN towards transport (optical) networks, the presented tool can facilitate the evaluation of innovative idea before actual implementations...

End-to-end Information Flow Security Model for Software-Defined Networks

Directory of Open Access Journals (Sweden)

D. Ju. Chaly

2015-01-01

Full Text Available Software-defined networks (SDN are a novel paradigm of networking which became an enabler technology for many modern applications such as network virtualization, policy-based access control and many others. Software can provide flexibility and fast-paced innovations in the networking; however, it has a complex nature. In this connection there is an increasing necessity of means for assuring its correctness and security. Abstract models for SDN can tackle these challenges. This paper addresses to confidentiality and some integrity properties of SDNs. These are critical properties for multi-tenant SDN environments, since the network management software must ensure that no confidential data of one tenant are leaked to other tenants in spite of using the same physical infrastructure. We define a notion of end-to-end security in context of software-defined networks and propose a semantic model where the reasoning is possible about confidentiality, and we can check that confidential information flows do not interfere with non-confidential ones. We show that the model can be extended in order to reason about networks with secure and insecure links which can arise, for example, in wireless environments.The article is published in the authors’ wording.

Software Defined Networking (SDN) controlled all optical switching networks with multi-dimensional switching architecture

Science.gov (United States)

Zhao, Yongli; Ji, Yuefeng; Zhang, Jie; Li, Hui; Xiong, Qianjin; Qiu, Shaofeng

2014-08-01

Ultrahigh throughout capacity requirement is challenging the current optical switching nodes with the fast development of data center networks. Pbit/s level all optical switching networks need to be deployed soon, which will cause the high complexity of node architecture. How to control the future network and node equipment together will become a new problem. An enhanced Software Defined Networking (eSDN) control architecture is proposed in the paper, which consists of Provider NOX (P-NOX) and Node NOX (N-NOX). With the cooperation of P-NOX and N-NOX, the flexible control of the entire network can be achieved. All optical switching network testbed has been experimentally demonstrated with efficient control of enhanced Software Defined Networking (eSDN). Pbit/s level all optical switching nodes in the testbed are implemented based on multi-dimensional switching architecture, i.e. multi-level and multi-planar. Due to the space and cost limitation, each optical switching node is only equipped with four input line boxes and four output line boxes respectively. Experimental results are given to verify the performance of our proposed control and switching architecture.

Modeling of a 3DTV service in the software-defined networking architecture

Science.gov (United States)

Wilczewski, Grzegorz

2014-11-01

In this article a newly developed concept towards modeling of a multimedia service offering stereoscopic motion imagery is presented. Proposed model is based on the approach of utilization of Software-defined Networking or Software Defined Networks architecture (SDN). The definition of 3D television service spanning SDN concept is identified, exposing basic characteristic of a 3DTV service in a modern networking organization layout. Furthermore, exemplary functionalities of the proposed 3DTV model are depicted. It is indicated that modeling of a 3DTV service in the Software-defined Networking architecture leads to multiplicity of improvements, especially towards flexibility of a service supporting heterogeneity of end user devices.

Minimizing communication cost among distributed controllers in software defined networks

Science.gov (United States)

Arlimatti, Shivaleela; Elbreiki, Walid; Hassan, Suhaidi; Habbal, Adib; Elshaikh, Mohamed

2016-08-01

Software Defined Networking (SDN) is a new paradigm to increase the flexibility of today's network by promising for a programmable network. The fundamental idea behind this new architecture is to simplify network complexity by decoupling control plane and data plane of the network devices, and by making the control plane centralized. Recently controllers have distributed to solve the problem of single point of failure, and to increase scalability and flexibility during workload distribution. Even though, controllers are flexible and scalable to accommodate more number of network switches, yet the problem of intercommunication cost between distributed controllers is still challenging issue in the Software Defined Network environment. This paper, aims to fill the gap by proposing a new mechanism, which minimizes intercommunication cost with graph partitioning algorithm, an NP hard problem. The methodology proposed in this paper is, swapping of network elements between controller domains to minimize communication cost by calculating communication gain. The swapping of elements minimizes inter and intra communication cost among network domains. We validate our work with the OMNeT++ simulation environment tool. Simulation results show that the proposed mechanism minimizes the inter domain communication cost among controllers compared to traditional distributed controllers.

Resiliency as a component importance measure in network reliability

International Nuclear Information System (INIS)

Whitson, John C.; Ramirez-Marquez, Jose Emmanuel

2009-01-01

This paper seeks to define the concept of resiliency as a component importance measure related to network reliability. Resiliency can be defined as a composite of: (1) the ability of a network to provide service despite external failures and (2) the time to restore service when in the presence of such failures. Although, Resiliency has been extensively studied in different research areas, this paper will study the specific aspects of quantifiable network resiliency when the network is experiencing potential catastrophic failures from external events and/or influences, and when it is not known a priori which specific components within the network will fail. A formal definition for Category I resiliency is proposed and a step-by-step approach based on Monte-Carlo simulation to calculate it is defined. To illustrate the approach, two-terminal networks with varying degrees of redundancy, have been considered. The results obtained for test networks show that this new quantifiable concept of resiliency provides insight into the performance and topology of the network. Future use for this work could include methods for safeguarding critical network components and optimizing the use of redundancy as a technique to improve network resiliency.

Detecting P2P Botnet in Software Defined Networks

Directory of Open Access Journals (Sweden)

Shang-Chiuan Su

2018-01-01

Full Text Available Software Defined Network separates the control plane from network equipment and has great advantage in network management as compared with traditional approaches. With this paradigm, the security issues persist to exist and could become even worse because of the flexibility on handling the packets. In this paper we propose an effective framework by integrating SDN and machine learning to detect and categorize P2P network traffics. This work provides experimental evidence showing that our approach can automatically analyze network traffic and flexibly change flow entries in OpenFlow switches through the SDN controller. This can effectively help the network administrators manage related security problems.

Desenvolupament d'un sistema de monitoratge per a Software Defined Networks (SDN)

OpenAIRE

Navarro Sánchez, Albert

2015-01-01

Les Software Defined-Networks (SDN) són una tecnologia emergent que permet als components software estendre funcionalitats sobre la xarxa. En aquest projecte s'estudia com pot encaixar Polygraph, un sistema de monitoratge per a xarxes tradicionals, dins les SDN. Software Defined-Networks (SDN) are a new tecnology that allows software components to add new functionalities on networks. This project studies how Polygraph, a monitoring system for traditional networks, can fit in a SDN scenario.

Dynamic optical resource allocation for mobile core networks with software defined elastic optical networking.

Science.gov (United States)

Zhao, Yongli; Chen, Zhendong; Zhang, Jie; Wang, Xinbo

2016-07-25

Driven by the forthcoming of 5G mobile communications, the all-IP architecture of mobile core networks, i.e. evolved packet core (EPC) proposed by 3GPP, has been greatly challenged by the users' demands for higher data rate and more reliable end-to-end connection, as well as operators' demands for low operational cost. These challenges can be potentially met by software defined optical networking (SDON), which enables dynamic resource allocation according to the users' requirement. In this article, a novel network architecture for mobile core network is proposed based on SDON. A software defined network (SDN) controller is designed to realize the coordinated control over different entities in EPC networks. We analyze the requirement of EPC-lightpath (EPCL) in data plane and propose an optical switch load balancing (OSLB) algorithm for resource allocation in optical layer. The procedure of establishment and adjustment of EPCLs is demonstrated on a SDON-based EPC testbed with extended OpenFlow protocol. We also evaluate the OSLB algorithm through simulation in terms of bandwidth blocking ratio, traffic load distribution, and resource utilization ratio compared with link-based load balancing (LLB) and MinHops algorithms.

On the Design of Energy Efficient Optical Networks with Software Defined Networking Control Across Core and Access Networks

DEFF Research Database (Denmark)

Wang, Jiayuan; Yan, Ying; Dittmann, Lars

2013-01-01

This paper presents a Software Defined Networking (SDN) control plane based on an overlay GMPLS control model. The SDN control platform manages optical core networks (WDM/DWDM networks) and the associated access networks (GPON networks), which makes it possible to gather global information...... and enable wider areas' energy efficiency networking. The energy related information of the networks and the types of the traffic flows are collected and utilized for the end-to-end QoS provision. Dynamic network simulation results show that by applying different routing algorithms according to the type...... of traffic in the core networks, the energy efficiency of the network is improved without compromising the quality of service....

Network neighborhood analysis with the multi-node topological overlap measure.

Science.gov (United States)

Li, Ai; Horvath, Steve

2007-01-15

The goal of neighborhood analysis is to find a set of genes (the neighborhood) that is similar to an initial 'seed' set of genes. Neighborhood analysis methods for network data are important in systems biology. If individual network connections are susceptible to noise, it can be advantageous to define neighborhoods on the basis of a robust interconnectedness measure, e.g. the topological overlap measure. Since the use of multiple nodes in the seed set may lead to more informative neighborhoods, it can be advantageous to define multi-node similarity measures. The pairwise topological overlap measure is generalized to multiple network nodes and subsequently used in a recursive neighborhood construction method. A local permutation scheme is used to determine the neighborhood size. Using four network applications and a simulated example, we provide empirical evidence that the resulting neighborhoods are biologically meaningful, e.g. we use neighborhood analysis to identify brain cancer related genes. An executable Windows program and tutorial for multi-node topological overlap measure (MTOM) based analysis can be downloaded from the webpage (http://www.genetics.ucla.edu/labs/horvath/MTOM/).

Software defined networks reactive flow programming and load balance switching

OpenAIRE

Καλλιανιώτης, Νικόλαος; Kallianiotis, Nikolaos

2017-01-01

This project serves as a Master Thesis as the requirements of the master’s programme Master of Digital Communications and Networks. It proposes load balancing algorithms applied to Software-Defined Networks to achieve the best possible resource utilisation of each of the links present in a network. The open-sources Opendaylight project and Floodlight project are used as SDN controllers, and the network is emulated using Mininet software

Measuring distances between complex networks

International Nuclear Information System (INIS)

Andrade, Roberto F.S.; Miranda, Jose G.V.; Pinho, Suani T.R.; Lobao, Thierry Petit

2008-01-01

A previously introduced concept of higher order neighborhoods in complex networks, [R.F.S. Andrade, J.G.V. Miranda, T.P. Lobao, Phys. Rev. E 73 (2006) 046101] is used to define a distance between networks with the same number of nodes. With such measure, expressed in terms of the matrix elements of the neighborhood matrices of each network, it is possible to compare, in a quantitative way, how far apart in the space of neighborhood matrices two networks are. The distance between these matrices depends on both the network topologies and the adopted node numberings. While the numbering of one network is fixed, a Monte Carlo algorithm is used to find the best numbering of the other network, in the sense that it minimizes the distance between the matrices. The minimal value found for the distance reflects differences in the neighborhood structures of the two networks that arise only from distinct topologies. This procedure ends up by providing a projection of the first network on the pattern of the second one. Examples are worked out allowing for a quantitative comparison for distances among distinct networks, as well as among distinct realizations of random networks

Software defined networking applications in distributed datacenters

CERN Document Server

Qi, Heng

2016-01-01

This SpringerBrief provides essential insights on the SDN application designing and deployment in distributed datacenters. In this book, three key problems are discussed: SDN application designing, SDN deployment and SDN management. This book demonstrates how to design the SDN-based request allocation application in distributed datacenters. It also presents solutions for SDN controller placement to deploy SDN in distributed datacenters. Finally, an SDN management system is proposed to guarantee the performance of datacenter networks which are covered and controlled by many heterogeneous controllers. Researchers and practitioners alike will find this book a valuable resource for further study on Software Defined Networking. .

Characterizations of the Beta and the Degree Network Power Measure

NARCIS (Netherlands)

van den Brink, J.R.; Borm, P.; Hendrickx, R.; Owen, G.

2008-01-01

A symmetric network consists of a set of positions and a set of bilateral links between these positions. For every symmetric network we define a cooperative transferable utility game that measures the "power" of each coalition of positions in the network. Applying the Shapley value to this game

Towards Effective Intra-flow Network Coding in Software Defined Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Donghai Zhu

2016-01-01

Full Text Available Wireless Mesh Networks (WMNs have potential to provide convenient broadband wireless Internet access to mobile users.With the support of Software-Defined Networking (SDN paradigm that separates control plane and data plane, WMNs can be easily deployed and managed. In addition, by exploiting the broadcast nature of the wireless medium and the spatial diversity of multi-hop wireless networks, intra-flow network coding has shown a greater benefit in comparison with traditional routing paradigms in data transmission for WMNs. In this paper, we develop a novel OpenCoding protocol, which combines the SDN technique with intra-flow network coding for WMNs. Our developed protocol can simplify the deployment and management of the network and improve network performance. In OpenCoding, a controller that works on the control plane makes routing decisions for mesh routers and the hop-by-hop forwarding function is replaced by network coding functions in data plane. We analyze the overhead of OpenCoding. Through a simulation study, we show the effectiveness of the OpenCoding protocol in comparison with existing schemes. Our data shows that OpenCoding outperforms both traditional routing and intra-flow network coding schemes.

Capacity Extension of Software Defined Data Center Networks With Jellyfish Topology

DEFF Research Database (Denmark)

Mehmeri, Victor; Vegas Olmos, Juan José; Tafur Monroy, Idelfonso

We present a performance analysis of Jellyfish topology with Software-Defined commodity switches for Data Center networks. Our results show up to a 2-fold performance gain when compared to a Spanning Tree Protocol implementation.......We present a performance analysis of Jellyfish topology with Software-Defined commodity switches for Data Center networks. Our results show up to a 2-fold performance gain when compared to a Spanning Tree Protocol implementation....

A Formal Model and Verification Problems for Software Defined Networks

Directory of Open Access Journals (Sweden)

V. A. Zakharov

2013-01-01

Full Text Available Software-defined networking (SDN is an approach to building computer networks that separate and abstract data planes and control planes of these systems. In a SDN a centralized controller manages a distributed set of switches. A set of open commands for packet forwarding and flow-table updating was defined in the form of a protocol known as OpenFlow. In this paper we describe an abstract formal model of SDN, introduce a tentative language for specification of SDN forwarding policies, and set up formally model-checking problems for SDN.

Considerations for Software Defined Networking (SDN): Approaches and use cases

Science.gov (United States)

Bakshi, K.

Software Defined Networking (SDN) is an evolutionary approach to network design and functionality based on the ability to programmatically modify the behavior of network devices. SDN uses user-customizable and configurable software that's independent of hardware to enable networked systems to expand data flow control. SDN is in large part about understanding and managing a network as a unified abstraction. It will make networks more flexible, dynamic, and cost-efficient, while greatly simplifying operational complexity. And this advanced solution provides several benefits including network and service customizability, configurability, improved operations, and increased performance. There are several approaches to SDN and its practical implementation. Among them, two have risen to prominence with differences in pedigree and implementation. This paper's main focus will be to define, review, and evaluate salient approaches and use cases of the OpenFlow and Virtual Network Overlay approaches to SDN. OpenFlow is a communication protocol that gives access to the forwarding plane of a network's switches and routers. The Virtual Network Overlay relies on a completely virtualized network infrastructure and services to abstract the underlying physical network, which allows the overlay to be mobile to other physical networks. This is an important requirement for cloud computing, where applications and associated network services are migrated to cloud service providers and remote data centers on the fly as resource demands dictate. The paper will discuss how and where SDN can be applied and implemented, including research and academia, virtual multitenant data center, and cloud computing applications. Specific attention will be given to the cloud computing use case, where automated provisioning and programmable overlay for scalable multi-tenancy is leveraged via the SDN approach.

Research Network of Tehran Defined Population: Methodology and Establishment

Directory of Open Access Journals (Sweden)

Ali-Asghar Kolahi

2015-12-01

Full Text Available Background: We need a defined population for determining prevalence and incidence of diseases, as well as conducting interventional, cohort and longitudinal studies, calculating correct and timely public health indicators, assessing actual health needs of community, performing educational programs and interventions to promote healthy lifestyle, and enhancing quality of primary health services.The objective of this project was to determine a defined population which is representative of Tehran, the Capital of Iran. This article reports the methodology and establishment of the research network of Tehran defined population.Methods: This project started by selecting two urban health centers from each of the five district health centers affiliated to Shahid Beheshti University of Medical Sciences in 2012. Inside each selected urban health center, one defined population research station was established. Two new centers have been added during 2013 and 2014. For the time being, the number of the covered population of the network has reached 40000 individuals. The most important criterion for the defined population has been to be representative of the population of Tehran. For this, we selected two urban health centers from 12 of 22 municipality districts and from each of the five different socioeconomic of Greater Tehran. Merely 80000 individuals in neighborhoods of each defined population research station were considered as control group of the project.Findings: Totally we selected 12 defined population research stations and their under-covered population developed a defined population which is representative of Tehran population.Conclusion: a population lab is ready now in metropolitan of Tehran.

A complex network-based importance measure for mechatronics systems

Science.gov (United States)

Wang, Yanhui; Bi, Lifeng; Lin, Shuai; Li, Man; Shi, Hao

2017-01-01

In view of the negative impact of functional dependency, this paper attempts to provide an alternative importance measure called Improved-PageRank (IPR) for measuring the importance of components in mechatronics systems. IPR is a meaningful extension of the centrality measures in complex network, which considers usage reliability of components and functional dependency between components to increase importance measures usefulness. Our work makes two important contributions. First, this paper integrates the literature of mechatronic architecture and complex networks theory to define component network. Second, based on the notion of component network, a meaningful IPR is brought into the identifying of important components. In addition, the IPR component importance measures, and an algorithm to perform stochastic ordering of components due to the time-varying nature of usage reliability of components and functional dependency between components, are illustrated with a component network of bogie system that consists of 27 components.

Hyperbolicity measures democracy in real-world networks

Science.gov (United States)

Borassi, Michele; Chessa, Alessandro; Caldarelli, Guido

2015-09-01

In this work, we analyze the hyperbolicity of real-world networks, a geometric quantity that measures if a space is negatively curved. We provide two improvements in our understanding of this quantity: first of all, in our interpretation, a hyperbolic network is "aristocratic", since few elements "connect" the system, while a non-hyperbolic network has a more "democratic" structure with a larger number of crucial elements. The second contribution is the introduction of the average hyperbolicity of the neighbors of a given node. Through this definition, we outline an "influence area" for the vertices in the graph. We show that in real networks the influence area of the highest degree vertex is small in what we define "local" networks (i.e., social or peer-to-peer networks), and large in "global" networks (i.e., power grid, metabolic networks, or autonomous system networks).

Hierarchy Measure for Complex Networks

Science.gov (United States)

Mones, Enys; Vicsek, Lilla; Vicsek, Tamás

2012-01-01

Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges). Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy. Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network. We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. Results for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure. PMID:22470477

Software-defined networking control plane for seamless integration of multiple silicon photonic switches in Datacom networks.

Science.gov (United States)

Shen, Yiwen; Hattink, Maarten H N; Samadi, Payman; Cheng, Qixiang; Hu, Ziyiz; Gazman, Alexander; Bergman, Keren

2018-04-16

Silicon photonics based switches offer an effective option for the delivery of dynamic bandwidth for future large-scale Datacom systems while maintaining scalable energy efficiency. The integration of a silicon photonics-based optical switching fabric within electronic Datacom architectures requires novel network topologies and arbitration strategies to effectively manage the active elements in the network. We present a scalable software-defined networking control plane to integrate silicon photonic based switches with conventional Ethernet or InfiniBand networks. Our software-defined control plane manages both electronic packet switches and multiple silicon photonic switches for simultaneous packet and circuit switching. We built an experimental Dragonfly network testbed with 16 electronic packet switches and 2 silicon photonic switches to evaluate our control plane. Observed latencies occupied by each step of the switching procedure demonstrate a total of 344 µs control plane latency for data-center and high performance computing platforms.

Fingerprinting Software Defined Networks and Controllers

Science.gov (United States)

2015-03-01

rps requests per second RTT Round-Trip Time SDN Software Defined Networking SOM Self-Organizing Map STP Spanning Tree Protocol TRW-CB Threshold Random...Protocol ( STP ) updates), in which case the frame will be “punted” from the forwarding lookup process and processed by the route processor [9]. The act of...environment 20 to accomplish the needs of B4. In addition to Google, the SDN market is expected to grow beyond $35 billion by April 2018 [31]. The rate

An Optimal Path Computation Architecture for the Cloud-Network on Software-Defined Networking

Directory of Open Access Journals (Sweden)

Hyunhun Cho

2015-05-01

Full Text Available Legacy networks do not open the precise information of the network domain because of scalability, management and commercial reasons, and it is very hard to compute an optimal path to the destination. According to today’s ICT environment change, in order to meet the new network requirements, the concept of software-defined networking (SDN has been developed as a technological alternative to overcome the limitations of the legacy network structure and to introduce innovative concepts. The purpose of this paper is to propose the application that calculates the optimal paths for general data transmission and real-time audio/video transmission, which consist of the major services of the National Research & Education Network (NREN in the SDN environment. The proposed SDN routing computation (SRC application is designed and applied in a multi-domain network for the efficient use of resources, selection of the optimal path between the multi-domains and optimal establishment of end-to-end connections.

State of the Art and Recent Research Advances in Software Defined Networking

Directory of Open Access Journals (Sweden)

Taimur Bakhshi

2017-01-01

Full Text Available Emerging network services and subsequent growth in the networking infrastructure have gained tremendous momentum in recent years. Application performance requiring rapid real-time network provisioning, optimized traffic management, and virtualization of shared resources has induced the conceptualization and adoption of new networking models. Software defined networking (SDN, one of the predominant and relatively new networking paradigms, seeks to simplify network management by decoupling network control logic from the underlying hardware and introduces real-time network programmability enabling innovation. The present work reviews the state of the art in software defined networking providing a historical perspective on complementary technologies in network programmability and the inherent shortcomings which paved the way for SDN. The SDN architecture is discussed along with popular protocols, platforms, and existing simulation and debugging solutions. Furthermore, a detailed analysis is presented around recent SDN development and deployment avenues ranging from mobile communications and data centers to campus networks and residential environments. The review concludes by highlighting implementation challenges and subsequent research directions being pursued in academia and industry to address issues related to application performance, control plane scalability and design, security, and interdomain connectivity in the context of SDN.

A taxonomy for software-defined networking, man-in-the-middle attacks

OpenAIRE

Fischer, Briana D.; Lato, Anita M.

2016-01-01

Approved for public release; distribution is unlimited In contrast to traditional networks, Software Defined Networking (SDN) allows the programming of network functions via an Application Programming Interface (API). The ability to implement the APIs in software is advantageous for traffic manipulation in SDN. With automated logic being programmed into a centralized component of the SDN, network operators are presented with new and scalable methods for traffic manipulation. Enterprises an...

The Evolution of Gene Regulatory Networks that Define Arthropod Body Plans.

Science.gov (United States)

Auman, Tzach; Chipman, Ariel D

2017-09-01

Our understanding of the genetics of arthropod body plan development originally stems from work on Drosophila melanogaster from the late 1970s and onward. In Drosophila, there is a relatively detailed model for the network of gene interactions that proceeds in a sequential-hierarchical fashion to define the main features of the body plan. Over the years, we have a growing understanding of the networks involved in defining the body plan in an increasing number of arthropod species. It is now becoming possible to tease out the conserved aspects of these networks and to try to reconstruct their evolution. In this contribution, we focus on several key nodes of these networks, starting from early patterning in which the main axes are determined and the broad morphological domains of the embryo are defined, and on to later stage wherein the growth zone network is active in sequential addition of posterior segments. The pattern of conservation of networks is very patchy, with some key aspects being highly conserved in all arthropods and others being very labile. Many aspects of early axis patterning are highly conserved, as are some aspects of sequential segment generation. In contrast, regional patterning varies among different taxa, and some networks, such as the terminal patterning network, are only found in a limited range of taxa. The growth zone segmentation network is ancient and is probably plesiomorphic to all arthropods. In some insects, it has undergone significant modification to give rise to a more hardwired network that generates individual segments separately. In other insects and in most arthropods, the sequential segmentation network has undergone a significant amount of systems drift, wherein many of the genes have changed. However, it maintains a conserved underlying logic and function. © The Author 2017. Published by Oxford University Press on behalf of the Society for Integrative and Comparative Biology. All rights reserved. For permissions please

Cognitive Routing in Software-Defined Underwater Acoustic Networks

Directory of Open Access Journals (Sweden)

Huma Ghafoor

2017-12-01

Full Text Available There are two different types of primary users (natural acoustic and artificial acoustic, and there is a long propagation delay for acoustic links in underwater cognitive acoustic networks (UCANs. Thus, the selection of a stable route is one of the key design factors for improving overall network stability, thereby reducing end-to-end delay. Software-defined networking (SDN is a novel approach that improves network intelligence. To this end, we propose a novel SDN-based routing protocol for UCANs in order to find a stable route between source and destination. A main controller is placed in a surface buoy that is responsible for the global view of the network, whereas local controllers are placed in different autonomous underwater vehicles (AUVs that are responsible for a localized view of the network. The AUVs have fixed trajectories, and sensor nodes within transmission range of the AUVs serve as gateways to relay the gathered information to the controllers. This is an SDN-based underwater communications scheme whereby two nodes can only communicate when they have a consensus about a common idle channel. To evaluate our proposed scheme, we perform extensive simulations and improve network performance in terms of end-to-end delay, delivery ratio, and overhead.

Energy-Saving Traffic Scheduling in Hybrid Software Defined Wireless Rechargeable Sensor Networks.

Science.gov (United States)

Wei, Yunkai; Ma, Xiaohui; Yang, Ning; Chen, Yijin

2017-09-15

Software Defined Wireless Rechargeable Sensor Networks (SDWRSNs) are an inexorable trend for Wireless Sensor Networks (WSNs), including Wireless Rechargeable Sensor Network (WRSNs). However, the traditional network devices cannot be completely substituted in the short term. Hybrid SDWRSNs, where software defined devices and traditional devices coexist, will last for a long time. Hybrid SDWRSNs bring new challenges as well as opportunities for energy saving issues, which is still a key problem considering that the wireless chargers are also exhaustible, especially in some rigid environment out of the main supply. Numerous energy saving schemes for WSNs, or even some works for WRSNs, are no longer suitable for the new features of hybrid SDWRSNs. To solve this problem, this paper puts forward an Energy-saving Traffic Scheduling (ETS) algorithm. The ETS algorithm adequately considers the new characters in hybrid SDWRSNs, and takes advantage of the Software Defined Networking (SDN) controller's direct control ability on SDN nodes and indirect control ability on normal nodes. The simulation results show that, comparing with traditional Minimum Transmission Energy (MTE) protocol, ETS can substantially improve the energy efficiency in hybrid SDWRSNs for up to 20-40% while ensuring feasible data delay.

Energy-Saving Traffic Scheduling in Hybrid Software Defined Wireless Rechargeable Sensor Networks

Directory of Open Access Journals (Sweden)

Yunkai Wei

2017-09-01

Full Text Available Software Defined Wireless Rechargeable Sensor Networks (SDWRSNs are an inexorable trend for Wireless Sensor Networks (WSNs, including Wireless Rechargeable Sensor Network (WRSNs. However, the traditional network devices cannot be completely substituted in the short term. Hybrid SDWRSNs, where software defined devices and traditional devices coexist, will last for a long time. Hybrid SDWRSNs bring new challenges as well as opportunities for energy saving issues, which is still a key problem considering that the wireless chargers are also exhaustible, especially in some rigid environment out of the main supply. Numerous energy saving schemes for WSNs, or even some works for WRSNs, are no longer suitable for the new features of hybrid SDWRSNs. To solve this problem, this paper puts forward an Energy-saving Traffic Scheduling (ETS algorithm. The ETS algorithm adequately considers the new characters in hybrid SDWRSNs, and takes advantage of the Software Defined Networking (SDN controller’s direct control ability on SDN nodes and indirect control ability on normal nodes. The simulation results show that, comparing with traditional Minimum Transmission Energy (MTE protocol, ETS can substantially improve the energy efficiency in hybrid SDWRSNs for up to 20–40% while ensuring feasible data delay.

Performance verification of network function virtualization in software defined optical transport networks

Science.gov (United States)

Zhao, Yongli; Hu, Liyazhou; Wang, Wei; Li, Yajie; Zhang, Jie

2017-01-01

With the continuous opening of resource acquisition and application, there are a large variety of network hardware appliances deployed as the communication infrastructure. To lunch a new network application always implies to replace the obsolete devices and needs the related space and power to accommodate it, which will increase the energy and capital investment. Network function virtualization1 (NFV) aims to address these problems by consolidating many network equipment onto industry standard elements such as servers, switches and storage. Many types of IT resources have been deployed to run Virtual Network Functions (vNFs), such as virtual switches and routers. Then how to deploy NFV in optical transport networks is a of great importance problem. This paper focuses on this problem, and gives an implementation architecture of NFV-enabled optical transport networks based on Software Defined Optical Networking (SDON) with the procedure of vNFs call and return. Especially, an implementation solution of NFV-enabled optical transport node is designed, and a parallel processing method for NFV-enabled OTN nodes is proposed. To verify the performance of NFV-enabled SDON, the protocol interaction procedures of control function virtualization and node function virtualization are demonstrated on SDON testbed. Finally, the benefits and challenges of the parallel processing method for NFV-enabled OTN nodes are simulated and analyzed.

First field trial of Virtual Network Operator oriented network on demand (NoD) service provisioning over software defined multi-vendor OTN networks

Science.gov (United States)

Li, Yajie; Zhao, Yongli; Zhang, Jie; Yu, Xiaosong; Chen, Haoran; Zhu, Ruijie; Zhou, Quanwei; Yu, Chenbei; Cui, Rui

2017-01-01

A Virtual Network Operator (VNO) is a provider and reseller of network services from other telecommunications suppliers. These network providers are categorized as virtual because they do not own the underlying telecommunication infrastructure. In terms of business operation, VNO can provide customers with personalized services by leasing network infrastructure from traditional network providers. The unique business modes of VNO lead to the emergence of network on demand (NoD) services. The conventional network provisioning involves a series of manual operation and configuration, which leads to high cost in time. Considering the advantages of Software Defined Networking (SDN), this paper proposes a novel NoD service provisioning solution to satisfy the private network need of VNOs. The solution is first verified in the real software defined multi-domain optical networks with multi-vendor OTN equipment. With the proposed solution, NoD service can be deployed via online web portals in near-real time. It reinvents the customer experience and redefines how network services are delivered to customers via an online self-service portal. Ultimately, this means a customer will be able to simply go online, click a few buttons and have new services almost instantaneously.

Contribution of past and future self-defining event networks to personal identity.

Science.gov (United States)

Demblon, Julie; D'Argembeau, Arnaud

2017-05-01

Personal identity is nourished by memories of significant past experiences and by the imagination of meaningful events that one anticipates to happen in the future. The organisation of such self-defining memories and prospective thoughts in the cognitive system has received little empirical attention, however. In the present study, our aims were to investigate to what extent self-defining memories and future projections are organised in networks of related events, and to determine the nature of the connections linking these events. Our results reveal the existence of self-defining event networks, composed of both memories and future events of similar centrality for identity and characterised by similar identity motives. These self-defining networks expressed a strong internal coherence and frequently organised events in meaningful themes and sequences (i.e., event clusters). Finally, we found that the satisfaction of identity motives in represented events and the presence of clustering across events both contributed to increase in the perceived centrality of events for the sense of identity. Overall, these findings suggest that personal identity is not only nourished by representations of significant past and future events, but also depends on the formation of coherent networks of related events that provide an overarching meaning to specific life experiences.

Cloud-Centric and Logically Isolated Virtual Network Environment Based on Software-Defined Wide Area Network

Directory of Open Access Journals (Sweden)

Dongkyun Kim

2017-12-01

Full Text Available Recent development of distributed cloud environments requires advanced network infrastructure in order to facilitate network automation, virtualization, high performance data transfer, and secured access of end-to-end resources across regional boundaries. In order to meet these innovative cloud networking requirements, software-defined wide area network (SD-WAN is primarily demanded to converge distributed cloud resources (e.g., virtual machines (VMs in a programmable and intelligent manner over distant networks. Therefore, this paper proposes a logically isolated networking scheme designed to integrate distributed cloud resources to dynamic and on-demand virtual networking over SD-WAN. The performance evaluation and experimental results of the proposed scheme indicate that virtual network convergence time is minimized in two different network models such as: (1 an operating OpenFlow-oriented SD-WAN infrastructure (KREONET-S which is deployed on the advanced national research network in Korea, and (2 Mininet-based experimental and emulated networks.

Analyzing complex networks through correlations in centrality measurements

International Nuclear Information System (INIS)

Ricardo Furlan Ronqui, José; Travieso, Gonzalo

2015-01-01

Many real world systems can be expressed as complex networks of interconnected nodes. It is frequently important to be able to quantify the relative importance of the various nodes in the network, a task accomplished by defining some centrality measures, with different centrality definitions stressing different aspects of the network. It is interesting to know to what extent these different centrality definitions are related for different networks. In this work, we study the correlation between pairs of a set of centrality measures for different real world networks and two network models. We show that the centralities are in general correlated, but with stronger correlations for network models than for real networks. We also show that the strength of the correlation of each pair of centralities varies from network to network. Taking this fact into account, we propose the use of a centrality correlation profile, consisting of the values of the correlation coefficients between all pairs of centralities of interest, as a way to characterize networks. Using the yeast protein interaction network as an example we show also that the centrality correlation profile can be used to assess the adequacy of a network model as a representation of a given real network. (paper)

Software-Defined Collaborative Offloading for Heterogeneous Vehicular Networks

Directory of Open Access Journals (Sweden)

Wei Quan

2018-01-01

Full Text Available Vehicle-assisted data offloading is envisioned to significantly alleviate the problem of explosive growth of mobile data traffic. However, due to the high mobility of vehicles and the frequent disruption of communication links, it is very challenging to efficiently optimize collaborative offloading from a group of vehicles. In this paper, we leverage the concept of Software-Defined Networking (SDN and propose a software-defined collaborative offloading (SDCO solution for heterogeneous vehicular networks. In particular, SDCO can efficiently manage the offloading nodes and paths based on a centralized offloading controller. The offloading controller is equipped with two specific functions: the hybrid awareness path collaboration (HPC and the graph-based source collaboration (GSC. HPC is in charge of selecting the suitable paths based on the round-trip time, packet loss rate, and path bandwidth, while GSC optimizes the offloading nodes according to the minimum vertex cover for effective offloading. Simulation results are provided to demonstrate that SDCO can achieve better offloading efficiency compared to the state-of-the-art solutions.

Malware Propagation and Prevention Model for Time-Varying Community Networks within Software Defined Networks

Directory of Open Access Journals (Sweden)

Lan Liu

2017-01-01

Full Text Available As the adoption of Software Defined Networks (SDNs grows, the security of SDN still has several unaddressed limitations. A key network security research area is in the study of malware propagation across the SDN-enabled networks. To analyze the spreading processes of network malware (e.g., viruses in SDN, we propose a dynamic model with a time-varying community network, inspired by research models on the spread of epidemics in complex networks across communities. We assume subnets of the network as communities and links that are dense in subnets but sparse between subnets. Using numerical simulation and theoretical analysis, we find that the efficiency of network malware propagation in this model depends on the mobility rate q of the nodes between subnets. We also find that there exists a mobility rate threshold qc. The network malware will spread in the SDN when the mobility rate q>qc. The malware will survive when q>qc and perish when qnetwork malware and provide a theoretical basis to reduce and prevent network security incidents.

Software-defined optical network for metro-scale geographically distributed data centers.

Science.gov (United States)

Samadi, Payman; Wen, Ke; Xu, Junjie; Bergman, Keren

2016-05-30

The emergence of cloud computing and big data has rapidly increased the deployment of small and mid-sized data centers. Enterprises and cloud providers require an agile network among these data centers to empower application reliability and flexible scalability. We present a software-defined inter data center network to enable on-demand scale out of data centers on a metro-scale optical network. The architecture consists of a combined space/wavelength switching platform and a Software-Defined Networking (SDN) control plane equipped with a wavelength and routing assignment module. It enables establishing transparent and bandwidth-selective connections from L2/L3 switches, on-demand. The architecture is evaluated in a testbed consisting of 3 data centers, 5-25 km apart. We successfully demonstrated end-to-end bulk data transfer and Virtual Machine (VM) migrations across data centers with less than 100 ms connection setup time and close to full link capacity utilization.

Software Defined Networking for Improved Wireless Sensor Network Management: A Survey.

Science.gov (United States)

Ndiaye, Musa; Hancke, Gerhard P; Abu-Mahfouz, Adnan M

2017-05-04

Wireless sensor networks (WSNs) are becoming increasingly popular with the advent of the Internet of things (IoT). Various real-world applications of WSNs such as in smart grids, smart farming and smart health would require a potential deployment of thousands or maybe hundreds of thousands of sensor nodes/actuators. To ensure proper working order and network efficiency of such a network of sensor nodes, an effective WSN management system has to be integrated. However, the inherent challenges of WSNs such as sensor/actuator heterogeneity, application dependency and resource constraints have led to challenges in implementing effective traditional WSN management. This difficulty in management increases as the WSN becomes larger. Software Defined Networking (SDN) provides a promising solution in flexible management WSNs by allowing the separation of the control logic from the sensor nodes/actuators. The advantage with this SDN-based management in WSNs is that it enables centralized control of the entire WSN making it simpler to deploy network-wide management protocols and applications on demand. This paper highlights some of the recent work on traditional WSN management in brief and reviews SDN-based management techniques for WSNs in greater detail while drawing attention to the advantages that SDN brings to traditional WSN management. This paper also investigates open research challenges in coming up with mechanisms for flexible and easier SDN-based WSN configuration and management.

Software Defined Networking for Improved Wireless Sensor Network Management: A Survey

Directory of Open Access Journals (Sweden)

Musa Ndiaye

2017-05-01

Full Text Available Wireless sensor networks (WSNs are becoming increasingly popular with the advent of the Internet of things (IoT. Various real-world applications of WSNs such as in smart grids, smart farming and smart health would require a potential deployment of thousands or maybe hundreds of thousands of sensor nodes/actuators. To ensure proper working order and network efficiency of such a network of sensor nodes, an effective WSN management system has to be integrated. However, the inherent challenges of WSNs such as sensor/actuator heterogeneity, application dependency and resource constraints have led to challenges in implementing effective traditional WSN management. This difficulty in management increases as the WSN becomes larger. Software Defined Networking (SDN provides a promising solution in flexible management WSNs by allowing the separation of the control logic from the sensor nodes/actuators. The advantage with this SDN-based management in WSNs is that it enables centralized control of the entire WSN making it simpler to deploy network-wide management protocols and applications on demand. This paper highlights some of the recent work on traditional WSN management in brief and reviews SDN-based management techniques for WSNs in greater detail while drawing attention to the advantages that SDN brings to traditional WSN management. This paper also investigates open research challenges in coming up with mechanisms for flexible and easier SDN-based WSN configuration and management.

A New Resilience Measure for Supply Chain Networks

Directory of Open Access Journals (Sweden)

Ruiying Li

2017-01-01

Full Text Available Currently, supply chain networks can span the whole world, and any disruption of these networks may cause economic losses, decreases in sales and unsustainable supplies. Resilience, the ability of the system to withstand disruption and return to a normal state quickly, has become a new challenge during the supply chain network design. This paper defines a new resilience measure as the ratio of the integral of the normalized system performance within its maximum allowable recovery time after the disruption to the integral of the performance in the normal state. Using the maximum allowable recovery time of the system as the time interval under consideration, this measure allows the resilience of different systems to be compared on the same relative scale, and be used under both scenarios that the system can or cannot restore in the given time. Two specific resilience measures, the resilience based on the amount of product delivered and the resilience based on the average delivery distance, are provided for supply chain networks. To estimate the resilience of a given supply chain network, a resilience simulation method is proposed based on the Monte Carlo method. A four-layered hierarchial mobile phone supply chain network is used to illustrate the resilience quantification process and show how network structure affects the resilience of supply chain networks.

Unified Multi-Layer among Software Defined Multi-Domain Optical Networks (Invited

Directory of Open Access Journals (Sweden)

Hui Yang

2015-06-01

Full Text Available The software defined networking (SDN enabled by OpenFlow protocol has gained popularity which can enable the network to be programmable and accommodate both fixed and flexible bandwidth services. In this paper, we present a unified multi-layer (UML architecture with multiple controllers and a dynamic orchestra plane (DOP for software defined multi-domain optical networks. The proposed architecture can shield the differences among various optical devices from multi-vendors and the details of connecting heterogeneous networks. The cross-domain services with on-demand bandwidth can be deployed via unified interfaces provided by the dynamic orchestra plane. Additionally, the globalization strategy and practical capture of signal processing are presented based on the architecture. The overall feasibility and efficiency of the proposed architecture is experimentally verified on the control plane of our OpenFlow-based testbed. The performance of globalization strategy under heavy traffic load scenario is also quantitatively evaluated based on UML architecture compared with other strategies in terms of blocking probability, average hops, and average resource consumption.

Reference Architecture for Multi-Layer Software Defined Optical Data Center Networks

Directory of Open Access Journals (Sweden)

Casimer DeCusatis

2015-09-01

Full Text Available As cloud computing data centers grow larger and networking devices proliferate; many complex issues arise in the network management architecture. We propose a framework for multi-layer; multi-vendor optical network management using open standards-based software defined networking (SDN. Experimental results are demonstrated in a test bed consisting of three data centers interconnected by a 125 km metropolitan area network; running OpenStack with KVM and VMW are components. Use cases include inter-data center connectivity via a packet-optical metropolitan area network; intra-data center connectivity using an optical mesh network; and SDN coordination of networking equipment within and between multiple data centers. We create and demonstrate original software to implement virtual network slicing and affinity policy-as-a-service offerings. Enhancements to synchronous storage backup; cloud exchanges; and Fibre Channel over Ethernet topologies are also discussed.

Feature-based comparison and selection of software defined networking (SDN) controllers

OpenAIRE

Khondoker, Rahamatullah; Zaalouk, Adel; Marx, Ronald; Bayarou, Kpatcha

2014-01-01

Software Defined Networking (SDN) is seen as one way to solve some problems of the Internet including security, managing complexity, multi-casting, load balancing, and energy efficiency. SDN is an architectural paradigm that separates the control plane of a networking device (e.g., a switch / router) from its data plane, making it feasible to control, monitor, and manage a network from a centralized node (the SDN controller). However, today there exists many SDN controllers including POX, Flo...

APIs for QoS configuration in Software Defined Networks

DEFF Research Database (Denmark)

Caba, Cosmin Marius; Soler, José

2015-01-01

The OpenFlow (OF) protocol is widely used in Software Defined Networking (SDN) to realize the communication between the controller and forwarding devices. OF allows great flexibility in managing traffic flows. However, OF alone is not enough to build more complex SDN services that require complete...... such as configuration of devices, ports, queues, etc. An Application Programming Interface (API) for dynamic configuration of QoS resources in the network devices is implemented herein, by using the capabilities of OVSDB. Further, the paper demonstrates the possibility to create network services with coarse granularity...... on top of the fine granular services exposed by the QoS configuration API at the SDNC. A series of tests emphasize the capabilities and the performance of the implemented QoS configuration API....

An Initial Load-Based Green Software Defined Network

Directory of Open Access Journals (Sweden)

Ying Hu

2017-05-01

Full Text Available Software defined network (SDN is a new network architecture in which the control function is decoupled from the data forwarding plane, that is attracting wide attentions from both research and industry sectors. However, SDN still faces the energy waste problem as do traditional networks. At present, research on energy saving in SDN is mainly focused on the static optimization of the network with zero load when new traffic arrives, changing the transmission path of the uncompleted traffic which arrived before the optimization, possibly resulting in route oscillation and other deleterious effects. To avoid this, a dynamical energy saving optimization scheme in which the paths of the uncompleted flows will not be changed when new traffic arrives is designed. To find the optimal solution for energy saving, the problem is modeled as a mixed integer linear programming (MILP problem. As the high complexity of the problem prohibits the optimal solution, an improved heuristic routing algorithm called improved constant weight greedy algorithm (ICWGA is proposed to find a sub-optimal solution. Simulation results show that the energy saving capacity of ICWGA is close to that of the optimal solution, offering desirable improvement in the energy efficiency of the network.

Validating User Flows to Protect Software Defined Network Environments

Directory of Open Access Journals (Sweden)

Ihsan H. Abdulqadder

2018-01-01

Full Text Available Software Defined Network is a promising network paradigm which has led to several security threats in SDN applications that involve user flows, switches, and controllers in the network. Threats as spoofing, tampering, information disclosure, Denial of Service, flow table overloading, and so on have been addressed by many researchers. In this paper, we present novel SDN design to solve three security threats: flow table overloading is solved by constructing a star topology-based architecture, unsupervised hashing method mitigates link spoofing attack, and fuzzy classifier combined with L1-ELM running on a neural network for isolating anomaly packets from normal packets. For effective flow migration Discrete-Time Finite-State Markov Chain model is applied. Extensive simulations using OMNeT++ demonstrate the performance of our proposed approach, which is better at preserving holding time than are other state-of-the-art works from the literature.

Social network analysis of public health programs to measure partnership.

Science.gov (United States)

Schoen, Martin W; Moreland-Russell, Sarah; Prewitt, Kim; Carothers, Bobbi J

2014-12-01

In order to prevent chronic diseases, community-based programs are encouraged to take an ecological approach to public health promotion and involve many diverse partners. Little is known about measuring partnership in implementing public health strategies. We collected data from 23 Missouri communities in early 2012 that received funding from three separate programs to prevent obesity and/or reduce tobacco use. While all of these funding programs encourage partnership, only the Social Innovation for Missouri (SIM) program included a focus on building community capacity and enhancing collaboration. Social network analysis techniques were used to understand contact and collaboration networks in community organizations. Measurements of average degree, density, degree centralization, and betweenness centralization were calculated for each network. Because of the various sizes of the networks, we conducted comparative analyses with and without adjustment for network size. SIM programs had increased measurements of average degree for partner collaboration and larger networks. When controlling for network size, SIM groups had higher measures of network density and lower measures of degree centralization and betweenness centralization. SIM collaboration networks were more dense and less centralized, indicating increased partnership. The methods described in this paper can be used to compare partnership in community networks of various sizes. Further research is necessary to define causal mechanisms of partnership development and their relationship to public health outcomes. Copyright © 2014 Elsevier Ltd. All rights reserved.

Software defined network architecture based research on load balancing strategy

Science.gov (United States)

You, Xiaoqian; Wu, Yang

2018-05-01

As a new type network architecture, software defined network has the key idea of separating the control place of the network from the transmission plane, to manage and control the network in a concentrated way; in addition, the network interface is opened on the control layer and the data layer, so as to achieve programmable control of the network. Considering that only the single shortest route is taken into the calculation of traditional network data flow transmission, and congestion and resource consumption caused by excessive load of link circuits are ignored, a link circuit load based flow media business QoS gurantee system is proposed in this article to divide the flow in the network into ordinary data flow and QoS flow. In this way, it supervises the link circuit load with the controller so as to calculate reasonable route rapidly and issue the flow table to the exchanger, to finish rapid data transmission. In addition, it establishes a simulation platform to acquire optimized result through simulation experiment.

Federated software defined network operations for LHC experiments

Science.gov (United States)

Kim, Dongkyun; Byeon, Okhwan; Cho, Kihyeon

2013-09-01

The most well-known high-energy physics collaboration, the Large Hadron Collider (LHC), which is based on e-Science, has been facing several challenges presented by its extraordinary instruments in terms of the generation, distribution, and analysis of large amounts of scientific data. Currently, data distribution issues are being resolved by adopting an advanced Internet technology called software defined networking (SDN). Stability of the SDN operations and management is demanded to keep the federated LHC data distribution networks reliable. Therefore, in this paper, an SDN operation architecture based on the distributed virtual network operations center (DvNOC) is proposed to enable LHC researchers to assume full control of their own global end-to-end data dissemination. This may achieve an enhanced data delivery performance based on data traffic offloading with delay variation. The evaluation results indicate that the overall end-to-end data delivery performance can be improved over multi-domain SDN environments based on the proposed federated SDN/DvNOC operation framework.

Experimental performance evaluation of software defined networking (SDN) based data communication networks for large scale flexi-grid optical networks.

Science.gov (United States)

Zhao, Yongli; He, Ruiying; Chen, Haoran; Zhang, Jie; Ji, Yuefeng; Zheng, Haomian; Lin, Yi; Wang, Xinbo

2014-04-21

Software defined networking (SDN) has become the focus in the current information and communication technology area because of its flexibility and programmability. It has been introduced into various network scenarios, such as datacenter networks, carrier networks, and wireless networks. Optical transport network is also regarded as an important application scenario for SDN, which is adopted as the enabling technology of data communication networks (DCN) instead of general multi-protocol label switching (GMPLS). However, the practical performance of SDN based DCN for large scale optical networks, which is very important for the technology selection in the future optical network deployment, has not been evaluated up to now. In this paper we have built a large scale flexi-grid optical network testbed with 1000 virtual optical transport nodes to evaluate the performance of SDN based DCN, including network scalability, DCN bandwidth limitation, and restoration time. A series of network performance parameters including blocking probability, bandwidth utilization, average lightpath provisioning time, and failure restoration time have been demonstrated under various network environments, such as with different traffic loads and different DCN bandwidths. The demonstration in this work can be taken as a proof for the future network deployment.

Software defined networking firewall for industry 4.0 manufacturing systems

Directory of Open Access Journals (Sweden)

Akihiro Tsuchiya

2018-04-01

Full Text Available Purpose: In order to leverage automation control data, Industry 4.0 manufacturing systems require industrial devices to be connected to the network. Potentially, this can increase the risk of cyberattacks, which can compromise connected industrial devices to acquire production data or gain control over the production process. Search engines such as Sentient Hyper-Optimized Data Access Network (SHODAN can be perverted by attackers to acquire network information that can be later used for intrusion. To prevent this, cybersecurity standards propose network architectures divided into several networks segments based on system functionalities. In this architecture, Firewalls limit the exposure of industrial control devices in order to minimize security risks. This paper presents a novel Software Defined Networking (SDN Firewall that automatically applies this standard architecture without compromising network flexibility.   Design/methodology/approach: The proposed SDN Firewall changes filtering rules in order to implement the different network segments according to application level access control policies. The Firewall applies two filtering techniques described in this paper: temporal filtering and spatial filtering, so that only applications in a white list can connect to industrial control devices. Network administrators need only to configure this application-oriented white lists to comply with security standards for ICS. This simplifies to a great extent network management tasks. Authors have developed a prototype implementation based on the OPC UA Standard and conducted security tests in order to test the viability of the proposal. Findings: Network segmentation and segregation are effective counter-measures against network scanning attacks. The proposed SDN Firewall effectively configures a flat network into virtual LAN segments according to security standard guidelines. Research limitations/implications: The prototype implementation still

Measuring co-authorship and networking-adjusted scientific impact.

Directory of Open Access Journals (Sweden)

John P A Ioannidis

Full Text Available Appraisal of the scientific impact of researchers, teams and institutions with productivity and citation metrics has major repercussions. Funding and promotion of individuals and survival of teams and institutions depend on publications and citations. In this competitive environment, the number of authors per paper is increasing and apparently some co-authors don't satisfy authorship criteria. Listing of individual contributions is still sporadic and also open to manipulation. Metrics are needed to measure the networking intensity for a single scientist or group of scientists accounting for patterns of co-authorship. Here, I define I(1 for a single scientist as the number of authors who appear in at least I(1 papers of the specific scientist. For a group of scientists or institution, I(n is defined as the number of authors who appear in at least I(n papers that bear the affiliation of the group or institution. I(1 depends on the number of papers authored N(p. The power exponent R of the relationship between I(1 and N(p categorizes scientists as solitary (R>2.5, nuclear (R = 2.25-2.5, networked (R = 2-2.25, extensively networked (R = 1.75-2 or collaborators (R<1.75. R may be used to adjust for co-authorship networking the citation impact of a scientist. I(n similarly provides a simple measure of the effective networking size to adjust the citation impact of groups or institutions. Empirical data are provided for single scientists and institutions for the proposed metrics. Cautious adoption of adjustments for co-authorship and networking in scientific appraisals may offer incentives for more accountable co-authorship behaviour in published articles.

Optimal Switch Configuration in Software-Defined Networks

Directory of Open Access Journals (Sweden)

Béla GENGE

2016-06-01

Full Text Available The emerging Software-Defined Networks (SDN paradigm facilitates innovative applications and enables the seamless provisioning of resilient communications. Nevertheless, the installation of communication flows in SDN requires careful planning in order to avoid configuration errors and to fulfill communication requirements. In this paper we propose an approach that installs automatically and optimally static flows in SDN switches. The approach aims to select high capacity links and shortest path routing, and enforces communication link and switch capacity limitations. Experimental results demonstrate the effectiveness and scalability of the developed methodology.

Advance reservation access control using software-defined networking and tokens

Energy Technology Data Exchange (ETDEWEB)

Chung, Joaquin; Jung, Eun-Sung; Kettimuthu, Rajkumar; Rao, Nageswara S. V.; Foster, Ian T.; Clark, Russ; Owen, Henry

2018-02-01

Advance reservation systems allow users to reserve dedicated bandwidth connection resources from advanced high-speed networks. A common use case for such systems is data transfers in distributed science environments in which a user wants exclusive access to the reservation. However, current advance network reservation methods cannot ensure exclusive access of a network reservation to the specific flow for which the user made the reservation. We present here a novel network architecture that addresses this limitation and ensures that a reservation is used only by the intended flow. We achieve this by leveraging software-defined networking (SDN) and token-based authorization. We use SDN to orchestrate and automate the reservation of networking resources, end-to-end and across multiple administrative domains, and tokens to create a strong binding between the user or application that requested the reservation and the flows provisioned by SDN. We conducted experiments on the ESNet 100G SDN testbed, and demonstrated that our system effectively protects authorized flows from competing traffic in the network. (C) 2017 Elsevier B.V. All rights reserved.

Simulasi Virtual Local Area Network (VLAN Berbasis Software Defined Network (SDN Menggunakan POX Controller

Directory of Open Access Journals (Sweden)

Rohmat Tulloh

2015-11-01

Full Text Available VLAN (Virtual LAN merupakan sebuah teknologi yang dapat mengkonfigurasi jaringan logis independen dari struktur jaringan fisik. Hasil dari penelitian sebelumnya sudah diprediksi bahwa dibutuhkan Virtual Network yang akhirnya terciptalah VLAN. Namun paradigma jaringan saat ini tidak flexible, ketergantungan terhadap vendor sangat besar karena fungsi data plane dan control plane berada dalam satu paket device. SDN (Software defined network yang merupakan salahsatu evolusi teknologi jaringan sesuai dengan tuntutan yang berkembang dimana memisahkan fungsi data plane dan control plane pada suatu perangkat. POX Controller digunakan untuk men-simulasikan dan menguji Platform SDN (Software defined network. Pada penelitian ini menggunakan Openflow versi 1.0 untuk memasang header VLAN sehingga penelitian ini difokuskan untuk mengevaluasi performa forwarding VLAN yang memanfaatkan Openflow sebagai control plane dapat berfungsi dengan baik. Hasil penelitian ini mengusulkan penerapan karakteristik teknologi VLAN pada SDN karena telah berjalan dengan benar sesuai hasil pengujian konektifitas, verifikasi dan keamanan. Kemudian hasil pengujian lanjutan untuk melihat pengaruh SDN dengan skenario penambahan jumlah VLAN ID didapatkan bahwa set-up time akan bertambah seiring meningkatnya jumlah host dan dengan menggunakan protokol OpenFlow, latency yang terjadi di jaringan dapat dipantau dengan parameter round trip time (RTT yang stabil direntang 0,2 sampai 6 second walaupun jumlah vlan_id dan background traffic bertambah.

Computer Network Availability at Sandia National Laboratories, Albuquerque NM: Measurement and Perception; TOPICAL

International Nuclear Information System (INIS)

NELSON, SPENCER D.; TOLENDINO, LAWRENCE F.

1999-01-01

The desire to provide a measure of computer network availability at Sandia National Laboratories has existed for along time. Several attempts were made to build this measure by accurately recording network failures, identifying the type of network element involved, the root cause of the problem, and the time to repair the fault. Recognizing the limitations of available methods, it became obvious that another approach of determining network availability had to be defined. The chosen concept involved the periodic sampling of network services and applications from various network locations. A measure of ''network'' availability was then calculated based on the ratio of polling success to failure. The effort required to gather the information and produce a useful metric is not prohibitive and the information gained has verified long held feelings regarding network performance with real data

A New Wavelength Optimization and Energy-Saving Scheme Based on Network Coding in Software-Defined WDM-PON Networks

Science.gov (United States)

Ren, Danping; Wu, Shanshan; Zhang, Lijing

2016-09-01

In view of the characteristics of the global control and flexible monitor of software-defined networks (SDN), we proposes a new optical access network architecture dedicated to Wavelength Division Multiplexing-Passive Optical Network (WDM-PON) systems based on SDN. The network coding (NC) technology is also applied into this architecture to enhance the utilization of wavelength resource and reduce the costs of light source. Simulation results show that this scheme can optimize the throughput of the WDM-PON network, greatly reduce the system time delay and energy consumption.

Network module detection: Affinity search technique with the multi-node topological overlap measure.

Science.gov (United States)

Li, Ai; Horvath, Steve

2009-07-20

Many clustering procedures only allow the user to input a pairwise dissimilarity or distance measure between objects. We propose a clustering method that can input a multi-point dissimilarity measure d(i1, i2, ..., iP) where the number of points P can be larger than 2. The work is motivated by gene network analysis where clusters correspond to modules of highly interconnected nodes. Here, we define modules as clusters of network nodes with high multi-node topological overlap. The topological overlap measure is a robust measure of interconnectedness which is based on shared network neighbors. In previous work, we have shown that the multi-node topological overlap measure yields biologically meaningful results when used as input of network neighborhood analysis. We adapt network neighborhood analysis for the use of module detection. We propose the Module Affinity Search Technique (MAST), which is a generalized version of the Cluster Affinity Search Technique (CAST). MAST can accommodate a multi-node dissimilarity measure. Clusters grow around user-defined or automatically chosen seeds (e.g. hub nodes). We propose both local and global cluster growth stopping rules. We use several simulations and a gene co-expression network application to argue that the MAST approach leads to biologically meaningful results. We compare MAST with hierarchical clustering and partitioning around medoid clustering. Our flexible module detection method is implemented in the MTOM software which can be downloaded from the following webpage: http://www.genetics.ucla.edu/labs/horvath/MTOM/

Cross-layer restoration with software defined networking based on IP over optical transport networks

Science.gov (United States)

Yang, Hui; Cheng, Lei; Deng, Junni; Zhao, Yongli; Zhang, Jie; Lee, Young

2015-10-01

The IP over optical transport network is a very promising networking architecture applied to the interconnection of geographically distributed data centers due to the performance guarantee of low delay, huge bandwidth and high reliability at a low cost. It can enable efficient resource utilization and support heterogeneous bandwidth demands in highly-available, cost-effective and energy-effective manner. In case of cross-layer link failure, to ensure a high-level quality of service (QoS) for user request after the failure becomes a research focus. In this paper, we propose a novel cross-layer restoration scheme for data center services with software defined networking based on IP over optical network. The cross-layer restoration scheme can enable joint optimization of IP network and optical network resources, and enhance the data center service restoration responsiveness to the dynamic end-to-end service demands. We quantitatively evaluate the feasibility and performances through the simulation under heavy traffic load scenario in terms of path blocking probability and path restoration latency. Numeric results show that the cross-layer restoration scheme improves the recovery success rate and minimizes the overall recovery time.

Performance Analysis of Congestion Control Mechanism in Software Defined Network (SDN

Directory of Open Access Journals (Sweden)

Rahman M. Z. A.

2017-01-01

Full Text Available In the near future, the traditional networks architecture will be difficult to be managed. Hence, Software Defined Network (SDN will be an alternative in the future of programmable networks to replace the conventional network architecture. The main idea of SDN architecture is to separate the forwarding plane and control plane of network system, where network operators can program packet forwarding behaviour to improve the network performance. Congestion control is important mechanism for network traffic to improve network capability and achieve high end Quality of Service (QoS. In this paper, extensive simulation is conducted to analyse the performance of SDN by implementing Link Layer Discovery Protocol (LLDP under congested network. The simulation was conducted on Mininet by creating four different fanout and the result was analysed based on differences of matrix performance. As a result, the packet loss and throughput reduction were observed when number of fanout in the topology was increased. By using LLDP protocol, huge reduction in packet loss rate has been achieved while maximizing percentage packet delivery ratio.

Software defined multi-OLT passive optical network for flexible traffic allocation

Science.gov (United States)

Zhang, Shizong; Gu, Rentao; Ji, Yuefeng; Zhang, Jiawei; Li, Hui

2016-10-01

With the rapid growth of 4G mobile network and vehicular network services mobile terminal users have increasing demand on data sharing among different radio remote units (RRUs) and roadside units (RSUs). Meanwhile, commercial video-streaming, video/voice conference applications delivered through peer-to-peer (P2P) technology are still keep on stimulating the sharp increment of bandwidth demand in both business and residential subscribers. However, a significant issue is that, although wavelength division multiplexing (WDM) and orthogonal frequency division multiplexing (OFDM) technology have been proposed to fulfil the ever-increasing bandwidth demand in access network, the bandwidth of optical fiber is not unlimited due to the restriction of optical component properties and modulation/demodulation technology, and blindly increase the wavelength cannot meet the cost-sensitive characteristic of the access network. In this paper, we propose a software defined multi-OLT PON architecture to support efficient scheduling of access network traffic. By introducing software defined networking technology and wavelength selective switch into TWDM PON system in central office, multiple OLTs can be considered as a bandwidth resource pool and support flexible traffic allocation for optical network units (ONUs). Moreover, under the configuration of the control plane, ONUs have the capability of changing affiliation between different OLTs under different traffic situations, thus the inter-OLT traffic can be localized and the data exchange pressure of the core network can be released. Considering this architecture is designed to be maximum following the TWDM PON specification, the existing optical distribution network (ODN) investment can be saved and conventional EPON/GPON equipment can be compatible with the proposed architecture. What's more, based on this architecture, we propose a dynamic wavelength scheduling algorithm, which can be deployed as an application on control plane

Energy-Aware Routing in Multiple Domains Software-Defined Networks

Directory of Open Access Journals (Sweden)

Adriana FERNÁNDEZ-FERNÁNDEZ

2016-12-01

Full Text Available The growing energy consumption of communication networks has attracted the attention of the networking researchers in the last decade. In this context, the new architecture of Software-Defined Networks (SDN allows a flexible programmability, suitable for the power-consumption optimization problem. In this paper we address the issue of designing a novel distributed routing algorithm that optimizes the power consumption in large scale SDN with multiple domains. The solution proposed, called DEAR (Distributed Energy-Aware Routing, tackles the problem of minimizing the number of links that can be used to satisfy a given data traffic demand under performance constraints such as control traffic delay and link utilization. To this end, we present a complete formulation of the optimization problem that considers routing requirements for control and data plane communications. Simulation results confirm that the proposed solution enables the achievement of significant energy savings.

Robust and Agile System against Fault and Anomaly Traffic in Software Defined Networks

Directory of Open Access Journals (Sweden)

Mihui Kim

2017-03-01

Full Text Available The main advantage of software defined networking (SDN is that it allows intelligent control and management of networking though programmability in real time. It enables efficient utilization of network resources through traffic engineering, and offers potential attack defense methods when abnormalities arise. However, previous studies have only identified individual solutions for respective problems, instead of finding a more global solution in real time that is capable of addressing multiple situations in network status. To cover diverse network conditions, this paper presents a comprehensive reactive system for simultaneously monitoring failures, anomalies, and attacks for high availability and reliability. We design three main modules in the SDN controller for a robust and agile defense (RAD system against network anomalies: a traffic analyzer, a traffic engineer, and a rule manager. RAD provides reactive flow rule generation to control traffic while detecting network failures, anomalies, high traffic volume (elephant flows, and attacks. The traffic analyzer identifies elephant flows, traffic anomalies, and attacks based on attack signatures and network monitoring. The traffic engineer module measures network utilization and delay in order to determine the best path for multi-dimensional routing and load balancing under any circumstances. Finally, the rule manager generates and installs a flow rule for the selected best path to control traffic. We implement the proposed RAD system based on Floodlight, an open source project for the SDN controller. We evaluate our system using simulation with and without the aforementioned RAD modules. Experimental results show that our approach is both practical and feasible, and can successfully augment an existing SDN controller in terms of agility, robustness, and efficiency, even in the face of link failures, attacks, and elephant flows.

Organization of Multi-controller Interaction in Software Defined Networks

Directory of Open Access Journals (Sweden)

Sergey V. Morzhov

2018-01-01

Full Text Available Software Defined Networking (SDN is a promising paradigm for network management. It is a centralized network intelligence on a dedicated server, which runs network operating system, and is called SDN controller. It was assumed that such an architecture should have an improved network performance and monitoring. However, the centralized control architecture of the SDNs brings novel challenges to reliability, scalability, fault tolerance and interoperability. These problems are especially acute for large data center networks and can be solved by combining SDN controllers into clusters, called multi-controllers. Multi-controller architecture became very important for SDN-enabled networks nowadays. This paper gives a comprehensive overview of SDN multi-controller architectures. The authors review several most popular distributed controllers in order to indicate their strengths and weaknesses. They also investigate and classify approaches used. This paper explains in details the difference among various types of multi-controller architectures, the distribution method and the communication system. Furthermore, it provides already implemented architectures and some examples of architectures under consideration by describing their design, communication process, and performance results. In this paper, the authors show their own classification of multi-controllers and claim that, despite the existence of undeniable advantages, all reviewed controllers have serious drawbacks, which must be eliminated. These drawbacks hamper the development of multi-controllers and their widespread adoption in corporate networks. In the end, the authors conclude that now it is impossible to find a solution capable to solve all the tasks assigned to it adequately and fully. The article is published in the authors’ wording.

An assessment of available measures to reduce traction energy use in railway networks

International Nuclear Information System (INIS)

Douglas, Heather; Roberts, Clive; Hillmansen, Stuart; Schmid, Felix

2015-01-01

Highlights: • Railway networks are defined in terms of their distinguishing features. • Current energy saving measures are reviewed and categorised by the energy use they target. • The achievable energy savings of different measures are compared dependent on the network type. • The success of a measure depends on the characteristics of the network, vehicle and service. • Measures should be evaluated at system level due to interdependencies. - Abstract: Rail is becoming an increasingly popular choice to satisfy transportation demands locally, nationally and internationally, due to its inherent efficiency and high capacity. Despite this, operators are facing pressure to reduce rail energy consumption to meet efficiency targets, whilst still maintaining service quality and managing increased demand. A number of individual measures have been proposed to reduce energy in the rail sector, often showing good results on specific case studies. It is generally agreed that the attainable savings of a given measure change dependant on the route, vehicle and service characteristics. However, there is little information in the literature specifically regarding which measures are most suitable for given network types, or how they interact. This paper therefore aims to begin evaluating the available measures in terms of their suitability for different systems. Firstly, networks are defined in terms of their distinguishing features. As traction accounts for the majority of all energy use in the rail sector, the traction flow through a vehicle is considered as the starting point for an evaluation of measures. Current technologies and procedures are reviewed and categorised based on which area of traction use they target. Thought is given to the factors that affect implementation and the networks where they are applied. A key output of this paper is a comparison of the achievable energy savings of different measures dependent on the network type. It is hoped that this will

TopoGen: A Network Topology Generation Architecture with application to automating simulations of Software Defined Networks

CERN Document Server

Laurito, Andres; The ATLAS collaboration

2017-01-01

Simulation is an important tool to validate the performance impact of control decisions in Software Defined Networks (SDN). Yet, the manual modeling of complex topologies that may change often during a design process can be a tedious error-prone task. We present TopoGen, a general purpose architecture and tool for systematic translation and generation of network topologies. TopoGen can be used to generate network simulation models automatically by querying information available at diverse sources, notably SDN controllers. The DEVS modeling and simulation framework facilitates a systematic translation of structured knowledge about a network topology into a formal modular and hierarchical coupling of preexisting or new models of network entities (physical or logical). TopoGen can be flexibly extended with new parsers and generators to grow its scope of applicability. This permits to design arbitrary workflows of topology transformations. We tested TopoGen in a network engineering project for the ATLAS detector ...

TopoGen: A Network Topology Generation Architecture with application to automating simulations of Software Defined Networks

CERN Document Server

Laurito, Andres; The ATLAS collaboration

2018-01-01

Simulation is an important tool to validate the performance impact of control decisions in Software Defined Networks (SDN). Yet, the manual modeling of complex topologies that may change often during a design process can be a tedious error-prone task. We present TopoGen, a general purpose architecture and tool for systematic translation and generation of network topologies. TopoGen can be used to generate network simulation models automatically by querying information available at diverse sources, notably SDN controllers. The DEVS modeling and simulation framework facilitates a systematic translation of structured knowledge about a network topology into a formal modular and hierarchical coupling of preexisting or new models of network entities (physical or logical). TopoGen can be flexibly extended with new parsers and generators to grow its scope of applicability. This permits to design arbitrary workflows of topology transformations. We tested TopoGen in a network engineering project for the ATLAS detector ...

SD-EAR: Energy Aware Routing in Software Defined Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Anuradha Banerjee

2018-06-01

Full Text Available In today’s internet-of-things (IoT environment, wireless sensor networks (WSNs have many advantages, with broad applications in different areas including environmental monitoring, maintaining security, etc. However, high energy depletion may lead to node failures in WSNs. In most WSNs, nodes deplete energy mainly because of the flooding and broadcasting of route-request (RREQ packets, which is essential for route discovery in WSNs. The present article models wireless sensor networks as software-defined wireless sensor networks (SD-WSNs where the network is divided into multiple clusters or zones, and each zone is controlled by a software-defined network (SDN controller. The SDN controller is aware of the topology of each zone, and finds out the optimum energy efficient path from any source to any destination inside the zone. For destinations outside of the zone, the SDN controller of the source zone instructs the source to send a message to all of the peripheral nodes in that zone, so that they can forward the message to the peripheral nodes in other zones, and the process goes on until a destination is found. As far as energy-efficient path selection is concerned, the SDN controller of a zone is aware of the connectivity and residual energy of each node. Therefore, it is capable of discovering an optimum energy efficient path from any source to any destination inside as well as outside of the zone of the source. Accordingly, flow tables in different routers are updated dynamically. The task of route discovery is shifted from individual nodes to controllers, and as a result, the flooding of route-requests is completely eliminated. Software-defined energy aware routing (SD-EARalso proposes an innovative sleeping strategy where exhausted nodes are allowed to go to sleep through a sleep request—sleep grant mechanism. All of these result in huge energy savings in SD-WSN, as shown in the simulation results.

Experimental demonstration of software defined data center optical networks with Tbps end-to-end tunability

Science.gov (United States)

Zhao, Yongli; Zhang, Jie; Ji, Yuefeng; Li, Hui; Wang, Huitao; Ge, Chao

2015-10-01

The end-to-end tunability is important to provision elastic channel for the burst traffic of data center optical networks. Then, how to complete the end-to-end tunability based on elastic optical networks? Software defined networking (SDN) based end-to-end tunability solution is proposed for software defined data center optical networks, and the protocol extension and implementation procedure are designed accordingly. For the first time, the flexible grid all optical networks with Tbps end-to-end tunable transport and switch system have been online demonstrated for data center interconnection, which are controlled by OpenDayLight (ODL) based controller. The performance of the end-to-end tunable transport and switch system has been evaluated with wavelength number tuning, bit rate tuning, and transmit power tuning procedure.

Monitoring and Discovery for Self-Organized Network Management in Virtualized and Software Defined Networks

Science.gov (United States)

Valdivieso Caraguay, Ángel Leonardo; García Villalba, Luis Javier

2017-01-01

This paper presents the Monitoring and Discovery Framework of the Self-Organized Network Management in Virtualized and Software Defined Networks SELFNET project. This design takes into account the scalability and flexibility requirements needed by 5G infrastructures. In this context, the present framework focuses on gathering and storing the information (low-level metrics) related to physical and virtual devices, cloud environments, flow metrics, SDN traffic and sensors. Similarly, it provides the monitoring data as a generic information source in order to allow the correlation and aggregation tasks. Our design enables the collection and storing of information provided by all the underlying SELFNET sublayers, including the dynamically onboarded and instantiated SDN/NFV Apps, also known as SELFNET sensors. PMID:28362346

Monitoring and Discovery for Self-Organized Network Management in Virtualized and Software Defined Networks.

Science.gov (United States)

Caraguay, Ángel Leonardo Valdivieso; Villalba, Luis Javier García

2017-03-31

This paper presents the Monitoring and Discovery Framework of the Self-Organized Network Management in Virtualized and Software Defined Networks SELFNET project. This design takes into account the scalability and flexibility requirements needed by 5G infrastructures. In this context, the present framework focuses on gathering and storing the information (low-level metrics) related to physical and virtual devices, cloud environments, flow metrics, SDN traffic and sensors. Similarly, it provides the monitoring data as a generic information source in order to allow the correlation and aggregation tasks. Our design enables the collection and storing of information provided by all the underlying SELFNET sublayers, including the dynamically onboarded and instantiated SDN/NFV Apps, also known as SELFNET sensors.

Delay Bounded Multi-Source Multicast in Software-Defined Networking

Directory of Open Access Journals (Sweden)

Thabo Semong

2018-01-01

Full Text Available Software-Defined Networking (SDN is the next generation network architecture with exciting application prospects. The control function in SDN is decoupled from the data forwarding plane, hence it provides a new centralized architecture with flexible network resource management. Although SDN is attracting much attention from both industry and research, its advantage over the traditional networks has not been fully utilized. Multicast is designed to deliver content to multiple destinations. The current traffic engineering in SDN focuses mainly on unicast, however, multicast can effectively reduce network resource consumption by serving multiple clients. This paper studies a novel delay-bounded multi-source multicast SDN problem, in which among the set of potential sources, we select a source to build the multicast-tree, under the constraint that the transmission delay for every destination is bounded. This problem is more difficult than the traditional Steiner minimum tree (SMT problem, since it needs to find a source from the set of all potential sources. We model the problem as a mixed-integer linear programming (MILP and prove its NP-Hardness. To solve the problem, a delay bounded multi-source (DBMS scheme is proposed, which includes a DBMS algorithm to build a minimum delay cost DBMS-Forest. Through a MATLAB experiment, we demonstrate that DBMS is significantly more efficient and outperforms other existing algorithms in the literature.

Design of a stateless low-latency router architecture for green software-defined networking

DEFF Research Database (Denmark)

Saldaña Cercos, Silvia; Ramos, Ramon M.; Eller, Ana C. Ewald

2015-01-01

Expanding software defined networking (SDN) to transport networks requires new strategies to deal with the large number of flows that future core networks will have to face. New south-bound protocols within SDN have been proposed to benefit from having control plane detached from the data plane...... offering a cost- and energy-efficient forwarding engine. This paper presents an overview of a new approach named KeyFlow to simultaneously reduce latency, jitter, and power consumption in core network nodes. Results on an emulation platform indicate that round trip time (RTT) can be reduced above 50...

Key on demand (KoD) for software-defined optical networks secured by quantum key distribution (QKD).

Science.gov (United States)

Cao, Yuan; Zhao, Yongli; Colman-Meixner, Carlos; Yu, Xiaosong; Zhang, Jie

2017-10-30

Software-defined optical networking (SDON) will become the next generation optical network architecture. However, the optical layer and control layer of SDON are vulnerable to cyberattacks. While, data encryption is an effective method to minimize the negative effects of cyberattacks, secure key interchange is its major challenge which can be addressed by the quantum key distribution (QKD) technique. Hence, in this paper we discuss the integration of QKD with WDM optical networks to secure the SDON architecture by introducing a novel key on demand (KoD) scheme which is enabled by a novel routing, wavelength and key assignment (RWKA) algorithm. The QKD over SDON with KoD model follows two steps to provide security: i) quantum key pools (QKPs) construction for securing the control channels (CChs) and data channels (DChs); ii) the KoD scheme uses RWKA algorithm to allocate and update secret keys for different security requirements. To test our model, we define a security probability index which measures the security gain in CChs and DChs. Simulation results indicate that the security performance of CChs and DChs can be enhanced by provisioning sufficient secret keys in QKPs and performing key-updating considering potential cyberattacks. Also, KoD is beneficial to achieve a positive balance between security requirements and key resource usage.

Optimisation of Software-Defined Networks Performance Using a Hybrid Intelligent System

Directory of Open Access Journals (Sweden)

Ann Sabih

2017-06-01

Full Text Available This paper proposes a novel intelligent technique that has been designed to optimise the performance of Software Defined Networks (SDN. The proposed hybrid intelligent system has employed integration of intelligence-based optimisation approaches with the artificial neural network. These heuristic optimisation methods include Genetic Algorithms (GA and Particle Swarm Optimisation (PSO. These methods were utilised separately in order to select the best inputs to maximise SDN performance. In order to identify SDN behaviour, the neural network model is trained and applied. The maximal optimisation approach has been identified using an analytical approach that considered SDN performance and the computational time as objective functions. Initially, the general model of the neural network was tested with unseen data before implementing the model using GA and PSO to determine the optimal performance of SDN. The results showed that the SDN represented by Artificial Neural Network ANN, and optmised by PSO, generated a better configuration with regards to computational efficiency and performance index.

Dynamic Flow Migration for Delay Constrained Traffic in Software-Defined Networks

NARCIS (Netherlands)

Berger, Andre; Gross, James; Danielis, Peter; Dán, György

2017-01-01

Various industrial control applications have stringent end-to-end latency requirements in the order of a few milliseconds. Software-defined networking (SDN) is a promising solution in order to meet these stringent requirements under varying traffic patterns, as it enables the flexible management of

Virtual optical network provisioning with unified service logic processing model for software-defined multidomain optical networks

Science.gov (United States)

Zhao, Yongli; Li, Shikun; Song, Yinan; Sun, Ji; Zhang, Jie

2015-12-01

Hierarchical control architecture is designed for software-defined multidomain optical networks (SD-MDONs), and a unified service logic processing model (USLPM) is first proposed for various applications. USLPM-based virtual optical network (VON) provisioning process is designed, and two VON mapping algorithms are proposed: random node selection and per controller computation (RNS&PCC) and balanced node selection and hierarchical controller computation (BNS&HCC). Then an SD-MDON testbed is built with OpenFlow extension in order to support optical transport equipment. Finally, VON provisioning service is experimentally demonstrated on the testbed along with performance verification.

Monitoring and Discovery for Self-Organized Network Management in Virtualized and Software Defined Networks

Directory of Open Access Journals (Sweden)

Ángel Leonardo Valdivieso Caraguay

2017-03-01

Full Text Available This paper presents the Monitoring and Discovery Framework of the Self-Organized Network Management in Virtualized and Software Defined Networks SELFNET project. This design takes into account the scalability and flexibility requirements needed by 5G infrastructures. In this context, the present framework focuses on gathering and storing the information (low-level metrics related to physical and virtual devices, cloud environments, flow metrics, SDN traffic and sensors. Similarly, it provides the monitoring data as a generic information source in order to allow the correlation and aggregation tasks. Our design enables the collection and storing of information provided by all the underlying SELFNET sublayers, including the dynamically onboarded and instantiated SDN/NFV Apps, also known as SELFNET sensors.

Troubleshooting of Software Defined Networks

OpenAIRE

Sistek, Haris

2015-01-01

Network troubleshooting is a field where automation is sorely needed. While the network has grown in many other ways since 1960s, the tools we use to troubleshoot and manage it have stayed very much the same. Could we use the programmability of SDN to automate this problem? In this thesis work, we developed a prototype that would systematically troubleshoot the network with automation. The prototype automatically captures network behaviour, matches it against a network policy and creates its ...

Network cohesion

OpenAIRE

Cavalcanti, Tiago Vanderlei; Giannitsarou, Chrysi; Johnson, CR

2017-01-01

We define a measure of network cohesion and show how it arises naturally in a broad class of dynamic models of endogenous perpetual growth with network externalities. Via a standard growth model, we show why network cohesion is crucial for conditional convergence and explain that as cohesion increases, convergence is faster. We prove properties of network cohesion and define a network aggregator that preserves network cohesion.

Measuring co-authorship and networking-adjusted scientific impact.

Science.gov (United States)

Ioannidis, John P A

2008-07-23

Appraisal of the scientific impact of researchers, teams and institutions with productivity and citation metrics has major repercussions. Funding and promotion of individuals and survival of teams and institutions depend on publications and citations. In this competitive environment, the number of authors per paper is increasing and apparently some co-authors don't satisfy authorship criteria. Listing of individual contributions is still sporadic and also open to manipulation. Metrics are needed to measure the networking intensity for a single scientist or group of scientists accounting for patterns of co-authorship. Here, I define I(1) for a single scientist as the number of authors who appear in at least I(1) papers of the specific scientist. For a group of scientists or institution, I(n) is defined as the number of authors who appear in at least I(n) papers that bear the affiliation of the group or institution. I(1) depends on the number of papers authored N(p). The power exponent R of the relationship between I(1) and N(p) categorizes scientists as solitary (R>2.5), nuclear (R = 2.25-2.5), networked (R = 2-2.25), extensively networked (R = 1.75-2) or collaborators (Raccountable co-authorship behaviour in published articles.

Defining the protein interaction network of human malaria parasite Plasmodium falciparum

KAUST Repository

Ramaprasad, Abhinay

2012-02-01

Malaria, caused by the protozoan parasite Plasmodium falciparum, affects around 225. million people yearly and a huge international effort is directed towards combating this grave threat to world health and economic development. Considerable advances have been made in malaria research triggered by the sequencing of its genome in 2002, followed by several high-throughput studies defining the malaria transcriptome and proteome. A protein-protein interaction (PPI) network seeks to trace the dynamic interactions between proteins, thereby elucidating their local and global functional relationships. Experimentally derived PPI network from high-throughput methods such as yeast two hybrid (Y2H) screens are inherently noisy, but combining these independent datasets by computational methods tends to give a greater accuracy and coverage. This review aims to discuss the computational approaches used till date to construct a malaria protein interaction network and to catalog the functional predictions and biological inferences made from analysis of the PPI network. © 2011 Elsevier Inc.

A Service-Oriented Approach for Dynamic Chaining of Virtual Network Functions over Multi-Provider Software-Defined Networks

Directory of Open Access Journals (Sweden)

Barbara Martini

2016-06-01

Full Text Available Emerging technologies such as Software-Defined Networks (SDN and Network Function Virtualization (NFV promise to address cost reduction and flexibility in network operation while enabling innovative network service delivery models. However, operational network service delivery solutions still need to be developed that actually exploit these technologies, especially at the multi-provider level. Indeed, the implementation of network functions as software running over a virtualized infrastructure and provisioned on a service basis let one envisage an ecosystem of network services that are dynamically and flexibly assembled by orchestrating Virtual Network Functions even across different provider domains, thereby coping with changeable user and service requirements and context conditions. In this paper we propose an approach that adopts Service-Oriented Architecture (SOA technology-agnostic architectural guidelines in the design of a solution for orchestrating and dynamically chaining Virtual Network Functions. We discuss how SOA, NFV, and SDN may complement each other in realizing dynamic network function chaining through service composition specification, service selection, service delivery, and placement tasks. Then, we describe the architecture of a SOA-inspired NFV orchestrator, which leverages SDN-based network control capabilities to address an effective delivery of elastic chains of Virtual Network Functions. Preliminary results of prototype implementation and testing activities are also presented. The benefits for Network Service Providers are also described that derive from the adaptive network service provisioning in a multi-provider environment through the orchestration of computing and networking services to provide end users with an enhanced service experience.

3D Facial Similarity Measure Based on Geodesic Network and Curvatures

Directory of Open Access Journals (Sweden)

Junli Zhao

2014-01-01

Full Text Available Automated 3D facial similarity measure is a challenging and valuable research topic in anthropology and computer graphics. It is widely used in various fields, such as criminal investigation, kinship confirmation, and face recognition. This paper proposes a 3D facial similarity measure method based on a combination of geodesic and curvature features. Firstly, a geodesic network is generated for each face with geodesics and iso-geodesics determined and these network points are adopted as the correspondence across face models. Then, four metrics associated with curvatures, that is, the mean curvature, Gaussian curvature, shape index, and curvedness, are computed for each network point by using a weighted average of its neighborhood points. Finally, correlation coefficients according to these metrics are computed, respectively, as the similarity measures between two 3D face models. Experiments of different persons’ 3D facial models and different 3D facial models of the same person are implemented and compared with a subjective face similarity study. The results show that the geodesic network plays an important role in 3D facial similarity measure. The similarity measure defined by shape index is consistent with human’s subjective evaluation basically, and it can measure the 3D face similarity more objectively than the other indices.

Reliable and Fault-Tolerant Software-Defined Network Operations Scheme for Remote 3D Printing

Science.gov (United States)

Kim, Dongkyun; Gil, Joon-Min

2015-03-01

The recent wide expansion of applicable three-dimensional (3D) printing and software-defined networking (SDN) technologies has led to a great deal of attention being focused on efficient remote control of manufacturing processes. SDN is a renowned paradigm for network softwarization, which has helped facilitate remote manufacturing in association with high network performance, since SDN is designed to control network paths and traffic flows, guaranteeing improved quality of services by obtaining network requests from end-applications on demand through the separated SDN controller or control plane. However, current SDN approaches are generally focused on the controls and automation of the networks, which indicates that there is a lack of management plane development designed for a reliable and fault-tolerant SDN environment. Therefore, in addition to the inherent advantage of SDN, this paper proposes a new software-defined network operations center (SD-NOC) architecture to strengthen the reliability and fault-tolerance of SDN in terms of network operations and management in particular. The cooperation and orchestration between SDN and SD-NOC are also introduced for the SDN failover processes based on four principal SDN breakdown scenarios derived from the failures of the controller, SDN nodes, and connected links. The abovementioned SDN troubles significantly reduce the network reachability to remote devices (e.g., 3D printers, super high-definition cameras, etc.) and the reliability of relevant control processes. Our performance consideration and analysis results show that the proposed scheme can shrink operations and management overheads of SDN, which leads to the enhancement of responsiveness and reliability of SDN for remote 3D printing and control processes.

Software defined access networks

OpenAIRE

Maricato, José Miguel Duarte

2016-01-01

With the increase of internet usage and the exponential growth of bandwidth consumption due to the increasing number of users of new generation equipments and the creation of new services that consume increasingly higher bandwidths, it's necessary to nd solutions to meet these new requirements. Passive optical networks (PONs) promise to solve these problems by providing a better service to users and providers. PON networks are very attractive since they don't depend on a...

Pyramidal resistor networks for electrical impedance tomography with partial boundary measurements

International Nuclear Information System (INIS)

Borcea, L; Mamonov, A V; Druskin, V; Vasquez, F Guevara

2010-01-01

We introduce an inversion algorithm for electrical impedance tomography (EIT) with partial boundary measurements in two dimensions. It gives stable and fast reconstructions using sparse parameterizations of the unknown conductivity on optimal grids that are computed as part of the inversion. We follow the approach in Borcea et al (2008 Inverse Problems 24 035013) and Vasquez (2006 PhD thesis Rice University, Houston, TX, USA) that connects inverse discrete problems for resistor networks to continuum EIT problems, using optimal grids. The algorithm in Borcea et al (2008 Inverse Problems 24 035013) and Vasquez (2006 PhD Thesis Rice University, Houston, TX, USA) is based on circular resistor networks, and solves the EIT problem with full boundary measurements. It is extended in Borcea et al (2010 Inverse Problems 26 045010) to EIT with partial boundary measurements, using extremal quasi-conformal mappings that transform the problem to one with full boundary measurements. Here we introduce a different class of optimal grids, based on resistor networks with pyramidal topology, that is better suited for the partial measurements setup. We prove the unique solvability of the discrete inverse problem for these networks and develop an algorithm for finding them from the measurements of the Dirichlet to Neumann map. Then, we show how to use the networks to define the optimal grids and to approximate the unknown conductivity. We assess the performance of our approach with numerical simulations and compare the results with those in Borcea et al (2010)

De-optical-line-terminal hybrid access-aggregation optical network for time-sensitive services based on software-defined networking orchestration

Science.gov (United States)

Bai, Wei; Yang, Hui; Xiao, Hongyun; Yu, Ao; He, Linkuan; Zhang, Jie; Li, Zhen; Du, Yi

2017-11-01

With the increase in varieties of services in network, time-sensitive services (TSSs) appear and bring forward an impending need for delay performance. Ultralow-latency communication has become one of the important development goals for many scenarios in the coming 5G era (e.g., robotics and driverless cars). However, the conventional methods, which decrease delay by promoting the available resources and the network transmission speed, have limited effect; a new breakthrough for ultralow-latency communication is necessary. We propose a de-optical-line-terminal (De-OLT) hybrid access-aggregation optical network (DAON) for TSS based on software-defined networking (SDN) orchestration. In this network, low-latency all-optical communication based on optical burst switching can be achieved by removing OLT. For supporting this network and guaranteeing the quality of service for TSSs, we design SDN-driven control method and service provision method. Numerical results demonstrate the proposed DAON promotes network service efficiency and avoids traffic congestion.

Defining Multiple Chronic Conditions for Quality Measurement.

Science.gov (United States)

Drye, Elizabeth E; Altaf, Faseeha K; Lipska, Kasia J; Spatz, Erica S; Montague, Julia A; Bao, Haikun; Parzynski, Craig S; Ross, Joseph S; Bernheim, Susannah M; Krumholz, Harlan M; Lin, Zhenqiu

2018-02-01

Patients with multiple chronic conditions (MCCs) are a critical but undefined group for quality measurement. We present a generally applicable systematic approach to defining an MCC cohort of Medicare fee-for-service beneficiaries that we developed for a national quality measure, risk-standardized rates of unplanned admissions for Accountable Care Organizations. To define the MCC cohort we: (1) identified potential chronic conditions; (2) set criteria for cohort conditions based on MCC framework and measure concept; (3) applied the criteria informed by empirical analysis, experts, and the public; (4) described "broader" and "narrower" cohorts; and (5) selected final cohort with stakeholder input. Subjects were patients with chronic conditions. Participants included 21.8 million Medicare fee-for-service beneficiaries in 2012 aged 65 years and above with ≥1 of 27 Medicare Chronic Condition Warehouse condition(s). In total, 10 chronic conditions were identified based on our criteria; 8 of these 10 were associated with notably increased admission risk when co-occurring. A broader cohort (2+ of the 8 conditions) included 4.9 million beneficiaries (23% of total cohort) with an admission rate of 70 per 100 person-years. It captured 53% of total admissions. The narrower cohort (3+ conditions) had 2.2 million beneficiaries (10%) with 100 admissions per 100 person-years and captured 32% of admissions. Most stakeholders viewed the broader cohort as best aligned with the measure concept. By systematically narrowing chronic conditions to those most relevant to the outcome and incorporating stakeholder input, we defined an MCC admission measure cohort supported by stakeholders. This approach can be used as a model for other MCC outcome measures.

Controller Placement Algorithms in Software Defined Network - A Review of Trends and Challenges

Directory of Open Access Journals (Sweden)

Yoon Si-Kee

2017-01-01

Full Text Available Traditional network architectures are complex to manage, comparatively static, rigid and difficult to make changes for new innovation. The proprietary devices in such architectures are based on manual configuration which are unwieldy and error-prone. Software Defined Network (SDN which is described as a new network paradigm that decouple the control plane from data plane are capable to solve today's network issues and improve the network performance. Nevertheless, among so many challenges and research opportunity in SDN, Controller Placement Problem (CPP is said to be the most important issues which can directly affect the overall network performance. Thus far, the issue regarding the CPP and its challenge has not been completely reviewed and discussed properly in any other papers. In this paper, we provide a comprehensive review on several optimized controller placement problem algorithms in SDN. This paper also highlights some limitations of the reviewed methods and also emphasizes on suitable approach to address the aforementioned problems.

ABS-TrustSDN: An Agent-Based Simulator of Trust Strategies in Software-Defined Networks

Directory of Open Access Journals (Sweden)

Iván García-Magariño

2017-01-01

Full Text Available Software-defined networks (SDNs have become a mechanism to separate the control plane and the data plane in the communication in networks. SDNs involve several challenges around their security and their confidentiality. Ideally, SDNs should incorporate autonomous and adaptive systems for controlling the routing to be able to isolate network resources that may be malfunctioning or whose security has been compromised with malware. The current work introduces a novel agent-based framework that simulates SDN isolation protocols by means of trust and reputation models. This way, SDN programmers may estimate the repercussions of certain isolation protocols based on trust models before actually deploying the protocol into the network.

Spectrum and network measurements

CERN Document Server

Witte, Robert A

2014-01-01

This new edition of Spectrum and Network Measurements enables readers to understand the basic theory, relate it to measured results, and apply it when creating new designs. This comprehensive treatment of frequency domain measurements successfully consolidates all the pertinent theory into one text. It covers the theory and practice of spectrum and network measurements in electronic systems. It also provides thorough coverage of Fourier analysis, transmission lines, intermodulation distortion, signal-to-noise ratio and S-parameters.

Local difference measures between complex networks for dynamical system model evaluation.

Science.gov (United States)

Lange, Stefan; Donges, Jonathan F; Volkholz, Jan; Kurths, Jürgen

2015-01-01

A faithful modeling of real-world dynamical systems necessitates model evaluation. A recent promising methodological approach to this problem has been based on complex networks, which in turn have proven useful for the characterization of dynamical systems. In this context, we introduce three local network difference measures and demonstrate their capabilities in the field of climate modeling, where these measures facilitate a spatially explicit model evaluation.Building on a recent study by Feldhoff et al. [8] we comparatively analyze statistical and dynamical regional climate simulations of the South American monsoon system [corrected]. types of climate networks representing different aspects of rainfall dynamics are constructed from the modeled precipitation space-time series. Specifically, we define simple graphs based on positive as well as negative rank correlations between rainfall anomaly time series at different locations, and such based on spatial synchronizations of extreme rain events. An evaluation against respective networks built from daily satellite data provided by the Tropical Rainfall Measuring Mission 3B42 V7 reveals far greater differences in model performance between network types for a fixed but arbitrary climate model than between climate models for a fixed but arbitrary network type. We identify two sources of uncertainty in this respect. Firstly, climate variability limits fidelity, particularly in the case of the extreme event network; and secondly, larger geographical link lengths render link misplacements more likely, most notably in the case of the anticorrelation network; both contributions are quantified using suitable ensembles of surrogate networks. Our model evaluation approach is applicable to any multidimensional dynamical system and especially our simple graph difference measures are highly versatile as the graphs to be compared may be constructed in whatever way required. Generalizations to directed as well as edge- and node

Design of a stateless low-latency router architecture for green software-defined networking

Science.gov (United States)

Saldaña Cercós, Silvia; Ramos, Ramon M.; Ewald Eller, Ana C.; Martinello, Magnos; Ribeiro, Moisés. R. N.; Manolova Fagertun, Anna; Tafur Monroy, Idelfonso

2015-01-01

Expanding software defined networking (SDN) to transport networks requires new strategies to deal with the large number of flows that future core networks will have to face. New south-bound protocols within SDN have been proposed to benefit from having control plane detached from the data plane offering a cost- and energy-efficient forwarding engine. This paper presents an overview of a new approach named KeyFlow to simultaneously reduce latency, jitter, and power consumption in core network nodes. Results on an emulation platform indicate that round trip time (RTT) can be reduced above 50% compared to the reference protocol OpenFlow, specially when flow tables are densely populated. Jitter reduction has been demonstrated experimentally on a NetFPGA-based platform, and 57.3% power consumption reduction has been achieved.

A quantitative approach to measure road network information based on edge diversity

Science.gov (United States)

Wu, Xun; Zhang, Hong; Lan, Tian; Cao, Weiwei; He, Jing

2015-12-01

The measure of map information has been one of the key issues in assessing cartographic quality and map generalization algorithms. It is also important for developing efficient approaches to transfer geospatial information. Road network is the most common linear object in real world. Approximately describe road network information will benefit road map generalization, navigation map production and urban planning. Most of current approaches focused on node diversities and supposed that all the edges are the same, which is inconsistent to real-life condition, and thus show limitations in measuring network information. As real-life traffic flow are directed and of different quantities, the original undirected vector road map was first converted to a directed topographic connectivity map. Then in consideration of preferential attachment in complex network study and rich-club phenomenon in social network, the from and to weights of each edge are assigned. The from weight of a given edge is defined as the connectivity of its end node to the sum of the connectivities of all the neighbors of the from nodes of the edge. After getting the from and to weights of each edge, edge information, node information and the whole network structure information entropies could be obtained based on information theory. The approach has been applied to several 1 square mile road network samples. Results show that information entropies based on edge diversities could successfully describe the structural differences of road networks. This approach is a complementarity to current map information measurements, and can be extended to measure other kinds of geographical objects.

In-Network Data Processing in Software-Defined IoT with a Programmable Data Plane

Directory of Open Access Journals (Sweden)

Ki-Wook Kim

2018-01-01

Full Text Available Making an SDN data plane flexible enough to satisfy the various requirements of heterogeneous IoT applications is very desirable in terms of software-defined IoT (SD-IoT networking. Network devices with a programmable data plane provide an ability to dynamically add new packet- and data-processing procedures to IoT applications. The previously proposed solutions for the addition of the programmability feature to the SDN data plane provide extensibility for the packet-forwarding operations of new protocols, but IoT applications need a more flexible programmability for in-network data-processing operations (e.g., the sensing-data aggregation from thousands of sensor nodes. Moreover, some IoT models such as OMG DDS, oneM2M, and Eclipse SCADA use the publish-subscribe model that is difficult to represent using the operations of the existing message-centric data-plane models. We introduce a new in-network data-processing scheme for the SD-IoT data plane that defines an event-driven data-processing model that can express a variety of in-network data-processing cases in the SD-IoT environment. Also, the proposed model comprises a language for the programming of the data-processing procedures, while a flexible data-plane structure that can install and execute the programs at runtime is additionally presented. We demonstrate the flexibility of the proposed scheme by using sample programs in a number of example SD-IoT cases.

Software defined networking with OpenFlow

CERN Document Server

Azodolmolky, Siamak

2013-01-01

A step-by-step, example-based guide which will help you gain hands-on experience with the platforms and debugging tools on OpenFlow.If you are a network engineer, architect, junior researcher or an application developer, this book is ideal for you. You will need to have some level of network experience, knowledge of broad networking concepts, and some familiarity with day- to- day operation of computer networks. Ideally, you should also be familiar with programing scripting/languages (especially Python and Java), and system virtualization.

Physical layer impairments tolerance based lightpath provision in software defined optical network

Institute of Scientific and Technical Information of China (English)

Zhao Xianlong; Xu Xianze; Bai Huifeng

2017-01-01

As all-optical networks grow with ever increasing ultra-high speed, the communication quality suffers seriously from physical layer impairments ( PLIs) .The same problem still exists in software defined optical network ( SDON) controlled by OpenFlow.Aimed to solve this problem, a PLIs tol-erance based lightpath provision scheme is proposed for OpenFlow controlled optical networks.This proposed approach not only takes the OSNR model to represent those linear PLIs factors, but also in-troduces those nonlinear factors into the OSNR model.Thus, the proposed scheme is able to cover most PLIs factors of each optical link and conduct optical lightpath provison with better communica-tion quality.Moreover, PLIs tolerance model is also set up and considered in this work with some necessary extension to OpenFlow protocols to achieve better compatibility between physical layer im-pairments factors and various services connections.Simulation results show that the proposed scheme is able to get better performance in terms of packet loss rate and connection setup time.

A Quantum Cryptography Communication Network Based on Software Defined Network

Directory of Open Access Journals (Sweden)

Zhang Hongliang

2018-01-01

Full Text Available With the development of the Internet, information security has attracted great attention in today’s society, and quantum cryptography communication network based on quantum key distribution (QKD is a very important part of this field, since the quantum key distribution combined with one-time-pad encryption scheme can guarantee the unconditional security of the information. The secret key generated by quantum key distribution protocols is a very valuable resource, so making full use of key resources is particularly important. Software definition network (SDN is a new type of network architecture, and it separates the control plane and the data plane of network devices through OpenFlow technology, thus it realizes the flexible control of the network resources. In this paper, a quantum cryptography communication network model based on SDN is proposed to realize the flexible control of quantum key resources in the whole cryptography communication network. Moreover, we propose a routing algorithm which takes into account both the hops and the end-to-end availible keys, so that the secret key generated by QKD can be used effectively. We also simulate this quantum cryptography communication network, and the result shows that based on SDN and the proposed routing algorithm the performance of this network is improved since the effective use of the quantum key resources.

Application of the ETOM framework for defining processes in the telecommunication systems management network of the Serbian Army

Directory of Open Access Journals (Sweden)

Vladimir B. Suša

2013-10-01

Full Text Available This paper deals with management system requirements in telecommunications. A TMN (Telecommunication Management Network is necessary to be well designed and constantly upgraded. The  ETOM (Enhanced Telecommunication Operation Map framework, defined by the ITU-T Recommendation M.3050, is used to describe various processes that occur in the network for monitoring and control of military telecommunications systems. Their definition is an essential precondition for introducing management applications that would manage all of the processes in their end-to-end structure. Telecommunication networks are categorized in  accordance withg their functions. A set of relevant network processes important for supervision and management is explained for each described subsystem. This defining represents a prerequisite for the management application configuration which aims to automate management functions and services. eTOM frame and its implementation in telecommunication management networks ETOM is defined as a telecommunication conceptual frame which includes all the processes that exist in a telecommunication network. It does not represent a telecommunication model, but gives a basic frame for all the processes to be included within. It ranges throughout three basic areas: operation processes, planning and development processes and production management. ETOM supports two different process grouping perspectives: horizontal and vertical. The aim of this kind of grouping is to provide the complete overview in all the processes a telecommunication management network should include. Horizontal grouping includes functional processes within the same managed system. Vertical grouping includes all the processes within a TMN. Overlapped horizontal and vertical group constellations enable a connected matrix structure of the eTOM frame. Operational processes within a TMN can be divided into a few categories: user-network interaction, services management and

A measure of the denseness of a phylogenetic network. [by sequenced proteins from extant species

Science.gov (United States)

Holmquist, R.

1978-01-01

An objective measure of phylogenetic denseness is developed to examine various phylogenetic criteria: alpha- and beta-hemoglobin, myoglobin, cytochrome c, and the parvalbumin family. Attention is given to the number of nucleotide replacements separating homologous sequences, and to the topology of the network (in other words, to the qualitative nature of the network as defined by how closely the studied species are related). Applications include quantitative comparisons of species origin, relation, and rates of evolution.

Network Compression as a Quality Measure for Protein Interaction Networks

Science.gov (United States)

Royer, Loic; Reimann, Matthias; Stewart, A. Francis; Schroeder, Michael

2012-01-01

With the advent of large-scale protein interaction studies, there is much debate about data quality. Can different noise levels in the measurements be assessed by analyzing network structure? Because proteomic regulation is inherently co-operative, modular and redundant, it is inherently compressible when represented as a network. Here we propose that network compression can be used to compare false positive and false negative noise levels in protein interaction networks. We validate this hypothesis by first confirming the detrimental effect of false positives and false negatives. Second, we show that gold standard networks are more compressible. Third, we show that compressibility correlates with co-expression, co-localization, and shared function. Fourth, we also observe correlation with better protein tagging methods, physiological expression in contrast to over-expression of tagged proteins, and smart pooling approaches for yeast two-hybrid screens. Overall, this new measure is a proxy for both sensitivity and specificity and gives complementary information to standard measures such as average degree and clustering coefficients. PMID:22719828

Experimental demonstration of bandwidth on demand (BoD) provisioning based on time scheduling in software-defined multi-domain optical networks

Science.gov (United States)

Zhao, Yongli; Li, Yajie; Wang, Xinbo; Chen, Bowen; Zhang, Jie

2016-09-01

A hierarchical software-defined networking (SDN) control architecture is designed for multi-domain optical networks with the Open Daylight (ODL) controller. The OpenFlow-based Control Virtual Network Interface (CVNI) protocol is deployed between the network orchestrator and the domain controllers. Then, a dynamic bandwidth on demand (BoD) provisioning solution is proposed based on time scheduling in software-defined multi-domain optical networks (SD-MDON). Shared Risk Link Groups (SRLG)-disjoint routing schemes are adopted to separate each tenant for reliability. The SD-MDON testbed is built based on the proposed hierarchical control architecture. Then the proposed time scheduling-based BoD (Ts-BoD) solution is experimentally demonstrated on the testbed. The performance of the Ts-BoD solution is evaluated with respect to blocking probability, resource utilization, and lightpath setup latency.

Evaluating measurement of dynamic constructs: defining a measurement model of derivatives.

Science.gov (United States)

Estabrook, Ryne

2015-03-01

While measurement evaluation has been embraced as an important step in psychological research, evaluating measurement structures with longitudinal data is fraught with limitations. This article defines and tests a measurement model of derivatives (MMOD), which is designed to assess the measurement structure of latent constructs both for analyses of between-person differences and for the analysis of change. Simulation results indicate that MMOD outperforms existing models for multivariate analysis and provides equivalent fit to data generation models. Additional simulations show MMOD capable of detecting differences in between-person and within-person factor structures. Model features, applications, and future directions are discussed. (c) 2015 APA, all rights reserved).

Dynamic Construction Scheme for Virtualization Security Service in Software-Defined Networks.

Science.gov (United States)

Lin, Zhaowen; Tao, Dan; Wang, Zhenji

2017-04-21

For a Software Defined Network (SDN), security is an important factor affecting its large-scale deployment. The existing security solutions for SDN mainly focus on the controller itself, which has to handle all the security protection tasks by using the programmability of the network. This will undoubtedly involve a heavy burden for the controller. More devastatingly, once the controller itself is attacked, the entire network will be paralyzed. Motivated by this, this paper proposes a novel security protection architecture for SDN. We design a security service orchestration center in the control plane of SDN, and this center physically decouples from the SDN controller and constructs SDN security services. We adopt virtualization technology to construct a security meta-function library, and propose a dynamic security service composition construction algorithm based on web service composition technology. The rule-combining method is used to combine security meta-functions to construct security services which meet the requirements of users. Moreover, the RETE algorithm is introduced to improve the efficiency of the rule-combining method. We evaluate our solutions in a realistic scenario based on OpenStack. Substantial experimental results demonstrate the effectiveness of our solutions that contribute to achieve the effective security protection with a small burden of the SDN controller.

Using Software-Defined Networking for Ransomware Mitigation: the Case of CryptoWall

OpenAIRE

Cabaj, Krzysztof; Mazurczyk, Wojciech

2016-01-01

Currently, different forms of ransomware are increasingly threatening Internet users. Modern ransomware encrypts important user data and it is only possible to recover it once a ransom has been paid. In this paper we show how Software-Defined Networking (SDN) can be utilized to improve ransomware mitigation. In more detail, we analyze the behavior of popular ransomware - CryptoWall - and, based on this knowledge, we propose two real-time mitigation methods. Then we designed the SDN-based syst...

Inverting radiometric measurements with a neural network

Science.gov (United States)

Measure, Edward M.; Yee, Young P.; Balding, Jeff M.; Watkins, Wendell R.

1992-02-01

A neural network scheme for retrieving remotely sensed vertical temperature profiles was applied to observed ground based radiometer measurements. The neural network used microwave radiance measurements and surface measurements of temperature and pressure as inputs. Because the microwave radiometer is capable of measuring 4 oxygen channels at 5 different elevation angles (9, 15, 25, 40, and 90 degs), 20 microwave measurements are potentially available. Because these measurements have considerable redundancy, a neural network was experimented with, accepting as inputs microwave measurements taken at 53.88 GHz, 40 deg; 57.45 GHz, 40 deg; and 57.45, 90 deg. The primary test site was located at White Sands Missile Range (WSMR), NM. Results are compared with measurements made simultaneously with balloon borne radiosonde instruments and with radiometric temperature retrievals made using more conventional retrieval algorithms. The neural network was trained using a Widrow-Hoff delta rule procedure. Functions of date to include season dependence in the retrieval process and functions of time to include diurnal effects were used as inputs to the neural network.

Design and performance evaluation of an OpenFlow-based control plane for software-defined elastic optical networks with direct-detection optical OFDM (DDO-OFDM) transmission.

Science.gov (United States)

Liu, Lei; Peng, Wei-Ren; Casellas, Ramon; Tsuritani, Takehiro; Morita, Itsuro; Martínez, Ricardo; Muñoz, Raül; Yoo, S J B

2014-01-13

Optical Orthogonal Frequency Division Multiplexing (O-OFDM), which transmits high speed optical signals using multiple spectrally overlapped lower-speed subcarriers, is a promising candidate for supporting future elastic optical networks. In contrast to previous works which focus on Coherent Optical OFDM (CO-OFDM), in this paper, we consider the direct-detection optical OFDM (DDO-OFDM) as the transport technique, which leads to simpler hardware and software realizations, potentially offering a low-cost solution for elastic optical networks, especially in metro networks, and short or medium distance core networks. Based on this network scenario, we design and deploy a software-defined networking (SDN) control plane enabled by extending OpenFlow, detailing the network architecture, the routing and spectrum assignment algorithm, OpenFlow protocol extensions and the experimental validation. To the best of our knowledge, it is the first time that an OpenFlow-based control plane is reported and its performance is quantitatively measured in an elastic optical network with DDO-OFDM transmission.

Improving Distributed Denial of Service (DDOS Detection using Entropy Method in Software Defined Network (SDN

Directory of Open Access Journals (Sweden)

Maman Abdurohman

2017-12-01

Full Text Available This research proposed a new method to enhance Distributed Denial of Service (DDoS detection attack on Software Defined Network (SDN environment. This research utilized the OpenFlow controller of SDN for DDoS attack detection using modified method and regarding entropy value. The new method would check whether the traffic was a normal traffic or DDoS attack by measuring the randomness of the packets. This method consisted of two steps, detecting attack and checking the entropy. The result shows that the new method can reduce false positive when there is a temporary and sudden increase in normal traffic. The new method succeeds in not detecting this as a DDoS attack. Compared to previous methods, this proposed method can enhance DDoS attack detection on SDN environment.

A DDoS Attack Detection Method Based on SVM in Software Defined Network

Directory of Open Access Journals (Sweden)

Jin Ye

2018-01-01

Full Text Available The detection of DDoS attacks is an important topic in the field of network security. The occurrence of software defined network (SDN (Zhang et al., 2018 brings up some novel methods to this topic in which some deep learning algorithm is adopted to model the attack behavior based on collecting from the SDN controller. However, the existing methods such as neural network algorithm are not practical enough to be applied. In this paper, the SDN environment by mininet and floodlight (Ning et al., 2014 simulation platform is constructed, 6-tuple characteristic values of the switch flow table is extracted, and then DDoS attack model is built by combining the SVM classification algorithms. The experiments show that average accuracy rate of our method is 95.24% with a small amount of flow collecting. Our work is of good value for the detection of DDoS attack in SDN.

AmeriFlux Measurement Network: Science Team Research

Energy Technology Data Exchange (ETDEWEB)

Law, B E

2012-12-12

Research involves analysis and field direction of AmeriFlux operations, and the PI provides scientific leadership of the AmeriFlux network. Activities include the coordination and quality assurance of measurements across AmeriFlux network sites, synthesis of results across the network, organizing and supporting the annual Science Team Meeting, and communicating AmeriFlux results to the scientific community and other users. Objectives of measurement research include (i) coordination of flux and biometric measurement protocols (ii) timely data delivery to the Carbon Dioxide Information and Analysis Center (CDIAC); and (iii) assurance of data quality of flux and ecosystem measurements contributed by AmeriFlux sites. Objectives of integration and synthesis activities include (i) integration of site data into network-wide synthesis products; and (ii) participation in the analysis, modeling and interpretation of network data products. Communications objectives include (i) organizing an annual meeting of AmeriFlux investigators for reporting annual flux measurements and exchanging scientific information on ecosystem carbon budgets; (ii) developing focused topics for analysis and publication; and (iii) developing data reporting protocols in support of AmeriFlux network goals.

Integration of neural networks with fuzzy reasoning for measuring operational parameters in a nuclear reactor

International Nuclear Information System (INIS)

Ikonomopoulos, A.; Tsoukalas, L.H.

1993-01-01

A novel approach is described for measuring variables with operational significance in a complex system such as a nuclear reactor. The methodology is based on the integration of artificial neural networks with fuzzy reasoning. Neural networks are used to map dynamic time series to a set of user-defined linguistic labels called fuzzy values. The process takes place in a manner analogous to that of measurement. Hence, the entire procedure is referred to as virtual measurement and its software implementation as a virtual measuring device. An optimization algorithm based on information criteria and fuzzy algebra augments the process and assists in the identification of different states of the monitored parameter. The proposed technique is applied for monitoring parameters such as performance, valve position, transient type, and reactivity. The results obtained from the application of the neural network-fuzzy reasoning integration in a high power research reactor clearly demonstrate the excellent tolerance of the virtual measuring device to faulty signals as well as its ability to accommodate noisy inputs

State-of-the-art on Virtualization and Software Defined Networking for Efficient Resource Allocation on Multi-tenant 5G Networks

Directory of Open Access Journals (Sweden)

Tsirakis Christos

2017-01-01

Full Text Available Global data traffic explosion is expected to set stringent requirements for next generation networks in the next decades. Besides, very low latencies will have to be guaranteed for enabling new delay critical services. However, current Software Defined Networking (SDN solutions have limitations in terms of separating both data and control planes among tenants/operators, and the capability to adapt to new or changing requirements. Moreover, some virtualization schemes do not ensure isolation of resources and do not guarantee bandwidth across the entities. While some others fail to provide flexibility to the slices to customize the resource allocation across the users. Therefore, novel SDN and virtualization techniques should be implemented to realize the upcoming 5G network that will facilitate at least efficient resource allocation and multi-tenancy among the plethora of different requirements.

Measure of robustness for complex networks

Science.gov (United States)

Youssef, Mina Nabil

Critical infrastructures are repeatedly attacked by external triggers causing tremendous amount of damages. Any infrastructure can be studied using the powerful theory of complex networks. A complex network is composed of extremely large number of different elements that exchange commodities providing significant services. The main functions of complex networks can be damaged by different types of attacks and failures that degrade the network performance. These attacks and failures are considered as disturbing dynamics, such as the spread of viruses in computer networks, the spread of epidemics in social networks, and the cascading failures in power grids. Depending on the network structure and the attack strength, every network differently suffers damages and performance degradation. Hence, quantifying the robustness of complex networks becomes an essential task. In this dissertation, new metrics are introduced to measure the robustness of technological and social networks with respect to the spread of epidemics, and the robustness of power grids with respect to cascading failures. First, we introduce a new metric called the Viral Conductance (VCSIS ) to assess the robustness of networks with respect to the spread of epidemics that are modeled through the susceptible/infected/susceptible (SIS) epidemic approach. In contrast to assessing the robustness of networks based on a classical metric, the epidemic threshold, the new metric integrates the fraction of infected nodes at steady state for all possible effective infection strengths. Through examples, VCSIS provides more insights about the robustness of networks than the epidemic threshold. In addition, both the paradoxical robustness of Barabasi-Albert preferential attachment networks and the effect of the topology on the steady state infection are studied, to show the importance of quantifying the robustness of networks. Second, a new metric VCSIR is introduced to assess the robustness of networks with respect

Measurement methods on the complexity of network

Institute of Scientific and Technical Information of China (English)

LIN Lin; DING Gang; CHEN Guo-song

2010-01-01

Based on the size of network and the number of paths in the network,we proposed a model of topology complexity of a network to measure the topology complexity of the network.Based on the analyses of the effects of the number of the equipment,the types of equipment and the processing time of the node on the complexity of the network with the equipment-constrained,a complexity model of equipment-constrained network was constructed to measure the integrated complexity of the equipment-constrained network.The algorithms for the two models were also developed.An automatic generator of the random single label network was developed to test the models.The results show that the models can correctly evaluate the topology complexity and the integrated complexity of the networks.

AziSA: an architecture for underground measurement and control networks - 2nd International Conference on Wireless Communications...

CSIR Research Space (South Africa)

Stewart, R

2008-08-01

Full Text Available AziSA is an architecture for measurement and control networks that can be used to collect, store and facilitate the analysis of data from challenging underground environments. AziSA defines four node classes, two (Classes Four and Three...

Hardening Software Defined Networks

Science.gov (United States)

2014-07-01

Zarifis,Peyman Kazemian:Leveraging SDN layering to systematically troubleshoot networks. HotSDN 2013: 37-42 21. Aurojit Panda ,Colin Scott,Ali Ghodsi...Unlimited. 21 ICN.SIGCOMM 2013: 147-158 23. Sangjin Han (U.C.Berkeley), Norbert Egi (Huawei Corp.), Aurojit Panda , Sylvia Ratnasamy (U.C.Berkeley...balancers, traffic-shapers, and so on. SDN brings software and processing power to bear on all this complexity. While a large Data Center may be

Evaluating airline energy efficiency: An integrated approach with Network Epsilon-based Measure and Network Slacks-based Measure

International Nuclear Information System (INIS)

Xu, Xin; Cui, Qiang

2017-01-01

This paper focuses on evaluating airline energy efficiency, which is firstly divided into four stages: Operations Stage, Fleet Maintenance Stage, Services Stage and Sales Stage. The new four-stage network structure of airline energy efficiency is a modification of existing models. A new approach, integrated with Network Epsilon-based Measure and Network Slacks-based Measure, is applied to assess the overall energy efficiency and divisional efficiency of 19 international airlines from 2008 to 2014. The influencing factors of airline energy efficiency are analyzed through the regression analysis. The results indicate the followings: 1. The integrated model can identify the benchmarking airlines in the overall system and stages. 2. Most airlines' energy efficiencies keep steady during the period, except for some sharply fluctuations. The efficiency decreases mainly centralized in the year 2008–2011, affected by the financial crisis in the USA. 3. The average age of fleet is positively correlated with the overall energy efficiency, and each divisional efficiency has different significant influencing factors. - Highlights: • An integrated approach with Network Epsilon-based Measure and Network Slacks-based Measure is developed. • 19 airlines' energy efficiencies are evaluated. • Garuda Indonesia has the highest overall energy efficiency.

Enhanced method of fast re-routing with load balancing in software-defined networks

Science.gov (United States)

Lemeshko, Oleksandr; Yeremenko, Oleksandra

2017-11-01

A two-level method of fast re-routing with load balancing in a software-defined network (SDN) is proposed. The novelty of the method consists, firstly, in the introduction of a two-level hierarchy of calculating the routing variables responsible for the formation of the primary and backup paths, and secondly, in ensuring a balanced load of the communication links of the network, which meets the requirements of the traffic engineering concept. The method provides implementation of link, node, path, and bandwidth protection schemes for fast re-routing in SDN. The separation in accordance with the interaction prediction principle along two hierarchical levels of the calculation functions of the primary (lower level) and backup (upper level) routes allowed to abandon the initial sufficiently large and nonlinear optimization problem by transiting to the iterative solution of linear optimization problems of half the dimension. The analysis of the proposed method confirmed its efficiency and effectiveness in terms of obtaining optimal solutions for ensuring balanced load of communication links and implementing the required network element protection schemes for fast re-routing in SDN.

Burst switching without guard interval in all-optical software-define star intra-data center network

Science.gov (United States)

Ji, Philip N.; Wang, Ting

2014-02-01

Optical switching has been introduced in intra-data center networks (DCNs) to increase capacity and to reduce power consumption. Recently we proposed a star MIMO OFDM-based all-optical DCN with burst switching and software-defined networking. Here, we introduce the control procedure for the star DCN in detail for the first time. The timing, signaling, and operation are described for each step to achieve efficient bandwidth resource utilization. Furthermore, the guidelines for the burst assembling period selection that allows burst switching without guard interval are discussed. The star all-optical DCN offers flexible and efficient control for next-generation data center application.

Investments in power networks and alternative measures

International Nuclear Information System (INIS)

2003-01-01

Measures taken with respect to production and consumption are often alternatives to investments in the power networks. While decisions about production and consumption are taken in the market, the network operation is subject to monopoly regulation. In the central network, Statnett's commission is to invest on the basis of socioeconomic profitability. There is a need for much better coordination between network investments and other measures in the power system. The price signal from the market and general tariffs are not sufficient to realize optimal solutions, and there is a need for a ''visible hand'' that can contribute to the realization of the solutions that are the best in each individual situation. It is desirable to create processes and incentives that realize the best solutions, independently of dealing with network investments, local power production or other measures.

Measurement of company effectiveness using analytic network process method

Science.gov (United States)

Goran, Janjić; Zorana, Tanasić; Borut, Kosec

2017-07-01

The sustainable development of an organisation is monitored through the organisation's performance, which beforehand incorporates all stakeholders' requirements in its strategy. The strategic management concept enables organisations to monitor and evaluate their effectiveness along with efficiency by monitoring of the implementation of set strategic goals. In the process of monitoring and measuring effectiveness, an organisation can use multiple-criteria decision-making methods as help. This study uses the method of analytic network process (ANP) to define the weight factors of the mutual influences of all the important elements of an organisation's strategy. The calculation of an organisation's effectiveness is based on the weight factors and the degree of fulfilment of the goal values of the strategic map measures. New business conditions influence the changes in the importance of certain elements of an organisation's business in relation to competitive advantage on the market, and on the market, increasing emphasis is given to non-material resources in the process of selection of the organisation's most important measures.

Directed weighted network structure analysis of complex impedance measurements for characterizing oil-in-water bubbly flow.

Science.gov (United States)

Gao, Zhong-Ke; Dang, Wei-Dong; Xue, Le; Zhang, Shan-Shan

2017-03-01

Characterizing the flow structure underlying the evolution of oil-in-water bubbly flow remains a contemporary challenge of great interests and complexity. In particular, the oil droplets dispersing in a water continuum with diverse size make the study of oil-in-water bubbly flow really difficult. To study this issue, we first design a novel complex impedance sensor and systematically conduct vertical oil-water flow experiments. Based on the multivariate complex impedance measurements, we define modalities associated with the spatial transient flow structures and construct modality transition-based network for each flow condition to study the evolution of flow structures. In order to reveal the unique flow structures underlying the oil-in-water bubbly flow, we filter the inferred modality transition-based network by removing the edges with small weight and resulting isolated nodes. Then, the weighted clustering coefficient entropy and weighted average path length are employed for quantitatively assessing the original network and filtered network. The differences in network measures enable to efficiently characterize the evolution of the oil-in-water bubbly flow structures.

Measurement of Online Social Networks

Science.gov (United States)

Gjoka, Mina

2010-01-01

In recent years, the popularity of online social networks (OSN) has risen to unprecedented levels, with the most popular ones having hundreds of millions of users. This success has generated interest within the networking community and has given rise to a number of measurement and characterization studies, which provide a first step towards their…

An a posteriori measure of network modularity [v3; ref status: indexed, http://f1000r.es/2ju

Directory of Open Access Journals (Sweden)

Timothée Poisot

2013-12-01

Full Text Available Measuring the modularity of networks, and how it deviates from random expectations, important to understand their structure and emerging properties. Several measures exist to assess modularity, which when applied to the same network, can return both different modularity values (i.e. different estimates of how modular the network is and different module compositions (i.e. different groups of species forming said modules. More importantly, as each optimization method uses a different optimization criterion, there is a need to have an a posteriori measure serving as an equivalent of a goodness-of-fit. In this article, I propose such a measure of modularity, which is simply defined as the ratio of interactions established between members of the same modules vs. members of different modules. I apply this measure to a large dataset of 290 ecological networks representing host–parasite (bipartite and predator–prey (unipartite interactions, to show how the results are easy to interpret and present especially to a broad audience not familiar with modularity analyses, but still can reveal new features about modularity and the ways to measure it.

Augmented Lagrange Programming Neural Network for Localization Using Time-Difference-of-Arrival Measurements.

Science.gov (United States)

Han, Zifa; Leung, Chi Sing; So, Hing Cheung; Constantinides, Anthony George

2017-08-15

A commonly used measurement model for locating a mobile source is time-difference-of-arrival (TDOA). As each TDOA measurement defines a hyperbola, it is not straightforward to compute the mobile source position due to the nonlinear relationship in the measurements. This brief exploits the Lagrange programming neural network (LPNN), which provides a general framework to solve nonlinear constrained optimization problems, for the TDOA-based localization. The local stability of the proposed LPNN solution is also analyzed. Simulation results are included to evaluate the localization accuracy of the LPNN scheme by comparing with the state-of-the-art methods and the optimality benchmark of Cramér-Rao lower bound.

Incentivizing and Evaluating Internet-Wide Network Measurements

Science.gov (United States)

2014-03-01

Romania . . . . . . . . . . . . . . . . . . . . . . 62 Figure A.20 Cumulative SCR for Egypt . . . . . . . . . . . . . . . . . . . . . . . 63 Figure A...defined in RFC 1918 [29] and these packets should never be routed in the public Internet. These packets, however, are often filtered in the network core...Turkey, Singapore, Russia, Romania , Pakistan, Philippines, Netherlands, Indonesia, Hun- gary, Guatemala, Finland, Denmark, Switzerland, Brazil

On the Update Problems for Software Defined Networks

Directory of Open Access Journals (Sweden)

V. A. Zakharov

2014-01-01

Full Text Available The designing of network update algorithms is urgent for the development of SDN control software. A particular case of Network Update Problem is that of restoring seamlessly a given network configuration after some packet forwarding rules have been disabled (say, at the expiry of their time-outs. We study this problem in the framework of a formal model of SDN, develop correct and safe network recovering algorithms, and show that in general case there is no way to restore network configuration seamlessly without referring to priorities of packet forwarding rules.

Software defined wireless sensor networks application opportunities for efficient network management: a survey

CSIR Research Space (South Africa)

Modieginyane, KM

2017-03-01

Full Text Available Wireless Sensor Networks (WSNs) are commonly used information technologies of modern networking and computing platforms. Today's network computing applications are faced with a high demand of powerful network functionalities. Functional network...

National network of environment radioactivity measurements. Press kit

International Nuclear Information System (INIS)

2010-01-01

This document first presents the objectives, challenges, context, operation and actors of the French national network of environment radioactivity measurements. It discusses the reasons for these measurements, the way they are performed, who perform them and how they are transmitted to the national network. It describes the quality policy for these measurements, and how this network is at the service of authorities, experts and population. It outlines the originality of the French approach within the European Union, and how this network takes the population expectations and their evolution into account

A Hierarchy of Network Performance Characteristics for Grid Applications and Services

Energy Technology Data Exchange (ETDEWEB)

Lowekamp, B

2004-07-06

This document describes a standard set of network characteristics that are useful for Grid applications and services as well as a classification hierarchy for these characteristics. The goal of this work is to identify the various types of network measurements according to the network characteristic they measure and the network entity on which they are taken. This document defines standard terminology to describe those measurements, but it does not attempt to define new standard measurement methodologies or attempt to define the best measurement methodologies to use for grid applications. However, it does attempt to point out the advantages and disadvantages of different measurement methodologies. This document was motivated by the need for the interchange of measurements taken by various systems in the Grid and to develop a common dictionary to facilitate discussions about and specifications for measurement systems. The application of this naming system will facilitate the creation of common schemata for describing network monitoring data in Grid Monitoring and Discovery Services, and thus help to address portability issues between the wide variety of network measurements used between sites of a Grid.

A method of reconstructing the spatial measurement network by mobile measurement transmitter for shipbuilding

International Nuclear Information System (INIS)

Guo, Siyang; Lin, Jiarui; Yang, Linghui; Ren, Yongjie; Guo, Yin

2017-01-01

The workshop Measurement Position System (wMPS) is a distributed measurement system which is suitable for the large-scale metrology. However, there are some inevitable measurement problems in the shipbuilding industry, such as the restriction by obstacles and limited measurement range. To deal with these factors, this paper presents a method of reconstructing the spatial measurement network by mobile transmitter. A high-precision coordinate control network with more than six target points is established. The mobile measuring transmitter can be added into the measurement network using this coordinate control network with the spatial resection method. This method reconstructs the measurement network and broadens the measurement scope efficiently. To verify this method, two comparison experiments are designed with the laser tracker as the reference. The results demonstrate that the accuracy of point-to-point length is better than 0.4mm and the accuracy of coordinate measurement is better than 0.6mm. (paper)

Centrality measures in temporal networks with time series analysis

Science.gov (United States)

Huang, Qiangjuan; Zhao, Chengli; Zhang, Xue; Wang, Xiaojie; Yi, Dongyun

2017-05-01

The study of identifying important nodes in networks has a wide application in different fields. However, the current researches are mostly based on static or aggregated networks. Recently, the increasing attention to networks with time-varying structure promotes the study of node centrality in temporal networks. In this paper, we define a supra-evolution matrix to depict the temporal network structure. With using of the time series analysis, the relationships between different time layers can be learned automatically. Based on the special form of the supra-evolution matrix, the eigenvector centrality calculating problem is turned into the calculation of eigenvectors of several low-dimensional matrices through iteration, which effectively reduces the computational complexity. Experiments are carried out on two real-world temporal networks, Enron email communication network and DBLP co-authorship network, the results of which show that our method is more efficient at discovering the important nodes than the common aggregating method.

A Review of Anomaly Detection Techniques and Distributed Denial of Service (DDoS on Software Defined Network (SDN

Directory of Open Access Journals (Sweden)

M. H. H. Khairi

2018-04-01

Full Text Available Software defined network (SDN is a network architecture in which the network traffic may be operated and managed dynamically according to user requirements and demands. Issue of security is one of the big challenges of SDN because different attacks may affect performance and these attacks can be classified into different types. One of the famous attacks is distributed denial of service (DDoS. SDN is a new networking approach that is introduced with the goal to simplify the network management by separating the data and control planes. However, the separation leads to the emergence of new types of distributed denial-of-service (DDOS attacks on SDN networks. The centralized role of the controller in SDN makes it a perfect target for the attackers. Such attacks can easily bring down the entire network by bringing down the controller. This research explains DDoS attacks and the anomaly detection as one of the famous detection techniques for intelligent networks.

Multi-attribute integrated measurement of node importance in complex networks.

Science.gov (United States)

Wang, Shibo; Zhao, Jinlou

2015-11-01

The measure of node importance in complex networks is very important to the research of networks stability and robustness; it also can ensure the security of the whole network. Most researchers have used a single indicator to measure the networks node importance, so that the obtained measurement results only reflect certain aspects of the networks with a loss of information. Meanwhile, because of the difference of networks topology, the nodes' importance should be described by combining the character of the networks topology. Most of the existing evaluation algorithms cannot completely reflect the circumstances of complex networks, so this paper takes into account the degree of centrality, the relative closeness centrality, clustering coefficient, and topology potential and raises an integrated measuring method to measure the nodes' importance. This method can reflect nodes' internal and outside attributes and eliminate the influence of network structure on the node importance. The experiments of karate network and dolphin network show that networks topology structure integrated measure has smaller range of metrical result than a single indicator and more universal. Experiments show that attacking the North American power grid and the Internet network with the method has a faster convergence speed than other methods.

Redefining the Indirect Approach, Defining Special Operations Forces (SOF Power, and the Global Networking of SOF

Directory of Open Access Journals (Sweden)

Scott Morrison

2014-07-01

Full Text Available The current Defense Strategy assigns Special Operations Forces (SOF to play a central role in countering terrorism, weapons of mass destruction, and irregular warfare. However, there has been little published that defines the role of Special Operations alongside air, land, and sea domains. The U.S. Special Operations Community struggles to define its own theoretical concepts such as direct approach and indirect approach. The U.S. SOF circles typically define direct approach with direct action and the indirect approach with foreign internal defense or security force assistance. Military theorist Liddell Hart viewed the indirect approach as a method to orient upon, target, and upset an adversary’s equilibrium in order to plan for and direct decisive blows. Today, the SOF indirect approach is arguable more applicable due to the prevalence of non-state threats and internal conflicts. Following Hart’s definition, precision raids are among the integral components of a broader application of the indirect approach. The approach also networks U.S. government power as a force when used in concert with allies and local partners. Global networking along with balanced precision raids will exponentially increase the utility of SOF power and position it to appropriately complement all domains to tackle 21st century challenges.

Resting-state test-retest reliability of a priori defined canonical networks over different preprocessing steps.

Science.gov (United States)

Varikuti, Deepthi P; Hoffstaedter, Felix; Genon, Sarah; Schwender, Holger; Reid, Andrew T; Eickhoff, Simon B

2017-04-01

Resting-state functional connectivity analysis has become a widely used method for the investigation of human brain connectivity and pathology. The measurement of neuronal activity by functional MRI, however, is impeded by various nuisance signals that reduce the stability of functional connectivity. Several methods exist to address this predicament, but little consensus has yet been reached on the most appropriate approach. Given the crucial importance of reliability for the development of clinical applications, we here investigated the effect of various confound removal approaches on the test-retest reliability of functional-connectivity estimates in two previously defined functional brain networks. Our results showed that gray matter masking improved the reliability of connectivity estimates, whereas denoising based on principal components analysis reduced it. We additionally observed that refraining from using any correction for global signals provided the best test-retest reliability, but failed to reproduce anti-correlations between what have been previously described as antagonistic networks. This suggests that improved reliability can come at the expense of potentially poorer biological validity. Consistent with this, we observed that reliability was proportional to the retained variance, which presumably included structured noise, such as reliable nuisance signals (for instance, noise induced by cardiac processes). We conclude that compromises are necessary between maximizing test-retest reliability and removing variance that may be attributable to non-neuronal sources.

Resting-state test-retest reliability of a priori defined canonical networks over different preprocessing steps

Science.gov (United States)

Varikuti, Deepthi P.; Hoffstaedter, Felix; Genon, Sarah; Schwender, Holger; Reid, Andrew T.; Eickhoff, Simon B.

2016-01-01

Resting-state functional connectivity analysis has become a widely used method for the investigation of human brain connectivity and pathology. The measurement of neuronal activity by functional MRI, however, is impeded by various nuisance signals that reduce the stability of functional connectivity. Several methods exist to address this predicament, but little consensus has yet been reached on the most appropriate approach. Given the crucial importance of reliability for the development of clinical applications, we here investigated the effect of various confound removal approaches on the test-retest reliability of functional-connectivity estimates in two previously defined functional brain networks. Our results showed that grey matter masking improved the reliability of connectivity estimates, whereas de-noising based on principal components analysis reduced it. We additionally observed that refraining from using any correction for global signals provided the best test-retest reliability, but failed to reproduce anti-correlations between what have been previously described as antagonistic networks. This suggests that improved reliability can come at the expense of potentially poorer biological validity. Consistent with this, we observed that reliability was proportional to the retained variance, which presumably included structured noise, such as reliable nuisance signals (for instance, noise induced by cardiac processes). We conclude that compromises are necessary between maximizing test-retest reliability and removing variance that may be attributable to non-neuronal sources. PMID:27550015

Data analysis-based autonomic bandwidth adjustment in software defined multi-vendor optical transport networks.

Science.gov (United States)

Li, Yajie; Zhao, Yongli; Zhang, Jie; Yu, Xiaosong; Jing, Ruiquan

2017-11-27

Network operators generally provide dedicated lightpaths for customers to meet the demand for high-quality transmission. Considering the variation of traffic load, customers usually rent peak bandwidth that exceeds the practical average traffic requirement. In this case, bandwidth provisioning is unmetered and customers have to pay according to peak bandwidth. Supposing that network operators could keep track of traffic load and allocate bandwidth dynamically, bandwidth can be provided as a metered service and customers would pay for the bandwidth that they actually use. To achieve cost-effective bandwidth provisioning, this paper proposes an autonomic bandwidth adjustment scheme based on data analysis of traffic load. The scheme is implemented in a software defined networking (SDN) controller and is demonstrated in the field trial of multi-vendor optical transport networks. The field trial shows that the proposed scheme can track traffic load and realize autonomic bandwidth adjustment. In addition, a simulation experiment is conducted to evaluate the performance of the proposed scheme. We also investigate the impact of different parameters on autonomic bandwidth adjustment. Simulation results show that the step size and adjustment period have significant influences on bandwidth savings and packet loss. A small value of step size and adjustment period can bring more benefits by tracking traffic variation with high accuracy. For network operators, the scheme can serve as technical support of realizing bandwidth as metered service in the future.

Centrality measures for immunization of weighted networks

Directory of Open Access Journals (Sweden)

Mohammad Khansari

2016-03-01

Full Text Available Effective immunization of individual communities with minimal cost in vaccination has made great discussion surrounding the realm of complex networks. Meanwhile, proper realization of relationship among people in society and applying it to social networks brings about substantial improvements in immunization. Accordingly, weighted graph in which link weights represent the intensity and intimacy of relationships is an acceptable approach. In this work we employ weighted graphs and a wide variety of weighted centrality measures to distinguish important individuals in contagion of diseases. Furthermore, we propose new centrality measures for weighted networks. Our experimental results show that Radiality-Degree centrality is satisfying for weighted BA networks. Additionally, PageRank-Degree and Radiality-Degree centralities showmoreacceptable performance in targeted immunization of weighted networks.

On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy

Directory of Open Access Journals (Sweden)

Mikołaj Morzy

2017-01-01

Full Text Available One of the most popular methods of estimating the complexity of networks is to measure the entropy of network invariants, such as adjacency matrices or degree sequences. Unfortunately, entropy and all entropy-based information-theoretic measures have several vulnerabilities. These measures neither are independent of a particular representation of the network nor can capture the properties of the generative process, which produces the network. Instead, we advocate the use of the algorithmic entropy as the basis for complexity definition for networks. Algorithmic entropy (also known as Kolmogorov complexity or K-complexity for short evaluates the complexity of the description required for a lossless recreation of the network. This measure is not affected by a particular choice of network features and it does not depend on the method of network representation. We perform experiments on Shannon entropy and K-complexity for gradually evolving networks. The results of these experiments point to K-complexity as the more robust and reliable measure of network complexity. The original contribution of the paper includes the introduction of several new entropy-deceiving networks and the empirical comparison of entropy and K-complexity as fundamental quantities for constructing complexity measures for networks.

Resistance and Security Index of Networks: Structural Information Perspective of Network Security.

Science.gov (United States)

Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

2016-06-03

Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks.

Resistance and Security Index of Networks: Structural Information Perspective of Network Security

Science.gov (United States)

Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

2016-01-01

Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks. PMID:27255783

Resistance and Security Index of Networks: Structural Information Perspective of Network Security

Science.gov (United States)

Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

2016-06-01

Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks.

Cross-layer shared protection strategy towards data plane in software defined optical networks

Science.gov (United States)

Xiong, Yu; Li, Zhiqiang; Zhou, Bin; Dong, Xiancun

2018-04-01

In order to ensure reliable data transmission on the data plane and minimize resource consumption, a novel protection strategy towards data plane is proposed in software defined optical networks (SDON). Firstly, we establish a SDON architecture with hierarchical structure of data plane, which divides the data plane into four layers for getting fine-grained bandwidth resource. Then, we design the cross-layer routing and resource allocation based on this network architecture. Through jointly considering the bandwidth resource on all the layers, the SDN controller could allocate bandwidth resource to working path and backup path in an economical manner. Next, we construct auxiliary graphs and transform the shared protection problem into the graph vertex coloring problem. Therefore, the resource consumption on backup paths can be reduced further. The simulation results demonstrate that the proposed protection strategy can achieve lower protection overhead and higher resource utilization ratio.

Representative Delay Measurements (RDM: Facing the Challenge of Modern Networks

Directory of Open Access Journals (Sweden)

Joachim Fabini

2015-02-01

Full Text Available Network access technologies have evolved significantly in the last years. They deploy novel mechanisms like reactive capacity allocation and time-slotted operation to optimize overall network capacity. From a single node's perspective, such optimizations decrease network determinism and measurement repeatability. Evolving application fields like machine to machine (M2M communications or real-time gaming often have strict real-time requirements to operate correctly. Highly accurate delay measurements are necessary to monitor network compliance with application demands or to detect deviations of normal network behavior, which may be caused by network failures, misconfigurations or attacks. This paper analyzes factors that challenge active delay measurements in modern networks. It introduces the Representative Delay Measurement tool (RDM that addresses these factors and proposes solutions that conform to requirements of the recently published RFC7312. Delay measurement results acquired using RDM in live networks confirm that advanced measurement methods can significantly improve the quality of measurement samples by isolating systematic network behavior. The resulting high-quality samples are one prerequisite for accurate statistics that support proper operation of subsequent algorithms and applications.

Software Defined Networking challenges and future direction: A case study of implementing SDN features on OpenStack private cloud

International Nuclear Information System (INIS)

Shamugam, Veeramani; Murray, I; Leong, J A; Sidhu, Amandeep S

2016-01-01

Cloud computing provides services on demand instantly, such as access to network infrastructure consisting of computing hardware, operating systems, network storage, database and applications. Network usage and demands are growing at a very fast rate and to meet the current requirements, there is a need for automatic infrastructure scaling. Traditional networks are difficult to automate because of the distributed nature of their decision making process for switching or routing which are collocated on the same device. Managing complex environments using traditional networks is time-consuming and expensive, especially in the case of generating virtual machines, migration and network configuration. To mitigate the challenges, network operations require efficient, flexible, agile and scalable software defined networks (SDN). This paper discuss various issues in SDN and suggests how to mitigate the network management related issues. A private cloud prototype test bed was setup to implement the SDN on the OpenStack platform to test and evaluate the various network performances provided by the various configurations. (paper)

Software Defined Networking challenges and future direction: A case study of implementing SDN features on OpenStack private cloud

Science.gov (United States)

Shamugam, Veeramani; Murray, I.; Leong, J. A.; Sidhu, Amandeep S.

2016-03-01

Cloud computing provides services on demand instantly, such as access to network infrastructure consisting of computing hardware, operating systems, network storage, database and applications. Network usage and demands are growing at a very fast rate and to meet the current requirements, there is a need for automatic infrastructure scaling. Traditional networks are difficult to automate because of the distributed nature of their decision making process for switching or routing which are collocated on the same device. Managing complex environments using traditional networks is time-consuming and expensive, especially in the case of generating virtual machines, migration and network configuration. To mitigate the challenges, network operations require efficient, flexible, agile and scalable software defined networks (SDN). This paper discuss various issues in SDN and suggests how to mitigate the network management related issues. A private cloud prototype test bed was setup to implement the SDN on the OpenStack platform to test and evaluate the various network performances provided by the various configurations.

Performance evaluation of multi-stratum resources integration based on network function virtualization in software defined elastic data center optical interconnect.

Science.gov (United States)

Yang, Hui; Zhang, Jie; Ji, Yuefeng; Tian, Rui; Han, Jianrui; Lee, Young

2015-11-30

Data center interconnect with elastic optical network is a promising scenario to meet the high burstiness and high-bandwidth requirements of data center services. In our previous work, we implemented multi-stratum resilience between IP and elastic optical networks that allows to accommodate data center services. In view of this, this study extends to consider the resource integration by breaking the limit of network device, which can enhance the resource utilization. We propose a novel multi-stratum resources integration (MSRI) architecture based on network function virtualization in software defined elastic data center optical interconnect. A resource integrated mapping (RIM) scheme for MSRI is introduced in the proposed architecture. The MSRI can accommodate the data center services with resources integration when the single function or resource is relatively scarce to provision the services, and enhance globally integrated optimization of optical network and application resources. The overall feasibility and efficiency of the proposed architecture are experimentally verified on the control plane of OpenFlow-based enhanced software defined networking (eSDN) testbed. The performance of RIM scheme under heavy traffic load scenario is also quantitatively evaluated based on MSRI architecture in terms of path blocking probability, provisioning latency and resource utilization, compared with other provisioning schemes.

Toward Measuring Network Aesthetics Based on Symmetry

Directory of Open Access Journals (Sweden)

Zengqiang Chen

2017-05-01

Full Text Available In this exploratory paper, we discuss quantitative graph-theoretical measures of network aesthetics. Related work in this area has typically focused on geometrical features (e.g., line crossings or edge bendiness of drawings or visual representations of graphs which purportedly affect an observer’s perception. Here we take a very different approach, abandoning reliance on geometrical properties, and apply information-theoretic measures to abstract graphs and networks directly (rather than to their visual representaions as a means of capturing classical appreciation of structural symmetry. Examples are used solely to motivate the approach to measurement, and to elucidate our symmetry-based mathematical theory of network aesthetics.

Information theory perspective on network robustness

International Nuclear Information System (INIS)

Schieber, Tiago A.; Carpi, Laura; Frery, Alejandro C.; Rosso, Osvaldo A.; Pardalos, Panos M.; Ravetti, Martín G.

2016-01-01

A crucial challenge in network theory is the study of the robustness of a network when facing a sequence of failures. In this work, we propose a dynamical definition of network robustness based on Information Theory, that considers measurements of the structural changes caused by failures of the network's components. Failures are defined here as a temporal process defined in a sequence. Robustness is then evaluated by measuring dissimilarities between topologies after each time step of the sequence, providing a dynamical information about the topological damage. We thoroughly analyze the efficiency of the method in capturing small perturbations by considering different probability distributions on networks. In particular, we find that distributions based on distances are more consistent in capturing network structural deviations, as better reflect the consequences of the failures. Theoretical examples and real networks are used to study the performance of this methodology. - Highlights: • A novel methodology to measure the robustness of a network to component failure or targeted attacks is proposed. • The use of the network's distance PDF allows a precise analysis. • The method provides a dynamic robustness profile showing the response of the topology to each failure event. • The measure is capable to detect network's critical elements.

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks.

Directory of Open Access Journals (Sweden)

Huan Chen

Full Text Available This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN. Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme.

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks.

Science.gov (United States)

Chen, Huan; Li, Lemin; Ren, Jing; Wang, Yang; Zhao, Yangming; Wang, Xiong; Wang, Sheng; Xu, Shizhong

2015-01-01

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme.

DEFINE: A Service-Oriented Dynamically Enabling Function Model

Directory of Open Access Journals (Sweden)

Tan Wei-Yi

2017-01-01

In this paper, we introduce an innovative Dynamically Enable Function In Network Equipment (DEFINE to allow tenant get the network service quickly. First, DEFINE decouples an application into different functional components, and connects these function components in a reconfigurable method. Second, DEFINE provides a programmable interface to the third party, who can develop their own processing modules according to their own needs. To verify the effectiveness of this model, we set up an evaluating network with a FPGA-based OpenFlow switch prototype, and deployed several applications on it. Our results show that DEFINE has excellent flexibility and performance.

Measurement of company effectiveness using analytic network process method

Directory of Open Access Journals (Sweden)

Goran Janjić

2017-07-01

Full Text Available The sustainable development of an organisation is monitored through the organisation’s performance, which beforehand incorporates all stakeholders’ requirements in its strategy. The strategic management concept enables organisations to monitor and evaluate their effectiveness along with efficiency by monitoring of the implementation of set strategic goals. In the process of monitoring and measuring effectiveness, an organisation can use multiple-criteria decision-making methods as help. This study uses the method of analytic network process (ANP to define the weight factors of the mutual influences of all the important elements of an organisation’s strategy. The calculation of an organisation’s effectiveness is based on the weight factors and the degree of fulfilment of the goal values of the strategic map measures. New business conditions influence the changes in the importance of certain elements of an organisation’s business in relation to competitive advantage on the market, and on the market, increasing emphasis is given to non-material resources in the process of selection of the organisation’s most important measures.

Dynamic routing and spectrum assignment based on multilayer virtual topology and ant colony optimization in elastic software-defined optical networks

Science.gov (United States)

Wang, Fu; Liu, Bo; Zhang, Lijia; Zhang, Qi; Tian, Qinghua; Tian, Feng; Rao, Lan; Xin, Xiangjun

2017-07-01

Elastic software-defined optical networks greatly improve the flexibility of the optical switching network while it has brought challenges to the routing and spectrum assignment (RSA). A multilayer virtual topology model is proposed to solve RSA problems. Two RSA algorithms based on the virtual topology are proposed, which are the ant colony optimization (ACO) algorithm of minimum consecutiveness loss and the ACO algorithm of maximum spectrum consecutiveness. Due to the computing power of the control layer in the software-defined network, the routing algorithm avoids the frequent link-state information between routers. Based on the effect of the spectrum consecutiveness loss on the pheromone in the ACO, the path and spectrum of the minimal impact on the network are selected for the service request. The proposed algorithms have been compared with other algorithms. The results show that the proposed algorithms can reduce the blocking rate by at least 5% and perform better in spectrum efficiency. Moreover, the proposed algorithms can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness.

Network cohesion

OpenAIRE

Cavalcanti, Tiago V. V.; Giannitsarou, Chryssi; Johnson, Charles R.

2016-01-01

This is the final version of the article. It first appeared from Springer via http://dx.doi.org/10.1007/s00199-016-0992-1 We define a measure of network cohesion and show how it arises naturally in a broad class of dynamic models of endogenous perpetual growth with network externalities. Via a standard growth model, we show why network cohesion is crucial for conditional convergence and explain that as cohesion increases, convergence is faster. We prove properties of network cohesion and d...

Connectivity and dynamics of neuronal networks as defined by the shape of individual neurons

International Nuclear Information System (INIS)

Ahnert, Sebastian E; A N Travencolo, Bruno; Costa, Luciano da Fontoura

2009-01-01

Biological neuronal networks constitute a special class of dynamical systems, as they are formed by individual geometrical components, namely the neurons. In the existing literature, relatively little attention has been given to the influence of neuron shape on the overall connectivity and dynamics of the emerging networks. The current work addresses this issue by considering simplified neuronal shapes consisting of circular regions (soma/axons) with spokes (dendrites). Networks are grown by placing these patterns randomly in the two-dimensional (2D) plane and establishing connections whenever a piece of dendrite falls inside an axon. Several topological and dynamical properties of the resulting graph are measured, including the degree distribution, clustering coefficients, symmetry of connections, size of the largest connected component, as well as three hierarchical measurements of the local topology. By varying the number of processes of the individual basic patterns, we can quantify relationships between the individual neuronal shape and the topological and dynamical features of the networks. Integrate-and-fire dynamics on these networks is also investigated with respect to transient activation from a source node, indicating that long-range connections play an important role in the propagation of avalanches.

Software Defined Cyberinfrastructure

Energy Technology Data Exchange (ETDEWEB)

Foster, Ian; Blaiszik, Ben; Chard, Kyle; Chard, Ryan

2017-07-17

Within and across thousands of science labs, researchers and students struggle to manage data produced in experiments, simulations, and analyses. Largely manual research data lifecycle management processes mean that much time is wasted, research results are often irreproducible, and data sharing and reuse remain rare. In response, we propose a new approach to data lifecycle management in which researchers are empowered to define the actions to be performed at individual storage systems when data are created or modified: actions such as analysis, transformation, copying, and publication. We term this approach software-defined cyberinfrastructure because users can implement powerful data management policies by deploying rules to local storage systems, much as software-defined networking allows users to configure networks by deploying rules to switches.We argue that this approach can enable a new class of responsive distributed storage infrastructure that will accelerate research innovation by allowing any researcher to associate data workflows with data sources, whether local or remote, for such purposes as data ingest, characterization, indexing, and sharing. We report on early experiments with this approach in the context of experimental science, in which a simple if-trigger-then-action (IFTA) notation is used to define rules.

Inferring a Drive-Response Network from Time Series of Topological Measures in Complex Networks with Transfer Entropy

Directory of Open Access Journals (Sweden)

Xinbo Ai

2014-11-01

Full Text Available Topological measures are crucial to describe, classify and understand complex networks. Lots of measures are proposed to characterize specific features of specific networks, but the relationships among these measures remain unclear. Taking into account that pulling networks from different domains together for statistical analysis might provide incorrect conclusions, we conduct our investigation with data observed from the same network in the form of simultaneously measured time series. We synthesize a transfer entropy-based framework to quantify the relationships among topological measures, and then to provide a holistic scenario of these measures by inferring a drive-response network. Techniques from Symbolic Transfer Entropy, Effective Transfer Entropy, and Partial Transfer Entropy are synthesized to deal with challenges such as time series being non-stationary, finite sample effects and indirect effects. We resort to kernel density estimation to assess significance of the results based on surrogate data. The framework is applied to study 20 measures across 2779 records in the Technology Exchange Network, and the results are consistent with some existing knowledge. With the drive-response network, we evaluate the influence of each measure by calculating its strength, and cluster them into three classes, i.e., driving measures, responding measures and standalone measures, according to the network communities.

Vector network analyzer (VNA) measurements and uncertainty assessment

CERN Document Server

Shoaib, Nosherwan

2017-01-01

This book describes vector network analyzer measurements and uncertainty assessments, particularly in waveguide test-set environments, in order to establish their compatibility to the International System of Units (SI) for accurate and reliable characterization of communication networks. It proposes a fully analytical approach to measurement uncertainty evaluation, while also highlighting the interaction and the linear propagation of different uncertainty sources to compute the final uncertainties associated with the measurements. The book subsequently discusses the dimensional characterization of waveguide standards and the quality of the vector network analyzer (VNA) calibration techniques. The book concludes with an in-depth description of the novel verification artefacts used to assess the performance of the VNAs. It offers a comprehensive reference guide for beginners to experts, in both academia and industry, whose work involves the field of network analysis, instrumentation and measurements.

Dynamical networks: Finding, measuring, and tracking neural population activity using network science

Directory of Open Access Journals (Sweden)

Mark D. Humphries

2017-12-01

Full Text Available Systems neuroscience is in a headlong rush to record from as many neurons at the same time as possible. As the brain computes and codes using neuron populations, it is hoped these data will uncover the fundamentals of neural computation. But with hundreds, thousands, or more simultaneously recorded neurons come the inescapable problems of visualizing, describing, and quantifying their interactions. Here I argue that network science provides a set of scalable, analytical tools that already solve these problems. By treating neurons as nodes and their interactions as links, a single network can visualize and describe an arbitrarily large recording. I show that with this description we can quantify the effects of manipulating a neural circuit, track changes in population dynamics over time, and quantitatively define theoretical concepts of neural populations such as cell assemblies. Using network science as a core part of analyzing population recordings will thus provide both qualitative and quantitative advances to our understanding of neural computation.

Performance considerations of ultrasonic distance measurement with well defined properties

International Nuclear Information System (INIS)

Elmer, Hannes; Schweinzer, Herbert

2005-01-01

Conventional ultrasonic distance measurement systems based on narrow bandwidth ultrasonic bursts and amplitude detection are often used because of their low costs and easy implementation. However, the achievable results strongly depend on the actual environments where the system is implemented: in case of well defined objects that are always located near the measurement direction of the system, in general good results are obtained. If arbitrary objects are expected that are moreover located in arbitrary positions in front of the sensor, strongly object dependent areas where objects are detected with decreasing accuracy towards their borders must be taken into account. In previous works we developed an ultrasonic measurement system that provides accurate distance measurement values within a well defined detection area that is independent of the reflection properties of the objects. This measurement system is based on the One Bit Correlation method that is described in the following. To minimise its implementation efforts, it is necessary to examine the influence of the system parameters as e.g. the correlation length to the results that are expected in case of different signal to noise ratios of the received signal. In the following, these examinations are shown and the obtained results are discussed that allow getting a well conditioned system that makes best use of given system resources

Building and measuring a high performance network architecture

Energy Technology Data Exchange (ETDEWEB)

Kramer, William T.C.; Toole, Timothy; Fisher, Chuck; Dugan, Jon; Wheeler, David; Wing, William R; Nickless, William; Goddard, Gregory; Corbato, Steven; Love, E. Paul; Daspit, Paul; Edwards, Hal; Mercer, Linden; Koester, David; Decina, Basil; Dart, Eli; Paul Reisinger, Paul; Kurihara, Riki; Zekauskas, Matthew J; Plesset, Eric; Wulf, Julie; Luce, Douglas; Rogers, James; Duncan, Rex; Mauth, Jeffery

2001-04-20

Once a year, the SC conferences present a unique opportunity to create and build one of the most complex and highest performance networks in the world. At SC2000, large-scale and complex local and wide area networking connections were demonstrated, including large-scale distributed applications running on different architectures. This project was designed to use the unique opportunity presented at SC2000 to create a testbed network environment and then use that network to demonstrate and evaluate high performance computational and communication applications. This testbed was designed to incorporate many interoperable systems and services and was designed for measurement from the very beginning. The end results were key insights into how to use novel, high performance networking technologies and to accumulate measurements that will give insights into the networks of the future.

Measuring network competence in buyer-supplier relationships

Directory of Open Access Journals (Sweden)

Gert Human

2011-04-01

Full Text Available Managing multiple buyer-seller relationships in business-to-business networks demands an understanding of a firm’s competence to manage in an interconnected environment.  This paper reports on an attempt to measure network competence by using the NetCompTest scale in business-to-business markets in South Africa. Based on a pilot study refinement, the paper proposes an adjusted measurement scale and details the results of a second round of measurement conducted amongst 495 business-to-business managers in South Africa. The results established partial support for the use of the NetCompTest scale in a South African context, and analysis of variance indicated that some differences in the measurement based on firm and individual characteristics can be observed in the data. The paper assists in theory-building and provides managerial insights for managing buyer-supplier relationships in networks.

Geographically Locating an Internet Node Using Network Latency Measurement

National Research Council Canada - National Science Library

Turnbaugh, Eugene

2004-01-01

.... The difficulties include accurate latency measure, network address translation (NAT) masking, service blocking, disparate physical configuration, dissimilar network hardware, and inaccurate and limited measuring tools...

Measure of Node Similarity in Multilayer Networks

DEFF Research Database (Denmark)

Møllgaard, Anders; Zettler, Ingo; Dammeyer, Jesper

2016-01-01

The weight of links in a network is often related to the similarity of thenodes. Here, we introduce a simple tunable measure for analysing the similarityof nodes across different link weights. In particular, we use the measure toanalyze homophily in a group of 659 freshman students at a large...... university.Our analysis is based on data obtained using smartphones equipped with customdata collection software, complemented by questionnaire-based data. The networkof social contacts is represented as a weighted multilayer network constructedfrom different channels of telecommunication as well as data...... might bepresent in one layer of the multilayer network and simultaneously be absent inthe other layers. For a variable such as gender, our measure reveals atransition from similarity between nodes connected with links of relatively lowweight to dis-similarity for the nodes connected by the strongest...

Measure of Node Similarity in Multilayer Networks.

Directory of Open Access Journals (Sweden)

Anders Mollgaard

Full Text Available The weight of links in a network is often related to the similarity of the nodes. Here, we introduce a simple tunable measure for analysing the similarity of nodes across different link weights. In particular, we use the measure to analyze homophily in a group of 659 freshman students at a large university. Our analysis is based on data obtained using smartphones equipped with custom data collection software, complemented by questionnaire-based data. The network of social contacts is represented as a weighted multilayer network constructed from different channels of telecommunication as well as data on face-to-face contacts. We find that even strongly connected individuals are not more similar with respect to basic personality traits than randomly chosen pairs of individuals. In contrast, several socio-demographics variables have a significant degree of similarity. We further observe that similarity might be present in one layer of the multilayer network and simultaneously be absent in the other layers. For a variable such as gender, our measure reveals a transition from similarity between nodes connected with links of relatively low weight to dis-similarity for the nodes connected by the strongest links. We finally analyze the overlap between layers in the network for different levels of acquaintanceships.

Combined techniques for network measurements at accelerator facilities

International Nuclear Information System (INIS)

Pschorn, I.

1999-01-01

Usually network measurements at GSi (Gesellschaft fur Schwerionen forschung) are carried out by employing the Leica tachymeter TC2002K etc. Due to time constraints and the fact that GSi possesses only one of these selected, high precision total-stations, it was suddenly necessary to think about employing a Laser tracker as the major instrument for a reference network measurement. The idea was to compare the different instruments and to proof if it is possible at all to carry out a precise network measurement using a laser tracker. In the end the SMX Tracker4500 combined with Leica NA3000 for network measurements at GSi, Darmstadt and at BESSY Il, Berlin (both located in Germany) was applied. A few results are shown in the following chapters. A new technology in 3D metrology came up. Some ideas of applying these new tools in the field of accelerator measurements are given. Finally aspects of calibration and checking the performance of the employed high precision instrument are pointed out in this paper. (author)

Measuring symmetry, asymmetry and randomness in neural network connectivity.

Directory of Open Access Journals (Sweden)

Umberto Esposito

Full Text Available Cognitive functions are stored in the connectome, the wiring diagram of the brain, which exhibits non-random features, so-called motifs. In this work, we focus on bidirectional, symmetric motifs, i.e. two neurons that project to each other via connections of equal strength, and unidirectional, non-symmetric motifs, i.e. within a pair of neurons only one neuron projects to the other. We hypothesise that such motifs have been shaped via activity dependent synaptic plasticity processes. As a consequence, learning moves the distribution of the synaptic connections away from randomness. Our aim is to provide a global, macroscopic, single parameter characterisation of the statistical occurrence of bidirectional and unidirectional motifs. To this end we define a symmetry measure that does not require any a priori thresholding of the weights or knowledge of their maximal value. We calculate its mean and variance for random uniform or Gaussian distributions, which allows us to introduce a confidence measure of how significantly symmetric or asymmetric a specific configuration is, i.e. how likely it is that the configuration is the result of chance. We demonstrate the discriminatory power of our symmetry measure by inspecting the eigenvalues of different types of connectivity matrices. We show that a Gaussian weight distribution biases the connectivity motifs to more symmetric configurations than a uniform distribution and that introducing a random synaptic pruning, mimicking developmental regulation in synaptogenesis, biases the connectivity motifs to more asymmetric configurations, regardless of the distribution. We expect that our work will benefit the computational modelling community, by providing a systematic way to characterise symmetry and asymmetry in network structures. Further, our symmetry measure will be of use to electrophysiologists that investigate symmetry of network connectivity.

Measuring symmetry, asymmetry and randomness in neural network connectivity.

Science.gov (United States)

Esposito, Umberto; Giugliano, Michele; van Rossum, Mark; Vasilaki, Eleni

2014-01-01

Cognitive functions are stored in the connectome, the wiring diagram of the brain, which exhibits non-random features, so-called motifs. In this work, we focus on bidirectional, symmetric motifs, i.e. two neurons that project to each other via connections of equal strength, and unidirectional, non-symmetric motifs, i.e. within a pair of neurons only one neuron projects to the other. We hypothesise that such motifs have been shaped via activity dependent synaptic plasticity processes. As a consequence, learning moves the distribution of the synaptic connections away from randomness. Our aim is to provide a global, macroscopic, single parameter characterisation of the statistical occurrence of bidirectional and unidirectional motifs. To this end we define a symmetry measure that does not require any a priori thresholding of the weights or knowledge of their maximal value. We calculate its mean and variance for random uniform or Gaussian distributions, which allows us to introduce a confidence measure of how significantly symmetric or asymmetric a specific configuration is, i.e. how likely it is that the configuration is the result of chance. We demonstrate the discriminatory power of our symmetry measure by inspecting the eigenvalues of different types of connectivity matrices. We show that a Gaussian weight distribution biases the connectivity motifs to more symmetric configurations than a uniform distribution and that introducing a random synaptic pruning, mimicking developmental regulation in synaptogenesis, biases the connectivity motifs to more asymmetric configurations, regardless of the distribution. We expect that our work will benefit the computational modelling community, by providing a systematic way to characterise symmetry and asymmetry in network structures. Further, our symmetry measure will be of use to electrophysiologists that investigate symmetry of network connectivity.

Dynamic Network Security Control Using Software Defined Networking

Science.gov (United States)

2016-03-24

technologies such as Open vSwitch (OVS) [26], OpenFlow [22], Cisco Nexus 5000V [27], and IBM 5000V [28]. 2.2.4 OpenFlow. The Open Networking Foundation...companies with more than 64 OpenFlow products on the market . Since 2009, ONF released four major revisions to OpenFlow and the latest proposed...2015 from http://www.openvswitch.org, 2014. 27. Cisco Systems. Cisco Nexus 5000 Series Architecture. Retrieved 9 Oc- tober, 2015 from http

Networks of high mutual information define the structural proximity of catalytic sites: implications for catalytic residue identification.

Directory of Open Access Journals (Sweden)

Cristina Marino Buslje

Full Text Available Identification of catalytic residues (CR is essential for the characterization of enzyme function. CR are, in general, conserved and located in the functional site of a protein in order to attain their function. However, many non-catalytic residues are highly conserved and not all CR are conserved throughout a given protein family making identification of CR a challenging task. Here, we put forward the hypothesis that CR carry a particular signature defined by networks of close proximity residues with high mutual information (MI, and that this signature can be applied to distinguish functional from other non-functional conserved residues. Using a data set of 434 Pfam families included in the catalytic site atlas (CSA database, we tested this hypothesis and demonstrated that MI can complement amino acid conservation scores to detect CR. The Kullback-Leibler (KL conservation measurement was shown to significantly outperform both the Shannon entropy and maximal frequency measurements. Residues in the proximity of catalytic sites were shown to be rich in shared MI. A structural proximity MI average score (termed pMI was demonstrated to be a strong predictor for CR, thus confirming the proposed hypothesis. A structural proximity conservation average score (termed pC was also calculated and demonstrated to carry distinct information from pMI. A catalytic likeliness score (Cls, combining the KL, pC and pMI measures, was shown to lead to significantly improved prediction accuracy. At a specificity of 0.90, the Cls method was found to have a sensitivity of 0.816. In summary, we demonstrate that networks of residues with high MI provide a distinct signature on CR and propose that such a signature should be present in other classes of functional residues where the requirement to maintain a particular function places limitations on the diversification of the structural environment along the course of evolution.

Networks of high mutual information define the structural proximity of catalytic sites: implications for catalytic residue identification.

Science.gov (United States)

Marino Buslje, Cristina; Teppa, Elin; Di Doménico, Tomas; Delfino, José María; Nielsen, Morten

2010-11-04

Identification of catalytic residues (CR) is essential for the characterization of enzyme function. CR are, in general, conserved and located in the functional site of a protein in order to attain their function. However, many non-catalytic residues are highly conserved and not all CR are conserved throughout a given protein family making identification of CR a challenging task. Here, we put forward the hypothesis that CR carry a particular signature defined by networks of close proximity residues with high mutual information (MI), and that this signature can be applied to distinguish functional from other non-functional conserved residues. Using a data set of 434 Pfam families included in the catalytic site atlas (CSA) database, we tested this hypothesis and demonstrated that MI can complement amino acid conservation scores to detect CR. The Kullback-Leibler (KL) conservation measurement was shown to significantly outperform both the Shannon entropy and maximal frequency measurements. Residues in the proximity of catalytic sites were shown to be rich in shared MI. A structural proximity MI average score (termed pMI) was demonstrated to be a strong predictor for CR, thus confirming the proposed hypothesis. A structural proximity conservation average score (termed pC) was also calculated and demonstrated to carry distinct information from pMI. A catalytic likeliness score (Cls), combining the KL, pC and pMI measures, was shown to lead to significantly improved prediction accuracy. At a specificity of 0.90, the Cls method was found to have a sensitivity of 0.816. In summary, we demonstrate that networks of residues with high MI provide a distinct signature on CR and propose that such a signature should be present in other classes of functional residues where the requirement to maintain a particular function places limitations on the diversification of the structural environment along the course of evolution.

An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

Science.gov (United States)

Cabessa, Jérémie; Villa, Alessandro E. P.

2014-01-01

We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866

Financial Network Systemic Risk Contributions

NARCIS (Netherlands)

Hautsch, N.; Schaumburg, J.; Schienle, M.

2015-01-01

We propose the realized systemic risk beta as a measure of financial companies' contribution to systemic risk, given network interdependence between firms' tail risk exposures. Conditional on statistically pre-identified network spillover effects and market and balance sheet information, we define

Operationalization of Software-Defined Networks (SDN) Program Review

Data.gov (United States)

Networking and Information Technology Research and Development, Executive Office of the President — U.S. federal investments in networking research and technologies deployment have fostered and accelerated the development of the Internet from its inception. It is...

National network of radioactivity measurement in environment

International Nuclear Information System (INIS)

2006-01-01

This document constitutes the report of management for the year 2006 of the national network of measurement of radioactivity in environment, instituted by the article R.1333-11 of the Public Health code. According to the 5. of the decree of 27. june 2005, the Institute of radiation protection and nuclear safety (I.R.S.N.) has for mission to write every year a report of management of the national network of radioactivity measurement in environment. This report has for principal objectives: to do an evaluation on organisation and functioning of the piloting committee; to realize a synthesis on the different tasks lead by the working groups; as well as on the human and financial resources devoted to this project; to debrief on the development project of the national network information system. This report must allow to the network actors, as to the professional people and the public, to understand the functioning of the national network and the process implemented for the development of centralization, management and public diffusion tools, of the radioactivity data in environment. The year 2006 was marked by the opening of an Internet gate of the national network. (N.C.)

Greenhouse gas measurements from a UK network of tall towers: technical description and first results

Science.gov (United States)

Stanley, Kieran M.; Grant, Aoife; O'Doherty, Simon; Young, Dickon; Manning, Alistair J.; Stavert, Ann R.; Spain, T. Gerard; Salameh, Peter K.; Harth, Christina M.; Simmonds, Peter G.; Sturges, William T.; Oram, David E.; Derwent, Richard G.

2018-03-01

A network of three tall tower measurement stations was set up in 2012 across the United Kingdom to expand measurements made at the long-term background northern hemispheric site, Mace Head, Ireland. Reliable and precise in situ greenhouse gas (GHG) analysis systems were developed and deployed at three sites in the UK with automated instrumentation measuring a suite of GHGs. The UK Deriving Emissions linked to Climate Change (UK DECC) network uses tall (165-230 m) open-lattice telecommunications towers, which provide a convenient platform for boundary layer trace gas sampling. In this paper we describe the automated measurement system and first results from the UK DECC network for CO2, CH4, N2O, SF6, CO and H2. CO2 and CH4 are measured at all of the UK DECC sites by cavity ring-down spectroscopy (CRDS) with multiple inlet heights at two of the three tall tower sites to assess for boundary layer stratification. The short-term precisions (1σ on 1 min means) of CRDS measurements at background mole fractions for January 2012 to September 2015 is sampling temperatures. Automated alerts are generated and emailed to site operators when instrumental parameters are not within defined set ranges. Automated instrument shutdowns occur for critical errors such as carrier gas flow rate deviations. Results from the network give good spatial and temporal coverage of atmospheric mixing ratios within the UK since early 2012. Results also show that all measured GHGs are increasing in mole fraction over the selected reporting period and, except for SF6, exhibit a seasonal trend. CO2 and CH4 also show strong diurnal cycles, with night-time maxima and daytime minima in mole fractions.

Exploring machine-learning-based control plane intrusion detection techniques in software defined optical networks

Science.gov (United States)

Zhang, Huibin; Wang, Yuqiao; Chen, Haoran; Zhao, Yongli; Zhang, Jie

2017-12-01

In software defined optical networks (SDON), the centralized control plane may encounter numerous intrusion threatens which compromise the security level of provisioned services. In this paper, the issue of control plane security is studied and two machine-learning-based control plane intrusion detection techniques are proposed for SDON with properly selected features such as bandwidth, route length, etc. We validate the feasibility and efficiency of the proposed techniques by simulations. Results show an accuracy of 83% for intrusion detection can be achieved with the proposed machine-learning-based control plane intrusion detection techniques.

Transaction costs and social networks in productivity measurement

DEFF Research Database (Denmark)

Henningsen, Geraldine; Henningsen, Arne; Henning, Christian H. C. A.

2015-01-01

. Hence, both the absolute productivity measures and, more importantly, the productivity ranking will be distorted. A major driver of transaction costs is poor access to information and contract enforcement assistance. Social networks often catalyse information exchange as well as generate trust...... and support. Hence, we use measures of a firm’s access to social networks as a proxy for the transaction costs the firm faces. We develop a microeconomic production model that takes into account transaction costs and networks. Using a data set of 384 Polish farms, we empirically estimate this model...... and compare different parametric, semiparametric, and nonparametric model specifications. Our results generally support our hypothesis. Especially, large trading networks and dense household networks have a positive influence on a farm’s productivity. Furthermore, our results indicate that transaction costs...

Software Defined Networking to support IP address mobility in future LTE network

NARCIS (Netherlands)

Karimzadeh Motallebi Azar, Morteza; Valtulina, Luca; van den Berg, Hans Leo; Pras, Aiko; Liebsch, Marco; Taleb, Tarik

2017-01-01

The existing LTE network architecture dose not scale well to increasing demands due to its highly centralized and hierarchical composition. In this paper we discuss the major modifications required in the current LTE network to realize a decentralized LTE architecture. Next, we develop two IP

Energy Consumption Model and Measurement Results for Network Coding-enabled IEEE 802.11 Meshed Wireless Networks

DEFF Research Database (Denmark)

Paramanathan, Achuthan; Rasmussen, Ulrik Wilken; Hundebøll, Martin

2012-01-01

This paper presents an energy model and energy measurements for network coding enabled wireless meshed networks based on IEEE 802.11 technology. The energy model and the energy measurement testbed is limited to a simple Alice and Bob scenario. For this toy scenario we compare the energy usages...... for a system with and without network coding support. While network coding reduces the number of radio transmissions, the operational activity on the devices due to coding will be increased. We derive an analytical model for the energy consumption and compare it to real measurements for which we build...... a flexible, low cost tool to be able to measure at any given node in a meshed network. We verify the precision of our tool by comparing it to a sophisticated device. Our main results in this paper are the derivation of an analytical energy model, the implementation of a distributed energy measurement testbed...

Risk measures on networks and expected utility

International Nuclear Information System (INIS)

Cerqueti, Roy; Lupi, Claudio

2016-01-01

In reliability theory projects are usually evaluated in terms of their riskiness, and often decision under risk is intended as the one-shot-type binary choice of accepting or not accepting the risk. In this paper we elaborate on the concept of risk acceptance, and propose a theoretical framework based on network theory. In doing this, we deal with system reliability, where the interconnections among the random quantities involved in the decision process are explicitly taken into account. Furthermore, we explore the conditions to be satisfied for risk-acceptance criteria to be consistent with the axiomatization of standard expected utility theory within the network framework. In accordance with existing literature, we show that a risk evaluation criterion can be meaningful even if it is not consistent with the standard axiomatization of expected utility, once this is suitably reinterpreted in the light of networks. Finally, we provide some illustrative examples. - Highlights: • We discuss risk acceptance and theoretically develop this theme on the basis of network theory. • We propose an original framework for describing the algebraic structure of the set of the networks, when they are viewed as risks. • We introduce the risk measures on networks, which induce total orders on the set of networks. • We state conditions on the risk measures on networks to let the induced risk-acceptance criterion be consistent with a new formulation of the expected utility theory.

Measurement with Persons: A European Network

NARCIS (Netherlands)

Pendrill, L.R.; Emardson, R.; Berglund, B.; Gröning, M.; Höglund, A.; Cancedda, A.; Quinti, G.; Crenna, F.; Rossi, G.B.; Drnovek, J.; Gersak, G.; Goodman, T.; Harris, S.; Heijden, van der G.W.A.M.; Kallinen, K.; Ravaja, N.

2010-01-01

The European ‘Measuring the Impossible’ Network MINET promotes new research activities in measurement dependent on human perception and/or interpretation. This includes the perceived attributes of products and services, such as quality or desirability, and societal parameters such as security and

Correlated measurement error hampers association network inference

NARCIS (Netherlands)

Kaduk, M.; Hoefsloot, H.C.J.; Vis, D.J.; Reijmers, T.; Greef, J. van der; Smilde, A.K.; Hendriks, M.M.W.B.

2014-01-01

Modern chromatography-based metabolomics measurements generate large amounts of data in the form of abundances of metabolites. An increasingly popular way of representing and analyzing such data is by means of association networks. Ideally, such a network can be interpreted in terms of the

Settings in Social Networks : a Measurement Model

NARCIS (Netherlands)

Schweinberger, Michael; Snijders, Tom A.B.

2003-01-01

A class of statistical models is proposed that aims to recover latent settings structures in social networks. Settings may be regarded as clusters of vertices. The measurement model is based on two assumptions. (1) The observed network is generated by hierarchically nested latent transitive

EIGENVECTOR-BASED CENTRALITY MEASURES FOR TEMPORAL NETWORKS*

Science.gov (United States)

TAYLOR, DANE; MYERS, SEAN A.; CLAUSET, AARON; PORTER, MASON A.; MUCHA, PETER J.

2017-01-01

Numerous centrality measures have been developed to quantify the importances of nodes in time-independent networks, and many of them can be expressed as the leading eigenvector of some matrix. With the increasing availability of network data that changes in time, it is important to extend such eigenvector-based centrality measures to time-dependent networks. In this paper, we introduce a principled generalization of network centrality measures that is valid for any eigenvector-based centrality. We consider a temporal network with N nodes as a sequence of T layers that describe the network during different time windows, and we couple centrality matrices for the layers into a supra-centrality matrix of size NT × NT whose dominant eigenvector gives the centrality of each node i at each time t. We refer to this eigenvector and its components as a joint centrality, as it reflects the importances of both the node i and the time layer t. We also introduce the concepts of marginal and conditional centralities, which facilitate the study of centrality trajectories over time. We find that the strength of coupling between layers is important for determining multiscale properties of centrality, such as localization phenomena and the time scale of centrality changes. In the strong-coupling regime, we derive expressions for time-averaged centralities, which are given by the zeroth-order terms of a singular perturbation expansion. We also study first-order terms to obtain first-order-mover scores, which concisely describe the magnitude of nodes’ centrality changes over time. As examples, we apply our method to three empirical temporal networks: the United States Ph.D. exchange in mathematics, costarring relationships among top-billed actors during the Golden Age of Hollywood, and citations of decisions from the United States Supreme Court. PMID:29046619

Template measurement for plutonium pit based on neural networks

International Nuclear Information System (INIS)

Zhang Changfan; Gong Jian; Liu Suping; Hu Guangchun; Xiang Yongchun

2012-01-01

Template measurement for plutonium pit extracts characteristic data from-ray spectrum and the neutron counts emitted by plutonium. The characteristic data of the suspicious object are compared with data of the declared plutonium pit to verify if they are of the same type. In this paper, neural networks are enhanced as the comparison algorithm for template measurement of plutonium pit. Two kinds of neural networks are created, i.e. the BP and LVQ neural networks. They are applied in different aspects for the template measurement and identification. BP neural network is used for classification for different types of plutonium pits, which is often used for management of nuclear materials. LVQ neural network is used for comparison of inspected objects to the declared one, which is usually applied in the field of nuclear disarmament and verification. (authors)

Defining and Measuring Cognitive-Entropy and Cognitive Self-Synchronization

Science.gov (United States)

2011-06-01

16th ICCRTS: “Collective C2 in Multinational Civil-Military Operations” Defining and Measuring Cognitive-Entropy and Cognitive Self- Synchronization ...shared awareness and enabling self- synchronization across the range of participating entities (Alberts and Hayes 2009, pp.106). We consider the...aspect of self- synchronization (Alberts and Hayes, 2006) a key one in the context of modern operations and in performing C2 assessments. Based on (Manso

A fractal-like resistive network

International Nuclear Information System (INIS)

Saggese, A; De Luca, R

2014-01-01

The equivalent resistance of a fractal-like network is calculated by means of approaches similar to those employed in defining the equivalent resistance of an infinite ladder. Starting from an elementary triangular circuit, a fractal-like network, named after Saggese, is developed. The equivalent resistance of finite approximations of this network is measured, and the didactical implications of the model are highlighted. (paper)

Processing horizontal networks measured by integrated terrestrial and GPS technologies

Directory of Open Access Journals (Sweden)

Vincent Jakub

2003-09-01

Full Text Available Local horizontal networks in which GPS and terrestrial measurements (TER are done are often established at present. Iin other networks, the previous terrestrial measurements can be completed with quantities from contemporary GPS observations (tunnel nets, mining nets with surface and underground parts and other long-shaped nets.The processing of such heterobeneous (GPS, TER networks whose terrestrial measurements are performed as point coordinate measurements (∆X, ∆Y using (geodetic total stationIn is presented in this paper. In such network structures it is then available:- the values ∆X, ∆Y from TER observations which are transformed in the plane of S-JTSK for adjustement,- the values ∆X, ∆Y in the plane S-JTSK that can be obtained by 3D transformation of WGS84 netpoint coordinates from GPS observations to corresponding coordinates S-JTSK.For common adjusting all the ∆X, ∆Y, some elements of the network geometry (e.g. distances should be measured by both methods (GPS, TER. This approach makes possible an effective homogenisation of both network parts what is equivalent to saying that an expressive influence reduction on local frame realizations of S-JTSK in the whole network can be made.Results of network processing obtained in proposed manner are acceptable in general and they are equivalent (accuracy, reliability to results of another processing methods.

Security measures effect over performance in service provider network

African Journals Online (AJOL)

pc

2018-03-05

Mar 5, 2018 ... Abstract—network security is defined as a set of policies and actions taken by a ... These threats are linked with the following factors that are ... typically smaller than those in the service provider space. ... Service providers cannot manage to provide ... e the DB performance effect ... r the business needs [10].

Displacement and deformation measurement for large structures by camera network

Science.gov (United States)

Shang, Yang; Yu, Qifeng; Yang, Zhen; Xu, Zhiqiang; Zhang, Xiaohu

2014-03-01

A displacement and deformation measurement method for large structures by a series-parallel connection camera network is presented. By taking the dynamic monitoring of a large-scale crane in lifting operation as an example, a series-parallel connection camera network is designed, and the displacement and deformation measurement method by using this series-parallel connection camera network is studied. The movement range of the crane body is small, and that of the crane arm is large. The displacement of the crane body, the displacement of the crane arm relative to the body and the deformation of the arm are measured. Compared with a pure series or parallel connection camera network, the designed series-parallel connection camera network can be used to measure not only the movement and displacement of a large structure but also the relative movement and deformation of some interesting parts of the large structure by a relatively simple optical measurement system.

Fighting Networks: The Defining Challenge of Irregular Warfare

Science.gov (United States)

2011-06-01

fighting networks, different skills allow for increased operational complexity. Lawrence and Lorsch found that organizations in more uncertain...Uncertainty in the Face of Risk,” in Cooperation and Prosocial Behavior, ed. Robert Hindle and Jo Groebel (New York: Cambridge University Press, 1991...simplistic to describe al-Qaeda as a guerrilla organization as they have transcended traditional practices by their skilled utilization of the network form

Transaction costs and social networks in productivity measurement

DEFF Research Database (Denmark)

Henningsen, Geraldine; Henningsen, Arne; Henning, Christian H. C. A.

2015-01-01

and support. Hence, we use measures of a firm’s access to social networks as a proxy for the transaction costs the firm faces. We develop a microeconomic production model that takes into account transaction costs and networks. Using a data set of 384 Polish farms, we empirically estimate this model......We argue that in the presence of transaction costs, observed productivity measures may in many cases understate the true productivity, as production data seldom distinguish between resources entering the production process and resources of a similar type that are sacrificed for transaction costs....... Hence, both the absolute productivity measures and, more importantly, the productivity ranking will be distorted. A major driver of transaction costs is poor access to information and contract enforcement assistance. Social networks often catalyse information exchange as well as generate trust...

Flow-based vulnerability measures for network component importance: Experimentation with preparedness planning

International Nuclear Information System (INIS)

Nicholson, Charles D.; Barker, Kash; Ramirez-Marquez, Jose E.

2016-01-01

This work develops and compares several flow-based vulnerability measures to prioritize important network edges for the implementation of preparedness options. These network vulnerability measures quantify different characteristics and perspectives on enabling maximum flow, creating bottlenecks, and partitioning into cutsets, among others. The efficacy of these vulnerability measures to motivate preparedness options against experimental geographically located disruption simulations is measured. Results suggest that a weighted flow capacity rate, which accounts for both (i) the contribution of an edge to maximum network flow and (ii) the extent to which the edge is a bottleneck in the network, shows most promise across four instances of varying network sizes and densities. - Highlights: • We develop new flow-based measures of network vulnerability. • We apply these measures to determine the importance of edges after disruptions. • Networks of varying size and density are explored.

Implementing Resource-aware Multicast Forwarding in Software Defined Networks

DEFF Research Database (Denmark)

Poderys, Justas; Sunny, Anjusha; Soler, José

2018-01-01

Using multicast data transmissions, data can be eciently distributed to a high number of network users. However, in order to ef-ciently stream multimedia using multicast communication, multicast routing protocols must have knowledge of all network links and their available bandwidth. In Software......-Karp algorithm, by taking into account network topology and links load information. This paper presents the algorithm, implementation details, and an analysis of the testing results....

Time Synchronized Wireless Sensor Network for Vibration Measurement

Science.gov (United States)

Uchimura, Yutaka; Nasu, Tadashi; Takahashi, Motoichi

Network based wireless sensing has become an important area of research and various new applications for remote sensing are expected to emerge. One of the promising applications is structural health monitoring of building or civil engineering structure and it often requires vibration measurement. For the vibration measurement via wireless network, time synchronization is indispensable. In this paper, we introduce a newly developed time synchronized wireless sensor network system. The system employs IEEE 802.11 standard based TSF counter and sends the measured data with the counter value. TSF based synchronization enables consistency on common clock among different wireless nodes. We consider the scale effect on the synchronization accuracy and the effect is evaluated by stochastic analysis and simulation studies. A new wireless sensing system is developed and the hardware and software specifications are shown. The experiments are conducted in a reinforced concrete building and results show good performance enough for vibration measurement purpose.

Joint Content Placement and Traffic Management for Cloud Mobile Video Distribution over Software-Defined Networks

Institute of Scientific and Technical Information of China (English)

Zhenghuan Zhang; Xiaofeng Jiang; Hongsheng Xi

2016-01-01

To cope with the rapid growth of mobile video,video providers have leveraged cloud technologies to deploy their mobile video service system for more cost-effective and scalable performance.The emergence of Software-Defined Networking (SDN) provides a promising solution to manage the underlying network.In this paper,we introduce an SDN-enabled cloud mobile video distribution architecture and propose a joint video placement,request dispatching and traffic management mechanism to improve user experience and reduce the system operational cost.We use a utility function to capture the two aspects of user experience:the level of satisfaction and average latency,and formulate the joint optimization problem as a mixed integer programming problem.We develop an optimal algorithm based on dual decomposition and prove its optimality.We conduct simulations to evaluate the performance of our algorithm and the results show that our strategy can effectively cut down the total cost and guarantee user experience.

A Network-Based Impact Measure for Propagated Losses in a Supply Chain Network Consisting of Resilient Components

Directory of Open Access Journals (Sweden)

Jesus Felix Bayta Valenzuela

2018-01-01

Full Text Available The topology of a supply chain network affects the impacts of disruptions in it. We formulate a network-based measure of the impact of a disruption loss in a supply chain propagating downstream from an originating node. The measure takes into account the loss profile of the originating node, the structure of the supply network, and the resilience of the network components. We obtain an analytical expression for the impact measure under a beta-distributed initial loss (generalizable to any continuous distribution supported on the interval 0,1, under a breakthrough scenario (in which a fraction of the initial production loss reaches a focal company downstream as opposed to containment upstream or at the originating point. Furthermore, we obtain a closed-form solution for a supply chain network with a k-ary tree topology; a numerical study is performed for a scale-free network and a random network. Our proposed approach enables the evaluation of potential losses for a focal company considering its supply chain network structure, which may help the company to plan or redesign a robust and resilient network in response to different types of disruptions.

Traffic measurement for big network data

CERN Document Server

Chen, Shigang; Xiao, Qingjun

2017-01-01

This book presents several compact and fast methods for online traffic measurement of big network data. It describes challenges of online traffic measurement, discusses the state of the field, and provides an overview of the potential solutions to major problems. The authors introduce the problem of per-flow size measurement for big network data and present a fast and scalable counter architecture, called Counter Tree, which leverages a two-dimensional counter sharing scheme to achieve far better memory efficiency and significantly extend estimation range. Unlike traditional approaches to cardinality estimation problems that allocate a separated data structure (called estimator) for each flow, this book takes a different design path by viewing all the flows together as a whole: each flow is allocated with a virtual estimator, and these virtual estimators share a common memory space. A framework of virtual estimators is designed to apply the idea of sharing to an array of cardinality estimation solutions, achi...

Extracting information from multiplex networks

Science.gov (United States)

Iacovacci, Jacopo; Bianconi, Ginestra

2016-06-01

Multiplex networks are generalized network structures that are able to describe networks in which the same set of nodes are connected by links that have different connotations. Multiplex networks are ubiquitous since they describe social, financial, engineering, and biological networks as well. Extending our ability to analyze complex networks to multiplex network structures increases greatly the level of information that is possible to extract from big data. For these reasons, characterizing the centrality of nodes in multiplex networks and finding new ways to solve challenging inference problems defined on multiplex networks are fundamental questions of network science. In this paper, we discuss the relevance of the Multiplex PageRank algorithm for measuring the centrality of nodes in multilayer networks and we characterize the utility of the recently introduced indicator function Θ ˜ S for describing their mesoscale organization and community structure. As working examples for studying these measures, we consider three multiplex network datasets coming for social science.

Exploring the morphospace of communication efficiency in complex networks.

Directory of Open Access Journals (Sweden)

Joaquín Goñi

Full Text Available Graph theoretical analysis has played a key role in characterizing global features of the topology of complex networks, describing diverse systems such as protein interactions, food webs, social relations and brain connectivity. How system elements communicate with each other depends not only on the structure of the network, but also on the nature of the system's dynamics which are constrained by the amount of knowledge and resources available for communication processes. Complementing widely used measures that capture efficiency under the assumption that communication preferentially follows shortest paths across the network ("routing", we define analytic measures directed at characterizing network communication when signals flow in a random walk process ("diffusion". The two dimensions of routing and diffusion efficiency define a morphospace for complex networks, with different network topologies characterized by different combinations of efficiency measures and thus occupying different regions of this space. We explore the relation of network topologies and efficiency measures by examining canonical network models, by evolving networks using a multi-objective optimization strategy, and by investigating real-world network data sets. Within the efficiency morphospace, specific aspects of network topology that differentially favor efficient communication for routing and diffusion processes are identified. Charting regions of the morphospace that are occupied by canonical, evolved or real networks allows inferences about the limits of communication efficiency imposed by connectivity and dynamics, as well as the underlying selection pressures that have shaped network topology.

Reciprocity of weighted networks.

Science.gov (United States)

Squartini, Tiziano; Picciolo, Francesco; Ruzzenenti, Franco; Garlaschelli, Diego

2013-01-01

In directed networks, reciprocal links have dramatic effects on dynamical processes, network growth, and higher-order structures such as motifs and communities. While the reciprocity of binary networks has been extensively studied, that of weighted networks is still poorly understood, implying an ever-increasing gap between the availability of weighted network data and our understanding of their dyadic properties. Here we introduce a general approach to the reciprocity of weighted networks, and define quantities and null models that consistently capture empirical reciprocity patterns at different structural levels. We show that, counter-intuitively, previous reciprocity measures based on the similarity of mutual weights are uninformative. By contrast, our measures allow to consistently classify different weighted networks according to their reciprocity, track the evolution of a network's reciprocity over time, identify patterns at the level of dyads and vertices, and distinguish the effects of flux (im)balances or other (a)symmetries from a true tendency towards (anti-)reciprocation.

Guidelines for defining and documenting data on costs of possible environmental protection measures

Energy Technology Data Exchange (ETDEWEB)

Marlowe, I.; King, K.; Boyd, R.; Bouscaren, R.; Pacyna, J. [AEA Technology Environment, Harwell (United Kingdom)

1999-07-01

The Guidelines are intended to promote good practice in the documenting and use of data on the costs of possible environmental protection measures in the context of international data comparisons. The minimum information needed to describe the cost of an environmental protection measures is: details of pollution source; details of the environmental protection measure and its performance characteristics; how costs are defined; the year to which data apply; indications of data uncertainty; how pollutants are defined; and reference to data sources. Guidelines are given for these seven items. These are followed by descriptions of various methods of data processing - dealing with information; calculating annual costs; discount/interest rates; and additional issues relating to the implementation of cost data. 16 refs., 5 tabs., 6 apps.

Centrality measures and thermodynamic formalism for complex networks.

Science.gov (United States)

Delvenne, Jean-Charles; Libert, Anne-Sophie

2011-04-01

In the study of small and large networks it is customary to perform a simple random walk where the random walker jumps from one node to one of its neighbors with uniform probability. The properties of this random walk are intimately related to the combinatorial properties of the network. In this paper we propose to use the Ruelle-Bowens random walk instead, whose probability transitions are chosen in order to maximize the entropy rate of the walk on an unweighted graph. If the graph is weighted, then a free energy is optimized instead of the entropy rate. Specifically, we introduce a centrality measure for large networks, which is the stationary distribution attained by the Ruelle-Bowens random walk; we name it entropy rank. We introduce a more general version, which is able to deal with disconnected networks, under the name of free-energy rank. We compare the properties of those centrality measures with the classic PageRank and hyperlink-induced topic search (HITS) on both toy and real-life examples, in particular their robustness to small modifications of the network. We show that our centrality measures are more discriminating than PageRank, since they are able to distinguish clearly pages that PageRank regards as almost equally interesting, and are more sensitive to the medium-scale details of the graph.

Sensor Networks for Optimal Target Localization with Bearings-Only Measurements in Constrained Three-Dimensional Scenarios

Directory of Open Access Journals (Sweden)

Joaquin Aranda

2013-08-01

Full Text Available In this paper, we address the problem of determining the optimal geometric configuration of an acoustic sensor network that will maximize the angle-related information available for underwater target positioning. In the set-up adopted, a set of autonomous vehicles carries a network of acoustic units that measure the elevation and azimuth angles between a target and each of the receivers on board the vehicles. It is assumed that the angle measurements are corrupted by white Gaussian noise, the variance of which is distance-dependent. Using tools from estimation theory, the problem is converted into that of minimizing, by proper choice of the sensor positions, the trace of the inverse of the Fisher Information Matrix (also called the Cramer-Rao Bound matrix to determine the sensor configuration that yields the minimum possible covariance of any unbiased target estimator. It is shown that the optimal configuration of the sensors depends explicitly on the intensity of the measurement noise, the constraints imposed on the sensor configuration, the target depth and the probabilistic distribution that defines the prior uncertainty in the target position. Simulation examples illustrate the key results derived.

Sensor networks for optimal target localization with bearings-only measurements in constrained three-dimensional scenarios.

Science.gov (United States)

Moreno-Salinas, David; Pascoal, Antonio; Aranda, Joaquin

2013-08-12

In this paper, we address the problem of determining the optimal geometric configuration of an acoustic sensor network that will maximize the angle-related information available for underwater target positioning. In the set-up adopted, a set of autonomous vehicles carries a network of acoustic units that measure the elevation and azimuth angles between a target and each of the receivers on board the vehicles. It is assumed that the angle measurements are corrupted by white Gaussian noise, the variance of which is distance-dependent. Using tools from estimation theory, the problem is converted into that of minimizing, by proper choice of the sensor positions, the trace of the inverse of the Fisher Information Matrix (also called the Cramer-Rao Bound matrix) to determine the sensor configuration that yields the minimum possible covariance of any unbiased target estimator. It is shown that the optimal configuration of the sensors depends explicitly on the intensity of the measurement noise, the constraints imposed on the sensor configuration, the target depth and the probabilistic distribution that defines the prior uncertainty in the target position. Simulation examples illustrate the key results derived.

The impact of measurement errors in the identification of regulatory networks

Directory of Open Access Journals (Sweden)

Sato João R

2009-12-01

Full Text Available Abstract Background There are several studies in the literature depicting measurement error in gene expression data and also, several others about regulatory network models. However, only a little fraction describes a combination of measurement error in mathematical regulatory networks and shows how to identify these networks under different rates of noise. Results This article investigates the effects of measurement error on the estimation of the parameters in regulatory networks. Simulation studies indicate that, in both time series (dependent and non-time series (independent data, the measurement error strongly affects the estimated parameters of the regulatory network models, biasing them as predicted by the theory. Moreover, when testing the parameters of the regulatory network models, p-values computed by ignoring the measurement error are not reliable, since the rate of false positives are not controlled under the null hypothesis. In order to overcome these problems, we present an improved version of the Ordinary Least Square estimator in independent (regression models and dependent (autoregressive models data when the variables are subject to noises. Moreover, measurement error estimation procedures for microarrays are also described. Simulation results also show that both corrected methods perform better than the standard ones (i.e., ignoring measurement error. The proposed methodologies are illustrated using microarray data from lung cancer patients and mouse liver time series data. Conclusions Measurement error dangerously affects the identification of regulatory network models, thus, they must be reduced or taken into account in order to avoid erroneous conclusions. This could be one of the reasons for high biological false positive rates identified in actual regulatory network models.

Tariffing of energy measured consumers in the distribution network

International Nuclear Information System (INIS)

2006-01-01

Criteria for socio-economic effective tariffing of energy-measured clients in the distribution network are discussed (i.e. households, leisure homes and smaller business clients), this means consumers that do not have hourly measurements or effect measurements. The tariffs should be based on variable segments that reflect short-term marginal costs in the network (in practice loss of transfer) and fixed segments that to the least extent possible influence the consumers' decisions in the choice of energy solutions, both in short term and long term. High-priced energy segments and effect based fixed segments may give unfortunate socio-economic price signals compared to the marginal long-term network costs. A fixed segment per measurement unit is in principle completely neutral, but it is to some extent vulnerable to strategic adjustments if the consumers choose collective measurement. This is not necessarily a big problem in practice (author)

A Step towards Developing a Sustainability Performance Measure within Industrial Networks

Directory of Open Access Journals (Sweden)

Samaneh Shokravi

2014-04-01

Full Text Available Despite the plethora of literature in sustainability and supply chain management in the recent years, a quantitative tool that measures the sustainability performance of an industrial supply network, considering the uncertainties of existing data, is hard to find. This conceptual paper is aimed at establishing a quantitative measure for the sustainability performance of industrial supply networks that considers aleatory and epistemic uncertainties in its environmental performance evaluation. The measure is built upon economic, environmental and social performance evaluation models. These models address a number of shortcomings in the literature, such as incomplete and inaccurate calculation of environmental impacts, as well as the disregard for aleatory and epistemic uncertainties in the input data and, more importantly, the scarce number of quantitative social sustainability measures. Dyadic interactions are chosen for the network, while the network members have a revenue-sharing relationship. This relationship promotes sharing of the required information for the use of the proposed model. This measure provides an approach to quantify the environmental, social and economic sustainability performances of a supply network. Moreover, as this measure is not specifically designed for an industrial sector, it can be employed over an evolving and diverse industrial network.

Security Analysis of a Software Defined Wide Area Network Solution

OpenAIRE

Rajendran, Ashok

2016-01-01

Enterprise wide area network (WAN) is a private network that connects the computers and other devices across an organisation's branch locations and the data centers. It forms the backbone of enterprise communication. Currently, multiprotocol label switching (MPLS) is commonly used to provide this service. As a recent alternative to MPLS, software-dened wide area networking (SD-WAN) solutions are being introduced as an IP based cloud-networking service for enterprises. SD-WAN virtualizes the n...

Implementing Resource-aware Multicast Forwarding in Software Defined Networks

DEFF Research Database (Denmark)

Poderys, Justas; Sunny, Anjusha; Soler, José

2018-01-01

Using multicast data transmissions, data can be eciently distributed to a high number of network users. However, in order to ef-ciently stream multimedia using multicast communication, multicast routing protocols must have knowledge of all network links and their available bandwidth. In Software...

Testing the Feasibility of a Low-Cost Network Performance Measurement Infrastructure

Energy Technology Data Exchange (ETDEWEB)

Chevalier, Scott [Indiana Univ., Bloomington, IN (United States). International Networks; Schopf, Jennifer M. [Indiana Univ., Bloomington, IN (United States). International Networks; Miller, Kenneth [Pennsylvania State Univ., University Park, PA (United States). Telecommunications and Networking Services; Zurawski, Jason [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Energy Sciences Network

2016-07-01

Todays science collaborations depend on reliable, high performance networks, but monitoring the end-to-end performance of a network can be costly and difficult. The most accurate approaches involve using measurement equipment in many locations, which can be both expensive and difficult to manage due to immobile or complicated assets. The perfSONAR framework facilitates network measurement making management of the tests more reasonable. Traditional deployments have used over-provisioned servers, which can be expensive to deploy and maintain. As scientific network uses proliferate, there is a desire to instrument more facets of a network to better understand trends. This work explores low cost alternatives to assist with network measurement. Benefits include the ability to deploy more resources quickly, and reduced capital and operating expenditures. Finally, we present candidate platforms and a testing scenario that evaluated the relative merits of four types of small form factor equipment to deliver accurate performance measurements.

Maslach Burnout Inventory and a Self-Defined, Single-Item Burnout Measure Produce Different Clinician and Staff Burnout Estimates.

Science.gov (United States)

Knox, Margae; Willard-Grace, Rachel; Huang, Beatrice; Grumbach, Kevin

2018-06-04

Clinicians and healthcare staff report high levels of burnout. Two common burnout assessments are the Maslach Burnout Inventory (MBI) and a single-item, self-defined burnout measure. Relatively little is known about how the measures compare. To identify the sensitivity, specificity, and concurrent validity of the self-defined burnout measure compared to the more established MBI measure. Cross-sectional survey (November 2016-January 2017). Four hundred forty-four primary care clinicians and 606 staff from three San Francisco Aarea healthcare systems. The MBI measure, calculated from a high score on either the emotional exhaustion or cynicism subscale, and a single-item measure of self-defined burnout. Concurrent validity was assessed using a validated, 7-item team culture scale as reported by Willard-Grace et al. (J Am Board Fam Med 27(2):229-38, 2014) and a standard question about workplace atmosphere as reported by Rassolian et al. (JAMA Intern Med 177(7):1036-8, 2017) and Linzer et al. (Ann Intern Med 151(1):28-36, 2009). Similar to other nationally representative burnout estimates, 52% of clinicians (95% CI: 47-57%) and 46% of staff (95% CI: 42-50%) reported high MBI emotional exhaustion or high MBI cynicism. In contrast, 29% of clinicians (95% CI: 25-33%) and 31% of staff (95% CI: 28-35%) reported "definitely burning out" or more severe symptoms on the self-defined burnout measure. The self-defined measure's sensitivity to correctly identify MBI-assessed burnout was 50.4% for clinicians and 58.6% for staff; specificity was 94.7% for clinicians and 92.3% for staff. Area under the receiver operator curve was 0.82 for clinicians and 0.81 for staff. Team culture and atmosphere were significantly associated with both self-defined burnout and the MBI, confirming concurrent validity. Point estimates of burnout notably differ between the self-defined and MBI measures. Compared to the MBI, the self-defined burnout measure misses half of high-burnout clinicians and more

Are self-report measures able to define individuals as physically active or inactive?

NARCIS (Netherlands)

Steene-Johannessen, J.; Anderssen, S.A.; Ploeg, H.P. van der; Hendriksen, I.J.M.; Donnelly, A.E.; Brage, S.; Ekelund, U.

2016-01-01

Purpose: Assess the agreement between commonly used self-report methods compared with objectively measured physical activity (PA) in defining the prevalence of individuals compliant with PA recommendations. Methods: Time spent in moderate and vigorous PA (MVPA) was measured at two time points in

Measuring structural similarity in large online networks.

Science.gov (United States)

Shi, Yongren; Macy, Michael

2016-09-01

Structural similarity based on bipartite graphs can be used to detect meaningful communities, but the networks have been tiny compared to massive online networks. Scalability is important in applications involving tens of millions of individuals with highly skewed degree distributions. Simulation analysis holding underlying similarity constant shows that two widely used measures - Jaccard index and cosine similarity - are biased by the distribution of out-degree in web-scale networks. However, an alternative measure, the Standardized Co-incident Ratio (SCR), is unbiased. We apply SCR to members of Congress, musical artists, and professional sports teams to show how massive co-following on Twitter can be used to map meaningful affiliations among cultural entities, even in the absence of direct connections to one another. Our results show how structural similarity can be used to map cultural alignments and demonstrate the potential usefulness of social media data in the study of culture, politics, and organizations across the social and behavioral sciences. Copyright © 2016 Elsevier Inc. All rights reserved.

Optimizing bulk data transfers using network measurements: A practical case

International Nuclear Information System (INIS)

Ciuffoletti, A; Merola, L; Palmieri, F; Russo, G; Pardi, S

2010-01-01

In modern Data Grid infrastructures, we increasingly face the problem of providing the running applications with fast and reliable access to large data volumes, often geographically distributed across the network. As a direct consequence, the concept of replication has been adopted by the grid community to increase data availability and maximize job throughput. To be really effective, such process has to be driven by specific optimization strategies that define when and where replicas should be created or deleted on a per-site basis, and which replicas a job should use. These strategies have to take into account the available network bandwidth as a primary resource, prior to any consideration about storage or processing power. We present a novel replica management service, integrated within the Gluedomains active network monitoring architecture, designed and implemented within the centralized collective middleware framework of the SCoPE project to provide network-aware transfer services for data intensive Grid applications.

Defining Usability of PN Services

DEFF Research Database (Denmark)

Nicolajsen, Hanne Westh; Ahola, Titta; Fleury, Alexandre

In this deliverable usability and user experience are defined in relation to MAGNET Beyond technologies, and it is described how the main MAGNET Beyond concepts can be evaluated through the involvement of users. The concepts include the new "Activity based communication approach" for interacting...... with the MAGNET Beyond system, as well as the core concepts: Personal Network, Personal Network-Federation, Service Discovery, User Profile Management, Personal Network Management, Privacy and Security and Context Awareness. The overall plans for the final usability evaluation are documented based on the present...

Toward defining and measuring social accountability in graduate medical education: a stakeholder study.

Science.gov (United States)

Reddy, Anjani T; Lazreg, Sonia A; Phillips, Robert L; Bazemore, Andrew W; Lucan, Sean C

2013-09-01

Since 1965, Medicare has publically financed graduate medical education (GME) in the United States. Given public financing, various advisory groups have argued that GME should be more socially accountable. Several efforts are underway to develop accountability measures for GME that could be tied to Medicare payments, but it is not clear how to measure or even define social accountability. We explored how GME stakeholders perceive, define, and measure social accountability. Through purposive and snowball sampling, we completed semistructured interviews with 18 GME stakeholders from GME training sites, government agencies, and health care organizations. We analyzed interview field notes and audiorecordings using a flexible, iterative, qualitative group process to identify themes. THREE THEMES EMERGED IN REGARDS TO DEFINING SOCIAL ACCOUNTABILITY: (1) creating a diverse physician workforce to address regional needs and primary care and specialty shortages; (2) ensuring quality in training and care to best serve patients; and (3) providing service to surrounding communities and the general public. All but 1 stakeholder believed GME institutions have a responsibility to be socially accountable. Reported barriers to achieving social accountability included training time constraints, financial limitations, and institutional resistance. Suggestions for measuring social accountability included reviewing graduates' specialties and practice locations, evaluating curricular content, and reviewing program services to surrounding communities. Most stakeholders endorsed the concept of social accountability in GME, suggesting definitions and possible measures that could inform policy makers calls for increased accountability despite recognized barriers.

Skill networks and measures of complex human capital.

Science.gov (United States)

Anderson, Katharine A

2017-11-28

We propose a network-based method for measuring worker skills. We illustrate the method using data from an online freelance website. Using the tools of network analysis, we divide skills into endogenous categories based on their relationship with other skills in the market. Workers who specialize in these different areas earn dramatically different wages. We then show that, in this market, network-based measures of human capital provide additional insight into wages beyond traditional measures. In particular, we show that workers with diverse skills earn higher wages than those with more specialized skills. Moreover, we can distinguish between two different types of workers benefiting from skill diversity: jacks-of-all-trades, whose skills can be applied independently on a wide range of jobs, and synergistic workers, whose skills are useful in combination and fill a hole in the labor market. On average, workers whose skills are synergistic earn more than jacks-of-all-trades. Copyright © 2017 the Author(s). Published by PNAS.

Quantitative Analysis of the Security of Software-Defined Network Controller Using Threat/Effort Model

Directory of Open Access Journals (Sweden)

Zehui Wu

2017-01-01

Full Text Available SDN-based controller, which is responsible for the configuration and management of the network, is the core of Software-Defined Networks. Current methods, which focus on the secure mechanism, use qualitative analysis to estimate the security of controllers, leading to inaccurate results frequently. In this paper, we employ a quantitative approach to overcome the above shortage. Under the analysis of the controller threat model we give the formal model results of the APIs, the protocol interfaces, and the data items of controller and further provide our Threat/Effort quantitative calculation model. With the help of Threat/Effort model, we are able to compare not only the security of different versions of the same kind controller but also different kinds of controllers and provide a basis for controller selection and secure development. We evaluated our approach in four widely used SDN-based controllers which are POX, OpenDaylight, Floodlight, and Ryu. The test, which shows the similarity outcomes with the traditional qualitative analysis, demonstrates that with our approach we are able to get the specific security values of different controllers and presents more accurate results.

Gross anatomy of network security

Science.gov (United States)

Siu, Thomas J.

2002-01-01

Information security involves many branches of effort, including information assurance, host level security, physical security, and network security. Computer network security methods and implementations are given a top-down description to permit a medically focused audience to anchor this information to their daily practice. The depth of detail of network functionality and security measures, like that of the study of human anatomy, can be highly involved. Presented at the level of major gross anatomical systems, this paper will focus on network backbone implementation and perimeter defenses, then diagnostic tools, and finally the user practices (the human element). Physical security measures, though significant, have been defined as beyond the scope of this presentation.

Smart thermal networks for smart cities - Introduction of concepts and measures

Science.gov (United States)

Schmidt, R. R.; Pol, O.; Basciotti, D.; Page, J.

2012-10-01

In order to contribute to high living standards, climate mitigation and energy supply security, future urban energy systems require a holistic approach. In particular an intelligent integration of thermal networks is necessary. This paper will briefly present the "smart city" concept and introduce an associated definition for smart thermal networks defined on three levels: 1. the interaction with urban planning processes and the interface to the overall urban energy system, 2. the adaptation of the temperature level and 3. supply and demand-side management strategies.

Measuring effectiveness of a university by a parallel network DEA model

Science.gov (United States)

Kashim, Rosmaini; Kasim, Maznah Mat; Rahman, Rosshairy Abd

2017-11-01

Universities contribute significantly to the development of human capital and socio-economic improvement of a country. Due to that, Malaysian universities carried out various initiatives to improve their performance. Most studies have used the Data Envelopment Analysis (DEA) model to measure efficiency rather than effectiveness, even though, the measurement of effectiveness is important to realize how effective a university in achieving its ultimate goals. A university system has two major functions, namely teaching and research and every function has different resources based on its emphasis. Therefore, a university is actually structured as a parallel production system with its overall effectiveness is the aggregated effectiveness of teaching and research. Hence, this paper is proposing a parallel network DEA model to measure the effectiveness of a university. This model includes internal operations of both teaching and research functions into account in computing the effectiveness of a university system. In literature, the graduate and the number of program offered are defined as the outputs, then, the employed graduates and the numbers of programs accredited from professional bodies are considered as the outcomes for measuring the teaching effectiveness. Amount of grants is regarded as the output of research, while the different quality of publications considered as the outcomes of research. A system is considered effective if only all functions are effective. This model has been tested using a hypothetical set of data consisting of 14 faculties at a public university in Malaysia. The results show that none of the faculties is relatively effective for the overall performance. Three faculties are effective in teaching and two faculties are effective in research. The potential applications of the parallel network DEA model allow the top management of a university to identify weaknesses in any functions in their universities and take rational steps for improvement.

Alpha emitters activity measurement using the defined solid angle method

International Nuclear Information System (INIS)

Blanchis, P.

1983-01-01

The defined solid angle counting method can reach a very high accuracy, specially for heavy ions as alpha particles emitted by a radioactive source. The activity measurement of such sources with a relative uncertainty of the order of 0.01% is investigated. Such an accuracy is available only under suitable conditions: the radiation emitted by the source must be isotropic and all the particles emitted in the effective solid angle must be detected. The efficiency detection value must be equal to unity and phenomena such as absorption or scattering must be null. It is shown that corrections often become necessary. All parameters which can influence the measurements are studied [fr

Information loss method to measure node similarity in networks

Science.gov (United States)

Li, Yongli; Luo, Peng; Wu, Chong

2014-09-01

Similarity measurement for the network node has been paid increasing attention in the field of statistical physics. In this paper, we propose an entropy-based information loss method to measure the node similarity. The whole model is established based on this idea that less information loss is caused by seeing two more similar nodes as the same. The proposed new method has relatively low algorithm complexity, making it less time-consuming and more efficient to deal with the large scale real-world network. In order to clarify its availability and accuracy, this new approach was compared with some other selected approaches on two artificial examples and synthetic networks. Furthermore, the proposed method is also successfully applied to predict the network evolution and predict the unknown nodes' attributions in the two application examples.

Procedure to Solve Network DEA Based on a Virtual Gap Measurement Model

Directory of Open Access Journals (Sweden)

Fuh-hwa Franklin Liu

2017-01-01

Full Text Available Network DEA models assess production systems that contain a set of network-structured subsystems. Each subsystem has input and output measures from and to the external network and has intermediate measures that link to other subsystems. Most published studies demonstrate how to employ DEA models to establish network DEA models. Neither static nor dynamic network DEA models adjust the links. This paper applies the virtual gap measurement (VGM model to construct a mixed integer program to solve dynamic network DEA problems. The mixed integer program sets the total numbers of “as-input” and “as-output” equal to the total number of links in the objective function. To obtain the best-practice efficiency, each DMU determines a set of weights for inputs, outputs, and links. The links are played either “as-input” or “as-output.” Input and as-input measures reduce slack, whereas output and as-output measures increase slacks to attain their target on the production frontier.

Performance evaluation of data center service localization based on virtual resource migration in software defined elastic optical network.

Science.gov (United States)

Yang, Hui; Zhang, Jie; Ji, Yuefeng; Tan, Yuanlong; Lin, Yi; Han, Jianrui; Lee, Young

2015-09-07

Data center interconnection with elastic optical network is a promising scenario to meet the high burstiness and high-bandwidth requirements of data center services. In our previous work, we implemented cross stratum optimization of optical network and application stratums resources that allows to accommodate data center services. In view of this, this study extends the data center resources to user side to enhance the end-to-end quality of service. We propose a novel data center service localization (DCSL) architecture based on virtual resource migration in software defined elastic data center optical network. A migration evaluation scheme (MES) is introduced for DCSL based on the proposed architecture. The DCSL can enhance the responsiveness to the dynamic end-to-end data center demands, and effectively reduce the blocking probability to globally optimize optical network and application resources. The overall feasibility and efficiency of the proposed architecture are experimentally verified on the control plane of our OpenFlow-based enhanced SDN testbed. The performance of MES scheme under heavy traffic load scenario is also quantitatively evaluated based on DCSL architecture in terms of path blocking probability, provisioning latency and resource utilization, compared with other provisioning scheme.

Evaluate Data Center Network Performance

DEFF Research Database (Denmark)

Pilimon, Artur

through a data center network, which is usually built with layer 2 switches and layer 3 routers. The topology of the data center network is crucial for latency in the data communication to and from the data center and between servers in the data center. Tests can be conducted to measure latency and other...... Engineering, scientists evaluate data center network topologies with an SDN-based (Software-Defined Networking) control framework measuring network performance – primarily latency. This can be used to plan data center scaling by testing how a new topology will function before changes are made. Data center...... performance parameters for different data center network topologies. It is however important that tests can be repeated and reproduced to have comparable information from the tests. There are, of course, many topologies that can be used for data center networks. At DTU Fotonik, Department of Photonics...

Software defined networking for improved wireless sensor network management: a survey

CSIR Research Space (South Africa)

Ndiaye, M

2017-05-01

Full Text Available Wireless sensor networks (WSNs) are becoming increasingly popular with the advent of the Internet of things (IoT). Various real-world applications of WSNs such as in smart grids, smart farming and smart health would require a potential deployment...

Evaluation of Network Reliability for Computer Networks with Multiple Sources

Directory of Open Access Journals (Sweden)

Yi-Kuei Lin

2012-01-01

Full Text Available Evaluating the reliability of a network with multiple sources to multiple sinks is a critical issue from the perspective of quality management. Due to the unrealistic definition of paths of network models in previous literature, existing models are not appropriate for real-world computer networks such as the Taiwan Advanced Research and Education Network (TWAREN. This paper proposes a modified stochastic-flow network model to evaluate the network reliability of a practical computer network with multiple sources where data is transmitted through several light paths (LPs. Network reliability is defined as being the probability of delivering a specified amount of data from the sources to the sink. It is taken as a performance index to measure the service level of TWAREN. This paper studies the network reliability of the international portion of TWAREN from two sources (Taipei and Hsinchu to one sink (New York that goes through a submarine and land surface cable between Taiwan and the United States.

Calibration-measurement unit for the automation of vector network analyzer measurements

Directory of Open Access Journals (Sweden)

I. Rolfes

2008-05-01

Full Text Available With the availability of multi-port vector network analyzers, the need for automated, calibrated measurement facilities increases. In this contribution, a calibration-measurement unit is presented which realizes a repeatable automated calibration of the measurement setup as well as a user-friendly measurement of the device under test (DUT. In difference to commercially available calibration units, which are connected to the ports of the vector network analyzer preceding a measurement and which are then removed so that the DUT can be connected, the presented calibration-measurement unit is permanently connected to the ports of the VNA for the calibration as well as for the measurement of the DUT. This helps to simplify the calibrated measurement of complex scattering parameters. Moreover, a full integration of the calibration unit into the analyzer setup becomes possible. The calibration-measurement unit is based on a multiport switch setup of e.g. electromechanical relays. Under the assumption of symmetry of a switch, on the one hand the unit realizes the connection of calibration standards like one-port reflection standards and two-port through connections between different ports and on the other hand it enables the connection of the DUT. The calibration-measurement unit is applicable for two-port VNAs as well as for multiport VNAs. For the calibration of the unit, methods with completely known calibration standards like SOLT (short, open, load, through as well as self-calibration procedures like TMR or TLR can be applied.

Modelling computer networks

International Nuclear Information System (INIS)

Max, G

2011-01-01

Traffic models in computer networks can be described as a complicated system. These systems show non-linear features and to simulate behaviours of these systems are also difficult. Before implementing network equipments users wants to know capability of their computer network. They do not want the servers to be overloaded during temporary traffic peaks when more requests arrive than the server is designed for. As a starting point for our study a non-linear system model of network traffic is established to exam behaviour of the network planned. The paper presents setting up a non-linear simulation model that helps us to observe dataflow problems of the networks. This simple model captures the relationship between the competing traffic and the input and output dataflow. In this paper, we also focus on measuring the bottleneck of the network, which was defined as the difference between the link capacity and the competing traffic volume on the link that limits end-to-end throughput. We validate the model using measurements on a working network. The results show that the initial model estimates well main behaviours and critical parameters of the network. Based on this study, we propose to develop a new algorithm, which experimentally determines and predict the available parameters of the network modelled.

Implementasi Wireless Quality of Service dengan Metode Load Switching Jaringan Seluler Menggunakan Software Defined Network untuk Meningkatkan Network Reliability pada Jaringan Dinamis

Directory of Open Access Journals (Sweden)

Yoga Bayu Aji Pranawa

2017-03-01

Full Text Available Wireless Quality of Service (QOS adalah salah satu dimensi mobilitas, yaitu sebuah metode yang digunakan untuk menjaga kualitas suatu jaringan nirkabel. QOS diperlukan sebagai sebuah metode untuk memenuhi kriteria pelayanan sistem bagi pengguna, yaitu confidentiality, integrity, dan availability. Beberapa aspek yang menjadi topik utama dalam QOS adalah failure and recovery mechanism, variable bandwidth, computing distribution, discovery mechanism, variable lantency, dan performance feedback. Wireless yang dibahas pada penelitian ini dititik beratkan pada jaringan seluler yang cenderung tidak reliable pada daerah tertentu. Oleh karena itu dibutuhkan sebuah mekanisme yang dapat mengatasi tidak stabilnya jaringan seluler tersebut. mplementasi mekanisme yang diterapkan pada penelitian ini adalah dengan menerapkan load switching pada jaringan seluler dengan menggunakan beberapa provider dan menerapkan teknologi Software Defined Network (SDN. Berdasarkan hasi uji coba dapat disimpulkan bahwa sistem yang dibuat pada penelitian ini dapat menerapkan wireless quality of service dan meningkatkan network reliability sebesar 65,29% dan 83,87% lebih baik untuk penggunaan tanpa waktu tunggu dan dengan waktu tunggu pada suatu jaringan  dinamis.

Research on the method of measuring space information network capacity in communication service

Directory of Open Access Journals (Sweden)

Zhu Shichao

2017-02-01

Full Text Available Because of the large scale characteristic of space information network in terms of space and time and the increasing of its complexity,existing measuring methods of information transmission capacity have been unable to measure the existing and future space information networkeffectively.In this study,we firstly established a complex model of space information network,and measured the whole space information network capacity by means of analyzing data access capability to the network and data transmission capability within the network.At last,we verified the rationality of the proposed measuring method by using STK and Matlab simulation software for collaborative simulation.

A game theory-based trust measurement model for social networks.

Science.gov (United States)

Wang, Yingjie; Cai, Zhipeng; Yin, Guisheng; Gao, Yang; Tong, Xiangrong; Han, Qilong

2016-01-01

In social networks, trust is a complex social network. Participants in online social networks want to share information and experiences with as many reliable users as possible. However, the modeling of trust is complicated and application dependent. Modeling trust needs to consider interaction history, recommendation, user behaviors and so on. Therefore, modeling trust is an important focus for online social networks. We propose a game theory-based trust measurement model for social networks. The trust degree is calculated from three aspects, service reliability, feedback effectiveness, recommendation credibility, to get more accurate result. In addition, to alleviate the free-riding problem, we propose a game theory-based punishment mechanism for specific trust and global trust, respectively. We prove that the proposed trust measurement model is effective. The free-riding problem can be resolved effectively through adding the proposed punishment mechanism.

Link-quality measurement and reporting in wireless sensor networks.

Science.gov (United States)

Chehri, Abdellah; Jeon, Gwanggil; Choi, Byoungjo

2013-03-04

Wireless Sensor networks (WSNs) are created by small hardware devices that possess the necessary functionalities to measure and exchange a variety of environmental data in their deployment setting. In this paper, we discuss the experiments in deploying a testbed as a first step towards creating a fully functional heterogeneous wireless network-based underground monitoring system. The system is mainly composed of mobile and static ZigBee nodes, which are deployed on the underground mine galleries for measuring ambient temperature. In addition, we describe the measured results of link characteristics such as received signal strength, latency and throughput for different scenarios.

Link-Quality Measurement and Reporting in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Byoungjo Choi

2013-03-01

Full Text Available Wireless Sensor networks (WSNs are created by small hardware devices that possess the necessary functionalities to measure and exchange a variety of environmental data in their deployment setting. In this paper, we discuss the experiments in deploying a testbed as a first step towards creating a fully functional heterogeneous wireless network-based underground monitoring system. The system is mainly composed of mobile and static ZigBee nodes, which are deployed on the underground mine galleries for measuring ambient temperature. In addition, we describe the measured results of link characteristics such as received signal strength, latency and throughput for different scenarios.

Measure of Node Similarity in Multilayer Networks

DEFF Research Database (Denmark)

Møllgaard, Anders; Zettler, Ingo; Dammeyer, Jesper

2016-01-01

university.Our analysis is based on data obtained using smartphones equipped with customdata collection software, complemented by questionnaire-based data. The networkof social contacts is represented as a weighted multilayer network constructedfrom different channels of telecommunication as well as data...... might bepresent in one layer of the multilayer network and simultaneously be absent inthe other layers. For a variable such as gender, our measure reveals atransition from similarity between nodes connected with links of relatively lowweight to dis-similarity for the nodes connected by the strongest...

Privacy Breach Analysis in Social Networks

Science.gov (United States)

Nagle, Frank

This chapter addresses various aspects of analyzing privacy breaches in social networks. We first review literature that defines three types of privacy breaches in social networks: interactive, active, and passive. We then survey the various network anonymization schemes that have been constructed to address these privacy breaches. After exploring these breaches and anonymization schemes, we evaluate a measure for determining the level of anonymity inherent in a network graph based on its topological structure. Finally, we close by emphasizing the difficulty of anonymizing social network data while maintaining usability for research purposes and offering areas for future work.

Circular resistor networks for electrical impedance tomography with partial boundary measurements

International Nuclear Information System (INIS)

Borcea, L; Mamonov, A V; Druskin, V

2010-01-01

We introduce an algorithm for the numerical solution of electrical impedance tomography (EIT) in two dimensions, with partial boundary measurements. The algorithm is an extension of the one in Borcea et al (2008 Inverse Problems 24 035013 (31pp)) and Vasquez (2006 PhD Thesis Rice University, Houston, TX, USA) for EIT with full boundary measurements. It is based on resistor networks that arise in finite volume discretizations of the elliptic partial differential equation for the potential on so-called optimal grids that are computed as part of the problem. The grids are adaptively refined near the boundary, where we measure and expect better resolution of the images. They can be used very efficiently in inversion, by defining a reconstruction mapping that is an approximate inverse of the forward map, and acts therefore as a preconditioner in any iterative scheme that solves the inverse problem via optimization. The main result in this paper is the construction of optimal grids for EIT with partial measurements by extremal quasiconformal (Teichmüller) transformations of the optimal grids for EIT with full boundary measurements. We present the algorithm for computing the reconstruction mapping on such grids, and we illustrate its performance with numerical simulations. The results show an interesting trade-off between the resolution of the reconstruction in the domain of the solution and distortions due to artificial anisotropy induced by the distribution of the measurement points on the accessible boundary

Arrester Resistive Current Measuring System Based on Heterogeneous Network

Science.gov (United States)

Zhang, Yun Hua; Li, Zai Lin; Yuan, Feng; Hou Pan, Feng; Guo, Zhan Nan; Han, Yue

2018-03-01

Metal Oxide Arrester (MOA) suffers from aging and poor insulation due to long-term impulse voltage and environmental impact, and the value and variation tendency of resistive current can reflect the health conditions of MOA. The common wired MOA detection need to use long cables, which is complicated to operate, and that wireless measurement methods are facing the problems of poor data synchronization and instability. Therefore a novel synchronous measurement system of arrester current resistive based on heterogeneous network is proposed, which simplifies the calculation process and improves synchronization, accuracy and stability and of the measuring system. This system combines LoRa wireless network, high speed wireless personal area network and the process layer communication, and realizes the detection of arrester working condition. Field test data shows that the system has the characteristics of high accuracy, strong anti-interference ability and good synchronization, which plays an important role in ensuring the stable operation of the power grid.

Community Structure in Online Collegiate Social Networks

Science.gov (United States)

Traud, Amanda; Kelsic, Eric; Mucha, Peter; Porter, Mason

2009-03-01

Online social networking sites have become increasingly popular with college students. The networks we studied are defined through ``friendships'' indicated by Facebook users from UNC, Oklahoma, Caltech, Georgetown, and Princeton. We apply the tools of network science to study the Facebook networks from these five different universities at a single point in time. We investigate each single-institution network's community structure, which we obtain through partitioning the graph using an eigenvector method. We use both graphical and quantitative tools, including pair-counting methods, which we interpret through statistical analysis and permutation tests to measure the correlations between the network communities and a set of characteristics given by each user (residence, class year, major, and high school). We also analyze the single gender subsets of these networks, and the impact of missing demographical data. Our study allows us to compare the online social networks for the five schools as well as infer differences in offline social interactions. At the schools studied, we were able to define which characteristics of the Facebook users correlate best with friendships.

Defining Tolerance: Impacts of Delay and Disruption when Managing Challenged Networks

Science.gov (United States)

Birrane, Edward J. III; Burleigh, Scott C.; Cerf, Vint

2011-01-01

Challenged networks exhibit irregularities in their communication performance stemming from node mobility, power constraints, and impacts from the operating environment. These irregularities manifest as high signal propagation delay and frequent link disruption. Understanding those limits of link disruption and propagation delay beyond which core networking features fail is an ongoing area of research. Various wireless networking communities propose tools and techniques that address these phenomena. Emerging standardization activities within the Internet Research Task Force (IRTF) and the Consultative Committee for Space Data Systems (CCSDS) look to build upon both this experience and scalability analysis. Successful research in this area is predicated upon identifying enablers for common communication functions (notably node discovery, duplex communication, state caching, and link negotiation) and how increased disruptions and delays affect their feasibility within the network. Networks that make fewer assumptions relating to these enablers provide more universal service. Specifically, reliance on node discovery and link negotiation results in network-specific operational concepts rather than scalable technical solutions. Fundamental to this debate are the definitions, assumptions, operational concepts, and anticipated scaling of these networks. This paper presents the commonalities and differences between delay and disruption tolerance, including support protocols and critical enablers. We present where and how these tolerances differ. We propose a set of use cases that must be accommodated by any standardized delay-tolerant network and discuss the implication of these on existing tool development.

Failure mitigation in software defined networking employing load type prediction

KAUST Repository

Bouacida, Nader; Alghadhban, Amer Mohammad JarAlla; Alalmaei, Shiyam Mohammed Abdullah; Mohammed, Haneen; Shihada, Basem

2017-01-01

The controller is a critical piece of the SDN architecture, where it is considered as the mastermind of SDN networks. Thus, its failure will cause a significant portion of the network to fail. Overload is one of the common causes of failure since

THE MEASUREMENT ELECTROMAGNETIC INTERFERENCE IN THE REVERSE TRACTION NETWORK

Directory of Open Access Journals (Sweden)

T. M. Serdiuk

2009-09-01

Full Text Available The original automated method of measurement of electrical noise in the return electric-traction network is proposed. It is realized on the base of car-laboratory “Automatics, telemechanics and communication”. The mathematic model of return electric-traction network is developed to scientific bases of automated measurement. It allows us obtaining the mathematic expressions for change of voltage and current harmonics in the rail net and taking into account the inhomogeneity of lines for the following analytic determination of a source of electric noise.

Smart thermal networks for smart cities – Introduction of concepts and measures

Directory of Open Access Journals (Sweden)

Basciotti D.

2012-10-01

Full Text Available In order to contribute to high living standards, climate mitigation and energy supply security, future urban energy systems require a holistic approach. In particular an intelligent integration of thermal networks is necessary. This paper will briefly present the “smart city” concept and introduce an associated definition for smart thermal networks defined on three levels: 1. the interaction with urban planning processes and the interface to the overall urban energy system, 2. the adaptation of the temperature level and 3. supply and demand-side management strategies.

Evaluation of Techniques to Detect Significant Network Performance Problems using End-to-End Active Network Measurements

Energy Technology Data Exchange (ETDEWEB)

Cottrell, R.Les; Logg, Connie; Chhaparia, Mahesh; /SLAC; Grigoriev, Maxim; /Fermilab; Haro, Felipe; /Chile U., Catolica; Nazir, Fawad; /NUST, Rawalpindi; Sandford, Mark

2006-01-25

End-to-End fault and performance problems detection in wide area production networks is becoming increasingly hard as the complexity of the paths, the diversity of the performance, and dependency on the network increase. Several monitoring infrastructures are built to monitor different network metrics and collect monitoring information from thousands of hosts around the globe. Typically there are hundreds to thousands of time-series plots of network metrics which need to be looked at to identify network performance problems or anomalous variations in the traffic. Furthermore, most commercial products rely on a comparison with user configured static thresholds and often require access to SNMP-MIB information, to which a typical end-user does not usually have access. In our paper we propose new techniques to detect network performance problems proactively in close to realtime and we do not rely on static thresholds and SNMP-MIB information. We describe and compare the use of several different algorithms that we have implemented to detect persistent network problems using anomalous variations analysis in real end-to-end Internet performance measurements. We also provide methods and/or guidance for how to set the user settable parameters. The measurements are based on active probes running on 40 production network paths with bottlenecks varying from 0.5Mbits/s to 1000Mbit/s. For well behaved data (no missed measurements and no very large outliers) with small seasonal changes most algorithms identify similar events. We compare the algorithms' robustness with respect to false positives and missed events especially when there are large seasonal effects in the data. Our proposed techniques cover a wide variety of network paths and traffic patterns. We also discuss the applicability of the algorithms in terms of their intuitiveness, their speed of execution as implemented, and areas of applicability. Our encouraging results compare and evaluate the accuracy of our

pO2 measurements in arteriolar networks.

Science.gov (United States)

Torres Filho, I P; Kerger, H; Intaglietta, M

1996-03-01

Previous studies from our laboratory have shown that the average arteriolar pO2 in the hamster skinfold preparation is lower than arterial systemic pO2. In the present work we tested the hypothesis that there is a longitudinal gradient of pO2 along precapillary vessels. Experiments were performed in Syrian golden hamsters bearing a dorsal skin chamber. The oxygen-dependent quenching of phosphorescence of palladium-porphyrin complexes was used to measure intravascular pO2 in the microcirculation. Arterioles were classified in four orders according to their position in the network, first-order vessels being the entrance points. Simultaneous determinations of diameter (D), red blood cell velocity, and systemic blood gases were also made. There was a significant fall of pO2 between vessels of different orders. First-order arterioles (mean D = 64 microns) had pO2 of 51.8 +/- 9.8 mm Hg (mean +/- SD) which was equivalent to approximately equal to 73% of the arterial systemic pO2. Within the arteriolar network, further decreases of intravascular pO2 were measured, leading to a pO2 of 34.0 +/- 7.9 mm Hg in terminal arterioles (mean D = 7.7 microns). In some vessels pO2 was measured in different positions of the same arteriole. The average longitudinal arteriolar oxygen saturation gradient was 3.4 +/- 0.4 delta %/mm (range 0.8-7.2). A significant and positive correlation was found between pO2 and microhemodynamic parameters when arterioles were grouped according to their order. This relation was not significant for venules which showed a mean pO2 of 30.8 +/- 10.8 mm Hg. Tissue pO2 averaged 24.6 +/- 5.8 mm Hg. We conclude that: (1) There is an oxygen loss in arterial vessels larger than 100 micrograms in diameter, (2) arteriolar pO2 in this preparation depends on the position of the vessel within the network, (3) a substantial portion of oxygen delivery to the hamster skin is provided by the arteriolar network, and (4) only a small pO2 gradient exists between terminal

Comparison of Neural Network Error Measures for Simulation of Slender Marine Structures

DEFF Research Database (Denmark)

Christiansen, Niels H.; Voie, Per Erlend Torbergsen; Winther, Ole

2014-01-01

Training of an artificial neural network (ANN) adjusts the internal weights of the network in order to minimize a predefined error measure. This error measure is given by an error function. Several different error functions are suggested in the literature. However, the far most common measure...

A Newly Developed Method for Computing Reliability Measures in a Water Supply Network

Directory of Open Access Journals (Sweden)

Jacek Malinowski

2016-01-01

Full Text Available A reliability model of a water supply network has beens examined. Its main features are: a topology that can be decomposed by the so-called state factorization into a (relativelysmall number of derivative networks, each having a series-parallel structure (1, binary-state components (either operative or failed with given flow capacities (2, a multi-state character of the whole network and its sub-networks - a network state is defined as the maximal flow between a source (sources and a sink (sinks (3, all capacities (component, network, and sub-network have integer values (4. As the network operates, its state changes due to component failures, repairs, and replacements. A newly developed method of computing the inter-state transition intensities has been presented. It is based on the so-called state factorization and series-parallel aggregation. The analysis of these intensities shows that the failure-repair process of the considered system is an asymptotically homogenous Markov process. It is also demonstrated how certain reliability parameters useful for the network maintenance planning can be determined on the basis of the asymptotic intensities. For better understanding of the presented method, an illustrative example is given. (original abstract

Quantifying the value of redundant measurements at GCOS Reference Upper-Air Network sites

Directory of Open Access Journals (Sweden)

F. Madonna

2014-11-01

Full Text Available The potential for measurement redundancy to reduce uncertainty in atmospheric variables has not been investigated comprehensively for climate observations. We evaluated the usefulness of entropy and mutual correlation concepts, as defined in information theory, for quantifying random uncertainty and redundancy in time series of the integrated water vapour (IWV and water vapour mixing ratio profiles provided by five highly instrumented GRUAN (GCOS, Global Climate Observing System, Reference Upper-Air Network stations in 2010–2012. Results show that the random uncertainties on the IWV measured with radiosondes, global positioning system, microwave and infrared radiometers, and Raman lidar measurements differed by less than 8%. Comparisons of time series of IWV content from ground-based remote sensing instruments with in situ soundings showed that microwave radiometers have the highest redundancy with the IWV time series measured by radiosondes and therefore the highest potential to reduce the random uncertainty of the radiosondes time series. Moreover, the random uncertainty of a time series from one instrument can be reduced by ~ 60% by constraining the measurements with those from another instrument. The best reduction of random uncertainty is achieved by conditioning Raman lidar measurements with microwave radiometer measurements. Specific instruments are recommended for atmospheric water vapour measurements at GRUAN sites. This approach can be applied to the study of redundant measurements for other climate variables.

Dynamic Video Streaming in Caching-enabled Wireless Mobile Networks

OpenAIRE

Liang, C.; Hu, S.

2017-01-01

Recent advances in software-defined mobile networks (SDMNs), in-network caching, and mobile edge computing (MEC) can have great effects on video services in next generation mobile networks. In this paper, we jointly consider SDMNs, in-network caching, and MEC to enhance the video service in next generation mobile networks. With the objective of maximizing the mean measurement of video quality, an optimization problem is formulated. Due to the coupling of video data rate, computing resource, a...

Hypergraph topological quantities for tagged social networks

Science.gov (United States)

Zlatić, Vinko; Ghoshal, Gourab; Caldarelli, Guido

2009-09-01

Recent years have witnessed the emergence of a new class of social networks, which require us to move beyond previously employed representations of complex graph structures. A notable example is that of the folksonomy, an online process where users collaboratively employ tags to resources to impart structure to an otherwise undifferentiated database. In a recent paper, we proposed a mathematical model that represents these structures as tripartite hypergraphs and defined basic topological quantities of interest. In this paper, we extend our model by defining additional quantities such as edge distributions, vertex similarity and correlations as well as clustering. We then empirically measure these quantities on two real life folksonomies, the popular online photo sharing site Flickr and the bookmarking site CiteULike. We find that these systems share similar qualitative features with the majority of complex networks that have been previously studied. We propose that the quantities and methodology described here can be used as a standard tool in measuring the structure of tagged networks.

World Input-Output Network.

Directory of Open Access Journals (Sweden)

Federica Cerina

Full Text Available Production systems, traditionally analyzed as almost independent national systems, are increasingly connected on a global scale. Only recently becoming available, the World Input-Output Database (WIOD is one of the first efforts to construct the global multi-regional input-output (GMRIO tables. By viewing the world input-output system as an interdependent network where the nodes are the individual industries in different economies and the edges are the monetary goods flows between industries, we analyze respectively the global, regional, and local network properties of the so-called world input-output network (WION and document its evolution over time. At global level, we find that the industries are highly but asymmetrically connected, which implies that micro shocks can lead to macro fluctuations. At regional level, we find that the world production is still operated nationally or at most regionally as the communities detected are either individual economies or geographically well defined regions. Finally, at local level, for each industry we compare the network-based measures with the traditional methods of backward linkages. We find that the network-based measures such as PageRank centrality and community coreness measure can give valuable insights into identifying the key industries.

Building GSM network in extreme conditions

Science.gov (United States)

Mikulec, M.; Voznak, M.; Fajkus, M.; Partila, P.; Tovarek, J.; Chmelikova, Z.

2015-05-01

The paper is focused on the building ad-hoc GSM network based on open source software and low-cost hardware. The created Base Transmission Station can be deployed and put into operation in a few minutes in a required area to ensure private communication between connected GSM mobile terminals. The convergence between BTS station and the other networks is possible through IP network. The paper tries to define connection parameters to provide sufficient quality of voice service between the GSM network and IP Multimedia Subsystem. The paper brings practical results of voice call quality measurement between users inside BTS station mobile network and users inside IP Multimedia Subsystem network. The calls are simulated by low-cost embedded solution for speech quality measurement in GSM network. This tool is under development of our laboratory and allows automatic speech quality measurement of any GSM or UMTS mobile network. The Perceptual Evaluation of Speech Quality method is used to get final comparable results. The communication between BTS station and connected networks has to be secured against the interception from the third party. The influence of the securing method for quality of service is presented in detail. Paper, apart from the quality of service measurement section, describes technical requirements for successful interconnection between BTS and IMS networks. The authentication, authorization and accounting methods in roaming between BTS and IMS system are presented too.

Implicitly Defined Neural Networks for Sequence Labeling

Science.gov (United States)

2017-07-31

ularity has soared for the Long Short - Term Memory (LSTM) (Hochreiter and Schmidhuber, 1997) and vari- ants such as Gated Recurrent Unit (GRU) (Cho et...610. Sepp Hochreiter and Jürgen Schmidhuber. 1997. Long short - term memory . Neural computation 9(8):1735– 1780. Zhiheng Huang, Wei Xu, and Kai Yu. 2015...network are coupled together, in order to improve perfor- mance on complex, long -range dependencies in either direction of a sequence. We contrast our

Social network analysis via multi-state reliability and conditional influence models

International Nuclear Information System (INIS)

Schneider, Kellie; Rainwater, Chase; Pohl, Ed; Hernandez, Ivan; Ramirez-Marquez, Jose Emmanuel

2013-01-01

This paper incorporates multi-state reliability measures into the assessment of a social network in which influence is treated as a multi-state commodity that flows through the network. The reliability of the network is defined as the probability that at least a certain level of influence reaches an intended target. We consider an individual's influence level as a function of the influence levels received from preceding actors in the network. We define several communication functions which describe the level of influence a particular actor will pass along to other actors within the network. Illustrative examples are presented, and the network reliability under the various communication influence levels is computed using exhaustive enumeration for a small example and Monte Carlo simulation for larger, more realistic sized examples.

Software defined networking to improve mobility management performance

NARCIS (Netherlands)

Karimzadeh Motallebi Azar, Morteza; Sperotto, Anna; Pras, Aiko; Sperotto, Anna; Doyen, Guillaume; Latré, Steven; Charalambides, Marinos; Stiller, Burkhard

2014-01-01

n mobile networks, efficient IP mobility management is a crucial issue for the mobile users changing their mobility anchor points during handover. In this regard several mobility management methods have been proposed. However, those are insufficient for the future mobile Internet in terms of

Output power distributions of mobile radio base stations based on network measurements

International Nuclear Information System (INIS)

Colombi, D; Thors, B; Persson, T; Törnevik, C; Wirén, N; Larsson, L-E

2013-01-01

In this work output power distributions of mobile radio base stations have been analyzed for 2G and 3G telecommunication systems. The approach is based on measurements in selected networks using performance surveillance tools part of the network Operational Support System (OSS). For the 3G network considered, direct measurements of output power levels were possible, while for the 2G networks, output power levels were estimated from measurements of traffic volumes. Both voice and data services were included in the investigation. Measurements were conducted for large geographical areas, to ensure good overall statistics, as well as for smaller areas to investigate the impact of different environments. For high traffic hours, the 90th percentile of the averaged output power was found to be below 65% and 45% of the available output power for the 2G and 3G systems, respectively.

Output power distributions of mobile radio base stations based on network measurements

Science.gov (United States)

Colombi, D.; Thors, B.; Persson, T.; Wirén, N.; Larsson, L.-E.; Törnevik, C.

2013-04-01

In this work output power distributions of mobile radio base stations have been analyzed for 2G and 3G telecommunication systems. The approach is based on measurements in selected networks using performance surveillance tools part of the network Operational Support System (OSS). For the 3G network considered, direct measurements of output power levels were possible, while for the 2G networks, output power levels were estimated from measurements of traffic volumes. Both voice and data services were included in the investigation. Measurements were conducted for large geographical areas, to ensure good overall statistics, as well as for smaller areas to investigate the impact of different environments. For high traffic hours, the 90th percentile of the averaged output power was found to be below 65% and 45% of the available output power for the 2G and 3G systems, respectively.

Network centrality measures and systemic risk: An application to the Turkish financial crisis

Science.gov (United States)

Kuzubaş, Tolga Umut; Ömercikoğlu, Inci; Saltoğlu, Burak

2014-07-01

In this paper, we analyze the performance of several network centrality measures in detecting systemically important financial institutions (SIFI) using data from the Turkish Interbank market during the financial crisis in 2000. We employ various network investigation tools such as volume, transactions, links, connectivity and reciprocity to gain a clearer picture of the network topology of the interbank market. We study the main borrower role of Demirbank in the crash of the banking system with network centrality measures which are extensively used in the network theory. This ex-post analysis of the crisis shows that centrality measures perform well in identifying and monitoring systemically important financial institutions which provide useful insights for financial regulations.

A new centrality measure for identifying influential nodes in social networks

Science.gov (United States)

Rhouma, Delel; Ben Romdhane, Lotfi

2018-04-01

The identification of central nodes has been a key problem in the field of social network analysis. In fact, it is a measure that accounts the popularity or the visibility of an actor within a network. In order to capture this concept, various measures, either sample or more elaborate, has been developed. Nevertheless, many of "traditional" measures are not designed to be applicable to huge data. This paper sets out a new node centrality index suitable for large social network. It uses the amount of the neighbors of a node and connections between them to characterize a "pivot" node in the graph. We presented experimental results on real data sets which show the efficiency of our proposal.

Software defined wireless sensor networks security challenges

CSIR Research Space (South Africa)

Kgogo, T

2017-09-01

Full Text Available party development [28]. Moreover, there is a new attack that fingerprints SDN network and launches more efficient resource consumption attacks like DDoS. In general, SDN security vulnerabilities comes from the absence of integration with existing... resilience in NOX that uses its component organization. Moreover, a Primary-Backup method was introduced to enhanve the resilience of the SDN. “SDN-based DDoS blocking scheme” [38] DoS/DDoS attack specifically on the controller DDoS Blocking...

Internal Interface Diversification as a Security Measure in Sensor Networks

Directory of Open Access Journals (Sweden)

Sampsa Rauti

2018-03-01

Full Text Available More actuator and sensor devices are connected to the Internet of Things (IoT every day, and the network keeps growing, while software security of the devices is often incomplete. Sensor networks and the IoT in general currently cover a large number of devices with an identical internal interface structure. By diversifying the internal interfaces, the interfaces on each node of the network are made unique, and it is possible to break the software monoculture of easily exploitable identical systems. This paper proposes internal interface diversification as a security measure for sensor networks. We conduct a study on diversifiable internal interfaces in 20 IoT operating systems. We also present two proof-of-concept implementations and perform experiments to gauge the feasibility in the IoT environment. Internal interface diversification has practical limitations, and not all IoT operating systems have that many diversifiable interfaces. However, because of low resource requirements, compatibility with other security measures and wide applicability to several interfaces, we believe internal interface diversification is a promising and effective approach for securing nodes in sensor networks.

The French National Network for the Measurement of Environmental Radioactivity

International Nuclear Information System (INIS)

Jaunet, P.

2010-01-01

After Chernobyl accident in 1986, the government began to implement mechanisms to ensure the quality of measurements of environmental radioactivity and to assure the transparency of information on environmental radioactivity monitoring results. Within this context, the French National Network for the Measurement of Environmental Radioactivity (RNM), is created in 2002 under the Public Health Code. This network is developed under the auspices of ASN in collaboration with IRSN and in partnership with government departments, major nuclear licensees, health agencies and environmental protection associations. In order to centralize information on environmental radioactivity and to provide access to measurement results, a single database that includes an the results of measurements of radioactivity in the environment on the national territory is build and a new web-site www.mesure-radioactivite.fr is launched. It provides quick and easy access to this database. The quality of measurements is performed by a laboratory system through an ASN decision. Novel initiative in Europe, the French National Network for the Measurement of Environmental Radioactivity web-site gives the user keys to understand the measurement results on the radiological state of the environment. The site will be improved over the time taking into account the feedback of the users. (author)

Measurement of repeat effects in Chicago’s criminal social network

Directory of Open Access Journals (Sweden)

Paul Kump

2016-07-01

Full Text Available The “near-repeat” effect is a well-known criminological phenomenon in which the occurrence of a crime incident gives rise to a temporary elevation of crime risk within close physical proximity to an initial incident. Adopting a social network perspective, we instead define a near repeat in terms of geodesic distance within a criminal social network, rather than spatial distance. Specifically, we report a statistical analysis of repeat effects in arrest data for Chicago during the years 2003–2012. We divide the arrest data into two sets (violent crimes and other crimes and, for each set, we compare the distributions of time intervals between repeat incidents to theoretical distributions in which repeat incidents occur only by chance. We first consider the case of the same arrestee participating in repeat incidents (“exact repeats” and then extend the analysis to evaluate repeat risks of those arrestees near one another in the social network. We observe repeat effects that diminish as a function of geodesic distance and time interval, and we estimate typical time scales for repeat crimes in Chicago.

Network measures for characterising team adaptation processes

NARCIS (Netherlands)

Barth, S.K.; Schraagen, J.M.C.; Schmettow, M.

2015-01-01

The aim of this study was to advance the conceptualisation of team adaptation by applying social network analysis (SNA) measures in a field study of a paediatric cardiac surgical team adapting to changes in task complexity and ongoing dynamic complexity. Forty surgical procedures were observed by

A working group for Japanese nuclear data measurement network

International Nuclear Information System (INIS)

Watanabe, Yukinobu

2013-01-01

A new working group in the Japanese Nuclear Data Committee has been established to make a cooperative network among researchers involved in nuclear data measurements and to discuss the strategy for nuclear data measurements. The working group activities are reported. (author)

Spectral affinity in protein networks.

Science.gov (United States)

Voevodski, Konstantin; Teng, Shang-Hua; Xia, Yu

2009-11-29

Protein-protein interaction (PPI) networks enable us to better understand the functional organization of the proteome. We can learn a lot about a particular protein by querying its neighborhood in a PPI network to find proteins with similar function. A spectral approach that considers random walks between nodes of interest is particularly useful in evaluating closeness in PPI networks. Spectral measures of closeness are more robust to noise in the data and are more precise than simpler methods based on edge density and shortest path length. We develop a novel affinity measure for pairs of proteins in PPI networks, which uses personalized PageRank, a random walk based method used in context-sensitive search on the Web. Our measure of closeness, which we call PageRank Affinity, is proportional to the number of times the smaller-degree protein is visited in a random walk that restarts at the larger-degree protein. PageRank considers paths of all lengths in a network, therefore PageRank Affinity is a precise measure that is robust to noise in the data. PageRank Affinity is also provably related to cluster co-membership, making it a meaningful measure. In our experiments on protein networks we find that our measure is better at predicting co-complex membership and finding functionally related proteins than other commonly used measures of closeness. Moreover, our experiments indicate that PageRank Affinity is very resilient to noise in the network. In addition, based on our method we build a tool that quickly finds nodes closest to a queried protein in any protein network, and easily scales to much larger biological networks. We define a meaningful way to assess the closeness of two proteins in a PPI network, and show that our closeness measure is more biologically significant than other commonly used methods. We also develop a tool, accessible at http://xialab.bu.edu/resources/pnns, that allows the user to quickly find nodes closest to a queried vertex in any protein

Symmetry in Complex Networks

Directory of Open Access Journals (Sweden)

Angel Garrido

2011-01-01

Full Text Available In this paper, we analyze a few interrelated concepts about graphs, such as their degree, entropy, or their symmetry/asymmetry levels. These concepts prove useful in the study of different types of Systems, and particularly, in the analysis of Complex Networks. A System can be defined as any set of components functioning together as a whole. A systemic point of view allows us to isolate a part of the world, and so, we can focus on those aspects that interact more closely than others. Network Science analyzes the interconnections among diverse networks from different domains: physics, engineering, biology, semantics, and so on. Current developments in the quantitative analysis of Complex Networks, based on graph theory, have been rapidly translated to studies of brain network organization. The brain's systems have complex network features—such as the small-world topology, highly connected hubs and modularity. These networks are not random. The topology of many different networks shows striking similarities, such as the scale-free structure, with the degree distribution following a Power Law. How can very different systems have the same underlying topological features? Modeling and characterizing these networks, looking for their governing laws, are the current lines of research. So, we will dedicate this Special Issue paper to show measures of symmetry in Complex Networks, and highlight their close relation with measures of information and entropy.

SOFTWARE DEFINED NETWORKS (SDN): APPROACHES NEEDED FOR UP-GRADATION OF SDN'S

OpenAIRE

Deepak Kumar*, Manu Sood

2017-01-01

SDN has changed the way of thinking about networks. SDN networks are flexible, scalable and easily manageable. Application that runs on the management plane actually utilize the network efficiency, So application developed should be capable of handling the controllers functionality. Each of the application that runs should be free from viruses, so that it does not affect the controller. Also we need to increase the level of security in all layers of the SDN architecture. SDN is growing faster...

Uji Performansi Algoritma Floyd-Warshall Pada Jaringan Software Defined Network (SDN

Directory of Open Access Journals (Sweden)

Ihsan Aris Saputra

2016-12-01

Full Text Available Penentuan rute pada sebuah jaringan software defined network (SDN merupakan salah satu contoh topik yang menarik untuk diteliti. Algoritma penentuan rute terpendek pada jaringan SDN sangatlah menentukan apakah jaringan SDN yang dibangun dengan algoritma tersebut sudah optimal. Salah satu algoritma penentuan rute terpendek yaitu algoritma FloydWarshall, yang akan diuji coba dan dianalisis apakah sudah termasuk algoritma yang optimal pada jaringan SDN dengan membandingkan dengan standarisasi yang ada. Pengujian akan dilakukan dengan mengirimkan paket data, VoIP dan video dengan melihat overhead traffic dan QoS (delay dan packet loss. Algoritma Floyd-Warshall akan digunakan pada pengontrol Ryu dan menggunakan Mininet sebagai emulator jaringan dengan topologi berbasis Abiline. Hasil simulasi dan pengujian algoritma Floyd-Warshall sebagai penentuan jalur terbaik dalam jaringan SDN, mendapatkan hasil yang memenuhi standarisasi. Nilai dari QoS yang didapat untuk delay masih berada pada nilai yang menjadi standar ITU-T G.1010. Packet loss yang dihasilkan semua jenis layanan sudah memenuhi standar ITU-T G.1010 yaitu 0% hingga saat pada jaringan diberikan background traffic melebihi kapasitas link yaitu pemberian sebesar 75 Mbps. Dalam pengujian waktu konvergensi didapatkan waktu dengan rata-rata nilai 17.71446 detik. Kemudian untuk overhead traffic menunjukan bahwa perubahan overhead dipengaruhi oleh controller update dan juga flow update, dimana ketika sering terjadinya controller update dan flow update maka semakin besar juga overhead yang didapat.

Centrality in earthquake multiplex networks

Science.gov (United States)

Lotfi, Nastaran; Darooneh, Amir Hossein; Rodrigues, Francisco A.

2018-06-01

Seismic time series has been mapped as a complex network, where a geographical region is divided into square cells that represent the nodes and connections are defined according to the sequence of earthquakes. In this paper, we map a seismic time series to a temporal network, described by a multiplex network, and characterize the evolution of the network structure in terms of the eigenvector centrality measure. We generalize previous works that considered the single layer representation of earthquake networks. Our results suggest that the multiplex representation captures better earthquake activity than methods based on single layer networks. We also verify that the regions with highest seismological activities in Iran and California can be identified from the network centrality analysis. The temporal modeling of seismic data provided here may open new possibilities for a better comprehension of the physics of earthquakes.

Least-squares methods for identifying biochemical regulatory networks from noisy measurements

Directory of Open Access Journals (Sweden)

Heslop-Harrison Pat

2007-01-01

Full Text Available Abstract Background We consider the problem of identifying the dynamic interactions in biochemical networks from noisy experimental data. Typically, approaches for solving this problem make use of an estimation algorithm such as the well-known linear Least-Squares (LS estimation technique. We demonstrate that when time-series measurements are corrupted by white noise and/or drift noise, more accurate and reliable identification of network interactions can be achieved by employing an estimation algorithm known as Constrained Total Least Squares (CTLS. The Total Least Squares (TLS technique is a generalised least squares method to solve an overdetermined set of equations whose coefficients are noisy. The CTLS is a natural extension of TLS to the case where the noise components of the coefficients are correlated, as is usually the case with time-series measurements of concentrations and expression profiles in gene networks. Results The superior performance of the CTLS method in identifying network interactions is demonstrated on three examples: a genetic network containing four genes, a network describing p53 activity and mdm2 messenger RNA interactions, and a recently proposed kinetic model for interleukin (IL-6 and (IL-12b messenger RNA expression as a function of ATF3 and NF-κB promoter binding. For the first example, the CTLS significantly reduces the errors in the estimation of the Jacobian for the gene network. For the second, the CTLS reduces the errors from the measurements that are corrupted by white noise and the effect of neglected kinetics. For the third, it allows the correct identification, from noisy data, of the negative regulation of (IL-6 and (IL-12b by ATF3. Conclusion The significant improvements in performance demonstrated by the CTLS method under the wide range of conditions tested here, including different levels and types of measurement noise and different numbers of data points, suggests that its application will enable

Measuring and evaluating energy consumption in street lighting networks

International Nuclear Information System (INIS)

Janiga, P.; Gasparovsky, D.

2012-01-01

Smart metering and smart grid are incoming technologies that provide new opportunities in various fields. In connection with the issue of evaluation of the energy aspects of public lighting networks opens up the possibility of evaluating and measuring consumption. Based on the obtained values would be possible to determine energy consumption of lighting systems. This obtained value could serve as a basis for comparing the relevant networks and thus the optimality assessment of lighting designs. Currently, the measure placed in the switchboard of public lighting. If we have considered sections parametramim same lighting, it is necessary to obtain more value from the measured or determined to assess the consumption of time. Proposal of such methods is still under construction but the basic methods have already been outlined. (Authors)

Real-Time Alpine Measurement System Using Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Sami A. Malek

2017-11-01

Full Text Available Monitoring the snow pack is crucial for many stakeholders, whether for hydro-power optimization, water management or flood control. Traditional forecasting relies on regression methods, which often results in snow melt runoff predictions of low accuracy in non-average years. Existing ground-based real-time measurement systems do not cover enough physiographic variability and are mostly installed at low elevations. We present the hardware and software design of a state-of-the-art distributed Wireless Sensor Network (WSN-based autonomous measurement system with real-time remote data transmission that gathers data of snow depth, air temperature, air relative humidity, soil moisture, soil temperature, and solar radiation in physiographically representative locations. Elevation, aspect, slope and vegetation are used to select network locations, and distribute sensors throughout a given network location, since they govern snow pack variability at various scales. Three WSNs were installed in the Sierra Nevada of Northern California throughout the North Fork of the Feather River, upstream of the Oroville dam and multiple powerhouses along the river. The WSNs gathered hydrologic variables and network health statistics throughout the 2017 water year, one of northern Sierra’s wettest years on record. These networks leverage an ultra-low-power wireless technology to interconnect their components and offer recovery features, resilience to data loss due to weather and wildlife disturbances and real-time topological visualizations of the network health. Data show considerable spatial variability of snow depth, even within a 1 km 2 network location. Combined with existing systems, these WSNs can better detect precipitation timing and phase in, monitor sub-daily dynamics of infiltration and surface runoff during precipitation or snow melt, and inform hydro power managers about actual ablation and end-of-season date across the landscape.

Real-Time Alpine Measurement System Using Wireless Sensor Networks.

Science.gov (United States)

Malek, Sami A; Avanzi, Francesco; Brun-Laguna, Keoma; Maurer, Tessa; Oroza, Carlos A; Hartsough, Peter C; Watteyne, Thomas; Glaser, Steven D

2017-11-09

Monitoring the snow pack is crucial for many stakeholders, whether for hydro-power optimization, water management or flood control. Traditional forecasting relies on regression methods, which often results in snow melt runoff predictions of low accuracy in non-average years. Existing ground-based real-time measurement systems do not cover enough physiographic variability and are mostly installed at low elevations. We present the hardware and software design of a state-of-the-art distributed Wireless Sensor Network (WSN)-based autonomous measurement system with real-time remote data transmission that gathers data of snow depth, air temperature, air relative humidity, soil moisture, soil temperature, and solar radiation in physiographically representative locations. Elevation, aspect, slope and vegetation are used to select network locations, and distribute sensors throughout a given network location, since they govern snow pack variability at various scales. Three WSNs were installed in the Sierra Nevada of Northern California throughout the North Fork of the Feather River, upstream of the Oroville dam and multiple powerhouses along the river. The WSNs gathered hydrologic variables and network health statistics throughout the 2017 water year, one of northern Sierra's wettest years on record. These networks leverage an ultra-low-power wireless technology to interconnect their components and offer recovery features, resilience to data loss due to weather and wildlife disturbances and real-time topological visualizations of the network health. Data show considerable spatial variability of snow depth, even within a 1 km 2 network location. Combined with existing systems, these WSNs can better detect precipitation timing and phase in, monitor sub-daily dynamics of infiltration and surface runoff during precipitation or snow melt, and inform hydro power managers about actual ablation and end-of-season date across the landscape.

Entanglement-Gradient Routing for Quantum Networks.

Science.gov (United States)

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

Application-Defined Decentralized Access Control

Science.gov (United States)

Xu, Yuanzhong; Dunn, Alan M.; Hofmann, Owen S.; Lee, Michael Z.; Mehdi, Syed Akbar; Witchel, Emmett

2014-01-01

DCAC is a practical OS-level access control system that supports application-defined principals. It allows normal users to perform administrative operations within their privilege, enabling isolation and privilege separation for applications. It does not require centralized policy specification or management, giving applications freedom to manage their principals while the policies are still enforced by the OS. DCAC uses hierarchically-named attributes as a generic framework for user-defined policies such as groups defined by normal users. For both local and networked file systems, its execution time overhead is between 0%–9% on file system microbenchmarks, and under 1% on applications. This paper shows the design and implementation of DCAC, as well as several real-world use cases, including sandboxing applications, enforcing server applications’ security policies, supporting NFS, and authenticating user-defined sub-principals in SSH, all with minimal code changes. PMID:25426493

Survivor-Defined Practice in Domestic Violence Work: Measure Development and Preliminary Evidence of Link to Empowerment.

Science.gov (United States)

Goodman, Lisa A; Thomas, Kristie; Cattaneo, Lauren Bennett; Heimel, Deborah; Woulfe, Julie; Chong, Siu Kwan

2016-01-01

Survivor-defined practice, characterized by an emphasis on client choice, partnership, and sensitivity to the unique needs, contexts, and coping strategies of individual survivors, is an aspirational goal of the domestic violence (DV) movement, assumed to be a key contributor to empowerment and other positive outcomes among survivors. Despite its central role in DV program philosophy, training, and practice, however, our ability to assess its presence and its presumed link to well-being has been hampered by the absence of a way to measure it from survivors' perspectives. As part of a larger university-community collaboration, this study had two aims: (a) to develop a measure of survivor-defined practice from the perspective of participants, and (b) to assess its relationship to safety-related empowerment after controlling for other contributors to survivor well-being (e.g., financial stability and social support). Results supported the reliability and validity of the Survivor-Defined Practice Scale (SDPS), a nine-item measure that assesses participants' perception of the degree to which their advocates help them achieve goals they set for themselves, facilitate a spirit of partnership, and show sensitivity to their individual needs and styles. The items combined to form one factor indicating that the three theoretical aspects of survivor-defined practice may be different manifestations of one underlying construct. Results also support the hypothesized link between survivor-defined practice and safety-related empowerment. The SDPS offers DV programs a mechanism for process evaluation that is rigorous and rooted in the feminist empowerment philosophy that so many programs espouse. © The Author(s) 2014.

Facing a Problem of Electrical Energy Quality in Ship Networks-measurements, Estimation, Control

Institute of Scientific and Technical Information of China (English)

Tomasz Tarasiuk; Janusz Mindykowski; Xiaoyan Xu

2003-01-01

In this paper, electrical energy quality and its indices in ship electric networks are introduced, especially the meaning of electrical energy quality terms in voltage and active and reactive power distribution indices. Then methods of measurement of marine electrical energy indices are introduced in details and a microprocessor measurement-diagnosis system with the function of measurement and control is designed. Afterwards, estimation and control of electrical power quality of marine electrical power networks are introduced. And finally, according to the existing method of measurement and control of electrical power quality in ship power networks, the improvement of relative method is proposed.

Centrality metrics and localization in core-periphery networks

International Nuclear Information System (INIS)

Barucca, Paolo; Lillo, Fabrizio; Tantari, Daniele

2016-01-01

Two concepts of centrality have been defined in complex networks. The first considers the centrality of a node and many different metrics for it have been defined (e.g. eigenvector centrality, PageRank, non-backtracking centrality, etc). The second is related to large scale organization of the network, the core-periphery structure, composed by a dense core plus an outlying and loosely-connected periphery. In this paper we investigate the relation between these two concepts. We consider networks generated via the stochastic block model, or its degree corrected version, with a core-periphery structure and we investigate the centrality properties of the core nodes and the ability of several centrality metrics to identify them. We find that the three measures with the best performance are marginals obtained with belief propagation, PageRank, and degree centrality, while non-backtracking and eigenvector centrality (or MINRES [10], showed to be equivalent to the latter in the large network limit) perform worse in the investigated networks. (paper: interdisciplinary statistical mechanics )

Do-it-yourself networks: a novel method of generating weighted networks.

Science.gov (United States)

Shanafelt, D W; Salau, K R; Baggio, J A

2017-11-01

Network theory is finding applications in the life and social sciences for ecology, epidemiology, finance and social-ecological systems. While there are methods to generate specific types of networks, the broad literature is focused on generating unweighted networks. In this paper, we present a framework for generating weighted networks that satisfy user-defined criteria. Each criterion hierarchically defines a feature of the network and, in doing so, complements existing algorithms in the literature. We use a general example of ecological species dispersal to illustrate the method and provide open-source code for academic purposes.

Multiscale Pore Throat Network Reconstruction of Tight Porous Media Constrained by Mercury Intrusion Capillary Pressure and Nuclear Magnetic Resonance Measurements

Science.gov (United States)

Xu, R.; Prodanovic, M.

2017-12-01

Due to the low porosity and permeability of tight porous media, hydrocarbon productivity strongly depends on the pore structure. Effective characterization of pore/throat sizes and reconstruction of their connectivity in tight porous media remains challenging. Having a representative pore throat network, however, is valuable for calculation of other petrophysical properties such as permeability, which is time-consuming and costly to obtain by experimental measurements. Due to a wide range of length scales encountered, a combination of experimental methods is usually required to obtain a comprehensive picture of the pore-body and pore-throat size distributions. In this work, we combine mercury intrusion capillary pressure (MICP) and nuclear magnetic resonance (NMR) measurements by percolation theory to derive pore-body size distribution, following the work by Daigle et al. (2015). However, in their work, the actual pore-throat sizes and the distribution of coordination numbers are not well-defined. To compensate for that, we build a 3D unstructured two-scale pore throat network model initialized by the measured porosity and the calculated pore-body size distributions, with a tunable pore-throat size and coordination number distribution, which we further determine by matching the capillary pressure vs. saturation curve from MICP measurement, based on the fact that the mercury intrusion process is controlled by both the pore/throat size distributions and the connectivity of the pore system. We validate our model by characterizing several core samples from tight Middle East carbonate, and use the network model to predict the apparent permeability of the samples under single phase fluid flow condition. Results show that the permeability we get is in reasonable agreement with the Coreval experimental measurements. The pore throat network we get can be used to further calculate relative permeability curves and simulate multiphase flow behavior, which will provide valuable

Energy and Power Measurements for Network Coding in the Context of Green Mobile Clouds

DEFF Research Database (Denmark)

Paramanathan, Achuthan; Pedersen, Morten Videbæk; Roetter, Daniel Enrique Lucani

2013-01-01

results for inter-session network coding in Open-Mesh routers underline that the energy invested in performing network coding pays off by dramatically reducing the total energy for the transmission of data over wireless links. We also show measurements for intra-session network coding in three different......This paper presents an in-depth power and energy measurement campaign for inter- and intra-session network coding enabled communication in mobile clouds. The measurements are carried out on different commercial platforms with focus on routers and mobile phones with different CPU capabilities. Our...

Growing complex network of citations of scientific papers: Modeling and measurements.

Science.gov (United States)

Golosovsky, Michael; Solomon, Sorin

2017-01-01

We consider the network of citations of scientific papers and use a combination of the theoretical and experimental tools to uncover microscopic details of this network growth. Namely, we develop a stochastic model of citation dynamics based on the copying-redirection-triadic closure mechanism. In a complementary and coherent way, the model accounts both for statistics of references of scientific papers and for their citation dynamics. Originating in empirical measurements, the model is cast in such a way that it can be verified quantitatively in every aspect. Such validation is performed by measuring citation dynamics of physics papers. The measurements revealed nonlinear citation dynamics, the nonlinearity being intricately related to network topology. The nonlinearity has far-reaching consequences including nonstationary citation distributions, diverging citation trajectories of similar papers, runaways or "immortal papers" with infinite citation lifetime, etc. Thus nonlinearity in complex network growth is our most important finding. In a more specific context, our results can be a basis for quantitative probabilistic prediction of citation dynamics of individual papers and of the journal impact factor.

Pathloss Measurements and Modeling for UAVs Connected to Cellular Networks

DEFF Research Database (Denmark)

Amorim, Rafhael Medeiros de; Mogensen, Preben Elgaard; Sørensen, Troels Bundgaard

2017-01-01

. The measurements were conducted in an operating LTE network (850 MHz), using a commercial cell phone, placed inside the frame of the UAV. Trials were conducted for UAV flying at 5 different heights measured above ground level (20, 40, 60, 80 and 100m) and a pathloss regression line was obtained from results. Then......This paper assess field measurements, as part of the investigation of the suitability of cellular networks for providing connectivity to UAVs (unmanned aerial vehicles). Evaluation is done by means of field measurements obtained in a rural environment in Denmark with an airbone UAV......, downlink (DL) SINR levels obtained during flight measurements are also presented. An important result obtained from the measurents reveal that there is a height-related DL SINR degradation. Three main sources of uncertainty on the pathloss model that could be responsible for the SINR degradation are also...

CytoViz: an artistic mapping of network measurements as living organisms in a VR application

Science.gov (United States)

López Silva, Brenda A.; Renambot, Luc

2007-02-01

CytoViz is an artistic, real-time information visualization driven by statistical information gathered during gigabit network transfers to the Scalable Adaptive Graphical Environment (SAGE) at various events. Data streams are mapped to cellular organisms defining their structure and behavior as autonomous agents. Network bandwidth drives the growth of each entity and the latency defines its physics-based independent movements. The collection of entity is bound within the 3D representation of the local venue. This visual and animated metaphor allows the public to experience the complexity of high-speed network streams that are used in the scientific community. Moreover, CytoViz displays the presence of discoverable Bluetooth devices carried by nearby persons. The concept is to generate an event-specific, real-time visualization that creates informational 3D patterns based on actual local presence. The observed Bluetooth traffic is put in opposition of the wide-area networking traffic by overlaying 2D animations on top of the 3D world. Each device is mapped to an animation fading over time while displaying the name of the detected device and its unique physical address. CytoViz was publicly presented at two major international conferences in 2005 (iGrid2005 in San Diego, CA and SC05 in Seattle, WA).

Novel method for water vapour monitoring using wireless communication networks measurements

Science.gov (United States)

David, N.; Alpert, P.; Messer, H.

2010-09-01

We propose a new technique for monitoring near-surface water vapour, by estimating humidity from data collected through existing wireless communication networks. Weather conditions and atmospheric phenomena affect the electromagnetic channel, causing attenuations to the radio signals. Thus, wireless communication networks are in effect built-in environmental monitoring facilities. The wireless microwave links, used in these networks, are widely deployed by cellular providers for backhaul communication between base stations, a few tens of meters above ground level. As a result, if all available measurements are used, the proposed method can provide moisture observations with high spatial resolution and potentially high temporal resolution. Further, the implementation cost is minimal, since the data used are already collected and saved by the cellular operators. In addition - many of these links are installed in areas where access is difficult such as orographic terrain and complex topography. As such, our method enables measurements in places that have been hard to measure in the past, or have never been measured before. The technique is restricted to weather conditions which exclude rain, fog or clouds along the propagation path. Strong winds that may cause movement of the link transmitter or receiver (or both) may also interfere with the ability to conduct accurate measurements. We present results from real-data measurements taken from microwave links used in a backhaul cellular network that show very good correlation with surface station humidity measurements (comparisons were performed for several links, found at different locations, during different time periods, showing correlations in the range of 0.5-0.9).

Ranking important nodes in complex networks by simulated annealing

International Nuclear Information System (INIS)

Sun Yu; Yao Pei-Yang; Shen Jian; Zhong Yun; Wan Lu-Jun

2017-01-01

In this paper, based on simulated annealing a new method to rank important nodes in complex networks is presented. First, the concept of an importance sequence (IS) to describe the relative importance of nodes in complex networks is defined. Then, a measure used to evaluate the reasonability of an IS is designed. By comparing an IS and the measure of its reasonability to a state of complex networks and the energy of the state, respectively, the method finds the ground state of complex networks by simulated annealing. In other words, the method can construct a most reasonable IS. The results of experiments on real and artificial networks show that this ranking method not only is effective but also can be applied to different kinds of complex networks. (paper)

Measurements of Voltage Harmonics in 400 kV Transmission Network

Directory of Open Access Journals (Sweden)

Ryszard Pawełek

2014-06-01

Full Text Available The paper deals with the analysis of voltage harmonics measurements performed in the 400 kV transmission network. The voltage was measured by means of three transducers: resistive voltage divider, inductive measuring transformer and capacitive voltage measuring transformer. Instrument errors were estimated for measuring transformers with reference to the harmonic values obtained from the voltage divider.

Temporal correlation coefficient for directed networks.

Science.gov (United States)

Büttner, Kathrin; Salau, Jennifer; Krieter, Joachim

2016-01-01

Previous studies dealing with network theory focused mainly on the static aggregation of edges over specific time window lengths. Thus, most of the dynamic information gets lost. To assess the quality of such a static aggregation the temporal correlation coefficient can be calculated. It measures the overall possibility for an edge to persist between two consecutive snapshots. Up to now, this measure is only defined for undirected networks. Therefore, we introduce the adaption of the temporal correlation coefficient to directed networks. This new methodology enables the distinction between ingoing and outgoing edges. Besides a small example network presenting the single calculation steps, we also calculated the proposed measurements for a real pig trade network to emphasize the importance of considering the edge direction. The farm types at the beginning of the pork supply chain showed clearly higher values for the outgoing temporal correlation coefficient compared to the farm types at the end of the pork supply chain. These farm types showed higher values for the ingoing temporal correlation coefficient. The temporal correlation coefficient is a valuable tool to understand the structural dynamics of these systems, as it assesses the consistency of the edge configuration. The adaption of this measure for directed networks may help to preserve meaningful additional information about the investigated network that might get lost if the edge directions are ignored.

Cloud networking understanding cloud-based data center networks

CERN Document Server

Lee, Gary

2014-01-01

Cloud Networking: Understanding Cloud-Based Data Center Networks explains the evolution of established networking technologies into distributed, cloud-based networks. Starting with an overview of cloud technologies, the book explains how cloud data center networks leverage distributed systems for network virtualization, storage networking, and software-defined networking. The author offers insider perspective to key components that make a cloud network possible such as switch fabric technology and data center networking standards. The final chapters look ahead to developments in architectures

How to Identify the Most Powerful Node in Complex Networks? A Novel Entropy Centrality Approach

Directory of Open Access Journals (Sweden)

Tong Qiao

2017-11-01

Full Text Available Centrality is one of the most studied concepts in network analysis. Despite an abundance of methods for measuring centrality in social networks has been proposed, each approach exclusively characterizes limited parts of what it implies for an actor to be “vital” to the network. In this paper, a novel mechanism is proposed to quantitatively measure centrality using the re-defined entropy centrality model, which is based on decompositions of a graph into subgraphs and analysis on the entropy of neighbor nodes. By design, the re-defined entropy centrality which describes associations among node pairs and captures the process of influence propagation can be interpreted explained as a measure of actor potential for communication activity. We evaluate the efficiency of the proposed model by using four real-world datasets with varied sizes and densities and three artificial networks constructed by models including Barabasi-Albert, Erdos-Renyi and Watts-Stroggatz. The four datasets are Zachary’s karate club, USAir97, Collaboration network and Email network URV respectively. Extensive experimental results prove the effectiveness of the proposed method.

OSiRIS: a distributed Ceph deployment using software defined networking for multi-institutional research

Science.gov (United States)

McKee, Shawn; Kissel, Ezra; Meekhof, Benjeman; Swany, Martin; Miller, Charles; Gregorowicz, Michael

2017-10-01

We report on the first year of the OSiRIS project (NSF Award #1541335, UM, IU, MSU and WSU) which is targeting the creation of a distributed Ceph storage infrastructure coupled together with software-defined networking to provide high-performance access for well-connected locations on any participating campus. The projects goal is to provide a single scalable, distributed storage infrastructure that allows researchers at each campus to read, write, manage and share data directly from their own computing locations. The NSF CC*DNI DIBBS program which funded OSiRIS is seeking solutions to the challenges of multi-institutional collaborations involving large amounts of data and we are exploring the creative use of Ceph and networking to address those challenges. While OSiRIS will eventually be serving a broad range of science domains, its first adopter will be the LHC ATLAS detector project via the ATLAS Great Lakes Tier-2 (AGLT2) jointly located at the University of Michigan and Michigan State University. Part of our presentation will cover how ATLAS is using the OSiRIS infrastructure and our experiences integrating our first user community. The presentation will also review the motivations for and goals of the project, the technical details of the OSiRIS infrastructure, the challenges in providing such an infrastructure, and the technical choices made to address those challenges. We will conclude with our plans for the remaining 4 years of the project and our vision for what we hope to deliver by the projects end.

Spectral Graph Theory Analysis of Software-Defined Networks to Improve Performance and Security

Science.gov (United States)

2015-09-01

too costly to continue operating and administrating them in the same basic manner as standardized by Advanced Research Projects Agency Network...to better monitor the network as compared to network perimeter defenses, such as firewalls and web server demilitarized zones (DMZs). The Open Network

Distinguishing fiction from non-fiction with complex networks

Science.gov (United States)

Larue, David M.; Carr, Lincoln D.; Jones, Linnea K.; Stevanak, Joe T.

2014-03-01

Complex Network Measures are applied to networks constructed from texts in English to demonstrate an initial viability in textual analysis. Texts from novels and short stories obtained from Project Gutenberg and news stories obtained from NPR are selected. Unique word stems in a text are used as nodes in an associated unweighted undirected network, with edges connecting words occurring within a certain number of words somewhere in the text. Various combinations of complex network measures are computed for each text's network. Fisher's Linear Discriminant analysis is used to build a parameter optimizing the ability to separate the texts according to their genre. Success rates in the 70% range for correctly distinguishing fiction from non-fiction were obtained using edges defined as within four words, using 400 word samples from 400 texts from each of the two genres with some combinations of measures such as the power-law exponents of degree distributions and clustering coefficients.

Measuring dynamic process of working memory training with functional brain networks

Directory of Open Access Journals (Sweden)

Hong Wang

2015-12-01

Full Text Available In this paper, we proposed the functional brain networks and graphic theory method to measure the effect of working memory training on the neural activities. 12 subjects were recruited in this study, and they did the same working memory task before they had been trained and after training. We architected functional brain networks based on EEG coherence and calculated properties of brain networks to measure the neural co-activities and the working memory level of subjects. As the result, the internal connections in frontal region decreased after working memory training, but the connection between frontal region and top region increased. And the more small-world feature was observed after training. The features observed above were in alpha (8-13 Hz and beta (13-30 Hz bands. The functional brain networks based on EEG coherence proposed in this paper can be used as the indicator of working memory level.

Defining Neighbourhoods as a Measure of Exposure to the Food Environment

Directory of Open Access Journals (Sweden)

Anders K. Lyseen

2015-07-01

Full Text Available Neighbourhoods are frequently used as a measure for individuals’ exposure to the food environment. However, the definitions of neighbourhoods fluctuate and have not been applied consistently in previous studies. Neighbourhoods defined from a single fixed location fail to capture people’s complete exposure in multiple locations, but measuring behaviour using traditional methods can be challenging. This study compares the traditional methods of measuring exposure to the food environment to methods that use data from GPS tracking. For each of the 187 participants, 11 different neighbourhoods were created in which the exposure to supermarkets and fast food outlets were measured. ANOVA, Tukey’s Honestly Significant Difference (HSD test and t-tests were performed to compare the neighbourhoods. Significant differences were found between area sizes and the exposure to supermarkets and fast food outlets for different neighbourhood types. Second, significant differences in exposure to food outlets were found between the urban and rural neighbourhoods. Neighbourhoods are clearly a diffused and blurred concept that varies in meaning depending on each person’s perception and the conducted study. Complexity and heterogeneity of human mobility no longer appear to correspond to the use of residential neighbourhoods but rather emphasise the need for methods, concepts and measures of individual activity and exposure.

Spectral affinity in protein networks

Directory of Open Access Journals (Sweden)

Teng Shang-Hua

2009-11-01

Full Text Available Abstract Background Protein-protein interaction (PPI networks enable us to better understand the functional organization of the proteome. We can learn a lot about a particular protein by querying its neighborhood in a PPI network to find proteins with similar function. A spectral approach that considers random walks between nodes of interest is particularly useful in evaluating closeness in PPI networks. Spectral measures of closeness are more robust to noise in the data and are more precise than simpler methods based on edge density and shortest path length. Results We develop a novel affinity measure for pairs of proteins in PPI networks, which uses personalized PageRank, a random walk based method used in context-sensitive search on the Web. Our measure of closeness, which we call PageRank Affinity, is proportional to the number of times the smaller-degree protein is visited in a random walk that restarts at the larger-degree protein. PageRank considers paths of all lengths in a network, therefore PageRank Affinity is a precise measure that is robust to noise in the data. PageRank Affinity is also provably related to cluster co-membership, making it a meaningful measure. In our experiments on protein networks we find that our measure is better at predicting co-complex membership and finding functionally related proteins than other commonly used measures of closeness. Moreover, our experiments indicate that PageRank Affinity is very resilient to noise in the network. In addition, based on our method we build a tool that quickly finds nodes closest to a queried protein in any protein network, and easily scales to much larger biological networks. Conclusion We define a meaningful way to assess the closeness of two proteins in a PPI network, and show that our closeness measure is more biologically significant than other commonly used methods. We also develop a tool, accessible at http://xialab.bu.edu/resources/pnns, that allows the user to

Reactor building indoor wireless network channel quality estimation using RSSI measurement of wireless sensor network

International Nuclear Information System (INIS)

Merat, S.

2008-01-01

Expanding wireless communication network reception inside reactor buildings (RB) and service wings (SW) has always been a technical challenge for operations service team. This is driven by the volume of metal equipment inside the Reactor Buildings (RB) that blocks and somehow shields the signal throughout the link. In this study, to improve wireless reception inside the Reactor Building (RB), an experimental model using indoor localization mesh based on IEEE 802.15 is developed to implement a wireless sensor network. This experimental model estimates the distance between different nodes by measuring the RSSI (Received Signal Strength Indicator). Then by using triangulation and RSSI measurement, the validity of the estimation techniques is verified to simulate the physical environmental obstacles, which block the signal transmission. (author)

Reactor building indoor wireless network channel quality estimation using RSSI measurement of wireless sensor network

Energy Technology Data Exchange (ETDEWEB)

Merat, S. [Wardrop Engineering Inc., Toronto, Ontario (Canada)

2008-07-01

Expanding wireless communication network reception inside reactor buildings (RB) and service wings (SW) has always been a technical challenge for operations service team. This is driven by the volume of metal equipment inside the Reactor Buildings (RB) that blocks and somehow shields the signal throughout the link. In this study, to improve wireless reception inside the Reactor Building (RB), an experimental model using indoor localization mesh based on IEEE 802.15 is developed to implement a wireless sensor network. This experimental model estimates the distance between different nodes by measuring the RSSI (Received Signal Strength Indicator). Then by using triangulation and RSSI measurement, the validity of the estimation techniques is verified to simulate the physical environmental obstacles, which block the signal transmission. (author)

VPN (Virtual Private Network) Performance Measurements

Energy Technology Data Exchange (ETDEWEB)

Calderon, Calixto; Goncalves, Joao G.M.; Sequeira, Vitor [Joint Research Centre, Ispra (Italy). Inst. for the Protection and Security of the Citizen; Vandaele, Roland; Meylemans, Paul [European Commission, DG-TREN (Luxembourg)

2003-05-01

Virtual Private Networks (VPN) is an important technology allowing for secure communications through insecure transmission media (i.e., Internet) by adding authentication and encryption to the existing protocols. This paper describes some VPN performance indicators measured over international communication links. An ISDN based VPN link was established between the Joint Research Centre, Ispra site, Italy, and EURATOM Safeguards in Luxembourg. This link connected two EURATOM Safeguards FAST surveillance stations, and used different vendor solutions hardware (Cisco router 1720 and Nokia CC-500 Gateway). To authenticate and secure this international link, we have used several methods at the different levels of the seven-layered ISO network protocol stack (i.e., Callback feature, CHAP - Challenge Handshake Protocol - authentication protocol). The tests made involved the use of different encryption algorithms and the way session secret keys are periodically renewed, considering these elements influence significantly the transmission throughput. Future tests will include the use of a wide variety of wireless media transmission and terminal equipment technologies, in particular PDAs (Personal Digital Assistants) and Notebook PCs. These tests aim at characterising the functionality of VPNs whenever field inspectors wish to contact headquarters to access information from a central archive database or transmit local measurements or documents. These technologies cover wireless transmission needs at different geographical scales: roombased level Bluetooth, floor or building level Wi-Fi and region or country level GPRS.

Network analysis literacy a practical approach to the analysis of networks

CERN Document Server

Zweig, Katharina A

2014-01-01

Network Analysis Literacy focuses on design principles for network analytics projects. The text enables readers to: pose a defined network analytic question; build a network to answer the question; choose or design the right network analytic methods for a particular purpose, and more.

OpenFlow Extensions for Programmable Quantum Networks

Science.gov (United States)

2017-06-19

Introduction 1 2. Background 1 2.1 Quantum Networks 2 2.2 Software -Defined Networks 3 3. Approach 3 3.1 Metadata 4 3.2 Switch 4 3.3 Controller 5... software -defined networks . Stanford (CA): Stanford University HotNets; 2010. 9. Raychev N. Algorithm for switching 4-bit packages in full quantum...applications to communicate. Advances in network protocols and architectures have led to the development of software -defined programmable networks

Measurement campaign on connectivity of mesh networks formed by mobile devices

DEFF Research Database (Denmark)

Pietrarca, Beatrice; Sasso, Giovanni; Perrucci, Gian Paolo

2007-01-01

This paper reports the results of a measurement campaign on the connectivity level of mobile devices using Bluetooth (BT) to form cooperative mobile mesh networks. Such mobile mesh networks composed of mobile devices are the basis for any peer-to-peer communication like wireless grids or social...

Partially ordered sets in complex networks

International Nuclear Information System (INIS)

Xuan Qi; Du Fang; Wu Tiejun

2010-01-01

In this paper, a partial-order relation is defined among vertices of a network to describe which vertex is more important than another on its contribution to the connectivity of the network. A maximum linearly ordered subset of vertices is defined as a chain and the chains sharing the same end-vertex are grouped as a family. Through combining the same vertices appearing in different chains, a directed chain graph is obtained. Based on these definitions, a series of new network measurements, such as chain length distribution, family diversity distribution, as well as the centrality of families, are proposed. By studying the partially ordered sets in three kinds of real-world networks, many interesting results are revealed. For instance, the similar approximately power-law chain length distribution may be attributed to a chain-based positive feedback mechanism, i.e. new vertices prefer to participate in longer chains, which can be inferred by combining the notable preferential attachment rule with a well-ordered recommendation manner. Moreover, the relatively large average incoming degree of the chain graphs may indicate an efficient substitution mechanism in these networks. Most of the partially ordered set-based properties cannot be explained by the current well-known scale-free network models; therefore, we are required to propose more appropriate network models in the future.

A Neural Network Approach to Fluid Quantity Measurement in Dynamic Environments

CERN Document Server

Terzic, Edin; Nagarajah, Romesh; Alamgir, Muhammad

2012-01-01

Sloshing causes liquid to fluctuate, making accurate level readings difficult to obtain in dynamic environments. The measurement system described uses a single-tube capacitive sensor to obtain an instantaneous level reading of the fluid surface, thereby accurately determining the fluid quantity in the presence of slosh. A neural network based classification technique has been applied to predict the actual quantity of the fluid contained in a tank under sloshing conditions.   In A neural network approach to fluid quantity measurement in dynamic environments, effects of temperature variations and contamination on the capacitive sensor are discussed, and the authors propose that these effects can also be eliminated with the proposed neural network based classification system. To examine the performance of the classification system, many field trials were carried out on a running vehicle at various tank volume levels that range from 5 L to 50 L. The effectiveness of signal enhancement on the neural network base...

Measuring large-scale social networks with high resolution.

Directory of Open Access Journals (Sweden)

Arkadiusz Stopczynski

Full Text Available This paper describes the deployment of a large-scale study designed to measure human interactions across a variety of communication channels, with high temporal resolution and spanning multiple years-the Copenhagen Networks Study. Specifically, we collect data on face-to-face interactions, telecommunication, social networks, location, and background information (personality, demographics, health, politics for a densely connected population of 1000 individuals, using state-of-the-art smartphones as social sensors. Here we provide an overview of the related work and describe the motivation and research agenda driving the study. Additionally, the paper details the data-types measured, and the technical infrastructure in terms of both backend and phone software, as well as an outline of the deployment procedures. We document the participant privacy procedures and their underlying principles. The paper is concluded with early results from data analysis, illustrating the importance of multi-channel high-resolution approach to data collection.

Measurement of traffic network vulnerability for Mississippi coastal region : final research report.

Science.gov (United States)

2017-08-15

Natural disasters such as a hurricane can cause great damages to the transportation networks and significantly affect the evacuation trip operations. An accurate understanding and measurement of the network vulnerability can enhance the evacuees p...

Defining Primary Care Shortage Areas: Do GIS-based Measures Yield Different Results?

Science.gov (United States)

Daly, Michael R; Mellor, Jennifer M; Millones, Marco

2018-02-12

To examine whether geographic information systems (GIS)-based physician-to-population ratios (PPRs) yield determinations of geographic primary care shortage areas that differ from those based on bounded-area PPRs like those used in the Health Professional Shortage Area (HPSA) designation process. We used geocoded data on primary care physician (PCP) locations and census block population counts from 1 US state to construct 2 shortage area indicators. The first is a bounded-area shortage indicator defined without GIS methods; the second is a GIS-based measure that measures the populations' spatial proximity to PCP locations. We examined agreement and disagreement between bounded shortage areas and GIS-based shortage areas. Bounded shortage area indicators and GIS-based shortage area indicators agree for the census blocks where the vast majority of our study populations reside. Specifically, 95% and 98% of the populations in our full and urban samples, respectively, reside in census blocks where the 2 indicators agree. Although agreement is generally high in rural areas (ie, 87% of the rural population reside in census blocks where the 2 indicators agree), agreement is significantly lower compared to urban areas. One source of disagreement suggests that bounded-area measures may "overlook" some shortages in rural areas; however, other aspects of the HPSA designation process likely mitigate this concern. Another source of disagreement arises from the border-crossing problem, and it is more prevalent. The GIS-based PPRs we employed would yield shortage area determinations that are similar to those based on bounded-area PPRs defined for Primary Care Service Areas. Disagreement rates were lower than previous studies have found. © 2018 National Rural Health Association.

A Survey on Security-Aware Measurement in SDN

Directory of Open Access Journals (Sweden)

Heng Zhang

2018-01-01

Full Text Available Software-defined networking (SDN is one of the most prevailing networking paradigms in current and next-generation networks. Basically, the highly featured separation of control and data planes makes SDN a proper solution towards many practical problems that challenge legacy networks, for example, energy efficiency, dynamic network configuration, agile network measurement, and flexible network deployment. Although the SDN and its applications have been extensively studied for several years, the research of SDN security is still in its infancy. Typically, the SDN suffers from architecture defect and OpenFlow protocol loopholes such as single controller problem, deficiency of communication verification, and network resources constraint. Hence, network measurement is a fundamental technique of protecting SDN against the above security threats. Specifically, network measurement aims to understand and quantify a variety of network behaviors to facilitate network management and monitoring, anomaly detection, network troubleshooting, and the establishment of security mechanisms. In this paper, we present a systematic survey on security-aware measurement technology in SDN. In particular, we first review the basic architecture of SDN and corresponding security challenges. Then, we investigate two performance measurement techniques in SDN, namely, link latency and available bandwidth measurements. After that, we further provide a general overview of topology measurement in SDN including intradomain and interdomain topology discovering techniques. Finally, we list three interesting future directions of security-aware measurement in SDN followed by giving conclusion remarks.

Modeling and performance analysis for composite network–compute service provisioning in software-defined cloud environments

Directory of Open Access Journals (Sweden)

Qiang Duan

2015-08-01

Full Text Available The crucial role of networking in Cloud computing calls for a holistic vision of both networking and computing systems that leads to composite network–compute service provisioning. Software-Defined Network (SDN is a fundamental advancement in networking that enables network programmability. SDN and software-defined compute/storage systems form a Software-Defined Cloud Environment (SDCE that may greatly facilitate composite network–compute service provisioning to Cloud users. Therefore, networking and computing systems need to be modeled and analyzed as composite service provisioning systems in order to obtain thorough understanding about service performance in SDCEs. In this paper, a novel approach for modeling composite network–compute service capabilities and a technique for evaluating composite network–compute service performance are developed. The analytic method proposed in this paper is general and agnostic to service implementation technologies; thus is applicable to a wide variety of network–compute services in SDCEs. The results obtained in this paper provide useful guidelines for federated control and management of networking and computing resources to achieve Cloud service performance guarantees.

Information Assurance in Wireless Networks

Science.gov (United States)

Kabara, Joseph; Krishnamurthy, Prashant; Tipper, David

2001-09-01

Emerging wireless networks will contain a hybrid infrastructure based on fixed, mobile and ad hoc topologies and technologies. In such a dynamic architecture, we define information assurance as the provisions for both information security and information availability. The implications of this definition are that the wireless network architecture must (a) provide sufficient security measures, (b) be survivable under node or link attack or failure and (c) be designed such that sufficient capacity remains for all critical services (and preferably most other services) in the event of attack or component failure. We have begun a research project to investigate the provision of information assurance for wireless networks viz. survivability, security and availability and here discuss the issues and challenges therein.

Talking and learning physics: Predicting future grades from network measures and Force Concept Inventory pretest scores

Directory of Open Access Journals (Sweden)

Jesper Bruun

2013-07-01

Full Text Available The role of student interactions in learning situations is a foundation of sociocultural learning theory, and social network analysis can be used to quantify student relations. We discuss how self-reported student interactions can be viewed as processes of meaning making and use this to understand how quantitative measures that describe the position in a network, called centrality measures, can be understood in terms of interactions that happen in the context of a university physics course. We apply this discussion to an empirical data set of self-reported student interactions. In a weekly administered survey, first year university students enrolled in an introductory physics course at a Danish university indicated with whom they remembered having communicated within different interaction categories. For three categories pertaining to (1 communication about how to solve physics problems in the course (called the PS category, (2 communications about the nature of physics concepts (called the CD category, and (3 social interactions that are not strictly related to the content of the physics classes (called the ICS category in the introductory mechanics course, we use the survey data to create networks of student interaction. For each of these networks, we calculate centrality measures for each student and correlate these measures with grades from the introductory course, grades from two subsequent courses, and the pretest Force Concept Inventory (FCI scores. We find highly significant correlations (p<0.001 between network centrality measures and grades in all networks. We find the highest correlations between network centrality measures and future grades. In the network composed of interactions regarding problem solving (the PS network, the centrality measures hide and PageRank show the highest correlations (r=-0.32 and r=0.33, respectively with future grades. In the CD network, the network measure target entropy shows the highest correlation

Accessibility in networks: A useful measure for understanding social insect nest architecture

International Nuclear Information System (INIS)

Viana, Matheus P.; Fourcassié, Vincent; Perna, Andrea; Costa, Luciano da F.; Jost, Christian

2013-01-01

Networks and the associated tools from graph theory have now become well-established approaches to study natural as well as human-made systems. While early studies focused on topology and connectivity, the recent literature has acknowledged the importance of the dynamical properties of these networks. Here we focus on such a dynamic measure: accessibility. It characterizes for any given movement dynamics (such as random walks) the average number of nodes that can be reached in exactly h steps (out-accessibility), or the average number of nodes from which a given node can be reached (in-accessibility). This focus on dynamics makes accessibility particularly appropriate to study movement on networks and to detect complementary properties with respect to topology-based measurements such as betweenness centrality. We apply this measure to six nests of Cubitermes termites. Their mushroom-like 3D architectures consist of chambers and connecting tunnels that can be associated to nodes and edges in a communication network. Accessibilities turn out to be particularly low in the bottom part of the nests that link them to their underground tunneling network. We interpret this result in the context of anti-predator (ants) behavior and/or as a side effect of the global nest shape.

A Taxonomy for Software Defined Networking, Man In The Middle Attacks

Science.gov (United States)

2016-09-01

that separates it from the networks of today’s world . As Stallings (2013) describes, “current networks are vertically integrated, meaning that the data...cause overpopulation of flow tables increasing processing rate on the switch (Zarek, 2012). More specifically, premature evictions result 16 in...Mininet demonstrated our proof of concept but was not sufficient for real world implementation. Our overall goal was to grab an HTTP response packet

A large scale analysis of information-theoretic network complexity measures using chemical structures.

Directory of Open Access Journals (Sweden)

Matthias Dehmer

Full Text Available This paper aims to investigate information-theoretic network complexity measures which have already been intensely used in mathematical- and medicinal chemistry including drug design. Numerous such measures have been developed so far but many of them lack a meaningful interpretation, e.g., we want to examine which kind of structural information they detect. Therefore, our main contribution is to shed light on the relatedness between some selected information measures for graphs by performing a large scale analysis using chemical networks. Starting from several sets containing real and synthetic chemical structures represented by graphs, we study the relatedness between a classical (partition-based complexity measure called the topological information content of a graph and some others inferred by a different paradigm leading to partition-independent measures. Moreover, we evaluate the uniqueness of network complexity measures numerically. Generally, a high uniqueness is an important and desirable property when designing novel topological descriptors having the potential to be applied to large chemical databases.

The new challenges of multiplex networks: Measures and models

Science.gov (United States)

Battiston, Federico; Nicosia, Vincenzo; Latora, Vito

2017-02-01

What do societies, the Internet, and the human brain have in common? They are all examples of complex relational systems, whose emerging behaviours are largely determined by the non-trivial networks of interactions among their constituents, namely individuals, computers, or neurons, rather than only by the properties of the units themselves. In the last two decades, network scientists have proposed models of increasing complexity to better understand real-world systems. Only recently we have realised that multiplexity, i.e. the coexistence of several types of interactions among the constituents of a complex system, is responsible for substantial qualitative and quantitative differences in the type and variety of behaviours that a complex system can exhibit. As a consequence, multilayer and multiplex networks have become a hot topic in complexity science. Here we provide an overview of some of the measures proposed so far to characterise the structure of multiplex networks, and a selection of models aiming at reproducing those structural properties and quantifying their statistical significance. Focusing on a subset of relevant topics, this brief review is a quite comprehensive introduction to the most basic tools for the analysis of multiplex networks observed in the real-world. The wide applicability of multiplex networks as a framework to model complex systems in different fields, from biology to social sciences, and the colloquial tone of the paper will make it an interesting read for researchers working on both theoretical and experimental analysis of networked systems.

BRAIN NETWORKS. Correlated gene expression supports synchronous activity in brain networks.

Science.gov (United States)

Richiardi, Jonas; Altmann, Andre; Milazzo, Anna-Clare; Chang, Catie; Chakravarty, M Mallar; Banaschewski, Tobias; Barker, Gareth J; Bokde, Arun L W; Bromberg, Uli; Büchel, Christian; Conrod, Patricia; Fauth-Bühler, Mira; Flor, Herta; Frouin, Vincent; Gallinat, Jürgen; Garavan, Hugh; Gowland, Penny; Heinz, Andreas; Lemaître, Hervé; Mann, Karl F; Martinot, Jean-Luc; Nees, Frauke; Paus, Tomáš; Pausova, Zdenka; Rietschel, Marcella; Robbins, Trevor W; Smolka, Michael N; Spanagel, Rainer; Ströhle, Andreas; Schumann, Gunter; Hawrylycz, Mike; Poline, Jean-Baptiste; Greicius, Michael D

2015-06-12

During rest, brain activity is synchronized between different regions widely distributed throughout the brain, forming functional networks. However, the molecular mechanisms supporting functional connectivity remain undefined. We show that functional brain networks defined with resting-state functional magnetic resonance imaging can be recapitulated by using measures of correlated gene expression in a post mortem brain tissue data set. The set of 136 genes we identify is significantly enriched for ion channels. Polymorphisms in this set of genes significantly affect resting-state functional connectivity in a large sample of healthy adolescents. Expression levels of these genes are also significantly associated with axonal connectivity in the mouse. The results provide convergent, multimodal evidence that resting-state functional networks correlate with the orchestrated activity of dozens of genes linked to ion channel activity and synaptic function. Copyright © 2015, American Association for the Advancement of Science.

Stream network responses to evapotranspiration in mountain systems: evidence from spatially-distributed network mapping and sapflow measurements

Science.gov (United States)

Godsey, S.; Whiting, J. A.; Reinhardt, K.

2015-12-01

Stream networks respond to decreased inputs by shrinking from their headwaters and disconnecting along their length. Both the relative stability of the stream network and the degree of disconnection along the network length can strongly affect stream ecology, including fish migration and nutrient spiraling. Previous data suggests that stream network lengths decrease measurably as discharge decreases, and that evapotranspiration may be an important control on stream network persistence. We hypothesized that changes in sapflow timing and magnitude across a gradient from rain-dominated to snow-dominated elevations would be reflected in the stability of the stream network in a steep watershed draining to the Middle Fork Salmon in central Idaho. We expected that the relative timing of water availability across the gradient would drive differences in water delivery to both trees and the stream network. Here we present results that highlight the stability of sapflow timing across the gradient and persistence of the stream network at this site. We discuss geologic controls on network stability and present a conceptual framework identifying characteristics of stable flowheads. We test this framework at four sites in central Idaho with mapped stream networks. We also discuss late summer sapflow patterns across the elevation gradient and their linkages to soil and atmospheric characteristics. Finally, we compare these patterns to those observed at other sites and discuss the role of vegetation in controlling spatiotemporal patterns across the stream network.

Exploiting the Vulnerability of Flow Table Overflow in Software-Defined Network: Attack Model, Evaluation, and Defense

Directory of Open Access Journals (Sweden)

Yadong Zhou

2018-01-01

Full Text Available As the most competitive solution for next-generation network, SDN and its dominant implementation OpenFlow are attracting more and more interests. But besides convenience and flexibility, SDN/OpenFlow also introduces new kinds of limitations and security issues. Of these limitations, the most obvious and maybe the most neglected one is the flow table capacity of SDN/OpenFlow switches. In this paper, we proposed a novel inference attack targeting at SDN/OpenFlow network, which is motivated by the limited flow table capacities of SDN/OpenFlow switches and the following measurable network performance decrease resulting from frequent interactions between data and control plane when the flow table is full. To the best of our knowledge, this is the first proposed inference attack model of this kind for SDN/OpenFlow. We implemented an inference attack framework according to our model and examined its efficiency and accuracy. The evaluation results demonstrate that our framework can infer the network parameters (flow table capacity and usage with an accuracy of 80% or higher. We also proposed two possible defense strategies for the discovered vulnerability, including routing aggregation algorithm and multilevel flow table architecture. These findings give us a deeper understanding of SDN/OpenFlow limitations and serve as guidelines to future improvements of SDN/OpenFlow.

Cellular network entropy as the energy potential in Waddington's differentiation landscape

Science.gov (United States)

Banerji, Christopher R. S.; Miranda-Saavedra, Diego; Severini, Simone; Widschwendter, Martin; Enver, Tariq; Zhou, Joseph X.; Teschendorff, Andrew E.

2013-01-01

Differentiation is a key cellular process in normal tissue development that is significantly altered in cancer. Although molecular signatures characterising pluripotency and multipotency exist, there is, as yet, no single quantitative mark of a cellular sample's position in the global differentiation hierarchy. Here we adopt a systems view and consider the sample's network entropy, a measure of signaling pathway promiscuity, computable from a sample's genome-wide expression profile. We demonstrate that network entropy provides a quantitative, in-silico, readout of the average undifferentiated state of the profiled cells, recapitulating the known hierarchy of pluripotent, multipotent and differentiated cell types. Network entropy further exhibits dynamic changes in time course differentiation data, and in line with a sample's differentiation stage. In disease, network entropy predicts a higher level of cellular plasticity in cancer stem cell populations compared to ordinary cancer cells. Importantly, network entropy also allows identification of key differentiation pathways. Our results are consistent with the view that pluripotency is a statistical property defined at the cellular population level, correlating with intra-sample heterogeneity, and driven by the degree of signaling promiscuity in cells. In summary, network entropy provides a quantitative measure of a cell's undifferentiated state, defining its elevation in Waddington's landscape. PMID:24154593

Failure mitigation in software defined networking employing load type prediction

KAUST Repository

Bouacida, Nader

2017-07-31

The controller is a critical piece of the SDN architecture, where it is considered as the mastermind of SDN networks. Thus, its failure will cause a significant portion of the network to fail. Overload is one of the common causes of failure since the controller is frequently invoked by new flows. Even through SDN controllers are often replicated, the significant recovery time can be an overkill for the availability of the entire network. In order to overcome the problem of the overloaded controller failure in SDN, this paper proposes a novel controller offload solution for failure mitigation based on a prediction module that anticipates the presence of a harmful long-term load. In fact, the long-standing load would eventually overwhelm the controller leading to a possible failure. To predict whether the load in the controller is short-term or long-term load, we used three different classification algorithms: Support Vector Machine, k-Nearest Neighbors, and Naive Bayes. Our evaluation results demonstrate that Support Vector Machine algorithm is applicable for detecting the type of load with an accuracy of 97.93% in a real-time scenario. Besides, our scheme succeeded to offload the controller by switching between the reactive and proactive mode in response to the prediction module output.

Optical track width measurements below 100 nm using artificial neural networks

Science.gov (United States)

Smith, R. J.; See, C. W.; Somekh, M. G.; Yacoot, A.; Choi, E.

2005-12-01

This paper discusses the feasibility of using artificial neural networks (ANNs), together with a high precision scanning optical profiler, to measure very fine track widths that are considerably below the conventional diffraction limit of a conventional optical microscope. The ANN is trained using optical profiles obtained from tracks of known widths, the network is then assessed by applying it to test profiles. The optical profiler is an ultra-stable common path scanning interferometer, which provides extremely precise surface measurements. Preliminary results, obtained with a 0.3 NA objective lens and a laser wavelength of 633 nm, show that the system is capable of measuring a 50 nm track width, with a standard deviation less than 4 nm.

Community Detection for Multiplex Social Networks Based on Relational Bayesian Networks

DEFF Research Database (Denmark)

Jiang, Jiuchuan; Jaeger, Manfred

2014-01-01

Many techniques have been proposed for community detection in social networks. Most of these techniques are only designed for networks defined by a single relation. However, many real networks are multiplex networks that contain multiple types of relations and different attributes on the nodes...

Static, Dynamic and Semantic Dimensions: Towards a Multidisciplinary Approach of Social Networks Analysis

Science.gov (United States)

Thovex, Christophe; Trichet, Francky