Motivated by our experiences operating a global WAN, we argue that SDN's reliance on infrastructure external to the data plane has substantially complicated the challenge of maintaining high availability. We propose a new decentralized SDN (dSDN) architecture in which SDN control logic instead runs within routers, eliminating the control plane's reliance on external infrastructure and restoring fate-sharing between control and data planes. We present dSDN as a simpler approach to realizing the benefits of SDN in the WAN. Despite its much simpler design, we show that dSDN is practical from an implementation viewpoint, and outperforms centralized SDN in terms of routing convergence and SLO impact.

Cloud tenant networks are complex to provision, configure, and manage. Tenants must figure out how to assemble, configure, test, etc. a large set of low-level building blocks in order to achieve their high-level goals. As these networks are increasingly spanning multiple clouds and on-premises infrastructure, the complexity scales poorly. We argue that the current cloud abstractions place an unnecessary burden on the tenant to become a seasoned network operator. We thus propose an alternative interface to the cloud provider's network resources in which a tenant's connectivity needs are reduced to a set of parameters associated with compute endpoints. Our API removes the tenant networking layer of cloud deployments altogether, placing its former duties primarily upon the cloud provider. We demonstrate that this API reduces the complexity experienced by tenants by 80-90% while maintaining a scalable and secure architecture. We provide a prototype of the underlying infrastructure changes necessary to support new functionality introduced by our interface and implement our API on top of current cloud APIs.

This paper explains an IoT controlled remote monitoring system. For the implementation of this system, Raspberry Pi is used. Raspberry Pi is a credit card sized single board computer, which has ARM11 microprocessor. A system is developed to continuously monitor the Electrocardiogram (ECG) and other vital parameters. The measured data is stored in a database and it can be displayed in a website that can be accessed only by authorized personnel like physicians, caretakers, etc. The primary objective of this setup is to update the data to the database and alert the physicians for any aberrancy. MySQLdb module is used to link Raspberry pi to the database. Alert message is sent by the combination of Raspberry Pi and GSM module. This system has more future scope as the data gathered by monitoring is very much important and can be used for scientific research by the medical community. By determining the patterns in the parameters observed, the nature of arrhythmias can be predicted. The paper mainly focuses on the system design and the algorithm used to accomplish the task.

Insufficient sleep has been found to be associated with a wide range of negative health and social outcomes. The pharmacological approach to this problem often raises issues related to dependence and residual daytime side effects. An alternative approach offering a potential solution to sleep deprivation is a non-pharmacological technique. This paper presents a compact wearable sleep monitoring device prototype having the capabilities of tracking the sleep stages during the consecutive night sleep cycles, identifying the Slow Wave Sleep (SWS) stage. Embedded into the device prototype are sensors for monitoring body movements, EEG signal and heart rate during the consecutive night sleep cycles and can be used for more precise detection SWS stage.

We present the design of Espresso, Google's SDN-based Internet peering edge routing infrastructure. This architecture grew out of a need to exponentially scale the Internet edge cost-effectively and to enable application-aware routing at Internet-peering scale. Espresso utilizes commodity switches and host-based routing/packet processing to implement a novel fine-grained traffic engineering capability. Overall, Espresso provides Google a scalable peering edge that is programmable, reliable, and integrated with global traffic systems. Espresso also greatly accelerated deployment of new networking features at our peering edge. Espresso has been in production for two years and serves over 22% of Google's total traffic to the Internet.

Arthritis is one of the kinds of chronic disease which causes inflammation to the joints which causing pain and stiffness that can worsen with aging. Mostly it is caused due to the decrease of Cartilage thickness present between the bone joints. There are more than 100 types of arthritis exist in the world. In general arthritis is classified into two parts, septic arthritis and reactive arthritis. Septic arthritis is an unfavorable arthropathy originated by an intraarticular infection which is usually connected to severe symptoms such as pain and decreased the range of motion. In this work, an analysis has been done on two meta-heuristic methods for early detection of septic arthritis since it is a direct invasion of bacteria. In this paper two different meta-heuristic methods like Ant Colony Optimization (ACO) and Clown Fish Queuing and Switching Optimization Algorithm (CFQSOA) are analyzed for the early detection of septic arthritis. By the early diagnosis and treatment of arthritis, the damage to the joints can be reduced.

Content-Centric Networking (CCN) is a communication paradigm that emphasizes content distribution. Named-Data Networking (NDN) is an instantiation of CCN, a candidate Future Internet Architecture. NDN supports human-readable content naming and router-based content caching which lends itself to efficient, secure, and scalable content distribution. Because of NDN's fundamental requirement that each content object must be signed by its producer, fragmentation has been considered incompatible with NDN since it precludes authentication of individual content fragments by routers. The alternative is to perform hop-by-hop reassembly, which incurs prohibitive delays. In this paper, we show that secure and efficient content fragmentation is both possible and even advantageous in NDN and similar content-centric network architectures that involve signed content. We design a concrete technique that facilitates efficient and secure content fragmentation in NDN, discuss its security guarantees and assess performance. We also describe a prototype implementation and compare performance of cut-through with hop-by-hop fragmentation and reassembly.

Named data networking (NDN) is a new networking paradigm using named data instead of named hosts for communication. Implementation of scalable NDN packet forwarding remains a challenge because NDN requires fast variable-length hierarchical name-based lookup, per-packet data plane state update, and large-scale forwarding tables. We have designed and implemented an NDN data plane with a software forwarding engine on an Intel Xeon-based line card in a Cisco ASR9000 router. In order to achieve high-speed forwarding, our design features (1) name lookup via hash tables with fast collision-resistant hash computation, (2) an efficient and secure FIB lookup algorithm that provides good average and bounded worst-case FIB lookup time, (3) PIT partitioning that enables linear multi-core speedup, and (4) an optimized data structure and software prefetching to maximize data cache utilization. In this demonstration, we showcase our NDN router implementation on the ASR9000 and demonstrate that it can forward real NDN traffic at 20Gbps or higher.

Hop-by-hop interest shaping has been proposed as a viable congestion control mechanism in Named Data Networking (NDN). Interest shaping exploits the strict receiver-driven traffic pattern and the symmetric bidirectional forwarding in NDN to control the returning data rate. In this paper, we point out that both interests and contents contribute to congestion and their interdependence must be considered in any interest shaping algorithm. We first analyze this issue mathematically by formulating it as an optimization problem to obtain the optimal shaping rate. Then a practical interest shaping algorithm is proposed to achieve high link utilization without congestive data loss. We further note that flow differentiation in NDN is complicated and design our scheme independently of traffic flows. We demonstrate our hop-by-hop interest shaper in conjunction with simple Additive-Increase-Multiplicative-Decrease (AIMD) clients using the ns3-based NDN simulator (ndnSIM). Our results show that the proposed shaping algorithm can effectively control congestion and achieve near-optimal throughput.

Named data networking (NDN) is a new networking paradigm using named data instead of named hosts for communication. Implementation of scalable NDN packet forwarding remains a challenge because NDN requires fast variable-length hierarchical name-based lookup, per-packet data plane state update, and large-scale forwarding tables. In this paper, we review various design options for a hash table-based NDN forwarding engine and propose a design that enables fast forwarding while achieving DoS (Denial-of-Service) resistance. Our forwarding engine features (1) name lookup via hash tables with fast collision-resistant hash computation, (2) an efficient FIB lookup algorithm that provides good average and bounded worst-case FIB lookup time, (3) PIT partitioning that enables linear multicore speedup, and (4) an optimized data structure and software prefetching to maximize data cache utilization. We have implemented an NDN data plane with a software forwarding engine on an Intel Xeon-based line card in the Cisco ASR 9000 router. By simulation with names extracted from the IR-Cache traces, we demonstrate that our forwarding engine achieves a promising performance of 8.8 MPPS and our NDN router can forward the NDN traffic at 20 Gbps or higher.

In Named Data Networking (NDN), forwarding lookup is based on tokenized variable-length names instead of fixed-length host addresses, and therefore it requires a new approach for designing a fast packet forwarding lookup engine. In this paper, we propose a design of an NDN software forwarding lookup engine based on hash tables and evaluate its performance with different design options. With a good hash function and table design combined with Bloom filters and data prefetching, we demonstrate that our design reaches about 1.5MPPS with a single thread on an Intel 2.0GHz Xeon processor.

Information-centric networks must ensure the authenticity and integrity of named data. ICN designs such as Content-Centric Networking apply a digital signature to a collection of packets for this purpose. This paper shifts the mode of ICN authentication: Self-verifying names ensure data authenticity for read-only named data; signatures or other means ensure name authenticity. The paper considers how self-verifying names might be used in CCN.

The RSVP ASSOCIATION object was defined in the context of GMPLS- controlled Label Switched Paths (LSPs). In this context, the object is used to associate recovery LSPs with the LSP they are protecting. This object also has broader applicability as a mechanism to associate RSVP state. This document defines how the ASSOCIATION object can be more generally applied. This document also defines Extended ASSOCIATION objects that, in particular, can be used in the context of the MPLS Transport Profile (MPLS-TP). This document updates RFC 2205, RFC 3209, and RFC 3473. It also generalizes the definition of the Association ID field defined in RFC 4872. [STANDARDS-TRACK]

Selon un mode de realisation de l'invention, un procede est decrit qui consiste a etablir une session video faisant intervenir un point d'extremite et un serveur ; a evaluer des criteres de reseau associes a des caracteristiques qui peuvent avoir une incidence sur un debit binaire pour la session video ; a communiquer des donnees d'indication de debit binaire, qui se fondent sur les criteres de reseau, au point d'extremite pour qu'il les prenne en consideration dans une requete de debit binaire. La requete de debit binaire concerne une transmission en continu de donnees dans la session video. Le procede consiste egalement a recevoir la requete de debit binaire du point d'extremite.