Call for Papers: Photonics in Switching

Non-blocking crossbar permutation engine with constant routing latency

NASA Technical Reports Server (NTRS)

Monacos, Steve P. (Inventor)

1994-01-01

The invention is embodied in an N x N crossbar for routing packets from a set of N input ports to a set of N output ports, each packet having a header identifying one of the output ports as its destination, including a plurality of individual links which carry individual packets. Each link has a link input end and a link output end, a plurality of switches. Each of the switches has at least top and bottom switch inputs connected to a corresponding pair of the link output ends and top and bottom switch outputs connected to a corresponding pair of link input ends, whereby each switch is connected to four different links. Each of the switches has an exchange state which routes packets from the top and bottom switch inputs to the bottom and top switch outputs, respectively, and a bypass state which routes packets from the top and bottom switch inputs to the top and bottom switch outputs, respectively. A plurality of individual controller devices governing respective switches for sensing from a header of a packet at each switch input for the identity of the destination output port of the packet and selecting one of the exchange and bypass states in accordance with the identity of the destination output port and with the location of the corresponding switch relative to the destination output port.

On-board B-ISDN fast packet switching architectures. Phase 2: Development. Proof-of-concept architecture definition report

NASA Technical Reports Server (NTRS)

Shyy, Dong-Jye; Redman, Wayne

1993-01-01

For the next-generation packet switched communications satellite system with onboard processing and spot-beam operation, a reliable onboard fast packet switch is essential to route packets from different uplink beams to different downlink beams. The rapid emergence of point-to-point services such as video distribution, and the large demand for video conference, distributed data processing, and network management makes the multicast function essential to a fast packet switch (FPS). The satellite's inherent broadcast features gives the satellite network an advantage over the terrestrial network in providing multicast services. This report evaluates alternate multicast FPS architectures for onboard baseband switching applications and selects a candidate for subsequent breadboard development. Architecture evaluation and selection will be based on the study performed in phase 1, 'Onboard B-ISDN Fast Packet Switching Architectures', and other switch architectures which have become commercially available as large scale integration (LSI) devices.

Development of optical packet and circuit integrated ring network testbed.

PubMed

Furukawa, Hideaki; Harai, Hiroaki; Miyazawa, Takaya; Shinada, Satoshi; Kawasaki, Wataru; Wada, Naoya

2011-12-12

We developed novel integrated optical packet and circuit switch-node equipment. Compared with our previous equipment, a polarization-independent 4 × 4 semiconductor optical amplifier switch subsystem, gain-controlled optical amplifiers, and one 100 Gbps optical packet transponder and seven 10 Gbps optical path transponders with 10 Gigabit Ethernet (10GbE) client-interfaces were newly installed in the present system. The switch and amplifiers can provide more stable operation without equipment adjustments for the frequent polarization-rotations and dynamic packet-rate changes of optical packets. We constructed an optical packet and circuit integrated ring network testbed consisting of two switch nodes for accelerating network development, and we demonstrated 66 km fiber transmission and switching operation of multiplexed 14-wavelength 10 Gbps optical paths and 100 Gbps optical packets encapsulating 10GbE frames. Error-free (frame error rate < 1×10(-4)) operation was achieved with optical packets of various packet lengths and packet rates, and stable operation of the network testbed was confirmed. In addition, 4K uncompressed video streaming over OPS links was successfully demonstrated. © 2011 Optical Society of America

Dynamically reconfigurable optical packet switch (DROPS)

NASA Astrophysics Data System (ADS)

Huang, Chi-Heng; Chou, Hsu-Feng; Bowers, John E.; Toudeh-Fallah, Farzam; Gyurek, Russ

2006-12-01

A novel Dynamically Reconfigurable Optical Packet Switch (DROPS) that combines both spectral and spatial switching capabilities is proposed and experimentally demonstrated for the first time. Compared with an Arrayed Waveguide Grating Router (AWGR), the added spatial switching capability provided by the microelectromechanical systems (MEMS) enables dynamically reconfigurable routing that is not possible with an AWGR alone. This methodology has several advantages over an AWGR including scalability, additional degrees of freedom in routing a packet from an ingress port to an egress port and more flexibility in path or line card recovery. The experimental demonstration implemented with 10-Gb/s packets shows that the added spatial switching does not degrade the bit-error-rate performance, indicating the promising potential of DROPS as a versatile and ultra-high capacity switch for optical packet-switched networks.

Flexible-rate optical packet generation/detection and label swapping for optical label switching networks

NASA Astrophysics Data System (ADS)

Wu, Zhongying; Li, Juhao; Tian, Yu; Ge, Dawei; Zhu, Paikun; Chen, Yuanxiang; Chen, Zhangyuan; He, Yongqi

2017-03-01

In recent years, optical label switching (OLS) gains lots of attentions due to its intrinsic advantages to implement protocol, bit-rate, granularity and data format transparency packet switching. In this paper, we propose a novel scheme to realize flexible-rate optical packet switching for OLS networks. At the transmitter node, flexible-rate packet is generated by parallel modulating different combinations of optical carriers generated from the optical multi-carrier generator (OMCG), among which the low-speed optical label occupies one carrier. At the switching node, label is extracted and re-generated in label processing unit (LPU). The payloads are switched based on routing information and new label is added after switching. At the receiver node, another OMCG serves as local oscillators (LOs) for optical payloads coherent detection. The proposed scheme offers good flexibility for dynamic optical packet switching by adjusting the payload bandwidth and could also effectively reduce the number of lasers, modulators and receivers for packet generation/detection. We present proof-of-concept demonstrations of flexible-rate packet generation/detection and label swapping in 12.5 GHz grid. The influence of crosstalk for cascaded label swapping is also investigated.

Multi-function all optical packet switch by periodic wavelength arrangement in an arrayed waveguide grating and wideband optical filters.

PubMed

Feng, Kai-Ming; Wu, Chung-Yu; Wen, Yu-Hsiang

2012-01-16

By utilizing the cyclic filtering function of an NxN arrayed waveguide grating (AWG), we propose and experimentally demonstrate a novel multi-function all optical packet switching (OPS) architecture by applying a periodical wavelength arrangement between the AWG in the optical routing/buffering unit and a set of wideband optical filters in the switched output ports to achieve the desired routing and buffering functions. The proposed OPS employs only one tunable wavelength converter at the input port to convert the input wavelength to a designated wavelength which reduces the number of active optical components and thus the complexity of the traffic control is simplified in the OPS. With the proposed OPS architecture, multiple optical packet switching functions, including arbitrary packet switching and buffering, first-in-first-out (FIFO) packet multiplexing, packet demultiplexing and packet add/drop multiplexing, have been successfully demonstrated.

A Cellular Neural Networks Based DiffServ Switch for Satellite Communication Systems

NASA Astrophysics Data System (ADS)

Tarchi, Daniele; Fantacci, Romano; Gubellini, Roberto; Pecorella, Tommaso

2003-07-01

Recent developments of Internet services and advanced compression methods has revived interest on IP based multimedia satellite communication systems. However a main problem arising here is to guarantee specific Quality of Service (QoS) constraints in order to have good performance for each traffic class.Among various QoS approach used in Internet, recently the DiffServ technique has became the most promising so- lution, mainly for its simplicity with respect to different alternatives. Moreover, in satellite communication systems, DiffServ policy computational capabilities are placed at the edge points (end-to-end philosophy); this is very important for a network constituted by one satellite link because it allows to reduce the implementation complexity of the satellite on-board equipments.The satellite switch under consideration makes use of the Multiple Input Queuing approach. Packets arrived at a switch input are stored in a shared buffer but they are logically ordered in individual queues, one for each possible output link. According to the DiffServ policy, within a same logical queue, packets are reordered in individual sub-queues according to the priority. A suitable implementation of the DiffServ policy based on a Cellular Neural Network (CNN) is proposed in the paper in order to achieve QoS requirements.The CNNs are a set of linear and nonlinear circuits connected among them that allow parallel and asynchronous computation. CNNs are a class of neural networks similar to Hopfield Neural Networks (HNN), but more flexible and suitable for solving the output contention problem, inherent of switching systems, for VLSI implementation.In this paper a CNN has been designed in order to maximize a cost functional, related to the on-board switch through- put and QoS constraints. The initial state for each neural cell is obtained looking at the presence of at least one packet from a certain input logical queue to a specific output line. The input value for each neural cell is a function of priority and length of each input logical queue. The versatility of neural network make feasible to take the best decision for the packet to be delivered to each output satellite beam, in order to meet specific QoS constraints. Numerical results for CNN approach highlights that Neural network convergence within a time slot is guaranteed, and an optimal, or at least near-optimal, solution in terms of cost function is achieved.The proposed system is based on the IETF (Internet Engineering Task Force) recommendations; this means that traffic entering the switching fabric could be marked as Expedited Forward (EF) or Assured Forward (AF), otherwise handled as Best Effort (BE). Two Assured Forward classes with different emission priority have been implemented, taking into account time spent inside the logical queue and its length. Expedited Forward traffic is typical of services to be delivered with the maximum priority, as streaming or interactive services. The packets, belonging to services that need a certain level of priority with low packet loss, are marked as Assured Forward. Best Effort traffic is related to e-mail or file transfer, or other that have not particular QoS requirements. The CNN used to solve conflict situations act as an arbiter for all the output links. Differently from other Multiple Input Queuing approach, where one arbiter for each output line is present, in proposed approach there exist only one arbiter that make the best decision. The selected rule has been defined in order to give priority to packets, according to opportunely defined functionals characteristic of each traffic class, under the constraint that no more than one packet can be delivered to the same output line. The functionals depend on queue length and time spent inside the queue by front packet.The performance of the proposed DiffServ switch has been derived in terms of delay and jitter; buffer occupancy has been analyzed for different configuration, such as a unique common buffer, one buffer for each input line, one buffer for each input line and each priority class.The obtained results highlight an high flexibility of satellite switch with CNN, taking into account that functional used to calculate priority of each queue could be easily changed, without any complexity gain nor change in CNN structure, in order to consider different traffic characteristic. Numerical results show that proposed algorithm outperform the switches based on Multiple Input Queuing, that use strictly priority methods, in terms of delay and jitter. Different buffer size have been also considered in order to analyze packet loss for CNN switch algorithm, comparing different configuration described above.The good behavior of the proposed DiffServ switch has been verified in the case of traffic with pareto distribution for packet length and a geometrical distribution for packet interarrival time, highlighting good performance in terms of delay and jitter. Numerical results also demonstrate the stability of this method for heavy load traffic; in particular maximum permitted load is higher for higher priority classes.

Optical implementation of a parallel out-of-band controller for large broadband ATM switch applications

NASA Astrophysics Data System (ADS)

Cloonan, Thomas J.; Richards, Gaylord W.; Lentine, Anthony L.

1996-03-01

Asynchronous transfer mode (ATM) is rapidly becoming the transport mechanism of choice for the information superhighway, because it promises the bandwidth and flexibility needed for many voice, video and data service offerings. Some industry experts project that the required sizes for ATM switching equipment in the public-switched environment will reach the Tbps range by the beginning of the next decade. This paper analyzes the problems associated with controlling the flow of packets within a broadband ATM switch of this size. The analysis is based on the requirements of the growable packet switch architecture. The paper proposes a novel solution to the problem of hunting paths within an ATM packet switch network. The resulting control scheme is unconventional in two ways. First, it uses an out-of-band control algorithm instead of the more common self-routing approach. In particular, we explore the benefits of using a parallel processor as an out-of-band controller for a growable packet switch distribution network. The processor permits additional levels of parallelism to be added to the out-of-band control function so that path hunts can be performed for all N of the input ports within a single cell interval. The proposed approach is also unconventional because it uses free-space digital optics to guide signals between successive stages of the controller. The paper describes the underlying motivations for implementing an optical out-of-band controller for an ATM switch, and it also describes the logic within a controller node that has been fabricated using a hybrid Si CMOS/GaAs SEED technology. The node uses optical detectors (in GaAs), amplifiers and digital control logic (in Si), and optical modulators (in GaAs). Free-space optical connections between successive device arrays can be provided using either bulk optical elements or micro-optics, but the optical interconnects must provide massive fanout capability. An architectural analysis studying the feasibility of applying free-space optics in this proposed ATM switch controller also is presented.

Advanced optical components for next-generation photonic networks

NASA Astrophysics Data System (ADS)

Yoo, S. J. B.

2003-08-01

Future networks will require very high throughput, carrying dominantly data-centric traffic. The role of Photonic Networks employing all-optical systems will become increasingly important in providing scalable bandwidth, agile reconfigurability, and low-power consumptions in the future. In particular, the self-similar nature of data traffic indicates that packet switching and burst switching will be beneficial in the Next Generation Photonic Networks. While the natural conclusion is to pursue Photonic Packet Switching and Photonic Burst Switching systems, there are significant challenges in realizing such a system due to practical limitations in optical component technologies. Lack of a viable all-optical memory technology will continue to drive us towards exploring rapid reconfigurability in the wavelength domain. We will introduce and discuss the advanced optical component technologies behind the Photonic Packet Routing system designed and demonstrated at UC Davis. The system is capable of packet switching and burst switching, as well as circuit switching with 600 psec switching speed and scalability to 42 petabit/sec aggregated switching capacity. By utilizing a combination of rapidly tunable wavelength conversion and a uniform-loss cyclic frequency (ULCF) arrayed waveguide grating router (AWGR), the system is capable of rapidly switching the packets in wavelength, time, and space domains. The label swapping module inside the Photonic Packet Routing system containing a Mach-Zehnder wavelength converter and a narrow-band fiber Bragg-grating achieves all-optical label swapping with optical 2R (potentially 3R) regeneration while maintaining optical transparency for the data payload. By utilizing the advanced optical component technologies, the Photonic Packet Routing system successfully demonstrated error-free, cascaded, multi-hop photonic packet switching and routing with optical-label swapping. This paper will review the advanced optical component technologies and their role in the Next Generation Photonic Networks.

Intelligent deflection routing in buffer-less networks.

PubMed

Haeri, Soroush; Trajković, Ljiljana

2015-02-01

Deflection routing is employed to ameliorate packet loss caused by contention in buffer-less architectures such as optical burst-switched networks. The main goal of deflection routing is to successfully deflect a packet based only on a limited knowledge that network nodes possess about their environment. In this paper, we present a framework that introduces intelligence to deflection routing (iDef). iDef decouples the design of the signaling infrastructure from the underlying learning algorithm. It consists of a signaling and a decision-making module. Signaling module implements a feedback management protocol while the decision-making module implements a reinforcement learning algorithm. We also propose several learning-based deflection routing protocols, implement them in iDef using the ns-3 network simulator, and compare their performance.

Advances in integrated photonic circuits for packet-switched interconnection

NASA Astrophysics Data System (ADS)

Williams, Kevin A.; Stabile, Ripalta

2014-03-01

Sustained increases in capacity and connectivity are needed to overcome congestion in a range of broadband communication network nodes. Packet routing and switching in the electronic domain are leading to unsustainable energy- and bandwidth-densities, motivating research into hybrid solutions: optical switching engines are introduced for massive-bandwidth data transport while the electronic domain is clocked at more modest GHz rates to manage routing. Commercially-deployed optical switching engines using MEMS technologies are unwieldy and too slow to reconfigure for future packet-based networking. Optoelectronic packet-compliant switch technologies have been demonstrated as laboratory prototypes, but they have so far mostly used discretely pigtailed components, which are impractical for control plane development and product assembly. Integrated photonics has long held the promise of reduced hardware complexity and may be the critical step towards packet-compliant optical switching engines. Recently a number of laboratories world-wide have prototyped optical switching circuits using monolithic integration technology with up to several hundreds of integrated optical components per chip. Our own work has focused on multi-input to multi-output switching matrices. Recently we have demonstrated 8×8×8λ space and wavelength selective switches using gated cyclic routers and 16×16 broadband switching chips using monolithic multi-stage networks. We now operate these advanced circuits with custom control planes implemented with FPGAs to explore real time packet routing in multi-wavelength, multi-port test-beds. We review our contributions in the context of state of the art photonic integrated circuit technology and packet optical switching hardware demonstrations.

All-optical switching for 10-Gb/s packet data by using an ultralow-power optical bistability of photonic-crystal nanocavities.

PubMed

Nozaki, Kengo; Lacraz, Amedee; Shinya, Akihiko; Matsuo, Shinji; Sato, Tomonari; Takeda, Koji; Kuramochi, Eiichi; Notomi, Masaya

2015-11-16

An all-optical packet switching using bistable photonic crystal nanocavity memories was demonstrated for the first time. Nanocavity-waveguide coupling systems were configured for 1 × 1, 1 × 2, and 1 × 3 switches for 10-Gb/s optical packet, and they were all operated with an optical bias power of only a few μW. The power is several magnitudes lower than that of previously reported all-optical packet switches incorporating all-optical memories. A theoretical investigation indicated the optimum design for reducing the power consumption even further, and for realizing a higher data-rate capability and higher extinction. A small footprint and integrability are also features of our switches, which make them attractive for constructing an all-optical packet switching subsystem with a view to realizing optical routing on a chip.

Mixture block coding with progressive transmission in packet video. Appendix 1: Item 2. M.S. Thesis

NASA Technical Reports Server (NTRS)

Chen, Yun-Chung

1989-01-01

Video transmission will become an important part of future multimedia communication because of dramatically increasing user demand for video, and rapid evolution of coding algorithm and VLSI technology. Video transmission will be part of the broadband-integrated services digital network (B-ISDN). Asynchronous transfer mode (ATM) is a viable candidate for implementation of B-ISDN due to its inherent flexibility, service independency, and high performance. According to the characteristics of ATM, the information has to be coded into discrete cells which travel independently in the packet switching network. A practical realization of an ATM video codec called Mixture Block Coding with Progressive Transmission (MBCPT) is presented. This variable bit rate coding algorithm shows how a constant quality performance can be obtained according to user demand. Interactions between codec and network are emphasized including packetization, service synchronization, flow control, and error recovery. Finally, some simulation results based on MBCPT coding with error recovery are presented.

Distributed synchronization control of complex networks with communication constraints.

PubMed

Xu, Zhenhua; Zhang, Dan; Song, Hongbo

2016-11-01

This paper is concerned with the distributed synchronization control of complex networks with communication constraints. In this work, the controllers communicate with each other through the wireless network, acting as a controller network. Due to the constrained transmission power, techniques such as the packet size reduction and transmission rate reduction schemes are proposed which could help reduce communication load of the controller network. The packet dropout problem is also considered in the controller design since it is often encountered in networked control systems. We show that the closed-loop system can be modeled as a switched system with uncertainties and random variables. By resorting to the switched system approach and some stochastic system analysis method, a new sufficient condition is firstly proposed such that the exponential synchronization is guaranteed in the mean-square sense. The controller gains are determined by using the well-known cone complementarity linearization (CCL) algorithm. Finally, a simulation study is performed, which demonstrates the effectiveness of the proposed design algorithm. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

A multi-ring optical packet and circuit integrated network with optical buffering.

PubMed

Furukawa, Hideaki; Shinada, Satoshi; Miyazawa, Takaya; Harai, Hiroaki; Kawasaki, Wataru; Saito, Tatsuhiko; Matsunaga, Koji; Toyozumi, Tatuya; Wada, Naoya

2012-12-17

We newly developed a 3 × 3 integrated optical packet and circuit switch-node. Optical buffers and burst-mode erbium-doped fiber amplifiers with the gain flatness are installed in the 3 × 3 switch-node. The optical buffer can prevent packet collisions and decrease packet loss. We constructed a multi-ring optical packet and circuit integrated network testbed connecting two single-ring networks and a client network by the 3 × 3 switch-node. For the first time, we demonstrated 244 km fiber transmission and 5-node hopping of multiplexed 14-wavelength 10 Gbps optical paths and 100 Gbps optical packets encapsulating 10 Gigabit Ethernet frames on the testbed. Error-free (frame error rate < 1 × 10(-4)) operation was achieved with optical packets of various packet lengths. In addition, successful avoidance of packet collisions by optical buffers was confirmed.

Packet Switching Networks: An Introduction with Some Attention to Selected Vendors.

ERIC Educational Resources Information Center

Sanchez, James Joseph

The purpose of this paper is to provide an overview of the history, development, and services of the packet switching network services that currently exist in the United States. The character of packet switching, a computerized method of transmitting data, is used as the basis for tracing the development of the industry itself. Contending that the…

Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report.

ERIC Educational Resources Information Center

Finn, Gregory G.

This report discusses some of the problems and limitations in existing internetwork design for the connection of packet-switching networks of different technologies and presents an algorithm that has been shown to be suitable for internetworks of unbounded size. Using a new form of address and a flat routing mechanism called Cartesian routing,…

Machine-Learning Based Channel Quality and Stability Estimation for Stream-Based Multichannel Wireless Sensor Networks.

PubMed

Rehan, Waqas; Fischer, Stefan; Rehan, Maaz

2016-09-12

Wireless sensor networks (WSNs) have become more and more diversified and are today able to also support high data rate applications, such as multimedia. In this case, per-packet channel handshaking/switching may result in inducing additional overheads, such as energy consumption, delays and, therefore, data loss. One of the solutions is to perform stream-based channel allocation where channel handshaking is performed once before transmitting the whole data stream. Deciding stream-based channel allocation is more critical in case of multichannel WSNs where channels of different quality/stability are available and the wish for high performance requires sensor nodes to switch to the best among the available channels. In this work, we will focus on devising mechanisms that perform channel quality/stability estimation in order to improve the accommodation of stream-based communication in multichannel wireless sensor networks. For performing channel quality assessment, we have formulated a composite metric, which we call channel rank measurement (CRM), that can demarcate channels into good, intermediate and bad quality on the basis of the standard deviation of the received signal strength indicator (RSSI) and the average of the link quality indicator (LQI) of the received packets. CRM is then used to generate a data set for training a supervised machine learning-based algorithm (which we call Normal Equation based Channel quality prediction (NEC) algorithm) in such a way that it may perform instantaneous channel rank estimation of any channel. Subsequently, two robust extensions of the NEC algorithm are proposed (which we call Normal Equation based Weighted Moving Average Channel quality prediction (NEWMAC) algorithm and Normal Equation based Aggregate Maturity Criteria with Beta Tracking based Channel weight prediction (NEAMCBTC) algorithm), that can perform channel quality estimation on the basis of both current and past values of channel rank estimation. In the end, simulations are made using MATLAB, and the results show that the Extended version of NEAMCBTC algorithm (Ext-NEAMCBTC) outperforms the compared techniques in terms of channel quality and stability assessment. It also minimizes channel switching overheads (in terms of switching delays and energy consumption) for accommodating stream-based communication in multichannel WSNs.

Machine-Learning Based Channel Quality and Stability Estimation for Stream-Based Multichannel Wireless Sensor Networks

PubMed Central

Rehan, Waqas; Fischer, Stefan; Rehan, Maaz

2016-01-01

Wireless sensor networks (WSNs) have become more and more diversified and are today able to also support high data rate applications, such as multimedia. In this case, per-packet channel handshaking/switching may result in inducing additional overheads, such as energy consumption, delays and, therefore, data loss. One of the solutions is to perform stream-based channel allocation where channel handshaking is performed once before transmitting the whole data stream. Deciding stream-based channel allocation is more critical in case of multichannel WSNs where channels of different quality/stability are available and the wish for high performance requires sensor nodes to switch to the best among the available channels. In this work, we will focus on devising mechanisms that perform channel quality/stability estimation in order to improve the accommodation of stream-based communication in multichannel wireless sensor networks. For performing channel quality assessment, we have formulated a composite metric, which we call channel rank measurement (CRM), that can demarcate channels into good, intermediate and bad quality on the basis of the standard deviation of the received signal strength indicator (RSSI) and the average of the link quality indicator (LQI) of the received packets. CRM is then used to generate a data set for training a supervised machine learning-based algorithm (which we call Normal Equation based Channel quality prediction (NEC) algorithm) in such a way that it may perform instantaneous channel rank estimation of any channel. Subsequently, two robust extensions of the NEC algorithm are proposed (which we call Normal Equation based Weighted Moving Average Channel quality prediction (NEWMAC) algorithm and Normal Equation based Aggregate Maturity Criteria with Beta Tracking based Channel weight prediction (NEAMCBTC) algorithm), that can perform channel quality estimation on the basis of both current and past values of channel rank estimation. In the end, simulations are made using MATLAB, and the results show that the Extended version of NEAMCBTC algorithm (Ext-NEAMCBTC) outperforms the compared techniques in terms of channel quality and stability assessment. It also minimizes channel switching overheads (in terms of switching delays and energy consumption) for accommodating stream-based communication in multichannel WSNs. PMID:27626429

A Study of Quality of Service Communication for High-Speed Packet-Switching Computer Sub-Networks

NASA Technical Reports Server (NTRS)

Cui, Zhenqian

1999-01-01

In this thesis, we analyze various factors that affect quality of service (QoS) communication in high-speed, packet-switching sub-networks. We hypothesize that sub-network-wide bandwidth reservation and guaranteed CPU processing power at endpoint systems for handling data traffic are indispensable to achieving hard end-to-end quality of service. Different bandwidth reservation strategies, traffic characterization schemes, and scheduling algorithms affect the network resources and CPU usage as well as the extent that QoS can be achieved. In order to analyze those factors, we design and implement a communication layer. Our experimental analysis supports our research hypothesis. The Resource ReSerVation Protocol (RSVP) is designed to realize resource reservation. Our analysis of RSVP shows that using RSVP solely is insufficient to provide hard end-to-end quality of service in a high-speed sub-network. Analysis of the IEEE 802.lp protocol also supports the research hypothesis.

Performance and policy dimensions in internet routing

NASA Technical Reports Server (NTRS)

Mills, David L.; Boncelet, Charles G.; Elias, John G.; Schragger, Paul A.; Jackson, Alden W.; Thyagarajan, Ajit

1995-01-01

The Internet Routing Project, referred to in this report as the 'Highball Project', has been investigating architectures suitable for networks spanning large geographic areas and capable of very high data rates. The Highball network architecture is based on a high speed crossbar switch and an adaptive, distributed, TDMA scheduling algorithm. The scheduling algorithm controls the instantaneous configuration and swell time of the switch, one of which is attached to each node. In order to send a single burst or a multi-burst packet, a reservation request is sent to all nodes. The scheduling algorithm then configures the switches immediately prior to the arrival of each burst, so it can be relayed immediately without requiring local storage. Reservations and housekeeping information are sent using a special broadcast-spanning-tree schedule. Progress to date in the Highball Project includes the design and testing of a suite of scheduling algorithms, construction of software reservation/scheduling simulators, and construction of a strawman hardware and software implementation. A prototype switch controller and timestamp generator have been completed and are in test. Detailed documentation on the algorithms, protocols and experiments conducted are given in various reports and papers published. Abstracts of this literature are included in the bibliography at the end of this report, which serves as an extended executive summary.

A Fully Implemented 12 × 12 Data Vortex Optical Packet Switching Interconnection Network

NASA Astrophysics Data System (ADS)

Shacham, Assaf; Small, Benjamin A.; Liboiron-Ladouceur, Odile; Bergman, Keren

2005-10-01

A fully functional optical packet switching (OPS) interconnection network based on the data vortex architecture is presented. The photonic switching fabric uniquely capitalizes on the enormous bandwidth advantage of wavelength division multiplexing (WDM) wavelength parallelism while delivering minimal packet transit latency. Utilizing semiconductor optical amplifier (SOA)-based switching nodes and conventional fiber-optic technology, the 12-port system exhibits a capacity of nearly 1 Tb/s. Optical packets containing an eight-wavelength WDM payload with 10 Gb/s per wavelength are routed successfully to all 12 ports while maintaining a bit error rate (BER) of 10-12 or better. Median port-to-port latencies of 110 ns are achieved with a distributed deflection routing network that resolves packet contention on-the-fly without the use of optical buffers and maintains the entire payload path in the optical domain.

MoNET: media over net gateway processor for next-generation network

NASA Astrophysics Data System (ADS)

Elabd, Hammam; Sundar, Rangarajan; Dedes, John

2001-12-01

MoNETTM (Media over Net) SX000 product family is designed using a scalable voice, video and packet-processing platform to address applications with channel densities from few voice channels to four OC3 per card. This platform is developed for bridging public circuit-switched network to the next generation packet telephony and data network. The platform consists of a DSP farm, RISC processors and interface modules. DSP farm is required to execute voice compression, image compression and line echo cancellation algorithms for large number of voice, video, fax, and modem or data channels. RISC CPUs are used for performing various packetizations based on RTP, UDP/IP and ATM encapsulations. In addition, RISC CPUs also participate in the DSP farm load management and communication with the host and other MoP devices. The MoNETTM S1000 communications device is designed for voice processing and for bridging TDM to ATM and IP packet networks. The S1000 consists of the DSP farm based on Carmel DSP core and 32-bit RISC CPU, along with Ethernet, Utopia, PCI, and TDM interfaces. In this paper, we will describe the VoIP infrastructure, building blocks of the S500, S1000 and S3000 devices, algorithms executed on these device and associated channel densities, detailed DSP architecture, memory architecture, data flow and scheduling.

Photonic integrated circuit optical buffer for packet-switched networks.

PubMed

Burmeister, Emily F; Mack, John P; Poulsen, Henrik N; Masanović, Milan L; Stamenić, Biljana; Blumenthal, Daniel J; Bowers, John E

2009-04-13

A chip-scale optical buffer performs autonomous contention resolution for 40-byte packets with 99% packet recovery. The buffer consists of a fast, InP-based 2 x 2 optical switch and a silica-on-silicon low loss delay loop. The buffer is demonstrated in recirculating operation, but may be reconfigured in feed-forward operation for longer packet lengths. The recirculating buffer provides packet storage in integer multiples of the delay length of 12.86 ns up to 64.3 ns with 98% packet recovery. The buffer is used to resolve contention between two 40 Gb/s packet streams using multiple photonic chip optical buffers.

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

PubMed

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.

Performance of highly connected photonic switching lossless metro-access optical networks

NASA Astrophysics Data System (ADS)

Martins, Indayara Bertoldi; Martins, Yara; Barbosa, Felipe Rudge

2018-03-01

The present work analyzes the performance of photonic switching networks, optical packet switching (OPS) and optical burst switching (OBS), in mesh topology of different sizes and configurations. The "lossless" photonic switching node is based on a semiconductor optical amplifier, demonstrated and validated with experimental results on optical power gain, noise figure, and spectral range. The network performance was evaluated through computer simulations based on parameters such as average number of hops, optical packet loss fraction, and optical transport delay (Am). The combination of these elements leads to a consistent account of performance, in terms of network traffic and packet delivery for OPS and OBS metropolitan networks. Results show that a combination of highly connected mesh topologies having an ingress e-buffer present high efficiency and throughput, with very low packet loss and low latency, ensuring fast data delivery to the final receiver.

MPNACK: an optical switching scheme enabling the buffer-less reliable transmission

NASA Astrophysics Data System (ADS)

Yu, Xiaoshan; Gu, Huaxi; Wang, Kun; Xu, Meng; Guo, Yantao

2016-01-01

Optical data center networks are becoming an increasingly promising solution to solve the bottlenecks faced by electrical networks, such as low transmission bandwidth, high wiring complexity, and unaffordable power consumption. However, the optical circuit switching (OCS) network is not flexible enough to carry the traffic burst while the optical packet switching (OPS) network cannot solve the packet contention in an efficient way. To this end, an improved switching strategy named OPS with multi-hop Negative Acknowledgement (MPNACK) is proposed. This scheme uses a feedback mechanism, rather than the buffering structure, to handle the optical packet contention. The collided packet is treated as a NACK packet and sent back to the source server. When the sender receives this NACK packet, it knows a collision happens in the transmission path and a retransmission procedure is triggered. Overall, the OPS-NACK scheme enables a reliable transmission in the buffer-less optical network. Furthermore, with this scheme, the expensive and energy-hungry elements, optical or electrical buffers, can be removed from the optical interconnects, thus a more scalable and cost-efficient network can be constructed for cloud computing data centers.

Fault tolerant onboard packet switch architecture for communication satellites: Shared memory per beam approach

NASA Technical Reports Server (NTRS)

Shalkhauser, Mary JO; Quintana, Jorge A.; Soni, Nitin J.

1994-01-01

The NASA Lewis Research Center is developing a multichannel communication signal processing satellite (MCSPS) system which will provide low data rate, direct to user, commercial communications services. The focus of current space segment developments is a flexible, high-throughput, fault tolerant onboard information switching processor. This information switching processor (ISP) is a destination-directed packet switch which performs both space and time switching to route user information among numerous user ground terminals. Through both industry study contracts and in-house investigations, several packet switching architectures were examined. A contention-free approach, the shared memory per beam architecture, was selected for implementation. The shared memory per beam architecture, fault tolerance insertion, implementation, and demonstration plans are described.

Next generation communications satellites: multiple access and network studies

NASA Technical Reports Server (NTRS)

Meadows, H. E.; Schwartz, M.; Stern, T. E.; Ganguly, S.; Kraimeche, B.; Matsuo, K.; Gopal, I.

1982-01-01

Efficient resource allocation and network design for satellite systems serving heterogeneous user populations with large numbers of small direct-to-user Earth stations are discussed. Focus is on TDMA systems involving a high degree of frequency reuse by means of satellite-switched multiple beams (SSMB) with varying degrees of onboard processing. Algorithms for the efficient utilization of the satellite resources were developed. The effect of skewed traffic, overlapping beams and batched arrivals in packet-switched SSMB systems, integration of stream and bursty traffic, and optimal circuit scheduling in SSMB systems: performance bounds and computational complexity are discussed.

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

DOE PAGES

Shen, Yiwen; Hattink, Maarten; Samadi, Payman; ...

2018-04-13

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. Here, 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 networkmore » 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 microsecond control plane latency for data-center and high performance computing platforms.« less

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Shen, Yiwen; Hattink, Maarten; Samadi, Payman

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. Here, 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 networkmore » 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 microsecond control plane latency for data-center and high performance computing platforms.« less

Moving the boundary between wavelength resources in optical packet and circuit integrated ring network.

PubMed

Furukawa, Hideaki; Miyazawa, Takaya; Wada, Naoya; Harai, Hiroaki

2014-01-13

Optical packet and circuit integrated (OPCI) networks provide both optical packet switching (OPS) and optical circuit switching (OCS) links on the same physical infrastructure using a wavelength multiplexing technique in order to deal with best-effort services and quality-guaranteed services. To immediately respond to changes in user demand for OPS and OCS links, OPCI networks should dynamically adjust the amount of wavelength resources for each link. We propose a resource-adjustable hybrid optical packet/circuit switch and transponder. We also verify that distributed control of resource adjustments can be applied to the OPCI ring network testbed we developed. In cooperation with the resource adjustment mechanism and the hybrid switch and transponder, we demonstrate that automatically allocating a shared resource and moving the wavelength resource boundary between OPS and OCS links can be successfully executed, depending on the number of optical paths in use.

On-board congestion control for satellite packet switching networks

NASA Technical Reports Server (NTRS)

Chu, Pong P.

1991-01-01

It is desirable to incorporate packet switching capability on-board for future communication satellites. Because of the statistical nature of packet communication, incoming traffic fluctuates and may cause congestion. Thus, it is necessary to incorporate a congestion control mechanism as part of the on-board processing to smooth and regulate the bursty traffic. Although there are extensive studies on congestion control for both baseband and broadband terrestrial networks, these schemes are not feasible for space based switching networks because of the unique characteristics of satellite link. Here, we propose a new congestion control method for on-board satellite packet switching. This scheme takes into consideration the long propagation delay in satellite link and takes advantage of the the satellite's broadcasting capability. It divides the control between the ground terminals and satellite, but distributes the primary responsibility to ground terminals and only requires minimal hardware resource on-board satellite.

New Scheduling Algorithms for Agile All-Photonic Networks

NASA Astrophysics Data System (ADS)

Mehri, Mohammad Saleh; Ghaffarpour Rahbar, Akbar

2017-12-01

An optical overlaid star network is a class of agile all-photonic networks that consists of one or more core node(s) at the center of the star network and a number of edge nodes around the core node. In this architecture, a core node may use a scheduling algorithm for transmission of traffic through the network. A core node is responsible for scheduling optical packets that arrive from edge nodes and switching them toward their destinations. Nowadays, most edge nodes use virtual output queue (VOQ) architecture for buffering client packets to achieve high throughput. This paper presents two efficient scheduling algorithms called discretionary iterative matching (DIM) and adaptive DIM. These schedulers find maximum matching in a small number of iterations and provide high throughput and incur low delay. The number of arbiters in these schedulers and the number of messages exchanged between inputs and outputs of a core node are reduced. We show that DIM and adaptive DIM can provide better performance in comparison with iterative round-robin matching with SLIP (iSLIP). SLIP means the act of sliding for a short distance to select one of the requested connections based on the scheduling algorithm.

Experimental demonstration of tunable multiple optical orthogonal codes sequences-based optical label for optical packets switching

NASA Astrophysics Data System (ADS)

Zhang, Chongfu; Qiu, Kun; Zhou, Heng; Ling, Yun; Wang, Yawei; Xu, Bo

2010-03-01

In this paper, the tunable multiple optical orthogonal codes sequences (MOOCS)-based optical label for optical packet switching (OPS) (MOOCS-OPS) is experimentally demonstrated for the first time. The tunable MOOCS-based optical label is performed by using fiber Bragg grating (FBG)-based optical en/decoders group and optical switches configured by using Field Programmable Gate Array (FPGA), and the optical label is erased by using Semiconductor Optical Amplifier (SOA). Some waveforms of the MOOCS-based optical label, optical packet including the MOOCS-based optical label and the payloads are obtained, the switching control mechanism and the switching matrix are discussed, the bit error rate (BER) performance of this system is also studied. These experimental results show that the tunable MOOCS-OPS scheme is effective.

Packet communications in satellites with multiple-beam antennas and signal processing

NASA Technical Reports Server (NTRS)

Davies, R.; Chethik, F.; Penick, M.

1980-01-01

A communication satellite with a multiple-beam antenna and onboard signal processing is considered for use in a 'message-switched' data relay system. The signal processor may incorporate demodulation, routing, storage, and remodulation of the data. A system user model is established and key functional elements for the signal processing are identified. With the throughput and delay requirements as the controlled variables, the hardware complexity, operational discipline, occupied bandwidth, and overall user end-to-end cost are estimated for (1) random-access packet switching; and (2) reservation-access packet switching. Other aspects of this network (eg, the adaptability to channel switched traffic requirements) are examined. For the given requirements and constraints, the reservation system appears to be the most attractive protocol.

Analysis of the packet formation process in packet-switched networks

NASA Astrophysics Data System (ADS)

Meditch, J. S.

Two new queueing system models for the packet formation process in packet-switched telecommunication networks are developed, and their applications in process stability, performance analysis, and optimization studies are illustrated. The first, an M/M/1 queueing system characterization of the process, is a highly aggregated model which is useful for preliminary studies. The second, a marked extension of an earlier M/G/1 model, permits one to investigate stability, performance characteristics, and design of the packet formation process in terms of the details of processor architecture, and hardware and software implementations with processor structure and as many parameters as desired as variables. The two new models together with the earlier M/G/1 characterization span the spectrum of modeling complexity for the packet formation process from basic to advanced.

Performance of circuit switching in the Internet

NASA Astrophysics Data System (ADS)

Molinero-Fernández, Pablo; McKeown, Nick

2003-04-01

We study the performance of an Internet that uses circuit switching (CS) instead of, or in addition to, packet switching (PS). On the face of it, this would seem a pointless exercise; the Internet is packet switched, and it was deliberately built that way to enable the efficiencies afforded by statistical multiplexing and the robustness of fast rerouting around failures. But link utilization is low particularly at the core of the Internet, which makes statistical multiplexing less important than it once was. Moreover, circuit switches today are capable of rapid reconfiguration around failures. There is also renewed interest in CS because of the ease of building very-high-capacity optical circuit switches. Although several proposals have suggested ways in which CS may be introduced into the Internet, the research presented here is based on Transmission Control Protocol (TCP) switching, in which a new circuit is created for each application flow. Here we explore the performance of a network that uses TCP switching, with particular emphasis on the response time experienced by users. We use simple M/GI/1 and M/GI/N queues to model application flows in both packet-switched and circuit-switched networks, as well as ns-2 simulations. We conclude that because of high-bandwidth long-lived flows, it does not make sense to use CS in shared-access or local area networks. But our results suggest that in the core of the network, where high capacity is needed most, and where peak flow rate is limited by the access link, there is little or no difference in performance between CS and PS. Given that circuit switches can be built to be much faster than packet switches, this suggests that a circuit-switched core warrants further investigation.

Fast simulation of packet loss rates in a shared buffer communications switch

NASA Technical Reports Server (NTRS)

Chang, Cheng-Shang; Heidelberger, Philip; Shahabuddin, Perwez

1993-01-01

This paper describes an efficient technique for estimating, via simulation, the probability of buffer overflows in a queueing model that arises in the analysis of ATM (Asynchronous Transfer Mode) communication switches. There are multiple streams of (autocorrelated) traffic feeding the switch that has a buffer of finite capacity. Each stream is designated as either being of high or low priority. When the queue length reaches a certain threshold, only high priority packets are admitted to the switch's buffer. The problem is to estimate the loss rate of high priority packets. An asymptotically optimal importance sampling approach is developed for this rare event simulation problem. In this approach, the importance sampling is done in two distinct phases. In the first phase, an importance sampling change of measure is used to bring the queue length up to the threshold at which low priority packets get rejected. In the second phase, a different importance sampling change of measure is used to move the queue length from the threshold to the buffer capacity.

Method and allocation device for allocating pending requests for data packet transmission at a number of inputs to a number of outputs of a packet switching device in successive time slots

DOEpatents

Abel, Francois [Rueschlikon, CH; Iliadis, Ilias [Rueschlikon, CH; Minkenberg, Cyriel J. A. [Adliswil, CH

2009-02-03

A method for allocating pending requests for data packet transmission at a number of inputs to a number of outputs of a switching system in successive time slots, including a matching method including the steps of providing a first request information in a first time slot indicating data packets at the inputs requesting transmission to the outputs of the switching system, performing a first step in the first time slot depending on the first request information to obtain a first matching information, providing a last request information in a last time slot successive to the first time slot, performing a last step in the last time slot depending on the last request information and depending on the first matching information to obtain a final matching information, and assigning the pending data packets at the number of inputs to the number of outputs based on the final matching information.

Flow-aggregated traffic-driven label mapping in label-switching networks

NASA Astrophysics Data System (ADS)

Nagami, Kenichi; Katsube, Yasuhiro; Esaki, Hiroshi; Nakamura, Osamu

1998-12-01

Label switching technology enables high performance, flexible, layer-3 packet forwarding based on the fixed length label information mapped to the layer-3 packet stream. A Label Switching Router (LSR) forwards layer-3 packets based on their label information mapped to the layer-3 address information as well as their layer-3 address information. This paper evaluates the required number of labels under traffic-driven label mapping policy using the real backbone traffic traces. The evaluation shows that the label mapping policy requires a large number of labels. In order to reduce the required number of labels, we propose a label mapping policy which is a traffic-driven label mapping for the traffic toward the same destination network. The evaluation shows that the proposed label mapping policy requires only about one tenth as many labels compared with the traffic-driven label mapping for the host-pair packet stream,and the topology-driven label mapping for the destination network packet stream.

Technical support for digital systems technology development. Task order 1: ISP contention analysis and control

NASA Technical Reports Server (NTRS)

Stehle, Roy H.; Ogier, Richard G.

1993-01-01

Alternatives for realizing a packet-based network switch for use on a frequency division multiple access/time division multiplexed (FDMA/TDM) geostationary communication satellite were investigated. Each of the eight downlink beams supports eight directed dwells. The design needed to accommodate multicast packets with very low probability of loss due to contention. Three switch architectures were designed and analyzed. An output-queued, shared bus system yielded a functionally simple system, utilizing a first-in, first-out (FIFO) memory per downlink dwell, but at the expense of a large total memory requirement. A shared memory architecture offered the most efficiency in memory requirements, requiring about half the memory of the shared bus design. The processing requirement for the shared-memory system adds system complexity that may offset the benefits of the smaller memory. An alternative design using a shared memory buffer per downlink beam decreases circuit complexity through a distributed design, and requires at most 1000 packets of memory more than the completely shared memory design. Modifications to the basic packet switch designs were proposed to accommodate circuit-switched traffic, which must be served on a periodic basis with minimal delay. Methods for dynamically controlling the downlink dwell lengths were developed and analyzed. These methods adapt quickly to changing traffic demands, and do not add significant complexity or cost to the satellite and ground station designs. Methods for reducing the memory requirement by not requiring the satellite to store full packets were also proposed and analyzed. In addition, optimal packet and dwell lengths were computed as functions of memory size for the three switch architectures.

Hierarchical trie packet classification algorithm based on expectation-maximization clustering.

PubMed

Bi, Xia-An; Zhao, Junxia

2017-01-01

With the development of computer network bandwidth, packet classification algorithms which are able to deal with large-scale rule sets are in urgent need. Among the existing algorithms, researches on packet classification algorithms based on hierarchical trie have become an important packet classification research branch because of their widely practical use. Although hierarchical trie is beneficial to save large storage space, it has several shortcomings such as the existence of backtracking and empty nodes. This paper proposes a new packet classification algorithm, Hierarchical Trie Algorithm Based on Expectation-Maximization Clustering (HTEMC). Firstly, this paper uses the formalization method to deal with the packet classification problem by means of mapping the rules and data packets into a two-dimensional space. Secondly, this paper uses expectation-maximization algorithm to cluster the rules based on their aggregate characteristics, and thereby diversified clusters are formed. Thirdly, this paper proposes a hierarchical trie based on the results of expectation-maximization clustering. Finally, this paper respectively conducts simulation experiments and real-environment experiments to compare the performances of our algorithm with other typical algorithms, and analyzes the results of the experiments. The hierarchical trie structure in our algorithm not only adopts trie path compression to eliminate backtracking, but also solves the problem of low efficiency of trie updates, which greatly improves the performance of the algorithm.

Hierarchical trie packet classification algorithm based on expectation-maximization clustering

PubMed Central

Bi, Xia-an; Zhao, Junxia

2017-01-01

With the development of computer network bandwidth, packet classification algorithms which are able to deal with large-scale rule sets are in urgent need. Among the existing algorithms, researches on packet classification algorithms based on hierarchical trie have become an important packet classification research branch because of their widely practical use. Although hierarchical trie is beneficial to save large storage space, it has several shortcomings such as the existence of backtracking and empty nodes. This paper proposes a new packet classification algorithm, Hierarchical Trie Algorithm Based on Expectation-Maximization Clustering (HTEMC). Firstly, this paper uses the formalization method to deal with the packet classification problem by means of mapping the rules and data packets into a two-dimensional space. Secondly, this paper uses expectation-maximization algorithm to cluster the rules based on their aggregate characteristics, and thereby diversified clusters are formed. Thirdly, this paper proposes a hierarchical trie based on the results of expectation-maximization clustering. Finally, this paper respectively conducts simulation experiments and real-environment experiments to compare the performances of our algorithm with other typical algorithms, and analyzes the results of the experiments. The hierarchical trie structure in our algorithm not only adopts trie path compression to eliminate backtracking, but also solves the problem of low efficiency of trie updates, which greatly improves the performance of the algorithm. PMID:28704476

A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks.

PubMed

Dao, Thi-Nga; Yoon, Seokhoon; Kim, Jangyoung

2016-01-05

Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR.

A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks

PubMed Central

Dao, Thi-Nga; Yoon, Seokhoon; Kim, Jangyoung

2016-01-01

Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR. PMID:26742046

Speech transport for packet telephony and voice over IP

NASA Astrophysics Data System (ADS)

Baker, Maurice R.

1999-11-01

Recent advances in packet switching, internetworking, and digital signal processing technologies have converged to allow realizable practical implementations of packet telephony systems. This paper provides a tutorial on transmission engineering for packet telephony covering the topics of speech coding/decoding, speech packetization, packet data network transport, and impairments which may negatively impact end-to-end system quality. Particular emphasis is placed upon Voice over Internet Protocol given the current popularity and ubiquity of IP transport.

An Efficient Conflict Detection Algorithm for Packet Filters

NASA Astrophysics Data System (ADS)

Lee, Chun-Liang; Lin, Guan-Yu; Chen, Yaw-Chung

Packet classification is essential for supporting advanced network services such as firewalls, quality-of-service (QoS), virtual private networks (VPN), and policy-based routing. The rules that routers use to classify packets are called packet filters. If two or more filters overlap, a conflict occurs and leads to ambiguity in packet classification. This study proposes an algorithm that can efficiently detect and resolve filter conflicts using tuple based search. The time complexity of the proposed algorithm is O(nW+s), and the space complexity is O(nW), where n is the number of filters, W is the number of bits in a header field, and s is the number of conflicts. This study uses the synthetic filter databases generated by ClassBench to evaluate the proposed algorithm. Simulation results show that the proposed algorithm can achieve better performance than existing conflict detection algorithms both in time and space, particularly for databases with large numbers of conflicts.

The sampled-data consensus of multi-agent systems with probabilistic time-varying delays and packet losses

NASA Astrophysics Data System (ADS)

Sui, Xin; Yang, Yongqing; Xu, Xianyun; Zhang, Shuai; Zhang, Lingzhong

2018-02-01

This paper investigates the consensus of multi-agent systems with probabilistic time-varying delays and packet losses via sampled-data control. On the one hand, a Bernoulli-distributed white sequence is employed to model random packet losses among agents. On the other hand, a switched system is used to describe packet dropouts in a deterministic way. Based on the special property of the Laplacian matrix, the consensus problem can be converted into a stabilization problem of a switched system with lower dimensions. Some mean square consensus criteria are derived in terms of constructing an appropriate Lyapunov function and using linear matrix inequalities (LMIs). Finally, two numerical examples are given to show the effectiveness of the proposed method.

A programmable Si-photonic node for SDN-enabled Bloom filter forwarding in disaggregated data centers

NASA Astrophysics Data System (ADS)

Moralis-Pegios, M.; Terzenidis, N.; Vagionas, C.; Pitris, S.; Chatzianagnostou, E.; Brimont, A.; Zanzi, A.; Sanchis, P.; Marti, J.; Kraft, J.; Rochracher, K.; Dorrestein, S.; Bogdan, M.; Tekin, T.; Syrivelis, D.; Tassiulas, L.; Miliou, A.; Pleros, N.; Vyrsokinos, K.

2017-02-01

Programmable switching nodes supporting Software-Defined Networking (SDN) over optical interconnecting technologies arise as a key enabling technology for future disaggregated Data Center (DC) environments. The SDNenabling roadmap of intra-DC optical solutions is already a reality for rack-to-rack interconnects, with recent research reporting on interesting applications of programmable silicon photonic switching fabrics addressing board-to-board and even on-board applications. In this perspective, simplified information addressing schemes like Bloom filter (BF)-based labels emerge as a highly promising solution for ensuring rapid switch reconfiguration, following quickly the changes enforced in network size, network topology or even in content location. The benefits of BF-based forwarding have been so far successfully demonstrated in the Information-Centric Network (ICN) paradigm, while theoretical studies have also revealed the energy consumption and speed advantages when applied in DCs. In this paper we present for the first time a programmable 4x4 Silicon Photonic switch that supports SDN through the use of BF-labeled router ports. Our scheme significantly simplifies packet forwarding as it negates the need for large forwarding tables, allowing for its remote control through modifications in the assigned BF labels. We demonstrate 1x4 switch operation controlling the Si-Pho switch by a Stratix V FPGA module, which is responsible for processing the packet ID and correlating its destination with the appropriate BF-labeled outgoing port. DAC- and amplifier-less control of the carrier-injection Si-Pho switches is demonstrated, revealing successful switching of 10Gb/s data packets with BF-based forwarding information changes taking place at a time-scale that equals the duration of four consecutive packets.

A Hybrid CPU/GPU Pattern-Matching Algorithm for Deep Packet Inspection

PubMed Central

Chen, Yaw-Chung

2015-01-01

The large quantities of data now being transferred via high-speed networks have made deep packet inspection indispensable for security purposes. Scalable and low-cost signature-based network intrusion detection systems have been developed for deep packet inspection for various software platforms. Traditional approaches that only involve central processing units (CPUs) are now considered inadequate in terms of inspection speed. Graphic processing units (GPUs) have superior parallel processing power, but transmission bottlenecks can reduce optimal GPU efficiency. In this paper we describe our proposal for a hybrid CPU/GPU pattern-matching algorithm (HPMA) that divides and distributes the packet-inspecting workload between a CPU and GPU. All packets are initially inspected by the CPU and filtered using a simple pre-filtering algorithm, and packets that might contain malicious content are sent to the GPU for further inspection. Test results indicate that in terms of random payload traffic, the matching speed of our proposed algorithm was 3.4 times and 2.7 times faster than those of the AC-CPU and AC-GPU algorithms, respectively. Further, HPMA achieved higher energy efficiency than the other tested algorithms. PMID:26437335

A Hybrid CPU/GPU Pattern-Matching Algorithm for Deep Packet Inspection.

PubMed

Lee, Chun-Liang; Lin, Yi-Shan; Chen, Yaw-Chung

2015-01-01

The large quantities of data now being transferred via high-speed networks have made deep packet inspection indispensable for security purposes. Scalable and low-cost signature-based network intrusion detection systems have been developed for deep packet inspection for various software platforms. Traditional approaches that only involve central processing units (CPUs) are now considered inadequate in terms of inspection speed. Graphic processing units (GPUs) have superior parallel processing power, but transmission bottlenecks can reduce optimal GPU efficiency. In this paper we describe our proposal for a hybrid CPU/GPU pattern-matching algorithm (HPMA) that divides and distributes the packet-inspecting workload between a CPU and GPU. All packets are initially inspected by the CPU and filtered using a simple pre-filtering algorithm, and packets that might contain malicious content are sent to the GPU for further inspection. Test results indicate that in terms of random payload traffic, the matching speed of our proposed algorithm was 3.4 times and 2.7 times faster than those of the AC-CPU and AC-GPU algorithms, respectively. Further, HPMA achieved higher energy efficiency than the other tested algorithms.

A packet switched communications system for GRO

NASA Astrophysics Data System (ADS)

Husain, Shabu; Yang, Wen-Hsing; Vadlamudi, Rani; Valenti, Joseph

1993-11-01

This paper describes the packet switched Instrumenters Communication System (ICS) that was developed for the Command Management Facility at GSFC to support the Gamma Ray Observatory (GRO) spacecraft. The GRO ICS serves as a vital science data acquisition link to the GRO scientists to initiate commands for their spacecraft instruments. The system is ready to send and receive messages at any time, 24 hours a day and seven days a week. The system is based on X.25 and the International Standard Organization's (ISO) 7-layer Open Systems Interconnection (OSI) protocol model and has client and server components. The components of the GRO ICS are discussed along with how the Communications Subsystem for Interconnection (CSFI) and Network Control Program Packet Switching Interface (NPSI) software are used in the system.

Distributed parallel messaging for multiprocessor systems

DOEpatents

Chen, Dong; Heidelberger, Philip; Salapura, Valentina; Senger, Robert M; Steinmacher-Burrow, Burhard; Sugawara, Yutaka

2013-06-04

A method and apparatus for distributed parallel messaging in a parallel computing system. The apparatus includes, at each node of a multiprocessor network, multiple injection messaging engine units and reception messaging engine units, each implementing a DMA engine and each supporting both multiple packet injection into and multiple reception from a network, in parallel. The reception side of the messaging unit (MU) includes a switch interface enabling writing of data of a packet received from the network to the memory system. The transmission side of the messaging unit, includes switch interface for reading from the memory system when injecting packets into the network.

Models for IP/MPLS routing performance: convergence, fast reroute, and QoS impact

NASA Astrophysics Data System (ADS)

Choudhury, Gagan L.

2004-09-01

We show how to model the black-holing and looping of traffic during an Interior Gateway Protocol (IGP) convergence event at an IP network and how to significantly improve both the convergence time and packet loss duration through IGP parameter tuning and algorithmic improvement. We also explore some congestion avoidance and congestion control algorithms that can significantly improve stability of networks in the face of occasional massive control message storms. Specifically we show the positive impacts of prioritizing Hello and Acknowledgement packets and slowing down LSA generation and retransmission generation on detecting congestion in the network. For some types of video, voice signaling and circuit emulation applications it is necessary to reduce traffic loss durations following a convergence event to below 100 ms and we explore that using Fast Reroute algorithms based on Multiprotocol Label Switching Traffic Engineering (MPLS-TE) that effectively bypasses IGP convergence. We explore the scalability of primary and backup MPLS-TE tunnels where MPLS-TE domain is in the backbone-only or edge-to-edge. We also show how much extra backbone resource is needed to support Fast Reroute and how can that be reduced by taking advantage of Constrained Shortest Path (CSPF) routing of MPLS-TE and by reserving less than 100% of primary tunnel bandwidth during Fast Reroute.

Novel flat datacenter network architecture based on scalable and flow-controlled optical switch system.

PubMed

Miao, Wang; Luo, Jun; Di Lucente, Stefano; Dorren, Harm; Calabretta, Nicola

2014-02-10

We propose and demonstrate an optical flat datacenter network based on scalable optical switch system with optical flow control. Modular structure with distributed control results in port-count independent optical switch reconfiguration time. RF tone in-band labeling technique allowing parallel processing of the label bits ensures the low latency operation regardless of the switch port-count. Hardware flow control is conducted at optical level by re-using the label wavelength without occupying extra bandwidth, space, and network resources which further improves the performance of latency within a simple structure. Dynamic switching including multicasting operation is validated for a 4 x 4 system. Error free operation of 40 Gb/s data packets has been achieved with only 1 dB penalty. The system could handle an input load up to 0.5 providing a packet loss lower that 10(-5) and an average latency less that 500 ns when a buffer size of 16 packets is employed. Investigation on scalability also indicates that the proposed system could potentially scale up to large port count with limited power penalty.

Destination directed packet switch architecture for a 30/20 GHz FDMA/TDM geostationary communication satellite network

NASA Technical Reports Server (NTRS)

Ivancic, William D.; Shalkhauser, Mary JO

1991-01-01

Emphasis is on a destination directed packet switching architecture for a 30/20 GHz frequency division multiplex access/time division multiplex (FDMA/TDM) geostationary satellite communication network. Critical subsystems and problem areas are identified and addressed. Efforts have concentrated heavily on the space segment; however, the ground segment was considered concurrently to ensure cost efficiency and realistic operational constraints.

25-Gbit/s burst-mode optical receiver using high-speed avalanche photodiode for 100-Gbit/s optical packet switching.

PubMed

Nada, Masahiro; Nakamura, Makoto; Matsuzaki, Hideaki

2014-01-13

25-Gbit/s error-free operation of an optical receiver is successfully demonstrated against burst-mode optical input signals without preambles. The receiver, with a high-sensitivity avalanche photodiode and burst-mode transimpedance amplifier, exhibits sufficient receiver sensitivity and an extremely quick response suitable for burst-mode operation in 100-Gbit/s optical packet switching.

Destination-directed, packet-switching architecture for 30/20-GHz FDMA/TDM geostationary communications satellite network

NASA Technical Reports Server (NTRS)

Ivancic, William D.; Shalkhauser, Mary JO

1992-01-01

A destination-directed packet switching architecture for a 30/20-GHz frequency division multiple access/time division multiplexed (FDMA/TDM) geostationary satellite communications network is discussed. Critical subsystems and problem areas are identified and addressed. Efforts have concentrated heavily on the space segment; however, the ground segment has been considered concurrently to ensure cost efficiency and realistic operational constraints.

A robust coding scheme for packet video

NASA Technical Reports Server (NTRS)

Chen, Y. C.; Sayood, Khalid; Nelson, D. J.

1991-01-01

We present a layered packet video coding algorithm based on a progressive transmission scheme. The algorithm provides good compression and can handle significant packet loss with graceful degradation in the reconstruction sequence. Simulation results for various conditions are presented.

A robust coding scheme for packet video

NASA Technical Reports Server (NTRS)

Chen, Yun-Chung; Sayood, Khalid; Nelson, Don J.

1992-01-01

A layered packet video coding algorithm based on a progressive transmission scheme is presented. The algorithm provides good compression and can handle significant packet loss with graceful degradation in the reconstruction sequence. Simulation results for various conditions are presented.

On-board closed-loop congestion control for satellite based packet switching networks

NASA Technical Reports Server (NTRS)

Chu, Pong P.; Ivancic, William D.; Kim, Heechul

1993-01-01

NASA LeRC is currently investigating a satellite architecture that incorporates on-board packet switching capability. Because of the statistical nature of packet switching, arrival traffic may fluctuate and thus it is necessary to integrate congestion control mechanism as part of the on-board processing unit. This study focuses on the closed-loop reactive control. We investigate the impact of the long propagation delay on the performance and propose a scheme to overcome the problem. The scheme uses a global feedback signal to regulate the packet arrival rate of ground stations. In this scheme, the satellite continuously broadcasts the status of its output buffer and the ground stations respond by selectively discarding packets or by tagging the excessive packets as low-priority. The two schemes are evaluated by theoretical queuing analysis and simulation. The former is used to analyze the simplified model and to determine the basic trends and bounds, and the later is used to assess the performance of a more realistic system and to evaluate the effectiveness of more sophisticated control schemes. The results show that the long propagation delay makes the closed-loop congestion control less responsive. The broadcasted information can only be used to extract statistical information. The discarding scheme needs carefully-chosen status information and reduction function, and normally requires a significant amount of ground discarding to reduce the on-board packet loss probability. The tagging scheme is more effective since it tolerates more uncertainties and allows a larger margin of error in status information. It can protect the high-priority packets from excessive loss and fully utilize the downlink bandwidth at the same time.

A robust low-rate coding scheme for packet video

NASA Technical Reports Server (NTRS)

Chen, Y. C.; Sayood, Khalid; Nelson, D. J.; Arikan, E. (Editor)

1991-01-01

Due to the rapidly evolving field of image processing and networking, video information promises to be an important part of telecommunication systems. Although up to now video transmission has been transported mainly over circuit-switched networks, it is likely that packet-switched networks will dominate the communication world in the near future. Asynchronous transfer mode (ATM) techniques in broadband-ISDN can provide a flexible, independent and high performance environment for video communication. For this paper, the network simulator was used only as a channel in this simulation. Mixture blocking coding with progressive transmission (MBCPT) has been investigated for use over packet networks and has been found to provide high compression rate with good visual performance, robustness to packet loss, tractable integration with network mechanics and simplicity in parallel implementation.

Silicon-Germanium Fast Packet Switch Developed for Communications Satellites

NASA Technical Reports Server (NTRS)

Quintana, Jorge A.

1999-01-01

Emerging multimedia applications and future satellite systems will require high-speed switching networks to accommodate high data-rate traffic among thousands of potential users. This will require advanced switching devices to enable communication between satellites. The NASA Lewis Research Center has been working closely with industry to develop a state-of-the-art fast packet switch (FPS) to fulfill this requirement. Recently, the Satellite Industry Task Force identified the need for high-capacity onboard processing switching components as one of the "grand challenges" for the satellite industry in the 21st century. In response to this challenge, future generations of onboard processing satellites will require low power and low mass components to enable transmission of services in the 100 gigabit (1011 bits) per second (Gbps) range.

Graphics processing unit-assisted lossless decompression

DOEpatents

Loughry, Thomas A.

2016-04-12

Systems and methods for decompressing compressed data that has been compressed by way of a lossless compression algorithm are described herein. In a general embodiment, a graphics processing unit (GPU) is programmed to receive compressed data packets and decompress such packets in parallel. The compressed data packets are compressed representations of an image, and the lossless compression algorithm is a Rice compression algorithm.

47 CFR 32.2212 - Digital electronic switching.

Code of Federal Regulations, 2012 CFR

2012-10-01

... shall include the original cost of digital electronic switching equipment used to provide circuit... electronic switching equipment used to provide both circuit and packet switching shall be recorded in the... 47 Telecommunication 2 2012-10-01 2012-10-01 false Digital electronic switching. 32.2212 Section...

47 CFR 32.2212 - Digital electronic switching.

Code of Federal Regulations, 2014 CFR

2014-10-01

... shall include the original cost of digital electronic switching equipment used to provide circuit... electronic switching equipment used to provide both circuit and packet switching shall be recorded in the... 47 Telecommunication 2 2014-10-01 2014-10-01 false Digital electronic switching. 32.2212 Section...

47 CFR 32.2212 - Digital electronic switching.

Code of Federal Regulations, 2011 CFR

2011-10-01

... shall include the original cost of digital electronic switching equipment used to provide circuit... electronic switching equipment used to provide both circuit and packet switching shall be recorded in the... 47 Telecommunication 2 2011-10-01 2011-10-01 false Digital electronic switching. 32.2212 Section...

47 CFR 32.2212 - Digital electronic switching.

Code of Federal Regulations, 2010 CFR

2010-10-01

... shall include the original cost of digital electronic switching equipment used to provide circuit... electronic switching equipment used to provide both circuit and packet switching shall be recorded in the... 47 Telecommunication 2 2010-10-01 2010-10-01 false Digital electronic switching. 32.2212 Section...

47 CFR 32.2212 - Digital electronic switching.

Code of Federal Regulations, 2013 CFR

2013-10-01

... shall include the original cost of digital electronic switching equipment used to provide circuit... electronic switching equipment used to provide both circuit and packet switching shall be recorded in the... 47 Telecommunication 2 2013-10-01 2013-10-01 false Digital electronic switching. 32.2212 Section...

Sliding mode stabilisation of networked systems with consecutive data packet dropouts using only accessible information

NASA Astrophysics Data System (ADS)

Argha, Ahmadreza; Li, Li; W. Su, Steven

2017-04-01

This paper develops a novel stabilising sliding mode for systems involving uncertainties as well as measurement data packet dropouts. In contrast to the existing literature that designs the switching function by using unavailable system states, a novel linear sliding function is constructed by employing only the available communicated system states for the systems involving measurement packet losses. This also equips us with the possibility to build a novel switching component for discrete-time sliding mode control (DSMC) by using only available system states. Finally, using a numerical example, we evaluate the performance of the designed DSMC for networked systems.

Enhancing In-Flight Transoceanic Communications Using Swift-64 Packet Mode Service

NASA Technical Reports Server (NTRS)

Slywczak, Richard A.

2004-01-01

Current aeronautical communications can be divided into two segments. The first provides state of the art, packet switched technology to the cabin passengers so that they have access to e-mail and web services. The second provides basic circuit switch communication technology to the cockpit, which does not use bandwidth as efficiently as packet switching nor promotes resource sharing. This paper explores the research efforts currently being conducted by the NASA/Glenn Research Center (GRC) for transoceanic communications. The goal is to bring packet mode services to both the cabin and the cockpit of the aircraft and be able to attain benefits by sharing the data link with cabin services. First, this paper will outline the goals of the program and detail the benefits and issues related to this research. We will explain our current laboratory setup and show an architecture implemented in the testbed. Finally, we will present a work plan that will show the progression of research over the next year. This plan will describe a complete cycle from conceptual design and laboratory implementation to the final flight testing.

Numerical and experimental study of a high port-density WDM optical packet switch architecture for data centers.

PubMed

Di Lucente, S; Luo, J; Centelles, R Pueyo; Rohit, A; Zou, S; Williams, K A; Dorren, H J S; Calabretta, N

2013-01-14

Data centers have to sustain the rapid growth of data traffic due to the increasing demand of bandwidth-hungry internet services. The current intra-data center fat tree topology causes communication bottlenecks in the server interaction process, power-hungry O-E-O conversions that limit the minimum latency and the power efficiency of these systems. In this paper we numerically and experimentally investigate an optical packet switch architecture with modular structure and highly distributed control that allow configuration times in the order of nanoseconds. Numerical results indicate that the candidate architecture scaled over 4000 ports, provides an overall throughput over 50 Tb/s and a packet loss rate below 10(-6) while assuring sub-microsecond latency. We present experimental results that demonstrate the feasibility of a 16x16 optical packet switch based on parallel 1x4 integrated optical cross-connect modules. Error-free operations can be achieved with 4 dB penalty while the overall energy consumption is of 66 pJ/b. Based on those results, we discuss feasibility to scale the architecture to a much larger port count.

Unified study of Quality of Service (QoS) in OPS/OBS networks

NASA Astrophysics Data System (ADS)

Hailu, Dawit Hadush; Lema, Gebrehiwet Gebrekrstos; Yekun, Ephrem Admasu; Kebede, Samrawit Haylu

2017-07-01

With the growth of Internet traffic, an inevitable use of optical networks provide a large bandwidth, fast data transmission rates and Quality of Service (QoS) support. Currently, Optical Burst Switched (OBS)/Optical Packet Switched (OPS) networks are under study as future solutions for addressing the increase demand of Internet traffic. However, due to their high blocking probability in the intermediate nodes they have been delayed in the industries. Packet loss in OBS/OPS networks is mainly occur due to contention. Hence, the contribution of this study is to analyze the file loss ratio (FLR), packet overhead and number of disjoint paths, and processing delay over Coded Packet Transport (CPT) scheme for OBS/OPS network using simulation. The simulations show that CPT scheme reduces the FLR in OBS/OPS network for the evaluated scenarios since the data packets are chopped off into blocks of the data packet for transmission over a network. Simulation results for secrecy and survivability are verified with the help of the analytical model to define the operational range of CPT scheme.

Satellite networks in the ISDN era

NASA Astrophysics Data System (ADS)

Amadesi, P.; Haines, P.; Patacchini, A.

1986-12-01

The development of an integrated service digital network (ISDN) capable of supporting a wide range of services using a small set of standard multipurpose user-network interfaces is examined. The ISDN environment is expected to consist of functional elements such as, circuit switching, packet switching, and common channel signaling. The use of satellites or fiber optics in the ISDN is evaluated. The relation between satellites and the ISDN in the short-, medium-, and long-terms is analyzed. The recommendations of the consultative committee, CCIR, concerning the definition of the hypothetical reference digital path and the required quality and availability for ISDN applications, and the proposed plans of Eutelsat and Intelsat for satellite systems compatible with an ISDN are discussed. The application of business satellite networks and packet satellite networks to an ISDN is studied. The long-term objectives for an ISDN is a wideband system that accommodates digital transmission on circuit and packet switched bases.

An End-to-End Loss Discrimination Scheme for Multimedia Transmission over Wireless IP Networks

NASA Astrophysics Data System (ADS)

Zhao, Hai-Tao; Dong, Yu-Ning; Li, Yang

As the rapid growth of wireless IP networks, wireless IP access networks have a lot of potential applications in a variety of fields in civilian and military environments. Many of these applications, such as realtime audio/video streaming, will require some form of end-to-end QoS assurance. In this paper, an algorithm WMPLD (Wireless Multimedia Packet Loss Discrimination) is proposed for multimedia transmission control over wired-wireless hybrid IP networks. The relationship between packet length and packet loss rate in the Gilbert wireless error model is investigated. Furthermore, the algorithm can detect the nature of packet losses by sending large and small packets alternately, and control the sending rate of nodes. In addition, by means of updating factor K, this algorithm can adapt to the changes of network states quickly. Simulation results show that, compared to previous algorithms, WMPLD algorithm can improve the networks throughput as well as reduce the congestion loss rate in various situations.

Next generation communications satellites: Multiple access and network studies

NASA Technical Reports Server (NTRS)

Stern, T. E.; Schwartz, M.; Meadows, H. E.; Ahmadi, H. K.; Gadre, J. G.; Gopal, I. S.; Matsmo, K.

1980-01-01

Following an overview of issues involved in the choice of promising system architectures for efficient communication with multiple small inexpensive Earth stations serving hetergeneous user populations, performance evaluation via analysis and simulation for six SS/TDMA (satellite-switched/time-division multiple access) system architectures is discussed. These configurations are chosen to exemplify the essential alternatives available in system design. Although the performance evaluation analyses are of fairly general applicability, whenever possible they are considered in the context of NASA's 30/20 GHz studies. Packet switched systems are considered, with the assumption that only a part of transponder capacit is devoted to packets, the integration of circuit and packet switched traffic being reserved for further study. Three types of station access are distinguished: fixed (FA), demand (DA), and random access (RA). Similarly, switching in the satellite can be assigned on a fixed (FS) or demand (DS) basis, or replaced by a buffered store-and-forward system (SF) onboard the satellite. Since not all access/switching combinations are practical, six systems are analyzed in detail: three FS SYSTEMS, FA/FS, DA/ES, RA/FS; one DS system, DA/DS; and two SF systems, FA/SF, DA/SF. Results are presented primarily in terms of delay-throughput characteristics.

High-performance flat data center network architecture based on scalable and flow-controlled optical switching system

NASA Astrophysics Data System (ADS)

Calabretta, Nicola; Miao, Wang; Dorren, Harm

2016-03-01

Traffic in data centers networks (DCNs) is steadily growing to support various applications and virtualization technologies. Multi-tenancy enabling efficient resource utilization is considered as a key requirement for the next generation DCs resulting from the growing demands for services and applications. Virtualization mechanisms and technologies can leverage statistical multiplexing and fast switch reconfiguration to further extend the DC efficiency and agility. We present a novel high performance flat DCN employing bufferless and distributed fast (sub-microsecond) optical switches with wavelength, space, and time switching operation. The fast optical switches can enhance the performance of the DCNs by providing large-capacity switching capability and efficiently sharing the data plane resources by exploiting statistical multiplexing. Benefiting from the Software-Defined Networking (SDN) control of the optical switches, virtual DCNs can be flexibly created and reconfigured by the DCN provider. Numerical and experimental investigations of the DCN based on the fast optical switches show the successful setup of virtual network slices for intra-data center interconnections. Experimental results to assess the DCN performance in terms of latency and packet loss show less than 10^-5 packet loss and 640ns end-to-end latency with 0.4 load and 16- packet size buffer. Numerical investigation on the performance of the systems when the port number of the optical switch is scaled to 32x32 system indicate that more than 1000 ToRs each with Terabit/s interface can be interconnected providing a Petabit/s capacity. The roadmap to photonic integration of large port optical switches will be also presented.

Call Admission Control on Single Node Networks under Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) Scheduler

NASA Astrophysics Data System (ADS)

Hanada, Masaki; Nakazato, Hidenori; Watanabe, Hitoshi

Multimedia applications such as music or video streaming, video teleconferencing and IP telephony are flourishing in packet-switched networks. Applications that generate such real-time data can have very diverse quality-of-service (QoS) requirements. In order to guarantee diverse QoS requirements, the combined use of a packet scheduling algorithm based on Generalized Processor Sharing (GPS) and leaky bucket traffic regulator is the most successful QoS mechanism. GPS can provide a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds for leaky bucket constrained sessions under GPS are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In order to solve this problem, a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) was proposed in [17]. ORC-GPS is a rate-based scheduling like GPS, and controls the service rate in order to lower the delay bounds for leaky bucket constrained sessions. In this paper, we propose a call admission control (CAC) algorithm for ORC-GPS, for leaky-bucket constrained sessions with deterministic delay requirements. This CAC algorithm for ORC-GPS determines the optimal values of parameters of ORC-GPS from the deterministic delay requirements of the sessions. In numerical experiments, we compare the CAC algorithm for ORC-GPS with one for GPS in terms of schedulable region and computational complexity.

Decoherence and surface hopping: When can averaging over initial conditions help capture the effects of wave packet separation?

NASA Astrophysics Data System (ADS)

Subotnik, Joseph E.; Shenvi, Neil

2011-06-01

Fewest-switches surface hopping (FSSH) is a popular nonadiabatic dynamics method which treats nuclei with classical mechanics and electrons with quantum mechanics. In order to simulate the motion of a wave packet as accurately as possible, standard FSSH requires a stochastic sampling of the trajectories over a distribution of initial conditions corresponding, e.g., to the Wigner distribution of the initial quantum wave packet. Although it is well-known that FSSH does not properly account for decoherence effects, there is some confusion in the literature about whether or not this averaging over a distribution of initial conditions can approximate some of the effects of decoherence. In this paper, we not only show that averaging over initial conditions does not generally account for decoherence, but also why it fails to do so. We also show how an apparent improvement in accuracy can be obtained for a fortuitous choice of model problems, even though this improvement is not possible, in general. For a basic set of one-dimensional and two-dimensional examples, we find significantly improved results using our recently introduced augmented FSSH algorithm.

A low-latency high-port count optical switch with optical delay line buffering for disaggregated data centers

NASA Astrophysics Data System (ADS)

Moralis-Pegios, M.; Terzenidis, N.; Mourgias-Alexandris, G.; Vyrsokinos, K.; Pleros, N.

2018-02-01

Disaggregated Data Centers (DCs) have emerged as a powerful architectural framework towards increasing resource utilization and system power efficiency, requiring, however, a networking infrastructure that can ensure low-latency and high-bandwidth connectivity between a high-number of interconnected nodes. This reality has been the driving force towards high-port count and low-latency optical switching platforms, with recent efforts concluding that the use of distributed control architectures as offered by Broadcast-and-Select (BS) layouts can lead to sub-μsec latencies. However, almost all high-port count optical switch designs proposed so far rely either on electronic buffering and associated SerDes circuitry for resolving contention or on buffer-less designs with packet drop and re-transmit procedures, unavoidably increasing latency or limiting throughput. In this article, we demonstrate a 256x256 optical switch architecture for disaggregated DCs that employs small-size optical delay line buffering in a distributed control scheme, exploiting FPGA-based header processing over a hybrid BS/Wavelength routing topology that is implemented by a 16x16 BS design and a 16x16 AWGR. Simulation-based performance analysis reveals that even the use of a 2- packet optical buffer can yield <620nsec latency with >85% throughput for up to 100% loads. The switch has been experimentally validated with 10Gb/s optical data packets using 1:16 optical splitting and a SOA-MZI wavelength converter (WC) along with fiber delay lines for the 2-packet buffer implementation at every BS outgoing port, followed by an additional SOA-MZI tunable WC and the 16x16 AWGR. Error-free performance in all different switch input/output combinations has been obtained with a power penalty of <2.5dB.

ATM encryption testing

NASA Astrophysics Data System (ADS)

Capell, Joyce; Deeth, David

1996-01-01

This paper describes why encryption was selected by Lockheed Martin Missiles & Space as the means for securing ATM networks. The ATM encryption testing program is part of an ATM network trial provided by Pacific Bell under the California Research Education Network (CalREN). The problem being addressed is the threat to data security which results when changing from a packet switched network infrastructure to a circuit switched ATM network backbone. As organizations move to high speed cell-based networks, there is a break down in the traditional security model which is designed to protect packet switched data networks from external attacks. This is due to the fact that most data security firewalls filter IP packets, restricting inbound and outbound protocols, e.g. ftp. ATM networks, based on cell-switching over virtual circuits, does not support this method for restricting access since the protocol information is not carried by each cell. ATM switches set up multiple virtual connections, thus there is no longer a single point of entry into the internal network. The problem is further complicated by the fact that ATM networks support high speed multi-media applications, including real time video and video teleconferencing which are incompatible with packet switched networks. The ability to restrict access to Lockheed Martin networks in support of both unclassified and classified communications is required before ATM network technology can be fully deployed. The Lockheed Martin CalREN ATM testbed provides the opportunity to test ATM encryption prototypes with actual applications to assess the viability of ATM encryption methodologies prior to installing large scale ATM networks. Two prototype ATM encryptors are being tested: (1) `MILKBUSH' a prototype encryptor developed by NSA for transmission of government classified data over ATM networks, and (2) a prototype ATM encryptor developed by Sandia National Labs in New Mexico, for the encryption of proprietary data.

Principle and verification of novel optical virtual private networks over multiprotocol label switching/optical packet switching networks

NASA Astrophysics Data System (ADS)

Zhang, Chongfu; Wang, Zhengsuan; Jin, Wei; Qiu, Kun

2012-11-01

A novel realization method of the optical virtual private networks (OVPN) over multiprotocol label switching/optical packet switching (MPLS/OPS) networks is proposed. In this scheme, the introduction of MPLS control plane makes OVPN over OPS networks more reliable and easier; OVPN makes use of the concept of high reconfiguration of light-paths offered by MPLS, to set up secure tunnels of high bandwidth across intelligent OPS networks. Through resource management, the signal mechanism, connection control, and the architecture of the creation and maintenance of OVPN are efficiently realized. We also present an OVPN architecture with two traffic priorities, which is used to analyze the capacity, throughput, delay time of the proposed networks, and the packet loss rate performance of the OVPN over MPLS/OPS networks based on full mesh topology. The results validate the applicability of such reliable connectivity to high quality services in the OVPN over MPLS/OPS networks. Along with the results, the feasibility of the approach as the basis for the next generation networks is demonstrated and discussed.

MMPP Traffic Generator for the Testing of the SCAR 2 Fast Packet Switch

NASA Technical Reports Server (NTRS)

Chren, William A., Jr.

1995-01-01

A prototype MWP Traffic Generator (TG) has been designed for testing of the COMSAT-supplied SCAR II Fast Packet Switch. By generating packets distributed according to a Markov-Modulated Poisson Process (MMPP) model. it allows the assessment of the switch performance under traffic conditions that are more realistic than could be generated using the COMSAT-supplied Traffic Generator Module. The MMPP model is widely believed to model accurately real-world superimposed voice and data communications traffic. The TG was designed to be as much as possible of a "drop-in" replacement for the COMSAT Traffic Generator Module. The latter fit on two Altera EPM7256EGC 192-pin CPLDs and produced traffic for one switch input port. No board changes are necessary because it has been partitioned to use the existing board traces. The TG, consisting of parts "TGDATPROC" and "TGRAMCTL" must merely be reprogrammed into the Altera devices of the same name. However, the 040 controller software must be modified to provide TG initialization data. This data will be given in Section II.

Future optical communication networks beyond 160 Gbit/s based on OTDM

NASA Astrophysics Data System (ADS)

Prati, Giancarlo; Bogoni, Antonella; Poti, Luca

2005-01-01

The virtually unlimited bandwidth of optical fibers has caused a great increase in data transmission speed over the past decade and, hence, stimulated high-demand multimedia services such as distance learning, video-conferencing and peer to peer applications. For this reason data traffic is exceeding telephony traffic, and this trend is driving the convergence of telecommunications and computer communications. In this scenario Internet Protocol (IP) is becoming the dominant protocol for any traffic, shifting the attention of the network designers from a circuit switching approach to a packet switching approach. A role of paramount importance in packet switching networks is played by the router that must implement the functionalities to set up and maintain the inter-nodal communications. The main functionalities a router must implement are routing, forwarding, switching, synchronization, contention resolution, and buffering. Nowadays, opto-electronic conversion is still required at each network node to process the incoming signal before routing that to the right output port. However, when the single channel bit rate increases beyond electronic speed limit, Optical Time Division Multiplexing (OTDM) becomes a forced choice, and all-optical processing must be performed to extract the information from the incoming packet. In this paper enabling techniques for ultra-fast all-optical network will be addressed. First a 160 Gbit/s complete transmission system will be considered. As enabling technique, an overview for all-optical logics will be discussed and experimental results will be presented using a particular reconfigurable NOLM based on Self-Phase-Modulation (SPM) or Cross-Phase-Modulation (XPM). Finally, a rough experiment on label extraction, all-optical switching and packet forwarding is shown.

Environmental Fluctuations and Acoustic Data Communications

DTIC Science & Technology

2015-09-30

July 2011 along with subsequent analysis of the experiment data. KAM11 Experiment (2011) A shallow water acoustic communications experiment...packet and packet-to-packet variability. Algorithm Design and Experiment Data Analysis Communication receiver algorithm design for shallow water is...exhibited substantial daily oceanographic variability. Analysis of the KAM11 experiment data this past year has focused on fixed source transmissions

Packet telemetry and packet telecommand - The new generation of spacecraft data handling techniques

NASA Technical Reports Server (NTRS)

Hooke, A. J.

1983-01-01

Because of rising costs and reduced reliability of spacecraft and ground network hardware and software customization, standardization Packet Telemetry and Packet Telecommand concepts are emerging as viable alternatives. Autonomous packets of data, within each concept, which are created within ground and space application processes through the use of formatting techniques, are switched end-to-end through the space data network to their destination application processes through the use of standard transfer protocols. This process may result in facilitating a high degree of automation and interoperability because of completely mission-independent-designed intermediate data networks. The adoption of an international guideline for future space telemetry formatting of the Packet Telemetry concept, and the advancement of the NASA-ESA Working Group's Packet Telecommand concept to a level of maturity parallel to the of Packet Telemetry are the goals of the Consultative Committee for Space Data Systems. Both the Packet Telemetry and Packet Telecommand concepts are reviewed.

Predictive onboard flow control for packet switching satellites

NASA Technical Reports Server (NTRS)

Bobinsky, Eric A.

1992-01-01

We outline two alternate approaches to predicting the onset of congestion in a packet switching satellite, and argue that predictive, rather than reactive, flow control is necessary for the efficient operation of such a system. The first method discussed is based on standard, statistical techniques which are used to periodically calculate a probability of near-term congestion based on arrival rate statistics. If this probability exceeds a present threshold, the satellite would transmit a rate-reduction signal to all active ground stations. The second method discussed would utilize a neural network to periodically predict the occurrence of buffer overflow based on input data which would include, in addition to arrival rates, the distributions of packet lengths, source addresses, and destination addresses.

Real-time video streaming using H.264 scalable video coding (SVC) in multihomed mobile networks: a testbed approach

NASA Astrophysics Data System (ADS)

Nightingale, James; Wang, Qi; Grecos, Christos

2011-03-01

Users of the next generation wireless paradigm known as multihomed mobile networks expect satisfactory quality of service (QoS) when accessing streamed multimedia content. The recent H.264 Scalable Video Coding (SVC) extension to the Advanced Video Coding standard (AVC), offers the facility to adapt real-time video streams in response to the dynamic conditions of multiple network paths encountered in multihomed wireless mobile networks. Nevertheless, preexisting streaming algorithms were mainly proposed for AVC delivery over multipath wired networks and were evaluated by software simulation. This paper introduces a practical, hardware-based testbed upon which we implement and evaluate real-time H.264 SVC streaming algorithms in a realistic multihomed wireless mobile networks environment. We propose an optimised streaming algorithm with multi-fold technical contributions. Firstly, we extended the AVC packet prioritisation schemes to reflect the three-dimensional granularity of SVC. Secondly, we designed a mechanism for evaluating the effects of different streamer 'read ahead window' sizes on real-time performance. Thirdly, we took account of the previously unconsidered path switching and mobile networks tunnelling overheads encountered in real-world deployments. Finally, we implemented a path condition monitoring and reporting scheme to facilitate the intelligent path switching. The proposed system has been experimentally shown to offer a significant improvement in PSNR of the received stream compared with representative existing algorithms.

SDN architecture for optical packet and circuit integrated networks

NASA Astrophysics Data System (ADS)

Furukawa, Hideaki; Miyazawa, Takaya

2016-02-01

We have been developing an optical packet and circuit integrated (OPCI) network, which realizes dynamic optical path, high-density packet multiplexing, and flexible wavelength resource allocation. In the OPCI networks, a best-effort service and a QoS-guaranteed service are provided by employing optical packet switching (OPS) and optical circuit switching (OCS) respectively, and users can select these services. Different wavelength resources are assigned for OPS and OCS links, and the amount of their wavelength resources are dynamically changed in accordance with the service usage conditions. To apply OPCI networks into wide-area (core/metro) networks, we have developed an OPCI node with a distributed control mechanism. Moreover, our OPCI node works with a centralized control mechanism as well as a distributed one. It is therefore possible to realize SDN-based OPCI networks, where resource requests and a centralized configuration are carried out. In this paper, we show our SDN architecture for an OPS system that configures mapping tables between IP addresses and optical packet addresses and switching tables according to the requests from multiple users via a web interface. While OpenFlow-based centralized control protocol is coming into widespread use especially for single-administrative, small-area (LAN/data-center) networks. Here, we also show an interworking mechanism between OpenFlow-based networks (OFNs) and the OPCI network for constructing a wide-area network, and a control method of wavelength resource selection to automatically transfer diversified flows from OFNs to the OPCI network.

ICC '86; Proceedings of the International Conference on Communications, Toronto, Canada, June 22-25, 1986, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

Papers are presented on ISDN, mobile radio systems and techniques for digital connectivity, centralized and distributed algorithms in computer networks, communications networks, quality assurance and impact on cost, adaptive filters in communications, the spread spectrum, signal processing, video communication techniques, and digital satellite services. Topics discussed include performance evaluation issues for integrated protocols, packet network operations, the computer network theory and multiple-access, microwave single sideband systems, switching architectures, fiber optic systems, wireless local communications, modulation, coding, and synchronization, remote switching, software quality, transmission, and expert systems in network operations. Consideration is given to wide area networks, image and speech processing, office communications application protocols, multimedia systems, customer-controlled network operations, digital radio systems, channel modeling and signal processing in digital communications, earth station/on-board modems, computer communications system performance evaluation, source encoding, compression, and quantization, and adaptive communications systems.

A novel all-optical label processing based on multiple optical orthogonal codes sequences for optical packet switching networks

NASA Astrophysics Data System (ADS)

Zhang, Chongfu; Qiu, Kun; Xu, Bo; Ling, Yun

2008-05-01

This paper proposes an all-optical label processing scheme that uses the multiple optical orthogonal codes sequences (MOOCS)-based optical label for optical packet switching (OPS) (MOOCS-OPS) networks. In this scheme, each MOOCS is a permutation or combination of the multiple optical orthogonal codes (MOOC) selected from the multiple-groups optical orthogonal codes (MGOOC). Following a comparison of different optical label processing (OLP) schemes, the principles of MOOCS-OPS network are given and analyzed. Firstly, theoretical analyses are used to prove that MOOCS is able to greatly enlarge the number of available optical labels when compared to the previous single optical orthogonal code (SOOC) for OPS (SOOC-OPS) network. Then, the key units of the MOOCS-based optical label packets, including optical packet generation, optical label erasing, optical label extraction and optical label rewriting etc., are given and studied. These results are used to verify that the proposed MOOCS-OPS scheme is feasible.

Optimal design of mixed-media packet-switching networks - Routing and capacity assignment

NASA Technical Reports Server (NTRS)

Huynh, D.; Kuo, F. F.; Kobayashi, H.

1977-01-01

This paper considers a mixed-media packet-switched computer communication network which consists of a low-delay terrestrial store-and-forward subnet combined with a low-cost high-bandwidth satellite subnet. We show how to route traffic via ground and/or satellite links by means of static, deterministic procedures and assign capacities to channels subject to a given linear cost such that the network average delay is minimized. Two operational schemes for this network model are investigated: one is a scheme in which the satellite channel is used as a slotted ALOHA channel; the other is a new multiaccess scheme we propose in which whenever a channel collision occurs, retransmission of the involved packets will route through ground links to their destinations. The performance of both schemes is evaluated and compared in terms of cost and average packet delay tradeoffs for some examples. The results offer guidelines for the design and optimal utilization of mixed-media networks.

PAD_AUDIT -- PAD Auditing Package

NASA Astrophysics Data System (ADS)

Clayton, C. A.

The PAD (Packet Assembler Disassembler) utility is the part of the VAX/VMS Coloured Book Software (CBS) which allows a user to log onto remote computers from a local VAX. Unfortunately, logging into a computer via either the Packet SwitchStream (PSS) or the International Packet SwitchStream (IPSS) costs real money. Some users either do not appreciate this or do not care and have been known to clock up rather large quarterly bills. This software package allows a system manager to determine who has used PAD to call where and (most importantly) how much it has cost. The system manager can then take appropriate action - either charging the individuals, warning them to use the facility with more care or even denying access to a greedy user to one or more sites.

Implementation issues in source coding

NASA Technical Reports Server (NTRS)

Sayood, Khalid; Chen, Yun-Chung; Hadenfeldt, A. C.

1989-01-01

An edge preserving image coding scheme which can be operated in both a lossy and a lossless manner was developed. The technique is an extension of the lossless encoding algorithm developed for the Mars observer spectral data. It can also be viewed as a modification of the DPCM algorithm. A packet video simulator was also developed from an existing modified packet network simulator. The coding scheme for this system is a modification of the mixture block coding (MBC) scheme described in the last report. Coding algorithms for packet video were also investigated.

Capture and playback synchronization in video conferencing

NASA Astrophysics Data System (ADS)

Shae, Zon-Yin; Chang, Pao-Chi; Chen, Mon-Song

1995-03-01

Packet-switching based video conferencing has emerged as one of the most important multimedia applications. Lip synchronization can be disrupted in the packet network as the result of the network properties: packet delay jitters at the capture end, network delay jitters, packet loss, packet arrived out of sequence, local clock mismatch, and video playback overlay with the graphic system. The synchronization problem become more demanding as the real time and multiparty requirement of the video conferencing application. Some of the above mentioned problem can be solved in the more advanced network architecture as ATM having promised. This paper will present some of the solutions to the problems that can be useful at the end station terminals in the massively deployed packet switching network today. The playback scheme in the end station will consist of two units: compression domain buffer management unit and the pixel domain buffer management unit. The pixel domain buffer management unit is responsible for removing the annoying frame shearing effect in the display. The compression domain buffer management unit is responsible for parsing the incoming packets for identifying the complete data blocks in the compressed data stream which can be decoded independently. The compression domain buffer management unit is also responsible for concealing the effects of clock mismatch, lip synchronization, and packet loss, out of sequence, and network jitters. This scheme can also be applied to the multiparty teleconferencing environment. Some of the schemes presented in this paper have been implemented in the Multiparty Multimedia Teleconferencing (MMT) system prototype at the IBM watson research center.

7 CFR 1770.15 - Supplementary accounts required of all borrowers.

Code of Federal Regulations, 2012 CFR

2012-01-01

... Switching—Circuit. 2212.2 2212.2 Digital Electronic Switching—Packet. 2230.11 Central Office Transmission... Retirement Work in Progress. Current Liabilities 2232.1 2232.1 Circuit Equipment—Electronic. 2232.2 2232.2... Expense—Circuit. 6212.2 6212.2 Digital Electronic Switching Expense—Packet. 6230.11 Radio Systems Expense...

7 CFR 1770.15 - Supplementary accounts required of all borrowers.

Code of Federal Regulations, 2014 CFR

2014-01-01

... Switching—Circuit. 2212.2 2212.2 Digital Electronic Switching—Packet. 2230.11 Central Office Transmission... Retirement Work in Progress. Current Liabilities 2232.1 2232.1 Circuit Equipment—Electronic. 2232.2 2232.2... Expense—Circuit. 6212.2 6212.2 Digital Electronic Switching Expense—Packet. 6230.11 Radio Systems Expense...

7 CFR 1770.15 - Supplementary accounts required of all borrowers.

Code of Federal Regulations, 2011 CFR

2011-01-01

... Switching—Circuit. 2212.2 2212.2 Digital Electronic Switching—Packet. 2230.11 Central Office Transmission... Retirement Work in Progress. Current Liabilities 2232.1 2232.1 Circuit Equipment—Electronic. 2232.2 2232.2... Expense—Circuit. 6212.2 6212.2 Digital Electronic Switching Expense—Packet. 6230.11 Radio Systems Expense...

Packets Distributing Evolutionary Algorithm Based on PSO for Ad Hoc Network

NASA Astrophysics Data System (ADS)

Xu, Xiao-Feng

2018-03-01

Wireless communication network has such features as limited bandwidth, changeful channel and dynamic topology, etc. Ad hoc network has lots of difficulties in accessing control, bandwidth distribution, resource assign and congestion control. Therefore, a wireless packets distributing Evolutionary algorithm based on PSO (DPSO)for Ad Hoc Network is proposed. Firstly, parameters impact on performance of network are analyzed and researched to obtain network performance effective function. Secondly, the improved PSO Evolutionary Algorithm is used to solve the optimization problem from local to global in the process of network packets distributing. The simulation results show that the algorithm can ensure fairness and timeliness of network transmission, as well as improve ad hoc network resource integrated utilization efficiency.

A scheme for synchronizing clocks connected by a packet communication network

NASA Astrophysics Data System (ADS)

dos Santos, R. V.; Monteiro, L. H. A.

2012-07-01

Consider a communication system in which a transmitter equipment sends fixed-size packets of data at a uniform rate to a receiver equipment. Consider also that these equipments are connected by a packet-switched network, which introduces a random delay to each packet. Here we propose an adaptive clock recovery scheme able of synchronizing the frequencies and the phases of these devices, within specified limits of precision. This scheme for achieving frequency and phase synchronization is based on measurements of the packet arrival times at the receiver, which are used to control the dynamics of a digital phase-locked loop. The scheme performance is evaluated via numerical simulations performed by using realistic parameter values.

Destination-directed, packet-switched architecture for a geostationary communications satellite network

NASA Technical Reports Server (NTRS)

Ivancic, William D.; Shalkhauser, Mary JO; Bobinsky, Eric A.; Soni, Nitin J.; Quintana, Jorge A.; Kim, Heechul; Wager, Paul; Vanderaar, Mark

1993-01-01

A major goal of the Digital Systems Technology Branch at the NASA Lewis Research Center is to identify and develop critical digital components and technologies that either enable new commercial missions or significantly enhance the performance, cost efficiency, and/or reliability of existing and planned space communications systems. NASA envisions a need for low-data-rate, interactive, direct-to-the-user communications services for data, voice, facsimile, and video conferencing. The network would provide enhanced very-small-aperture terminal (VSAT) communications services and be capable of handling data rates of 64 kbps through 2.048 Mbps in 64-kbps increments. Efforts have concentrated heavily on the space segment; however, the ground segment has been considered concurrently to ensure cost efficiency and realistic operational constraints. The focus of current space segment developments is a flexible, high-throughput, fault-tolerant onboard information-switching processor (ISP) for a geostationary satellite communications network. The Digital Systems Technology Branch is investigating both circuit and packet architectures for the ISP. Destination-directed, packet-switched architectures for geostationary communications satellites are addressed.

Lambda network having 2.sup.m-1 nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

DOEpatents

Napolitano, Jr., Leonard M.

1995-01-01

The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Dong; Heidelberger, Philip; Sugawara, Yutaka

An apparatus and method for extending the scalability and improving the partitionability of networks that contain all-to-all links for transporting packet traffic from a source endpoint to a destination endpoint with low per-endpoint (per-server) cost and a small number of hops. An all-to-all wiring in the baseline topology is decomposed into smaller all-to-all components in which each smaller all-to-all connection is replaced with star topology by using global switches. Stacking multiple copies of the star topology baseline network creates a multi-planed switching topology for transporting packet traffic. Point-to-point unified stacking method using global switch wiring methods connects multiple planes ofmore » a baseline topology by using the global switches to create a large network size with a low number of hops, i.e., low network latency. Grouped unified stacking method increases the scalability (network size) of a stacked topology.« less

Sampled-Data Consensus of Linear Multi-agent Systems With Packet Losses.

PubMed

Zhang, Wenbing; Tang, Yang; Huang, Tingwen; Kurths, Jurgen

In this paper, the consensus problem is studied for a class of multi-agent systems with sampled data and packet losses, where random and deterministic packet losses are considered, respectively. For random packet losses, a Bernoulli-distributed white sequence is used to describe packet dropouts among agents in a stochastic way. For deterministic packet losses, a switched system with stable and unstable subsystems is employed to model packet dropouts in a deterministic way. The purpose of this paper is to derive consensus criteria, such that linear multi-agent systems with sampled-data and packet losses can reach consensus. By means of the Lyapunov function approach and the decomposition method, the design problem of a distributed controller is solved in terms of convex optimization. The interplay among the allowable bound of the sampling interval, the probability of random packet losses, and the rate of deterministic packet losses are explicitly derived to characterize consensus conditions. The obtained criteria are closely related to the maximum eigenvalue of the Laplacian matrix versus the second minimum eigenvalue of the Laplacian matrix, which reveals the intrinsic effect of communication topologies on consensus performance. Finally, simulations are given to show the effectiveness of the proposed results.In this paper, the consensus problem is studied for a class of multi-agent systems with sampled data and packet losses, where random and deterministic packet losses are considered, respectively. For random packet losses, a Bernoulli-distributed white sequence is used to describe packet dropouts among agents in a stochastic way. For deterministic packet losses, a switched system with stable and unstable subsystems is employed to model packet dropouts in a deterministic way. The purpose of this paper is to derive consensus criteria, such that linear multi-agent systems with sampled-data and packet losses can reach consensus. By means of the Lyapunov function approach and the decomposition method, the design problem of a distributed controller is solved in terms of convex optimization. The interplay among the allowable bound of the sampling interval, the probability of random packet losses, and the rate of deterministic packet losses are explicitly derived to characterize consensus conditions. The obtained criteria are closely related to the maximum eigenvalue of the Laplacian matrix versus the second minimum eigenvalue of the Laplacian matrix, which reveals the intrinsic effect of communication topologies on consensus performance. Finally, simulations are given to show the effectiveness of the proposed results.

Packet-aware transport for video distribution [Invited

NASA Astrophysics Data System (ADS)

Aguirre-Torres, Luis; Rosenfeld, Gady; Bruckman, Leon; O'Connor, Mannix

2006-05-01

We describe a solution based on resilient packet rings (RPR) for the distribution of broadcast video and video-on-demand (VoD) content over a packet-aware transport network. The proposed solution is based on our experience in the design and deployment of nationwide Triple Play networks and relies on technologies such as RPR, multiprotocol label switching (MPLS), and virtual private LAN service (VPLS) to provide the most efficient solution in terms of utilization, scalability, and availability.

A Rate-Based Congestion Control Algorithm for the SURAP 4 Packet Radio Architecture (SRNTN-72)

DTIC Science & Technology

1990-01-01

factor, one packet. as at connection initialization. However. these TCP enhancements do not solve the fairness problem. The slow start algorithm ma...and signal interference (including lamming) and by the delavs demanded b% the hink -layer protocols in the absence of contention for resources at the...values. This role would be redundant if bits-per-second rations used measurements of packet duration to determine how fast to decrease, at the expense of

Detecting Anomalies in Process Control Networks

NASA Astrophysics Data System (ADS)

Rrushi, Julian; Kang, Kyoung-Don

This paper presents the estimation-inspection algorithm, a statistical algorithm for anomaly detection in process control networks. The algorithm determines if the payload of a network packet that is about to be processed by a control system is normal or abnormal based on the effect that the packet will have on a variable stored in control system memory. The estimation part of the algorithm uses logistic regression integrated with maximum likelihood estimation in an inductive machine learning process to estimate a series of statistical parameters; these parameters are used in conjunction with logistic regression formulas to form a probability mass function for each variable stored in control system memory. The inspection part of the algorithm uses the probability mass functions to estimate the normalcy probability of a specific value that a network packet writes to a variable. Experimental results demonstrate that the algorithm is very effective at detecting anomalies in process control networks.

Greedy data transportation scheme with hard packet deadlines for wireless ad hoc networks.

PubMed

Lee, HyungJune

2014-01-01

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

PubMed Central

Lee, HyungJune

2014-01-01

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services. PMID:25258736

Final report for the Multiprotocol Label Switching (MPLS) control plane security LDRD project.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Torgerson, Mark Dolan; Michalski, John T.; Tarman, Thomas David

2003-09-01

As rapid Internet growth continues, global communications becomes more dependent on Internet availability for information transfer. Recently, the Internet Engineering Task Force (IETF) introduced a new protocol, Multiple Protocol Label Switching (MPLS), to provide high-performance data flows within the Internet. MPLS emulates two major aspects of the Asynchronous Transfer Mode (ATM) technology. First, each initial IP packet is 'routed' to its destination based on previously known delay and congestion avoidance mechanisms. This allows for effective distribution of network resources and reduces the probability of congestion. Second, after route selection each subsequent packet is assigned a label at each hop, whichmore » determines the output port for the packet to reach its final destination. These labels guide the forwarding of each packet at routing nodes more efficiently and with more control than traditional IP forwarding (based on complete address information in each packet) for high-performance data flows. Label assignment is critical in the prompt and accurate delivery of user data. However, the protocols for label distribution were not adequately secured. Thus, if an adversary compromises a node by intercepting and modifying, or more simply injecting false labels into the packet-forwarding engine, the propagation of improperly labeled data flows could create instability in the entire network. In addition, some Virtual Private Network (VPN) solutions take advantage of this 'virtual channel' configuration to eliminate the need for user data encryption to provide privacy. VPN's relying on MPLS require accurate label assignment to maintain user data protection. This research developed a working distributive trust model that demonstrated how to deploy confidentiality, authentication, and non-repudiation in the global network label switching control plane. Simulation models and laboratory testbed implementations that demonstrated this concept were developed, and results from this research were transferred to industry via standards in the Optical Internetworking Forum (OIF).« less

Lambda network having 2{sup m{minus}1} nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

DOEpatents

Napolitano, L.M. Jr.

1995-11-28

The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance. 14 figs.

Scalable, high-capacity optical switches for Internet routers and moving platforms

NASA Astrophysics Data System (ADS)

Joe, In-Sung

Internet traffic nearly doubles every year, and we need faster routers with higher ports count, yet lower electrical power consumption. Current internet routers use electrical switches that consume large amounts of electrical power to operate at high data rates. These internet routers dissipate ˜ 10kW per rack, and their capacity is limited by cooling constraints. The power consumption is also critical for moving platforms. As avionics advance, the demand for larger capacity networks increases. Optical fibers are already chosen for high speed data transmission in advanced aircraft. In optical communication systems, integrated passive optical components, such as Array Waveguide Gratings (AWGs), have provided larger capacity with lower power consumption, because minimal electrical power is required for their operation. In addition, compact, wavelength-tunable semiconductor lasers with wide tuning ranges that can switch their wavelengths in tens of nanoseconds have been demonstrated. Here we present a wavelength-selective optical packet switch based on Waveguide Grating Routers (WGRs), passive splitters, and combiners. Tunable lasers on the transmitter side are the only active switching elements. The WGR is operated on multiple Free Spectral Ranges (FSRs) to achieve increased port count and switching capacity while maintaining strict-sense, non-blocking operation. Switching times of less than 24ns between two wavelengths covering three FSRs is demonstrated experimentally. The electrical power consumption, size, weight, and cost of our optical switch is compared with those of conventional electrical switches, showing substantial improvements at large throughputs (˜2 Tb/s full duplex). A revised switch design that does not suffer optical loss from star couplers is proposed. This switch design uses only WGRs, and it is suitable for networks with stringent power budgets. The burst nature of the optical packet transmission requires clock recovery for every incoming packet, and conventional continuous-mode receivers are not suitable for this application. An Embedded Clock Transport (ECT) technique is adopted here. The ECT combines a clock tone with the data payload before the transmission. Simple band pass filtering can extract the transmitted clock tone, and low pass filtering can recover the data. Error-free transmissions at 2.488 Gb/s with ˜16 ns clock recovery time were demonstrated.

Fast packet switching algorithms for dynamic resource control over ATM networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tsang, R.P.; Keattihananant, P.; Chang, T.

1996-12-01

Real-time continuous media traffic, such as digital video and audio, is expected to comprise a large percentage of the network load on future high speed packet switch networks such as ATM. A major feature which distinguishes high speed networks from traditional slower speed networks is the large amount of data the network must process very quickly. For efficient network usage, traffic control mechanisms are essential. Currently, most mechanisms for traffic control (such as flow control) have centered on the support of Available Bit Rate (ABR), i.e., non real-time, traffic. With regard to ATM, for ABR traffic, two major types ofmore » schemes which have been proposed are rate- control and credit-control schemes. Neither of these schemes are directly applicable to Real-time Variable Bit Rate (VBR) traffic such as continuous media traffic. Traffic control for continuous media traffic is an inherently difficult problem due to the time- sensitive nature of the traffic and its unpredictable burstiness. In this study, we present a scheme which controls traffic by dynamically allocating/de- allocating resources among competing VCs based upon their real-time requirements. This scheme incorporates a form of rate- control, real-time burst-level scheduling and link-link flow control. We show analytically potential performance improvements of our rate- control scheme and present a scheme for buffer dimensioning. We also present simulation results of our schemes and discuss the tradeoffs inherent in maintaining high network utilization and statistically guaranteeing many users` Quality of Service.« less

Electronic-To-Optical-To-Electronic Packet-Data Conversion

NASA Technical Reports Server (NTRS)

Monacos, Steve

1996-01-01

Space-time multiplexer (STM) cell-based communication system designed to take advantage of both high throughput attainable in optical transmission links and flexibility and functionality of electronic processing, storage, and switching. Long packets segmented and transmitted optically by wavelength-division multiplexing. Performs optoelectronic and protocol conversion between electronic "store-and-forward" protocols and optical "hot-potato" protocols.

The DDN (Defense Data Network) Course,

DTIC Science & Technology

1986-04-01

devices will share the same node-to-node channels. * Simultaneous availability of source and destination is not required. * Speed and code conversion can...address multiple addresses simultaneously 3) Disadvantages of Message Switching Systems Not suited to real time or interactive use * Long and highly...transmission b) Unlike message switching, packet switching requires the -. simultaneous availability of source and destination. 64 -4 ) ..xa...e s

A novel fair active queue management algorithm based on traffic delay jitter

NASA Astrophysics Data System (ADS)

Wang, Xue-Shun; Yu, Shao-Hua; Dai, Jin-You; Luo, Ting

2009-11-01

In order to guarantee the quantity of data traffic delivered in the network, congestion control strategy is adopted. According to the study of many active queue management (AQM) algorithms, this paper proposes a novel active queue management algorithm named JFED. JFED can stabilize queue length at a desirable level by adjusting output traffic rate and adopting a reasonable calculation of packet drop probability based on buffer queue length and traffic jitter; and it support burst packet traffic through the packet delay jitter, so that it can traffic flow medium data. JFED impose effective punishment upon non-responsible flow with a full stateless method. To verify the performance of JFED, it is implemented in NS2 and is compared with RED and CHOKe with respect to different performance metrics. Simulation results show that the proposed JFED algorithm outperforms RED and CHOKe in stabilizing instantaneous queue length and in fairness. It is also shown that JFED enables the link capacity to be fully utilized by stabilizing the queue length at a desirable level, while not incurring excessive packet loss ratio.

Energy-saving EPON Bandwidth Allocation Algorithm Supporting ONU's Sleep Mode

NASA Astrophysics Data System (ADS)

Zhang, Yinfa; Ren, Shuai; Liao, Xiaomin; Fang, Yuanyuan

2014-09-01

A new bandwidth allocation algorithm was presented by combining merits of the IPACT algorithm and the cyclic DBA algorithm based on the DBA algorithm for ONU's sleep mode. Simulation results indicate that compared with the normal mode ONU, the ONU's sleep mode can save about 74% of energy. The new algorithm has a smaller average packet delay and queue length in the upstream direction. While in the downstream direction, the average packet delay of the new algorithm is less than polling cycle Tcycle and the average queue length is less than the product of Tcycle and the maximum link rate. The new algorithm achieves a better compromise between energy-saving and ensuring quality of service.

Description and Simulation of a Fast Packet Switch Architecture for Communication Satellites

NASA Technical Reports Server (NTRS)

Quintana, Jorge A.; Lizanich, Paul J.

1995-01-01

The NASA Lewis Research Center has been developing the architecture for a multichannel communications signal processing satellite (MCSPS) as part of a flexible, low-cost meshed-VSAT (very small aperture terminal) network. The MCSPS architecture is based on a multifrequency, time-division-multiple-access (MF-TDMA) uplink and a time-division multiplex (TDM) downlink. There are eight uplink MF-TDMA beams, and eight downlink TDM beams, with eight downlink dwells per beam. The information-switching processor, which decodes, stores, and transmits each packet of user data to the appropriate downlink dwell onboard the satellite, has been fully described by using VHSIC (Very High Speed Integrated-Circuit) Hardware Description Language (VHDL). This VHDL code, which was developed in-house to simulate the information switching processor, showed that the architecture is both feasible and viable. This paper describes a shared-memory-per-beam architecture, its VHDL implementation, and the simulation efforts.

Modeling and performance analysis of an improved movement-based location management scheme for packet-switched mobile communication systems.

PubMed

Chung, Yun Won; Kwon, Jae Kyun; Park, Suwon

2014-01-01

One of the key technologies to support mobility of mobile station (MS) in mobile communication systems is location management which consists of location update and paging. In this paper, an improved movement-based location management scheme with two movement thresholds is proposed, considering bursty data traffic characteristics of packet-switched (PS) services. The analytical modeling for location update and paging signaling loads of the proposed scheme is developed thoroughly and the performance of the proposed scheme is compared with that of the conventional scheme. We show that the proposed scheme outperforms the conventional scheme in terms of total signaling load with an appropriate selection of movement thresholds.

DHCP Origin Traceback

NASA Astrophysics Data System (ADS)

Majumdar, Saugat; Kulkarni, Dhananjay; Ravishankar, Chinya V.

Imagine that the DHCP server is under attack from malicious hosts in your network. How would you know where these DHCP packets are coming from, or which path they took in the network? This paper investigates the problem of determining the origin of a DHCP packet in a network. We propose a practical method for adding a new option field that does not violate any RFC's, which we believe should be a crucial requirement while proposing any related solution. The new DHCP option will contain the ingress port and the switch MAC address. We recommend that this new option be added at the edge so that we can use the recorded value for performing traceback. The computational overhead of our solution is low, and the related network management tasks are low as well. We also address issues related to securing the field in order to maintain privacy of switch MAC addresses, fragmentation of packets, and possible attack scenarios. Our study shows that the traceback scheme is effective and practical to use in most network environments.

Efficient Actor Recovery Paradigm for Wireless Sensor and Actor Networks

PubMed Central

Mahjoub, Reem K.; Elleithy, Khaled

2017-01-01

The actor nodes are the spine of wireless sensor and actor networks (WSANs) that collaborate to perform a specific task in an unverified and uneven environment. Thus, there is a possibility of high failure rate in such unfriendly scenarios due to several factors such as power consumption of devices, electronic circuit failure, software errors in nodes or physical impairment of the actor nodes and inter-actor connectivity problem. Therefore, it is extremely important to discover the failure of a cut-vertex actor and network-disjoint in order to improve the Quality-of-Service (QoS). In this paper, we propose an Efficient Actor Recovery (EAR) paradigm to guarantee the contention-free traffic-forwarding capacity. The EAR paradigm consists of a Node Monitoring and Critical Node Detection (NMCND) algorithm that monitors the activities of the nodes to determine the critical node. In addition, it replaces the critical node with backup node prior to complete node-failure which helps balancing the network performance. The packets are handled using Network Integration and Message Forwarding (NIMF) algorithm that determines the source of forwarding the packets; either from actor or sensor. This decision-making capability of the algorithm controls the packet forwarding rate to maintain the network for a longer time. Furthermore, for handling the proper routing strategy, Priority-Based Routing for Node Failure Avoidance (PRNFA) algorithm is deployed to decide the priority of the packets to be forwarded based on the significance of information available in the packet. To validate the effectiveness of the proposed EAR paradigm, the proposed algorithms were tested using OMNET++ simulation. PMID:28420102

Efficient Actor Recovery Paradigm for Wireless Sensor and Actor Networks.

PubMed

Mahjoub, Reem K; Elleithy, Khaled

2017-04-14

The actor nodes are the spine of wireless sensor and actor networks (WSANs) that collaborate to perform a specific task in an unverified and uneven environment. Thus, there is a possibility of high failure rate in such unfriendly scenarios due to several factors such as power consumption of devices, electronic circuit failure, software errors in nodes or physical impairment of the actor nodes and inter-actor connectivity problem. Therefore, it is extremely important to discover the failure of a cut-vertex actor and network-disjoint in order to improve the Quality-of-Service (QoS). In this paper, we propose an Efficient Actor Recovery (EAR) paradigm to guarantee the contention-free traffic-forwarding capacity. The EAR paradigm consists of a Node Monitoring and Critical Node Detection (NMCND) algorithm that monitors the activities of the nodes to determine the critical node. In addition, it replaces the critical node with backup node prior to complete node-failure which helps balancing the network performance. The packets are handled using Network Integration and Message Forwarding (NIMF) algorithm that determines the source of forwarding the packets; either from actor or sensor. This decision-making capability of the algorithm controls the packet forwarding rate to maintain the network for a longer time. Furthermore, for handling the proper routing strategy, Priority-Based Routing for Node Failure Avoidance (PRNFA) algorithm is deployed to decide the priority of the packets to be forwarded based on the significance of information available in the packet. To validate the effectiveness of the proposed EAR paradigm, the proposed algorithms were tested using OMNET++ simulation.

On-board processing satellite network architecture and control study

NASA Technical Reports Server (NTRS)

Campanella, S. Joseph; Pontano, B.; Chalmers, H.

1987-01-01

For satellites to remain a vital part of future national and international communications, system concepts that use their inherent advantages to the fullest must be created. Network architectures that take maximum advantage of satellites equipped with onboard processing are explored. Satellite generations must accommodate various services for which satellites constitute the preferred vehicle of delivery. Such services tend to be those that are widely dispersed and present thin to medium loads to the system. Typical systems considered are thin and medium route telephony, maritime, land and aeronautical radio, VSAT data, low bit rate video teleconferencing, and high bit rate broadcast of high definition video. Delivery of services by TDMA and FDMA multiplexing techniques and combinations of the two for individual and mixed service types are studied. The possibilities offered by onboard circuit switched and packet switched architectures are examined and the results strongly support a preference for the latter. A detailed design architecture encompassing the onboard packet switch and its control, the related demand assigned TDMA burst structures, and destination packet protocols for routing traffic are presented. Fundamental onboard hardware requirements comprising speed, memory size, chip count, and power are estimated. The study concludes with identification of key enabling technologies and identifies a plan to develop a POC model.

Dimensioning of 10 Gbit/s all-optical packet switched networks based on optical label swapping routers with multistage 2R regeneration.

PubMed

Puerto, G; Ortega, B; Manzanedo, M D; Martínez, A; Pastor, D; Capmany, J; Kovacs, G

2006-10-30

This paper describes both the experimental and theoretical investigations on the cascadability of all-optical routers in optical label swapping networks incorporating a multistage wavelength conversion with 2R regeneration. A full description of a novel experimental setup allows the packet by packet measurement up to 16 hops with 10 Gb/s payload showing 1 dB penalty with 10(-12) bit error rate. Similarly, the simulations on the system allow a prediction on the cascadability of the router up to 64 hops.

A first packet processing subdomain cluster model based on SDN

NASA Astrophysics Data System (ADS)

Chen, Mingyong; Wu, Weimin

2017-08-01

For the current controller cluster packet processing performance bottlenecks and controller downtime problems. An SDN controller is proposed to allocate the priority of each device in the SDN (Software Defined Network) network, and the domain contains several network devices and Controller, the controller is responsible for managing the network equipment within the domain, the switch performs data delivery based on the load of the controller, processing network equipment data. The experimental results show that the model can effectively solve the risk of single point failure of the controller, and can solve the performance bottleneck of the first packet processing.

A distributed geo-routing algorithm for wireless sensor networks.

PubMed

Joshi, Gyanendra Prasad; Kim, Sung Won

2009-01-01

Geographic wireless sensor networks use position information for greedy routing. Greedy routing works well in dense networks, whereas in sparse networks it may fail and require a recovery algorithm. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costly for resource constrained position-based wireless sensor networks (WSNs). In this paper, we propose a void avoidance algorithm (VAA), a novel idea based on upgrading virtual distance. VAA allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forwarding packets using only greedy routing. In VAA, the stuck node upgrades distance unless it finds a next hop node that is closer to the destination than it is. VAA guarantees packet delivery if there is a topologically valid path. Further, it is completely distributed, immediately responds to node failure or topology changes and does not require planarization of the network. NS-2 is used to evaluate the performance and correctness of VAA and we compare its performance to other protocols. Simulations show our proposed algorithm consumes less energy, has an efficient path and substantially less control overheads.

Recognition of the optical packet header for two channels utilizing the parallel reservoir computing based on a semiconductor ring laser

NASA Astrophysics Data System (ADS)

Bao, Xiurong; Zhao, Qingchun; Yin, Hongxi; Qin, Jie

2018-05-01

In this paper, an all-optical parallel reservoir computing (RC) system with two channels for the optical packet header recognition is proposed and simulated, which is based on a semiconductor ring laser (SRL) with the characteristic of bidirectional light paths. The parallel optical loops are built through the cross-feedback of the bidirectional light paths where every optical loop can independently recognize each injected optical packet header. Two input signals are mapped and recognized simultaneously by training all-optical parallel reservoir, which is attributed to the nonlinear states in the laser. The recognition of optical packet headers for two channels from 4 bits to 32 bits is implemented through the simulation optimizing system parameters and therefore, the optimal recognition error ratio is 0. Since this structure can combine with the wavelength division multiplexing (WDM) optical packet switching network, the wavelength of each channel of optical packet headers for recognition can be different, and a better recognition result can be obtained.

User-oriented end-to-end transport protocols for the real-time distribution of telemetry data from NASA spacecraft

NASA Technical Reports Server (NTRS)

Hooke, A. J.

1979-01-01

A set of standard telemetry protocols for downlink data flow facilitating the end-to-end transport of instrument data from the spacecraft to the user in real time is proposed. The direct switching of data by autonomous message 'packets' that are assembled by the source instrument on the spacecraft is discussed. The data system consists thus of a format on a message rather than word basis, and such packet telemetry would include standardized protocol headers. Standards are being developed within the NASA End-to-End Data System (NEEDS) program for the source packet and transport frame protocols. The source packet protocol contains identification of both the sequence number of the packet as it is generated by the source and the total length of the packet, while the transport frame protocol includes a sequence count defining the serial number of the frame as it is generated by the spacecraft data system, and a field specifying any 'options' selected in the format of the frame itself.

Path Diversity Media Streaming over Best Effort Packet Switched Networks

DTIC Science & Technology

2003-01-01

intolerable sounds of my violin practice, but my mom was always there to defend and encourage her young violinist. When I left my full-time job for graduate...information can be incomplete or inaccurate. For exam - ple, traceroute can only differentiate between routers and not switches. Two paths with completely

Doubly differential star-16-QAM for fast wavelength switching coherent optical packet transceiver.

PubMed

Liu, Fan; Lin, Yi; Walsh, Anthony J; Yu, Yonglin; Barry, Liam P

2018-04-02

A coherent optical packet transceiver based on doubly differential star 16-ary quadrature amplitude modulation (DD-star-16-QAM) is presented for spectrally and energy efficient reconfigurable networks. The coding and decoding processes for this new modulation format are presented, simulations and experiments are then performed to investigate the performance of the DD-star-16-QAM in static and dynamic scenarios. The static results show that the influence of frequency offset (FO) can be cancelled out by doubly differential (DD) coding and the correction range is only limited by the electronic bandwidth of the receivers. In the dynamic scenario with a time-varying FO and linewidth, the DD-star-16-QAM can overcome the time-varying FO, and the switching time of around 70 ns is determined by the time it takes the dynamic linewidth to reach the requisite level. This format can thus achieve a shorter waiting time after switching tunable lasers than the commonly used square-16-QAM, in which the transmission performance is limited by the frequency transients after the wavelength switch.

Transmission and reflection of charge-density wave packets in a quantum Hall edge controlled by a metal gate

NASA Astrophysics Data System (ADS)

Matsuura, Masahiro; Mano, Takaaki; Noda, Takeshi; Shibata, Naokazu; Hotta, Masahiro; Yusa, Go

2018-02-01

Quantum energy teleportation (QET) is a proposed protocol related to quantum vacuum. The edge channels in a quantum Hall system are well suited for the experimental verification of QET. For this purpose, we examine a charge-density wave packet excited and detected by capacitively coupled front gate electrodes. We observe the waveform of the charge packet, which is proportional to the time derivative of the applied square voltage wave. Further, we study the transmission and reflection behaviors of the charge-density wave packet by applying a voltage to another front gate electrode to control the path of the edge state. We show that the threshold voltages where the dominant direction is switched in either transmission or reflection for dense and sparse wave packets are different from the threshold voltage where the current stops flowing in an equilibrium state.

A low-latency optical switch architecture using integrated μm SOI-based contention resolution and switching

NASA Astrophysics Data System (ADS)

Mourgias-Alexandris, G.; Moralis-Pegios, M.; Terzenidis, N.; Cherchi, M.; Harjanne, M.; Aalto, T.; Vyrsokinos, K.; Pleros, N.

2018-02-01

The urgent need for high-bandwidth and high-port connectivity in Data Centers has boosted the deployment of optoelectronic packet switches towards bringing high data-rate optics closer to the ASIC, realizing optical transceiver functions directly at the ASIC package for high-rate, low-energy and low-latency interconnects. Even though optics can offer a broad range of low-energy integrated switch fabrics for replacing electronic switches and seamlessly interface with the optical I/Os, the use of energy- and latency-consuming electronic SerDes continues to be a necessity, mainly dictated by the absence of integrated and reliable optical buffering solutions. SerDes undertakes the role of optimally synergizing the lower-speed electronic buffers with the incoming and outgoing optical streams, suggesting that a SerDes-released chip-scale optical switch fabric can be only realized in case all necessary functions including contention resolution and switching can be implemented on a common photonic integration platform. In this paper, we demonstrate experimentally a hybrid Broadcast-and-Select (BS) / wavelength routed optical switch that performs both the optical buffering and switching functions with μm-scale Silicon-integrated building blocks. Optical buffering is carried out in a silicon-integrated variable delay line bank with a record-high on-chip delay/footprint efficiency of 2.6ns/mm2 and up to 17.2 nsec delay capability, while switching is executed via a BS design and a silicon-integrated echelle grating, assisted by SOA-MZI wavelength conversion stages and controlled by a FPGA header processing module. The switch has been experimentally validated in a 3x3 arrangement with 10Gb/s NRZ optical data packets, demonstrating error-free switching operation with a power penalty of <5dB.

Study on multiple-hops performance of MOOC sequences-based optical labels for OPS networks

NASA Astrophysics Data System (ADS)

Zhang, Chongfu; Qiu, Kun; Ma, Chunli

2009-11-01

In this paper, we utilize a new study method that is under independent case of multiple optical orthogonal codes to derive the probability function of MOOCS-OPS networks, discuss the performance characteristics for a variety of parameters, and compare some characteristics of the system employed by single optical orthogonal code or multiple optical orthogonal codes sequences-based optical labels. The performance of the system is also calculated, and our results verify that the method is effective. Additionally it is found that performance of MOOCS-OPS networks would, negatively, be worsened, compared with single optical orthogonal code-based optical label for optical packet switching (SOOC-OPS); however, MOOCS-OPS networks can greatly enlarge the scalability of optical packet switching networks.

Optimized scalable network switch

DOEpatents

Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Steinmacher-Burow, Burkhard D [Mount Kisco, NY; Takken, Todd E [Mount Kisco, NY; Vranas, Pavlos M [Bedford Hills, NY

2007-12-04

In a massively parallel computing system having a plurality of nodes configured in m multi-dimensions, each node including a computing device, a method for routing packets towards their destination nodes is provided which includes generating at least one of a 2m plurality of compact bit vectors containing information derived from downstream nodes. A multilevel arbitration process in which downstream information stored in the compact vectors, such as link status information and fullness of downstream buffers, is used to determine a preferred direction and virtual channel for packet transmission. Preferred direction ranges are encoded and virtual channels are selected by examining the plurality of compact bit vectors. This dynamic routing method eliminates the necessity of routing tables, thus enhancing scalability of the switch.

Optimized scalable network switch

DOEpatents

Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.

2010-02-23

In a massively parallel computing system having a plurality of nodes configured in m multi-dimensions, each node including a computing device, a method for routing packets towards their destination nodes is provided which includes generating at least one of a 2m plurality of compact bit vectors containing information derived from downstream nodes. A multilevel arbitration process in which downstream information stored in the compact vectors, such as link status information and fullness of downstream buffers, is used to determine a preferred direction and virtual channel for packet transmission. Preferred direction ranges are encoded and virtual channels are selected by examining the plurality of compact bit vectors. This dynamic routing method eliminates the necessity of routing tables, thus enhancing scalability of the switch.

A fiber optic tactical voice/data network based on FDDI

NASA Technical Reports Server (NTRS)

Bergman, L. A.; Hartmayer, R.; Marelid, S.; Wu, W. H.; Edgar, G.; Cassell, P.; Mancini, R.; Kiernicki, J.; Paul, L. J.; Jeng, J.

1988-01-01

An asynchronous high-speed fiber optic local area network is described that supports ordinary data packet traffic simultaneously with synchronous Tl voice traffic over a common FDDI token ring channel. A voice interface module was developed that parses, buffers, and resynchronizes the voice data to the packet network. The technique is general, however, and can be applied to any deterministic class of networks, including multi-tier backbones. A conventional single token access protocol was employed at the lowest layer, with fixed packet sizes for voice and variable for data. In addition, the higher layer packet data protocols are allowed to operate independently of those for the voice thereby permitting great flexibility in reconfiguring the network. Voice call setup and switching functions were performed external to the network with PABX equipment.

Distributed Optimal Dispatch of Distributed Energy Resources Over Lossy Communication Networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, Junfeng; Yang, Tao; Wu, Di

In this paper, we consider the economic dispatch problem (EDP), where a cost function that is assumed to be strictly convex is assigned to each of distributed energy resources (DERs), over packet dropping networks. The goal of a standard EDP is to minimize the total generation cost while meeting total demand and satisfying individual generator output limit. We propose a distributed algorithm for solving the EDP over networks. The proposed algorithm is resilient against packet drops over communication links. Under the assumption that the underlying communication network is strongly connected with a positive probability and the packet drops are independentmore » and identically distributed (i.i.d.), we show that the proposed algorithm is able to solve the EDP. Numerical simulation results are used to validate and illustrate the main results of the paper.« less

Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

USGS Publications Warehouse

Song, W.-Z.; Yuan, F.; LaHuser, R.

2007-01-01

This paper studies the WSN application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs max(2N(u1) - 1, N(u 0) -1) time slots, assuming each node reports one unit of data in each round. Here N(u0) is the total number of sensors, while N(u 1) denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also eliminated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle. ??2006 IEEE.

Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

USGS Publications Warehouse

Song, W.-Z.; Yuan, F.; LaHusen, R.; Shirazi, B.

2007-01-01

This paper studies the wireless sensor networks (WSN) application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs [image omitted], N(u0)-1) time slots, assuming each node reports one unit of data in each round. Here [image omitted] is the total number of sensors, while [image omitted] denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet-scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also mitigated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle.

All-optical clocked delay flip-flop using a single terahertz optical asymmetric demultiplexer-based switch: a theoretical study.

PubMed

Chattopadhyay, Tanay

2010-10-01

A flip-flop (FF) is a kind of latch and the simplest form of memory device, which stores various values either temporarily or permanently. Optical FF memories form a fundamental building block for all-optical packet switches in next-generation communication networks. An all-optical clocked delay FF using a single terahertz optical asymmetric demultiplexer-based interferometric switch is proposed and described. Numerical simulation results are also reported.

Implementation of the Algorithm for Congestion control in the Dynamic Circuit Network (DCN)

NASA Astrophysics Data System (ADS)

Nalamwar, H. S.; Ivanov, M. A.; Buddhawar, G. U.

2017-01-01

Transport Control Protocol (TCP) incast congestion happens when a number of senders work in parallel with the same server where the high bandwidth and low latency network problem occurs. For many data center network applications such as a search engine, heavy traffic is present on such a server. Incast congestion degrades the entire performance as packets are lost at a server side due to buffer overflow, and as a result, the response time becomes longer. In this work, we focus on TCP throughput, round-trip time (RTT), receive window and retransmission. Our method is based on the proactive adjust of the TCP receive window before the packet loss occurs. We aim to avoid the wastage of the bandwidth by adjusting its size as per the number of packets. To avoid the packet loss, the ICTCP algorithm has been implemented in the data center network (ToR).

Interprocess Communication Protocols for Computer Networks

DTIC Science & Technology

1975-12-01

this value without maintaining any state information about itp partner CCP. The receiving CCP returns a SYN giving its own ISN, or can reject...34Packet Arrival and Buffer Statistics in a Packet Switching Node," IBM Research Report RZ 594 {.s;Zni02),. September 1973. [Cochi73] B. J. Cochi...rwid 0. P. Karp, "Protocol for a Computer Netuork," IBM Sustem Journa! 12. 1, 1973, pp. 94-105. [ricKen2ie741 A. fl. McKenzie

Research in the Aloha system

NASA Technical Reports Server (NTRS)

Abramson, N.

1974-01-01

The Aloha system was studied and developed and extended to advanced forms of computer communications networks. Theoretical and simulation studies of Aloha type radio channels for use in packet switched communications networks were performed. Improved versions of the Aloha communications techniques and their extensions were tested experimentally. A packet radio repeater suitable for use with the Aloha system operational network was developed. General studies of the organization of multiprocessor systems centered on the development of the BCC 500 computer were concluded.

Applications of High Speed Networks

DTIC Science & Technology

1991-09-01

plished in order to achieve a dpgree of parallelism by constructing a distributed switch. The type of switch, self -routing, processes the packet...control more than a dozen missiles in flight, and the four Mark 99 target illuminators direct missiles in the terminal phase. The self -contained Phalanx...military installations, weapon system respose and expected missile performance against a threat. Projects are already underway transposing of

MOBILESAT: Australia's own

NASA Technical Reports Server (NTRS)

Wagg, Michael

1990-01-01

Australia will be introducing a dedicated Mobile Satellite Communications System following the launch of the AUSSAT-B satellites late in 1991. The Mobile Satellite System, MOBILESAT, will provide circuit switched voice/data services and packet-switched data services for land, aeronautical and maritime users. Here, an overview is given of the development program being undertaken within Australia to enable a fully commercial service to be introduced in 1992.

Enhancing the Quality of Service for Real Time Traffic over Optical Burst Switching (OBS) Networks with Ensuring the Fairness for Other Traffics.

PubMed

Al-Shargabi, Mohammed A; Shaikh, Asadullah; Ismail, Abdulsamad S

2016-01-01

Optical burst switching (OBS) networks have been attracting much consideration as a promising approach to build the next generation optical Internet. A solution for enhancing the Quality of Service (QoS) for high priority real time traffic over OBS with the fairness among the traffic types is absent in current OBS' QoS schemes. In this paper we present a novel Real Time Quality of Service with Fairness Ratio (RT-QoSFR) scheme that can adapt the burst assembly parameters according to the traffic QoS needs in order to enhance the real time traffic QoS requirements and to ensure the fairness for other traffic. The results show that RT-QoSFR scheme is able to fulfill the real time traffic requirements (end to end delay, and loss rate) ensuring the fairness for other traffics under various conditions such as the type of real time traffic and traffic load. RT-QoSFR can guarantee that the delay of the real time traffic packets does not exceed the maximum packets transfer delay value. Furthermore, it can reduce the real time traffic packets loss, at the same time guarantee the fairness for non real time traffic packets by determining the ratio of real time traffic inside the burst to be 50-60%, 30-40%, and 10-20% for high, normal, and low traffic loads respectively.

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

PubMed

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.

Implementation of a tactical voice/data network over FDDI. [Fiber Distributed Data Interface

NASA Technical Reports Server (NTRS)

Bergman, L. A.; Halloran, F.; Martinez, J.

1988-01-01

An asynchronous high-speed fiber-optic local-area network is described that simultaneously supports packet data traffic with synchronous TI voice traffic over a standard asynchronous FDDI (fiber distributed data interface) token-ring channel. A voice interface module was developed that parses, buffers, and resynchronizes the voice data to the packet network. The technique is general, however, and can be applied to any deterministic class of networks, including multitier backbones. In addition, the higher layer packet data protocols may operate independently of those for the voice, thereby permitting great flexibility in reconfiguring the network. Voice call setup and switching functions are performed external to the network with PABX equipment.

Increasingly minimal bias routing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bataineh, Abdulla; Court, Thomas; Roweth, Duncan

2017-02-21

A system and algorithm configured to generate diversity at the traffic source so that packets are uniformly distributed over all of the available paths, but to increase the likelihood of taking a minimal path with each hop the packet takes. This is achieved by configuring routing biases so as to prefer non-minimal paths at the injection point, but increasingly prefer minimal paths as the packet proceeds, referred to herein as Increasing Minimal Bias (IMB).

Optical multicast system for data center networks.

PubMed

Samadi, Payman; Gupta, Varun; Xu, Junjie; Wang, Howard; Zussman, Gil; Bergman, Keren

2015-08-24

We present the design and experimental evaluation of an Optical Multicast System for Data Center Networks, a hardware-software system architecture that uniquely integrates passive optical splitters in a hybrid network architecture for faster and simpler delivery of multicast traffic flows. An application-driven control plane manages the integrated optical and electronic switched traffic routing in the data plane layer. The control plane includes a resource allocation algorithm to optimally assign optical splitters to the flows. The hardware architecture is built on a hybrid network with both Electronic Packet Switching (EPS) and Optical Circuit Switching (OCS) networks to aggregate Top-of-Rack switches. The OCS is also the connectivity substrate of splitters to the optical network. The optical multicast system implementation requires only commodity optical components. We built a prototype and developed a simulation environment to evaluate the performance of the system for bulk multicasting. Experimental and numerical results show simultaneous delivery of multicast flows to all receivers with steady throughput. Compared to IP multicast that is the electronic counterpart, optical multicast performs with less protocol complexity and reduced energy consumption. Compared to peer-to-peer multicast methods, it achieves at minimum an order of magnitude higher throughput for flows under 250 MB with significantly less connection overheads. Furthermore, for delivering 20 TB of data containing only 15% multicast flows, it reduces the total delivery energy consumption by 50% and improves latency by 55% compared to a data center with a sole non-blocking EPS network.

Network speech systems technology program

NASA Astrophysics Data System (ADS)

Weinstein, C. J.

1981-09-01

This report documents work performed during FY 1981 on the DCA-sponsored Network Speech Systems Technology Program. The two areas of work reported are: (1) communication system studies in support of the evolving Defense Switched Network (DSN) and (2) design and implementation of satellite/terrestrial interfaces for the Experimental Integrated Switched Network (EISN). The system studies focus on the development and evaluation of economical and endurable network routing procedures. Satellite/terrestrial interface development includes circuit-switched and packet-switched connections to the experimental wideband satellite network. Efforts in planning and coordination of EISN experiments are reported in detail in a separate EISN Experiment Plan.

Influence of lattice vibrations on the field driven electronic transport in chains with correlated disorder

NASA Astrophysics Data System (ADS)

da Silva, L. D.; Sales, M. O.; Ranciaro Neto, A.; Lyra, M. L.; de Moura, F. A. B. F.

2016-12-01

We investigate electronic transport in a one-dimensional model with four different types of atoms and long-ranged correlated disorder. The latter was attained by choosing an adequate distribution of on-site energies. The wave-packet dynamics is followed by taking into account effects due to a static electric field and electron-phonon coupling. In the absence of electron-phonon coupling, the competition between correlated disorder and the static electric field promotes the occurrence of wave-packet oscillations in the regime of strong correlations. When the electron-lattice coupling is switched on, phonon scattering degrades the Bloch oscillations. For weak electron-phonon couplings, a coherent oscillatory-like dynamics of the wave-packet centroid persists for short periods of time. For strong couplings the wave-packet acquires a diffusive-like displacement and spreading. A slower sub-diffusive spreading takes place in the regime of weak correlations.

Implementation of a data packet generator using pattern matching for wearable ECG monitoring systems.

PubMed

Noh, Yun Hong; Jeong, Do Un

2014-07-15

In this paper, a packet generator using a pattern matching algorithm for real-time abnormal heartbeat detection is proposed. The packet generator creates a very small data packet which conveys sufficient crucial information for health condition analysis. The data packet envelopes real time ECG signals and transmits them to a smartphone via Bluetooth. An Android application was developed specifically to decode the packet and extract ECG information for health condition analysis. Several graphical presentations are displayed and shown on the smartphone. We evaluate the performance of abnormal heartbeat detection accuracy using the MIT/BIH Arrhythmia Database and real time experiments. The experimental result confirm our finding that abnormal heart beat detection is practically possible. We also performed data compression ratio and signal restoration performance evaluations to establish the usefulness of the proposed packet generator and the results were excellent.

A Bibliography of Packet Radio Literature.

DTIC Science & Technology

1984-03-01

r r* C.C.4. W . . . . . . . . .. . . . Gafni, E. and D. Bertsekas, "Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently...December 1980). Leiner, B., K. Klemba, and J. Tornow , "Packet Radio Networking," Computer World, pp. 26-37, 30, (September 27, 1982). Liu, J...34Distributed Routing and Relay Management in Mobile Packet Radio Networks," Proceedings IEEE COMPCON Fall 󈨔, p. 235-243 (1980). MacGregor, W ., J. Westcott, and

A hybrid frame concealment algorithm for H.264/AVC.

PubMed

Yan, Bo; Gharavi, Hamid

2010-01-01

In packet-based video transmissions, packets loss due to channel errors may result in the loss of the whole video frame. Recently, many error concealment algorithms have been proposed in order to combat channel errors; however, most of the existing algorithms can only deal with the loss of macroblocks and are not able to conceal the whole missing frame. In order to resolve this problem, in this paper, we have proposed a new hybrid motion vector extrapolation (HMVE) algorithm to recover the whole missing frame, and it is able to provide more accurate estimation for the motion vectors of the missing frame than other conventional methods. Simulation results show that it is highly effective and significantly outperforms other existing frame recovery methods.

Experimental demonstration of an OpenFlow based software-defined optical network employing packet, fixed and flexible DWDM grid technologies on an international multi-domain testbed.

PubMed

Channegowda, M; Nejabati, R; Rashidi Fard, M; Peng, S; Amaya, N; Zervas, G; Simeonidou, D; Vilalta, R; Casellas, R; Martínez, R; Muñoz, R; Liu, L; Tsuritani, T; Morita, I; Autenrieth, A; Elbers, J P; Kostecki, P; Kaczmarek, P

2013-03-11

Software defined networking (SDN) and flexible grid optical transport technology are two key technologies that allow network operators to customize their infrastructure based on application requirements and therefore minimizing the extra capital and operational costs required for hosting new applications. In this paper, for the first time we report on design, implementation & demonstration of a novel OpenFlow based SDN unified control plane allowing seamless operation across heterogeneous state-of-the-art optical and packet transport domains. We verify and experimentally evaluate OpenFlow protocol extensions for flexible DWDM grid transport technology along with its integration with fixed DWDM grid and layer-2 packet switching.

OSLG: A new granting scheme in WDM Ethernet passive optical networks

NASA Astrophysics Data System (ADS)

Razmkhah, Ali; Rahbar, Akbar Ghaffarpour

2011-12-01

Several granting schemes have been proposed to grant transmission window and dynamic bandwidth allocation (DBA) in passive optical networks (PON). Generally, granting schemes suffer from bandwidth wastage of granted windows. Here, we propose a new granting scheme for WDM Ethernet PONs, called optical network unit (ONU) Side Limited Granting (OSLG) that conserves upstream bandwidth, thus resulting in decreasing queuing delay and packet drop ratio. In OSLG instead of optical line terminal (OLT), each ONU determines its transmission window. Two OSLG algorithms are proposed in this paper: the OSLG_GA algorithm that determines the size of its transmission window in such a way that the bandwidth wastage problem is relieved, and the OSLG_SC algorithm that saves unused bandwidth for more bandwidth utilization later on. The OSLG can be used as granting scheme of any DBA to provide better performance in the terms of packet drop ratio and queuing delay. Our performance evaluations show the effectiveness of OSLG in reducing packet drop ratio and queuing delay under different DBA techniques.

Quality of service routing in wireless ad hoc networks

NASA Astrophysics Data System (ADS)

Sane, Sachin J.; Patcha, Animesh; Mishra, Amitabh

2003-08-01

An efficient routing protocol is essential to guarantee application level quality of service running on wireless ad hoc networks. In this paper we propose a novel routing algorithm that computes a path between a source and a destination by considering several important constraints such as path-life, availability of sufficient energy as well as buffer space in each of the nodes on the path between the source and destination. The algorithm chooses the best path from among the multiples paths that it computes between two endpoints. We consider the use of control packets that run at a priority higher than the data packets in determining the multiple paths. The paper also examines the impact of different schedulers such as weighted fair queuing, and weighted random early detection among others in preserving the QoS level guarantees. Our extensive simulation results indicate that the algorithm improves the overall lifetime of a network, reduces the number of dropped packets, and decreases the end-to-end delay for real-time voice application.

Enhancing the Quality of Service for Real Time Traffic over Optical Burst Switching (OBS) Networks with Ensuring the Fairness for Other Traffics

PubMed Central

Al-Shargabi, Mohammed A.; Ismail, Abdulsamad S.

2016-01-01

Optical burst switching (OBS) networks have been attracting much consideration as a promising approach to build the next generation optical Internet. A solution for enhancing the Quality of Service (QoS) for high priority real time traffic over OBS with the fairness among the traffic types is absent in current OBS’ QoS schemes. In this paper we present a novel Real Time Quality of Service with Fairness Ratio (RT-QoSFR) scheme that can adapt the burst assembly parameters according to the traffic QoS needs in order to enhance the real time traffic QoS requirements and to ensure the fairness for other traffic. The results show that RT-QoSFR scheme is able to fulfill the real time traffic requirements (end to end delay, and loss rate) ensuring the fairness for other traffics under various conditions such as the type of real time traffic and traffic load. RT-QoSFR can guarantee that the delay of the real time traffic packets does not exceed the maximum packets transfer delay value. Furthermore, it can reduce the real time traffic packets loss, at the same time guarantee the fairness for non real time traffic packets by determining the ratio of real time traffic inside the burst to be 50–60%, 30–40%, and 10–20% for high, normal, and low traffic loads respectively. PMID:27583557

MSFC institutional area network and ATM technology

NASA Technical Reports Server (NTRS)

Amin, Ashok T.

1994-01-01

The New Institutional Area Network (NEWIAN) at Marshall supports over 5000 end users with access to 26 file servers providing work presentation services. It is comprised of some 150 Ethernet LAN's interconnected by bridges/routers which are in turn connected to servers over two dual FDDI rings. The network supports various higher level protocols such as IP, IPX, AppleTalk (AT), and DECNet. At present IPX and AT protocols packets are routed, and IP protocol packets are bridged; however, work is in progress to route all IP packets. The impact of routing IP packets on network operation is examined. Broadband Integrated Services Data Network (BISDN), presently at various stages of development, is intended to provide voice, video, and data transfer services over a single network. BISDN will use asynchronous transfer mode (ATM) as a data transfer technique which provides for transmission, multiplexing, switching, and relaying of small size data units called cells. Limited ATM Wide Area Network (WAN) services are offered by Wiltel, AT&T, Sprint, and others. NASA is testing a pilot ATM WAN with a view to provide Program Support Communication Network services using ATM. ATM supports wide range of data rates and quality of service requirements. It is expected that ATM switches will penetrate campus networks as well. However, presently products in these areas are at various stages of development and standards are not yet complete. We examine development of ATM to help assess its role in the evolution of NEWIAN.

ISDN Application in the Army Environment

DTIC Science & Technology

1992-02-01

Signalling System Number 7 ( SS7 ). SS7 is a packet switched signalling network operating in parallel with the traffic bearing network. The current, in...for example, require SS7 . Further into the future, broadband ISDN (B-ISDN) is expected to provide high-quality, full-motion video, High Definition...smaller business offices, ISDN could be a viable alternative to private networks, especially when switches are connected through SS7 . ISDN, in combination

Embedded wavelet packet transform technique for texture compression

NASA Astrophysics Data System (ADS)

Li, Jin; Cheng, Po-Yuen; Kuo, C.-C. Jay

1995-09-01

A highly efficient texture compression scheme is proposed in this research. With this scheme, energy compaction of texture images is first achieved by the wavelet packet transform, and an embedding approach is then adopted for the coding of the wavelet packet transform coefficients. By comparing the proposed algorithm with the JPEG standard, FBI wavelet/scalar quantization standard and the EZW scheme with extensive experimental results, we observe a significant improvement in the rate-distortion performance and visual quality.

A Genetic Algorithm for the Generation of Packetization Masks for Robust Image Communication

PubMed Central

Zapata-Quiñones, Katherine; Duran-Faundez, Cristian; Gutiérrez, Gilberto; Lecuire, Vincent; Arredondo-Flores, Christopher; Jara-Lipán, Hugo

2017-01-01

Image interleaving has proven to be an effective solution to provide the robustness of image communication systems when resource limitations make reliable protocols unsuitable (e.g., in wireless camera sensor networks); however, the search for optimal interleaving patterns is scarcely tackled in the literature. In 2008, Rombaut et al. presented an interesting approach introducing a packetization mask generator based in Simulated Annealing (SA), including a cost function, which allows assessing the suitability of a packetization pattern, avoiding extensive simulations. In this work, we present a complementary study about the non-trivial problem of generating optimal packetization patterns. We propose a genetic algorithm, as an alternative to the cited work, adopting the mentioned cost function, then comparing it to the SA approach and a torus automorphism interleaver. In addition, we engage the validation of the cost function and provide results attempting to conclude about its implication in the quality of reconstructed images. Several scenarios based on visual sensor networks applications were tested in a computer application. Results in terms of the selected cost function and image quality metric PSNR show that our algorithm presents similar results to the other approaches. Finally, we discuss the obtained results and comment about open research challenges. PMID:28452934

Internet traffic load balancing using dynamic hashing with flow volume

NASA Astrophysics Data System (ADS)

Jo, Ju-Yeon; Kim, Yoohwan; Chao, H. Jonathan; Merat, Francis L.

2002-07-01

Sending IP packets over multiple parallel links is in extensive use in today's Internet and its use is growing due to its scalability, reliability and cost-effectiveness. To maximize the efficiency of parallel links, load balancing is necessary among the links, but it may cause the problem of packet reordering. Since packet reordering impairs TCP performance, it is important to reduce the amount of reordering. Hashing offers a simple solution to keep the packet order by sending a flow over a unique link, but static hashing does not guarantee an even distribution of the traffic amount among the links, which could lead to packet loss under heavy load. Dynamic hashing offers some degree of load balancing but suffers from load fluctuations and excessive packet reordering. To overcome these shortcomings, we have enhanced the dynamic hashing algorithm to utilize the flow volume information in order to reassign only the appropriate flows. This new method, called dynamic hashing with flow volume (DHFV), eliminates unnecessary flow reassignments of small flows and achieves load balancing very quickly without load fluctuation by accurately predicting the amount of transferred load between the links. In this paper we provide the general framework of DHFV and address the challenges in implementing DHFV. We then introduce two algorithms of DHFV with different flow selection strategies and show their performances through simulation.

Free-space optics technology employed in an UMTS release 4 bearer independent core network access part

NASA Astrophysics Data System (ADS)

Bibac, Ionut

2005-08-01

The UMTS Bearer Independent Core Network program introduced the 3rd Generation Partnership Program Release 4 BICN architecture into the legacy UMTS TDM-switched network. BICN is the application of calI server archltecture for voice and circuit switched data, enabling the provisioning of traditional circuit-switched services using a packet-switched transport network. Today"s business climate has made it essential for service providers to develop a comprehensive networking strategy that means introduction of RCBICN networks. The R4-BICN solution to the evolution of the Core Network in UMTS will enable operators to significantly reduce the capital and operational costs of delivering both traditional voice sewices and new multimedia services. To build the optical backbone, which can support the third generation (3G) packetized infrastructure, the operators could choose a fibre connection, or they could retain the benefits of a wireless connectivity by using a FSO - Free Space Optical lmk, the only wireless technology available that is capable of achieving data rates up to 2.4 Gbit/s. FSO offers viable alternatives for both core transmission networks and for replacing microwaves links in NodeB - RNC access networks. The paper and presentation aim to demonstrate the manner in which FSO products and networks are employed into R4-BICN design solutions.

Improving the resolution for Lamb wave testing via a smoothed Capon algorithm

NASA Astrophysics Data System (ADS)

Cao, Xuwei; Zeng, Liang; Lin, Jing; Hua, Jiadong

2018-04-01

Lamb wave testing is promising for damage detection and evaluation in large-area structures. The dispersion of Lamb waves is often unavoidable, restricting testing resolution and making the signal hard to interpret. A smoothed Capon algorithm is proposed in this paper to estimate the accurate path length of each wave packet. In the algorithm, frequency domain whitening is firstly used to obtain the transfer function in the bandwidth of the excitation pulse. Subsequently, wavenumber domain smoothing is employed to reduce the correlation between wave packets. Finally, the path lengths are determined by distance domain searching based on the Capon algorithm. Simulations are applied to optimize the number of smoothing times. Experiments are performed on an aluminum plate consisting of two simulated defects. The results demonstrate that spatial resolution is improved significantly by the proposed algorithm.

On-board B-ISDN fast packet switching architectures. Phase 1: Study

NASA Technical Reports Server (NTRS)

Faris, Faris; Inukai, Thomas; Lee, Fred; Paul, Dilip; Shyy, Dong-Jye

1993-01-01

The broadband integrate services digital network (B-ISDN) is an emerging telecommunications technology that will meet most of the telecommunications networking needs in the mid-1990's to early next century. The satellite-based system is well positioned for providing B-ISDN service with its inherent capabilities of point-to-multipoint and broadcast transmission, virtually unlimited connectivity between any two points within a beam coverage, short deployment time of communications facility, flexible and dynamic reallocation of space segment capacity, and distance insensitive cost. On-board processing satellites, particularly in a multiple spot beam environment, will provide enhanced connectivity, better performance, optimized access and transmission link design, and lower user service cost. The following are described: the user and network aspects of broadband services; the current development status in broadband services; various satellite network architectures including system design issues; and various fast packet switch architectures and their detail designs.

Investigations into the Performance of a Distributed Routing Protocol for Packet Switching Networks.

DTIC Science & Technology

1982-12-01

normal printer output or both. A sample of the )u-tout f-mat used for this study is D:-ovided in Appendix E. 45 The implementation of the packet...LUl 16> CLU C.Z 9- - Z Q ZO M Zink - M XC Z- M 1-4 V) . ujW LU UJi eay) a- I--UJZ X<Wd Z OX -V) 1:1 =) m (XZ o OX .4 D UU-X .. cN U.""’ Z WI-’- L.A a

Objective research of auscultation signals in Traditional Chinese Medicine based on wavelet packet energy and support vector machine.

PubMed

Yan, Jianjun; Shen, Xiaojing; Wang, Yiqin; Li, Fufeng; Xia, Chunming; Guo, Rui; Chen, Chunfeng; Shen, Qingwei

2010-01-01

This study aims at utilising Wavelet Packet Transform (WPT) and Support Vector Machine (SVM) algorithm to make objective analysis and quantitative research for the auscultation in Traditional Chinese Medicine (TCM) diagnosis. First, Wavelet Packet Decomposition (WPD) at level 6 was employed to split more elaborate frequency bands of the auscultation signals. Then statistic analysis was made based on the extracted Wavelet Packet Energy (WPE) features from WPD coefficients. Furthermore, the pattern recognition was used to distinguish mixed subjects' statistical feature values of sample groups through SVM. Finally, the experimental results showed that the classification accuracies were at a high level.

High-Throughput, Survivable Protocols for CDMA Packet-Radio Networks (SRNTN-74)

DTIC Science & Technology

1990-03-01

published in a paper by Jubin and Tornow [2], however the reader must be aware that the current SURAP algorithms deviate slightly from this reference...threading policy outlined by Jubin and Tornow is equivalent to a link- level window size of one, meaning a policy of not transmitting a new packet to a... Tornow . The DARPA packet-radio network protocols. Proceedings of the IEEE, 75(1):21-32, January 1987. [31 N. Gower and J. Jubin. Congestion control using

An architecture for the MSAT mobile data system

NASA Technical Reports Server (NTRS)

Kerr, R. W.; Skerry, B.

1990-01-01

The Mobile Satellite (MSAT) Mobile Data System (MDS) will offer a wide range of packet switched data services. The characteristics and requirements of the services are briefly examined. A proposed architecture to implement these services is presented along with its connectivity requirements. A description of the inbound and outbound channels is provided which are based upon the signalling for the circuit switched services. Additionally, the duties of the Network Management System are examined.

Digital Telematics: Present and Future.

ERIC Educational Resources Information Center

Stalberg, Christian E.

1987-01-01

This overview of developments in international telecommunications networks focuses on their importance for developing countries and the necessary interdependence of all countries. Highlights include digital technology, telephone service, packet switching networks, communications satellites, fiber optic cables, and possible future developments.…

Error-Resilient Unequal Error Protection of Fine Granularity Scalable Video Bitstreams

NASA Astrophysics Data System (ADS)

Cai, Hua; Zeng, Bing; Shen, Guobin; Xiong, Zixiang; Li, Shipeng

2006-12-01

This paper deals with the optimal packet loss protection issue for streaming the fine granularity scalable (FGS) video bitstreams over IP networks. Unlike many other existing protection schemes, we develop an error-resilient unequal error protection (ER-UEP) method that adds redundant information optimally for loss protection and, at the same time, cancels completely the dependency among bitstream after loss recovery. In our ER-UEP method, the FGS enhancement-layer bitstream is first packetized into a group of independent and scalable data packets. Parity packets, which are also scalable, are then generated. Unequal protection is finally achieved by properly shaping the data packets and the parity packets. We present an algorithm that can optimally allocate the rate budget between data packets and parity packets, together with several simplified versions that have lower complexity. Compared with conventional UEP schemes that suffer from bit contamination (caused by the bit dependency within a bitstream), our method guarantees successful decoding of all received bits, thus leading to strong error-resilience (at any fixed channel bandwidth) and high robustness (under varying and/or unclean channel conditions).

Configuration development for ROMENET

NASA Astrophysics Data System (ADS)

Rhue, Lawrence

1989-10-01

A plan prepared by RJO Enterprises and BBN Communications Corporation (BBNCC) for the design of ROMENET, a DDN-like testbed for the Rome Air Development Center (RADC) Wide Area Networks (WAN) laboratory is presented. The ROMENET is intended to provide RADC with the ability to test and evaluate the performance and vulnerability of the Defense Data Network (DDN) technologies in support of specific Major Command programs and activities at RADC. It will also support experimentation with packet switched network technologies and includes facilities to analytically evaluate the performance of the network and its associated equipment and media. In addition, ROMENET will provide a simulation vehicle for controlled interference or jamming into the media for vulnerability assessment. Through interfaces with the RADC Battle Management Laboratory (BML), ROMENET will allow the Air Force to assess the restorative and performance characteristics of the network under stressed conditions. The closed environment of ROMENET makes it ideal for creating and testing routing algorithms and network control protocols.

Performance analysis of signaling protocols on OBS switches

NASA Astrophysics Data System (ADS)

Kirci, Pinar; Zaim, A. Halim

2005-10-01

In this paper, Just-In-Time (JIT), Just-Enough-Time (JET) and Horizon signalling schemes for Optical Burst Switched Networks (OBS) are presented. These signaling schemes run over a core dWDM network and a network architecture based on Optical Burst Switches (OBS) is proposed to support IP, ATM and Burst traffic. In IP and ATM traffic several packets are assembled in a single packet called burst and the burst contention is handled by burst dropping. The burst length distribution in IP traffic is arbitrary between 0 and 1, and is fixed in ATM traffic at 0,5. Burst traffic on the other hand is arbitrary between 1 and 5. The Setup and Setup ack length distributions are arbitrary. We apply the Poisson model with rate λ and Self-Similar model with pareto distribution rate α to identify inter-arrival times in these protocols. We consider a communication between a source client node and a destination client node over an ingress and one or more multiple intermediate switches.We use buffering only in the ingress node. The communication is based on single burst connections in which, the connection is set up just before sending a burst and then closed as soon as the burst is sent. Our analysis accounts for several important parameters, including the burst setup, burst setup ack, keepalive messages and the optical switching protocol. We compare the performance of the three signalling schemes on the network under as burst dropping probability under a range of network scenarios.

Fast WEP-Key Recovery Attack Using Only Encrypted IP Packets

NASA Astrophysics Data System (ADS)

Teramura, Ryoichi; Asakura, Yasuo; Ohigashi, Toshihiro; Kuwakado, Hidenori; Morii, Masakatu

Conventional efficient key recovery attacks against Wired Equivalent Privacy (WEP) require specific initialization vectors or specific packets. Since it takes much time to collect the packets sufficiently, any active attack should be performed. An Intrusion Detection System (IDS), however, will be able to prevent the attack. Since the attack logs are stored at the servers, it is possible to prevent such an attack. This paper proposes an algorithm for recovering a 104-bit WEP key from any IP packets in a realistic environment. This attack needs about 36, 500 packets with a success probability 0.5, and the complexity of our attack is equivalent to about 220 computations of the RC4 key setups. Since our attack is passive, it is difficult for both WEP users and administrators to detect our attack.

Pump-dump iterative squeezing of vibrational wave packets.

PubMed

Chang, Bo Y; Sola, Ignacio R

2005-12-22

The free motion of a nonstationary vibrational wave packet in an electronic potential is a source of interesting quantum properties. In this work we propose an iterative scheme that allows continuous stretching and squeezing of a wave packet in the ground or in an excited electronic state, by switching the wave function between both potentials with pi pulses at certain times. Using a simple model of displaced harmonic oscillators and delta pulses, we derive the analytical solution and the conditions for its possible implementation and optimization in different molecules and electronic states. We show that the main constraining parameter is the pulse bandwidth. Although in principle the degree of squeezing (or stretching) is not bounded, the physical resources increase quadratically with the number of iterations, while the achieved squeezing only increases linearly.

Improved wavelet packet classification algorithm for vibrational intrusions in distributed fiber-optic monitoring systems

NASA Astrophysics Data System (ADS)

Wang, Bingjie; Pi, Shaohua; Sun, Qi; Jia, Bo

2015-05-01

An improved classification algorithm that considers multiscale wavelet packet Shannon entropy is proposed. Decomposition coefficients at all levels are obtained to build the initial Shannon entropy feature vector. After subtracting the Shannon entropy map of the background signal, components of the strongest discriminating power in the initial feature vector are picked out to rebuild the Shannon entropy feature vector, which is transferred to radial basis function (RBF) neural network for classification. Four types of man-made vibrational intrusion signals are recorded based on a modified Sagnac interferometer. The performance of the improved classification algorithm has been evaluated by the classification experiments via RBF neural network under different diffusion coefficients. An 85% classification accuracy rate is achieved, which is higher than the other common algorithms. The classification results show that this improved classification algorithm can be used to classify vibrational intrusion signals in an automatic real-time monitoring system.

Quasi-light storage for optical data packets.

PubMed

Schneider, Thomas; Preußler, Stefan

2014-02-06

Today's telecommunication is based on optical packets which transmit the information in optical fiber networks around the world. Currently, the processing of the signals is done in the electrical domain. Direct storage in the optical domain would avoid the transfer of the packets to the electrical and back to the optical domain in every network node and, therefore, increase the speed and possibly reduce the energy consumption of telecommunications. However, light consists of photons which propagate with the speed of light in vacuum. Thus, the storage of light is a big challenge. There exist some methods to slow down the speed of the light, or to store it in excitations of a medium. However, these methods cannot be used for the storage of optical data packets used in telecommunications networks. Here we show how the time-frequency-coherence, which holds for every signal and therefore for optical packets as well, can be exploited to build an optical memory. We will review the background and show in detail and through examples, how a frequency comb can be used for the copying of an optical packet which enters the memory. One of these time domain copies is then extracted from the memory by a time domain switch. We will show this method for intensity as well as for phase modulated signals.

IP voice over ATM satellite: experimental results over satellite channels

NASA Astrophysics Data System (ADS)

Saraf, Koroush A.; Butts, Norman P.

1999-01-01

IP telephony, a new technology to provide voice communication over traditional data networks, has the potential to revolutionize telephone communication within the modern enterprise. This innovation uses packetization techniques to carry voice conversations over IP networks. This packet switched technology promises new integrated services, and lower cost long-distance communication compared to traditional circuit switched telephone networks. Future satellites will need to carry IP traffic efficiently in order to stay competitive in servicing the global data- networking and global telephony infrastructure. However, the effects of Voice over IP over switched satellite channels have not been investigated in detail. To fully understand the effects of satellite channels on Voice over IP quality; several experiments were conducted at Lockheed Martin Telecommunications' Satellite Integration Lab. The result of those experiments along with suggested improvements for voice communication over satellite are presented in this document. First, a detailed introduction of IP telephony as a suitable technology for voice communication over future satellites is presented. This is followed by procedures for the experiments, along with results and strategies. In conclusion we hope that these capability demonstrations will alleviate any uncertainty regarding the applicability of this technology to satellite networks.

Demonstration of optically controlled data routing with the use of multiple-quantum-well bistable and electro-optical devices.

PubMed

Koppa, P; Chavel, P; Oudar, J L; Kuszelewicz, R; Schnell, J P; Pocholle, J P

1997-08-10

We present experimental results on a 1-to-64-channel free-space photonic switching demonstration system based on GaAs/GaAlAs multiple-quantum-well active device arrays. Two control schemes are demonstrated: data transparent optical self-routing usable in a packet-switching environment and direct optical control with potential signal amplification for circuit switching. The self-routing operation relies on the optical recognition of the binary destination address coded in each packet header. Address decoding is implemented with elementary optical bistable devices and modulator pixels as all-optical latches and electro-optical and gates, respectively. All 60 defect-free channels of the system could be operated one by one, but the simultaneous operation of only three channels could be achieved mainly because of the spatial nonhomogeneities of the devices. Direct-control operation is based on directly setting the bistable device reflectivity with a variable-control beam power. This working mode turned out to be much more tolerant of spatial noises: 37 channels of the system could be operated simultaneously. Further development of the system to a crossbar of N inputs and M outputs and system miniaturization are also considered.

Performance Evaluation and Control of Distributed Computer Communication Networks.

DTIC Science & Technology

1984-09-01

including: L. Clare, L.A. De Moraes, J. Baker, M. Zuckerman, S. Katz, P. Rodrigues, R. Pazos , S. Resheff. Other participants are the following visiting...investigations have been reported in reference (1) and (2) below. References (1) M. Gerla, R. Pazos -Rangel "Bandwidth Allocation and Routing in ISDN’s," IEEE...and efficient methods for its solution are presented. (2) R.A. Pazos -Rangel "Evaluation and Design of Integrated Packet Switching and Circuit Switching

Report of the Defense Science Board Task Force on Defensive Information Operations. 2000 Summer Study. Volume II

DTIC Science & Technology

2001-03-01

distinguishing between attacks and other events such as accidents, system failures, or hacking by thrill-seekers. This challenge is exacerbated by the...and is referred to as Signaling System # 7 ( SS7 ). Commercial Intelligent Network Architecture Switching Signal Point (SSP) Service - Originates...Wireless access point to fixed infrastructure Ut c Signaling Transfer Point (STP) - Packet switch in CCITT#7 Network SP SW SS7 System Data Bases Network

Adaptive Topological Configuration of an Integrated Circuit/Packet-Switched Computer Network.

DTIC Science & Technology

1984-01-01

Gitman et al. [45] state that there are basically two approaches to the integrated network design problem: (1) solve the link/capacity problem for...1972), 1385-1397. 33. Frank, H., and Gitman , I. Economic analysis of integrated voice and data networks: a case study. Proc. of IEEE 66 , 11 (Nov. 1978...1974), 1074-1079. 45. Gitman , I., Hsieh, W., and Occhiogrosso, B. J. Analysis and design of hybrid switching networks. IEEE Trans. on Comm. Com-29

MOLA II Laser Transmitter Calibration and Performance. 1.2

NASA Technical Reports Server (NTRS)

Afzal, Robert S.; Smith, David E. (Technical Monitor)

1997-01-01

The goal of the document is to explain the algorithm for determining the laser output energy from the telemetry data within the return packets from MOLA II. A simple algorithm is developed to convert the raw start detector data into laser energy, measured in millijoules. This conversion is dependent on three variables, start detector counts, array heat sink temperature and start detector temperature. All these values are contained within the return packets. The conversion is applied to the GSFC Thermal Vacuum data as well as the in-space data to date and shows good correlation.

Two-Step Fair Scheduling of Continuous Media Streams over Error-Prone Wireless Channels

NASA Astrophysics Data System (ADS)

Oh, Soohyun; Lee, Jin Wook; Park, Taejoon; Jo, Tae-Chang

In wireless cellular networks, streaming of continuous media (with strict QoS requirements) over wireless links is challenging due to their inherent unreliability characterized by location-dependent, bursty errors. To address this challenge, we present a two-step scheduling algorithm for a base station to provide streaming of continuous media to wireless clients over the error-prone wireless links. The proposed algorithm is capable of minimizing the packet loss rate of individual clients in the presence of error bursts, by transmitting packets in the round-robin manner and also adopting a mechanism for channel prediction and swapping.

SURGNET: An Integrated Surgical Data Transmission System for Telesurgery.

PubMed

Natarajan, Sriram; Ganz, Aura

2009-01-01

Remote surgery information requires quick and reliable transmission between the surgeon and the patient site. However, the networks that interconnect the surgeon and patient sites are usually time varying and lossy which can cause packet loss and delay jitter. In this paper we propose SURGNET, a telesurgery system for which we developed the architecture, algorithms and implemented it on a testbed. The algorithms include adaptive packet prediction and buffer time adjustment techniques which reduce the negative effects caused by the lossy and time varying networks. To evaluate the proposed SURGNET system, at the therapist site, we implemented a therapist panel which controls the force feedback device movements and provides image analysis functionality. At the patient site we controlled a virtual reality applet built in Matlab. The varying network conditions were emulated using NISTNet emulator. Our results show that even for severe packet loss and variable delay jitter, the proposed integrated synchronization techniques significantly improve SURGNET performance.

Glossary of Internet Terms.

ERIC Educational Resources Information Center

Microcomputers for Information Management, 1995

1995-01-01

Provides definitions for 71 terms related to the Internet, including Archie, bulletin board system, cyberspace, e-mail (electronic mail), file transfer protocol, gopher, hypertext, integrated services digital network, local area network, listserv, modem, packet switching, server, telnet, UNIX, WAIS (wide area information servers), and World Wide…

Comparison Between Three Different Types of Routing Algorithms of Network on Chip

NASA Astrophysics Data System (ADS)

Soni, Neetu; Deshmukh, Khemraj

Network on Chip (NoC) is an on-chip communication technology in which a large number of processing elements and storage blocks are integrated on a single chip. Due to scalability, adaptive nature, well resource utilization NoCs have become popular in and has efficiently replaced SoCs. NoCs performance depends mainly on the type of routing algorithm chosen. In this paper three different types of routing algorithms are being compared firstly one is deterministic routing (XY routing algorithm), secondly three partially adaptive routing (West-first, North-last and Negative-first) and two adaptive routing (DyAD, OE) are being compared with respect to Packet Injection Rate (PIR) of load for random traffic pattern for 4 × 4 mesh topology. All these comparison and simulation is done in NOXIM 2.3.1 simulator which is a cycle accurate systemC based simulator. The distribution of packets is Poisson type with Buffer depth (number of buffers) of input channel FIFO is 8. Packet size is taken as 8 bytes. The simulation time is taken 50,000 cycles. We found that XY routing is better when the PIR is low. The partially adaptive routing is good when the PIR is moderate. DyAD routing is suited when the load i.e. PIR is high.

On-board processing architectures for satellite B-ISDN services

NASA Technical Reports Server (NTRS)

Inukai, Thomas; Shyy, Dong-Jye; Faris, Faris

1991-01-01

Onboard baseband processing architectures for future satellite broadband integrated services digital networks (B-ISDN's) are addressed. To assess the feasibility of implementing satellite B-ISDN services, critical design issues, such as B-ISDN traffic characteristics, transmission link design, and a trade-off between onboard circuit and fast packet switching, are analyzed. Examples of the two types of switching mechanisms and potential onboard network control functions are presented. A sample network architecture is also included to illustrate a potential onboard processing system.

On-board processing satellite network architectures for broadband ISDN

NASA Technical Reports Server (NTRS)

Inukai, Thomas; Faris, Faris; Shyy, Dong-Jye

1992-01-01

Onboard baseband processing architectures for future satellite broadband integrated services digital networks (B-ISDN's) are addressed. To assess the feasibility of implementing satellite B-ISDN services, critical design issues, such as B-ISDN traffic characteristics, transmission link design, and a trade-off between onboard circuit and fast packet switching, are analyzed. Examples of the two types of switching mechanisms and potential onboard network control functions are presented. A sample network architecture is also included to illustrate a potential onboard processing system.

On-Line Databases in Mexico.

ERIC Educational Resources Information Center

Molina, Enzo

1986-01-01

Use of online bibliographic databases in Mexico is provided through Servicio de Consulta a Bancos de Informacion, a public service that provides information retrieval, document delivery, translation, technical support, and training services. Technical infrastructure is based on a public packet-switching network and institutional users may receive…

Access to Corporate Information Systems: Datafiles, Classified Documents, and Information Resources.

ERIC Educational Resources Information Center

Baumgartner, Kurt O.; And Others

1988-01-01

Three articles discuss aspects of corporate information systems: (1) "Packet Switching Networks: Worldwide Access to Corporate Datafiles" (Kurt O. Baumgartner); "Classified Documents in the Corporate Library" (Patricia M. Shores); and "From Library to Information Center: Case Studies in the Evolution of Corporate…

A game theory-based obstacle avoidance routing protocol for wireless sensor networks.

PubMed

Guan, Xin; Wu, Huayang; Bi, Shujun

2011-01-01

The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their energy rapidly and the obstacle area is diffused. In this paper, we introduce a novel routing algorithm to solve the obstacle problem in wireless sensor networks based on a game-theory model. Our algorithm forms a concave region that cannot forward packets to achieve the aim of improving the transmission success rate and decreasing packet transmission delays. We consider the residual energy, out-degree and forwarding angle to determine the forwarding probability and payoff function of forwarding candidates. This achieves the aim of load balance and reduces network energy consumption. Simulation results show that based on the average delivery delay, energy consumption and packet delivery ratio performances our protocol is superior to other traditional schemes.

Hybrid Packet-Pheromone-Based Probabilistic Routing for Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Kashkouli Nejad, Keyvan; Shawish, Ahmed; Jiang, Xiaohong; Horiguchi, Susumu

Ad-Hoc networks are collections of mobile nodes communicating using wireless media without any fixed infrastructure. Minimal configuration and quick deployment make Ad-Hoc networks suitable for emergency situations like natural disasters or military conflicts. The current Ad-Hoc networks can only support either high mobility or high transmission rate at a time because they employ static approaches in their routing schemes. However, due to the continuous expansion of the Ad-Hoc network size, node-mobility and transmission rate, the development of new adaptive and dynamic routing schemes has become crucial. In this paper we propose a new routing scheme to support high transmission rates and high node-mobility simultaneously in a big Ad-Hoc network, by combining a new proposed packet-pheromone-based approach with the Hint Based Probabilistic Protocol (HBPP) for congestion avoidance with dynamic path selection in packet forwarding process. Because of using the available feedback information, the proposed algorithm does not introduce any additional overhead. The extensive simulation-based analysis conducted in this paper indicates that the proposed algorithm offers small packet-latency and achieves a significantly higher delivery probability in comparison with the available Hint-Based Probabilistic Protocol (HBPP).

An Underlay Communication Channel for 5G Cognitive Mesh Networks: Packet Design, Implementation, Analysis, and Experimental Results

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tarek Haddadin; Stephen Andrew Laraway; Arslan Majid

This paper proposes and presents the design and implementation of an underlay communication channel (UCC) for 5G cognitive mesh networks. The UCC builds its waveform based on filter bank multicarrier spread spectrum (FB-MCSS) signaling. The use of this novel spread spectrum signaling allows the device-to-device (D2D) user equipments (UEs) to communicate at a level well below noise temperature and hence, minimize taxation on macro-cell/small-cell base stations and their UEs in 5G wireless systems. Moreover, the use of filter banks allows us to avoid those portions of the spectrum that are in use by macro-cell and small-cell users. Hence, both D2D-to-cellularmore » and cellular-to-D2D interference will be very close to none. We propose a specific packet for UCC and develop algorithms for packet detection, timing acquisition and tracking, as well as channel estimation and equalization. We also present the detail of an implementation of the proposed transceiver on a software radio platform and compare our experimental results with those from a theoretical analysis of our packet detection algorithm.« less

Multistage switching hardware and software implementations for student experiment purpose

NASA Astrophysics Data System (ADS)

Sani, A.; Suherman

2018-02-01

Current communication and internet networks are underpinned by the switching technologies that interconnect one network to the others. Students’ understanding on networks rely on how they conver the theories. However, understanding theories without touching the reality may exert spots in the overall knowledge. This paper reports the progress of the multistage switching design and implementation for student laboratory activities. The hardware and software designs are based on three stages clos switching architecture with modular 2x2 switches, controlled by an arduino microcontroller. The designed modules can also be extended for batcher and bayan switch, and working on circuit and packet switching systems. The circuit analysis and simulation show that the blocking probability for each switch combinations can be obtained by generating random or patterned traffics. The mathematic model and simulation analysis shows 16.4% blocking probability differences as the traffic generation is uniform. The circuits design components and interfacing solution have been identified to allow next step implementation.

Optical Circuit Switched Protocol

NASA Technical Reports Server (NTRS)

Monacos, Steve P. (Inventor)

2000-01-01

The present invention is a system and method embodied in an optical circuit switched protocol for the transmission of data through a network. The optical circuit switched protocol is an all-optical circuit switched network and includes novel optical switching nodes for transmitting optical data packets within a network. Each optical switching node comprises a detector for receiving the header, header detection logic for translating the header into routing information and eliminating the header, and a controller for receiving the routing information and configuring an all optical path within the node. The all optical path located within the node is solely an optical path without having electronic storage of the data and without having optical delay of the data. Since electronic storage of the header is not necessary and the initial header is eliminated by the first detector of the first switching node. multiple identical headers are sent throughout the network so that subsequent switching nodes can receive and read the header for setting up an optical data path.

On Maximizing the Throughput of Packet Transmission under Energy Constraints.

PubMed

Wu, Weiwei; Dai, Guangli; Li, Yan; Shan, Feng

2018-06-23

More and more Internet of Things (IoT) wireless devices have been providing ubiquitous services over the recent years. Since most of these devices are powered by batteries, a fundamental trade-off to be addressed is the depleted energy and the achieved data throughput in wireless data transmission. By exploiting the rate-adaptive capacities of wireless devices, most existing works on energy-efficient data transmission try to design rate-adaptive transmission policies to maximize the amount of transmitted data bits under the energy constraints of devices. Such solutions, however, cannot apply to scenarios where data packets have respective deadlines and only integrally transmitted data packets contribute. Thus, this paper introduces a notion of weighted throughput, which measures how much total value of data packets are successfully and integrally transmitted before their own deadlines. By designing efficient rate-adaptive transmission policies, this paper aims to make the best use of the energy and maximize the weighted throughput. What is more challenging but with practical significance, we consider the fading effect of wireless channels in both offline and online scenarios. In the offline scenario, we develop an optimal algorithm that computes the optimal solution in pseudo-polynomial time, which is the best possible solution as the problem undertaken is NP-hard. In the online scenario, we propose an efficient heuristic algorithm based on optimal properties derived for the optimal offline solution. Simulation results validate the efficiency of the proposed algorithm.

Effective bandwidth guaranteed routing schemes for MPLS traffic engineering

NASA Astrophysics Data System (ADS)

Wang, Bin; Jain, Nidhi

2001-07-01

In this work, we present online algorithms for dynamic routing bandwidth guaranteed label switched paths (LSPs) where LSP set-up requests (in terms of a pair of ingress and egress routers as well as its bandwidth requirement) arrive one by one and there is no a priori knowledge regarding future LSP set-up requests. In addition, we consider rerouting of LSPs in this work. Rerouting of LSPs has not been well studied in previous work on LSP routing. The need of LSP rerouting arises in a number of ways: occurrence of faults (link and/or node failures), re-optimization of existing LSPs' routes to accommodate traffic fluctuation, requests with higher priorities, and so on. We formulate the bandwidth guaranteed LSP routing with rerouting capability as a multi-commodity flow problem. The solution to this problem is used as the benchmark for comparing other computationally less costly algorithms studied in this paper. Furthermore, to more efficiently utilize the network resources, we propose online routing algorithms which route bandwidth demands over multiple paths at the ingress router to satisfy the customer requests while providing better service survivability. Traffic splitting and distribution over the multiple paths are carefully handled using table-based hashing schemes while the order of packets within a flow is preserved. Preliminary simulations are conducted to show the performance of different design choices and the effectiveness of the rerouting and multi-path routing algorithms in terms of LSP set-up request rejection probability and bandwidth blocking probability.

Next generation satellite communications networks

NASA Astrophysics Data System (ADS)

Garland, P. J.; Osborne, F. J.; Streibl, I.

The paper introduces two potential uses for new space hardware to permit enhanced levels of signal handling and switching in satellite communication service for Canada. One application involves increased private-sector services in the Ku band; the second supports new personal/mobile services by employing higher levels of handling and switching in the Ka band. First-generation satellite regeneration and switching experiments involving the NASA/ACTS spacecraft are described, where the Ka band and switching satellite network problems are emphasized. Second-generation satellite development is outlined based on demand trends for more packet-based switching, low-cost earth stations, and closed user groups. A demonstration mission for new Ka- and Ku-band technologies is proposed, including the payload configuration. The half ANIK E payload is shown to meet the demonstration objectives, and projected to maintain a fully operational payload for at least 10 years.

Programmable on-chip and off-chip network architecture on demand for flexible optical intra-datacenters.

PubMed

Rofoee, Bijan Rahimzadeh; Zervas, Georgios; Yan, Yan; Amaya, Norberto; Qin, Yixuan; Simeonidou, Dimitra

2013-03-11

The paper presents a novel network architecture on demand approach using on-chip and-off chip implementations, enabling programmable, highly efficient and transparent networking, well suited for intra-datacenter communications. The implemented FPGA-based adaptable line-card with on-chip design along with an architecture on demand (AoD) based off-chip flexible switching node, deliver single chip dual L2-Packet/L1-time shared optical network (TSON) server Network Interface Cards (NIC) interconnected through transparent AoD based switch. It enables hitless adaptation between Ethernet over wavelength switched network (EoWSON), and TSON based sub-wavelength switching, providing flexible bitrates, while meeting strict bandwidth, QoS requirements. The on and off-chip performance results show high throughput (9.86Ethernet, 8.68Gbps TSON), high QoS, as well as hitless switch-over.

The congestion control algorithm based on queue management of each node in mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Wei, Yifei; Chang, Lin; Wang, Yali; Wang, Gaoping

2016-12-01

This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. As the network load increases, local congestion of mobile ad hoc network may lead to network performance degradation, hot node's energy consumption increase even failure. If small energy nodes congested because of forwarding data packets, then when it is used as the source node will cause a lot of packet loss. This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. Controlling nodes buffer queue in different levels of congestion area probability by adjusting the upper limits and lower limits, thus nodes can adjust responsibility of forwarding data packets according to their own situation. The proposed algorithm will slow down the send rate hop by hop along the data package transmission direction from congestion node to source node so that to prevent further congestion from the source node. The simulation results show that, the algorithm can better play the data forwarding ability of strong nodes, protect the weak nodes, can effectively alleviate the network congestion situation.

Advanced Teleprocessing Systems

DTIC Science & Technology

1980-03-31

75 Gitman , I., "On the Capacity of Slotted ALOHA Networks and Some Design Problems," IEEE Transactions on Communications, Vol. COM-23, March 1975, pp...305-317. GITM 76 Gitman , I., R. Van Slyke and H. Frank, "Routing in Packet-Switching Broadcast Radio Networks," IEEE Transactions on Communications

A Telecommunications Primer for College Presidents. Part I. The Technologies Defined. Educational Technology Profile 25.

ERIC Educational Resources Information Center

Smith, Ralph Lee

1978-01-01

Intended for use by presidents, planners, and administrators to acquaint them with developments in electronic communications, this primer describes cable television, common carrier, videotape recorders and videodiscs, satellites, microwave, circuit integration, digital transmission, data packet switching, and fiber optics. (LBH)

Pacific Educational Computer Network Study. Final Report.

ERIC Educational Resources Information Center

Hawaii Univ., Honolulu. ALOHA System.

The Pacific Educational Computer Network Feasibility Study examined technical and non-technical aspects of the formation of an international Pacific Area computer network for higher education. The technical study covered the assessment of the feasibility of a packet-switched satellite and radio ground distribution network for data transmission…

New mode switching algorithm for the JPL 70-meter antenna servo controller

NASA Technical Reports Server (NTRS)

Nickerson, J. A.

1988-01-01

The design of control mode switching algorithms and logic for JPL's 70 m antenna servo controller are described. The old control mode switching logic was reviewed and perturbation problems were identified. Design approaches for mode switching are presented and the final design is described. Simulations used to compare old and new mode switching algorithms and logic show that the new mode switching techniques will significantly reduce perturbation problems.

Dynamical jumping real-time fault-tolerant routing protocol for wireless sensor networks.

PubMed

Wu, Guowei; Lin, Chi; Xia, Feng; Yao, Lin; Zhang, He; Liu, Bing

2010-01-01

In time-critical wireless sensor network (WSN) applications, a high degree of reliability is commonly required. A dynamical jumping real-time fault-tolerant routing protocol (DMRF) is proposed in this paper. Each node utilizes the remaining transmission time of the data packets and the state of the forwarding candidate node set to dynamically choose the next hop. Once node failure, network congestion or void region occurs, the transmission mode will switch to jumping transmission mode, which can reduce the transmission time delay, guaranteeing the data packets to be sent to the destination node within the specified time limit. By using feedback mechanism, each node dynamically adjusts the jumping probabilities to increase the ratio of successful transmission. Simulation results show that DMRF can not only efficiently reduce the effects of failure nodes, congestion and void region, but also yield higher ratio of successful transmission, smaller transmission delay and reduced number of control packets.

An Efficient Next Hop Selection Algorithm for Multi-Hop Body Area Networks

PubMed Central

Ayatollahitafti, Vahid; Ngadi, Md Asri; Mohamad Sharif, Johan bin; Abdullahi, Mohammed

2016-01-01

Body Area Networks (BANs) consist of various sensors which gather patient’s vital signs and deliver them to doctors. One of the most significant challenges faced, is the design of an energy-efficient next hop selection algorithm to satisfy Quality of Service (QoS) requirements for different healthcare applications. In this paper, a novel efficient next hop selection algorithm is proposed in multi-hop BANs. This algorithm uses the minimum hop count and a link cost function jointly in each node to choose the best next hop node. The link cost function includes the residual energy, free buffer size, and the link reliability of the neighboring nodes, which is used to balance the energy consumption and to satisfy QoS requirements in terms of end to end delay and reliability. Extensive simulation experiments were performed to evaluate the efficiency of the proposed algorithm using the NS-2 simulator. Simulation results show that our proposed algorithm provides significant improvement in terms of energy consumption, number of packets forwarded, end to end delay and packet delivery ratio compared to the existing routing protocol. PMID:26771586

Stochastic sampled-data control for synchronization of complex dynamical networks with control packet loss and additive time-varying delays.

PubMed

Rakkiyappan, R; Sakthivel, N; Cao, Jinde

2015-06-01

This study examines the exponential synchronization of complex dynamical networks with control packet loss and additive time-varying delays. Additionally, sampled-data controller with time-varying sampling period is considered and is assumed to switch between m different values in a random way with given probability. Then, a novel Lyapunov-Krasovskii functional (LKF) with triple integral terms is constructed and by using Jensen's inequality and reciprocally convex approach, sufficient conditions under which the dynamical network is exponentially mean-square stable are derived. When applying Jensen's inequality to partition double integral terms in the derivation of linear matrix inequality (LMI) conditions, a new kind of linear combination of positive functions weighted by the inverses of squared convex parameters appears. In order to handle such a combination, an effective method is introduced by extending the lower bound lemma. To design the sampled-data controller, the synchronization error system is represented as a switched system. Based on the derived LMI conditions and average dwell-time method, sufficient conditions for the synchronization of switched error system are derived in terms of LMIs. Finally, numerical example is employed to show the effectiveness of the proposed methods. Copyright © 2015 Elsevier Ltd. All rights reserved.

Research on intelligent algorithm of electro - hydraulic servo control system

NASA Astrophysics Data System (ADS)

Wang, Yannian; Zhao, Yuhui; Liu, Chengtao

2017-09-01

In order to adapt the nonlinear characteristics of the electro-hydraulic servo control system and the influence of complex interference in the industrial field, using a fuzzy PID switching learning algorithm is proposed and a fuzzy PID switching learning controller is designed and applied in the electro-hydraulic servo controller. The designed controller not only combines the advantages of the fuzzy control and PID control, but also introduces the learning algorithm into the switching function, which makes the learning of the three parameters in the switching function can avoid the instability of the system during the switching between the fuzzy control and PID control algorithms. It also makes the switch between these two control algorithm more smoother than that of the conventional fuzzy PID.

Signals of Opportunity Navigation Using Wi-Fi Signals

DTIC Science & Technology

2011-03-24

Identifier . . . . . . . . . . . . . . . . . . . . . . . 54 MVM Mean Value Method . . . . . . . . . . . . . . . . . . . . . 60 SDM Scaled Differential...the mean value ( MVM ) and scaled differential (SDM) methods. An error was logged if the UI 60 correlation algorithm identified a packet index that did...Notable from this graph is that a window of 50 packets appears to provide zero errors for MVM and near zero errors for SDM. Also notable is that a

Uplink Packet-Data Scheduling in DS-CDMA Systems

NASA Astrophysics Data System (ADS)

Choi, Young Woo; Kim, Seong-Lyun

In this letter, we consider the uplink packet scheduling for non-real-time data users in a DS-CDMA system. As an effort to jointly optimize throughput and fairness, we formulate a time-span minimization problem incorporating the time-multiplexing of different simultaneous transmission schemes. Based on simple rules, we propose efficient scheduling algorithms and compare them with the optimal solution obtained by linear programming.

Automatic detection of blood versus non-blood regions on intravascular ultrasound (IVUS) images using wavelet packet signatures

NASA Astrophysics Data System (ADS)

Katouzian, Amin; Baseri, Babak; Konofagou, Elisa E.; Laine, Andrew F.

2008-03-01

Intravascular ultrasound (IVUS) has been proven a reliable imaging modality that is widely employed in cardiac interventional procedures. It can provide morphologic as well as pathologic information on the occluded plaques in the coronary arteries. In this paper, we present a new technique using wavelet packet analysis that differentiates between blood and non-blood regions on the IVUS images. We utilized the multi-channel texture segmentation algorithm based on the discrete wavelet packet frames (DWPF). A k-mean clustering algorithm was deployed to partition the extracted textural features into blood and non-blood in an unsupervised fashion. Finally, the geometric and statistical information of the segmented regions was used to estimate the closest set of pixels to the lumen border and a spline curve was fitted to the set. The presented algorithm may be helpful in delineating the lumen border automatically and more reliably prior to the process of plaque characterization, especially with 40 MHz transducers, where appearance of the red blood cells renders the border detection more challenging, even manually. Experimental results are shown and they are quantitatively compared with manually traced borders by an expert. It is concluded that our two dimensional (2-D) algorithm, which is independent of the cardiac and catheter motions performs well in both in-vivo and in-vitro cases.

Naval Research Logistics Quarterly. Volume 29, Number 3,

DTIC Science & Technology

1982-09-01

proposed for combining voice and data demands over the available channel bandwidth (Coviello and Vena [21, Fischer and Harris (41, Frank and Gitman 151...and Packet Switched Multiplex Structure," IEEE Transactions nn Communications, Com-24, 195-202 (1976). (51 Frank, H. and I. Gitman , "Integrated DOB

Real-Time Communication Systems: Design, Analysis and Implementation

DTIC Science & Technology

1984-07-31

sively [141-[19). A two-hop configuration involving a ring of repeaters around a station has been analyzed by Gitman [20) ; STATION network capacity...control of the packet-switching broadcast channels," J. Ass. Comput Mach., vol. 24, pp. 375-386, July 1977. [201 I. Gitman , "On the capacity of

Online Searching at 9600 Baud.

ERIC Educational Resources Information Center

Scott, Ralph Lee; Scott, Nancy Sue Schell

1991-01-01

Discusses online searching with the new 9600 baud rate and describes test searches on the BRS, Data-Star, LEXIS, and Dow Jones databases through three packet-switching networks: US Sprint, MEADNET, and TYMNET. Hardware and software are described, data communications equipment standards are discussed, and the impact of higher baud rates on pricing…

Simulation of the Impact of Packet Errors on the Kademlia Peer-to-Peer Routing

DTIC Science & Technology

2010-09-01

during the routing process. Pastry [15] switches to a proximity based metric when approaching a node closely. This complicates the implementation...and Peter Druschel. Pastry : Scalable, distributed object location and routing for large-scale peer-to-peer systems. IFIP/ACM International Conference

The ARPANET and DARPA Internet.

ERIC Educational Resources Information Center

Perry, Dennis G.; And Others

1988-01-01

Reviews the development and growth of the ARPANET, a wide-area packet switching network initiated by the U.S. Department of Defense in 1969. Evolution of the ARPANET into the DARPA (Advanced Research Projects Agency) Internet in the 1970s and current uses of the internet are discussed. (16 references) (MES)

Trace gas detection in hyperspectral imagery using the wavelet packet subspace

NASA Astrophysics Data System (ADS)

Salvador, Mark A. Z.

This dissertation describes research into a new remote sensing method to detect trace gases in hyperspectral and ultra-spectral data. This new method is based on the wavelet packet transform. It attempts to improve both the computational tractability and the detection of trace gases in airborne and spaceborne spectral imagery. Atmospheric trace gas research supports various Earth science disciplines to include climatology, vulcanology, pollution monitoring, natural disasters, and intelligence and military applications. Hyperspectral and ultra-spectral data significantly increases the data glut of existing Earth science data sets. Spaceborne spectral data in particular significantly increases spectral resolution while performing daily global collections of the earth. Application of the wavelet packet transform to the spectral space of hyperspectral and ultra-spectral imagery data potentially improves remote sensing detection algorithms. It also facilities the parallelization of these methods for high performance computing. This research seeks two science goals, (1) developing a new spectral imagery detection algorithm, and (2) facilitating the parallelization of trace gas detection in spectral imagery data.

A packet data compressor

NASA Technical Reports Server (NTRS)

Grunes, Mitchell R.; Choi, Junho

1995-01-01

We are in the preliminary stages of creating an operational system for losslessly compressing packet data streams. The end goal is to reduce costs. Real world constraints include transmission in the presence of error, tradeoffs between the costs of compression and the costs of transmission and storage, and imperfect knowledge of the data streams to be transmitted. The overall method is to bring together packets of similar type, split the data into bit fields, and test a large number of compression algorithms. Preliminary results are very encouraging, typically offering compression factors substantially higher than those obtained with simpler generic byte stream compressors, such as Unix Compress and HA 0.98.

Rejection of the maternal electrocardiogram in the electrohysterogram signal.

PubMed

Leman, H; Marque, C

2000-08-01

The electrohysterogram (EHG) signal is mainly corrupted by the mother's electrocardiogram (ECG), which remains present despite analog filtering during acquisition. Wavelets are a powerful denoising tool and have already proved their efficiency on the EHG. In this paper, we propose a new method that employs the redundant wavelet packet transform. We first study wavelet packet coefficient histograms and propose an algorithm to automatically detect the histogram mode number. Using a new criterion, we compute a best basis adapted to the denoising. After EHG wavelet packet coefficient thresholding in the selected basis, the inverse transform is applied. The ECG seems to be very efficiently removed.

Multi-channel distributed coordinated function over single radio in wireless sensor networks.

PubMed

Campbell, Carlene E-A; Loo, Kok-Keong Jonathan; Gemikonakli, Orhan; Khan, Shafiullah; Singh, Dhananjay

2011-01-01

Multi-channel assignments are becoming the solution of choice to improve performance in single radio for wireless networks. Multi-channel allows wireless networks to assign different channels to different nodes in real-time transmission. In this paper, we propose a new approach, Multi-channel Distributed Coordinated Function (MC-DCF) which takes advantage of multi-channel assignment. The backoff algorithm of the IEEE 802.11 distributed coordination function (DCF) was modified to invoke channel switching, based on threshold criteria in order to improve the overall throughput for wireless sensor networks (WSNs) over 802.11 networks. We presented simulation experiments in order to investigate the characteristics of multi-channel communication in wireless sensor networks using an NS2 platform. Nodes only use a single radio and perform channel switching only after specified threshold is reached. Single radio can only work on one channel at any given time. All nodes initiate constant bit rate streams towards the receiving nodes. In this work, we studied the impact of non-overlapping channels in the 2.4 frequency band on: constant bit rate (CBR) streams, node density, source nodes sending data directly to sink and signal strength by varying distances between the sensor nodes and operating frequencies of the radios with different data rates. We showed that multi-channel enhancement using our proposed algorithm provides significant improvement in terms of throughput, packet delivery ratio and delay. This technique can be considered for WSNs future use in 802.11 networks especially when the IEEE 802.11n becomes popular thereby may prevent the 802.15.4 network from operating effectively in the 2.4 GHz frequency band.

Multi-Channel Distributed Coordinated Function over Single Radio in Wireless Sensor Networks

PubMed Central

Campbell, Carlene E.-A.; Loo, Kok-Keong (Jonathan); Gemikonakli, Orhan; Khan, Shafiullah; Singh, Dhananjay

2011-01-01

Multi-channel assignments are becoming the solution of choice to improve performance in single radio for wireless networks. Multi-channel allows wireless networks to assign different channels to different nodes in real-time transmission. In this paper, we propose a new approach, Multi-channel Distributed Coordinated Function (MC-DCF) which takes advantage of multi-channel assignment. The backoff algorithm of the IEEE 802.11 distributed coordination function (DCF) was modified to invoke channel switching, based on threshold criteria in order to improve the overall throughput for wireless sensor networks (WSNs) over 802.11 networks. We presented simulation experiments in order to investigate the characteristics of multi-channel communication in wireless sensor networks using an NS2 platform. Nodes only use a single radio and perform channel switching only after specified threshold is reached. Single radio can only work on one channel at any given time. All nodes initiate constant bit rate streams towards the receiving nodes. In this work, we studied the impact of non-overlapping channels in the 2.4 frequency band on: constant bit rate (CBR) streams, node density, source nodes sending data directly to sink and signal strength by varying distances between the sensor nodes and operating frequencies of the radios with different data rates. We showed that multi-channel enhancement using our proposed algorithm provides significant improvement in terms of throughput, packet delivery ratio and delay. This technique can be considered for WSNs future use in 802.11 networks especially when the IEEE 802.11n becomes popular thereby may prevent the 802.15.4 network from operating effectively in the 2.4 GHz frequency band. PMID:22346614

Estimating Angle-of-Arrival and Time-of-Flight for Multipath Components Using WiFi Channel State Information.

PubMed

Ahmed, Afaz Uddin; Arablouei, Reza; Hoog, Frank de; Kusy, Branislav; Jurdak, Raja; Bergmann, Neil

2018-05-29

Channel state information (CSI) collected during WiFi packet transmissions can be used for localization of commodity WiFi devices in indoor environments with multipath propagation. To this end, the angle of arrival (AoA) and time of flight (ToF) for all dominant multipath components need to be estimated. A two-dimensional (2D) version of the multiple signal classification (MUSIC) algorithm has been shown to solve this problem using 2D grid search, which is computationally expensive and is therefore not suited for real-time localisation. In this paper, we propose using a modified matrix pencil (MMP) algorithm instead. Specifically, we show that the AoA and ToF estimates can be found independently of each other using the one-dimensional (1D) MMP algorithm and the results can be accurately paired to obtain the AoA⁻ToF pairs for all multipath components. Thus, the 2D estimation problem reduces to running 1D estimation multiple times, substantially reducing the computational complexity. We identify and resolve the problem of degenerate performance when two or more multipath components have the same AoA. In addition, we propose a packet aggregation model that uses the CSI data from multiple packets to improve the performance under noisy conditions. Simulation results show that our algorithm achieves two orders of magnitude reduction in the computational time over the 2D MUSIC algorithm while achieving similar accuracy. High accuracy and low computation complexity of our approach make it suitable for applications that require location estimation to run on resource-constrained embedded devices in real time.

Comparison between wavelet and wavelet packet transform features for classification of faults in distribution system

NASA Astrophysics Data System (ADS)

Arvind, Pratul

2012-11-01

The ability to identify and classify all ten types of faults in a distribution system is an important task for protection engineers. Unlike transmission system, distribution systems have a complex configuration and are subjected to frequent faults. In the present work, an algorithm has been developed for identifying all ten types of faults in a distribution system by collecting current samples at the substation end. The samples are subjected to wavelet packet transform and artificial neural network in order to yield better classification results. A comparison of results between wavelet transform and wavelet packet transform is also presented thereby justifying the feature extracted from wavelet packet transform yields promising results. It should also be noted that current samples are collected after simulating a 25kv distribution system in PSCAD software.

Designing Two-Layer Optical Networks with Statistical Multiplexing

NASA Astrophysics Data System (ADS)

Addis, B.; Capone, A.; Carello, G.; Malucelli, F.; Fumagalli, M.; Pedrin Elli, E.

The possibility of adding multi-protocol label switching (MPLS) support to transport networks is considered an important opportunity by telecom carriers that want to add packet services and applications to their networks. However, the question that arises is whether it is suitable to have MPLS nodes just at the edge of the network to collect packet traffic from users, or also to introduce MPLS facilities on a subset of the core nodes in order to exploit packet switching flexibility and multiplexing, thus providing induction of a better bandwidth allocation. In this article, we address this complex decisional problem with the support of a mathematical programming approach. We consider two-layer networks where MPLS is overlaid on top of transport networks-synchronous digital hierarchy (SDH) or wavelength division multiplexing (WDM)-depending on the required link speed. The discussions' decisions take into account the trade-off between the cost of adding MPLS support in the core nodes and the savings in the link bandwidth allocation due to the statistical multiplexing and the traffic grooming effects induced by MPLS nodes. The traffic matrix specifies for each point-to-point request a pair of values: a mean traffic value and an additional one. Using this traffic model, the effect of statistical multiplexing on a link allows the allocation of a capacity equal to the sum of all the mean values of the traffic demands routed on the link and only the highest additional one. The proposed approach is suitable to solve real instances in reasonable time.

Performance Tradeoffs and Hierarchical Designs of Distributed Packet-Switching Communication Networks,

DTIC Science & Technology

1979-09-01

the traffic is ecenl\\ divided between groups. Gitman 1141 introduced Such a scheme and calculated the capaciy of two-level systems, lie assumed all...447-448. April 1976. 25 (141 Gitman , ., "On the Capacity of Slotted ALOH1A Networks and Sonic Design Problems," IEEE Transactions on Communicatons

Evaluation of multicast schemes in optical burst-switched networks: the case with dynamic sessions

NASA Astrophysics Data System (ADS)

Jeong, Myoungki; Qiao, Chunming; Xiong, Yijun; Vandenhoute, Marc

2000-10-01

In this paper, we evaluate the performance of several multicast schemes in optical burst-switched WDM networks taking into accounts the overheads due to control packets and guard bands (Gbs) of bursts on separate channels (wavelengths). A straightforward scheme is called Separate Multicasting (S-MCAST) where each source node constructs separate bursts for its multicast (per each multicast session) and unicast traffic. To reduce the overhead due to Gbs (and control packets), one may piggyback the multicast traffic in bursts containing unicast traffic using a scheme called Multiple Unicasting (M-UCAST). The third scheme is called Tree-Shared Multicasting (TS-MCAST) wehreby multicast traffic belonging to multiple multicast sesions can be mixed together in a burst, which is delivered via a shared multicast tree. In [1], we have evaluated several multicast schemes with static sessions at the flow level. In this paper, we perform a simple analysis for the multicast schemes and evaluate the performance of three multicast schemes, focusing on the case with dynamic sessions in terms of the link utilization, bandwidth consumption, blocking (loss) probability, goodput and the processing loads.

Digital optical processing of optical communications: towards an Optical Turing Machine

NASA Astrophysics Data System (ADS)

Touch, Joe; Cao, Yinwen; Ziyadi, Morteza; Almaiman, Ahmed; Mohajerin-Ariaei, Amirhossein; Willner, Alan E.

2017-01-01

Optical computing is needed to support Tb/s in-network processing in a way that unifies communication and computation using a single data representation that supports in-transit network packet processing, security, and big data filtering. Support for optical computation of this sort requires leveraging the native properties of optical wave mixing to enable computation and switching for programmability. As a consequence, data must be encoded digitally as phase (M-PSK), semantics-preserving regeneration is the key to high-order computation, and data processing at Tb/s rates requires mixing. Experiments have demonstrated viable approaches to phase squeezing and power restoration. This work led our team to develop the first serial, optical Internet hop-count decrement, and to design and simulate optical circuits for calculating the Internet checksum and multiplexing Internet packets. The current exploration focuses on limited-lookback computational models to reduce the need for permanent storage and hybrid nanophotonic circuits that combine phase-aligned comb sources, non-linear mixing, and switching on the same substrate to avoid the macroscopic effects that hamper benchtop prototypes.

IDMA: improving the defense against malicious attack for mobile ad hoc networks based on ARIP protocol

NASA Astrophysics Data System (ADS)

Peng, Chaorong; Chen, Chang Wen

2008-04-01

Malicious nodes are mounting increasingly sophisticated attacking operations on the Mobile Ad Hoc Networks (MANETs). This is mainly because the IP-based MANETs are vulnerable to attacks by various malicious nodes. However, the defense against malicious attack can be improved when a new layer of network architecture can be developed to separate true IP address from disclosing to the malicious nodes. In this paper, we propose a new algorithm to improve the defense against malicious attack (IDMA) that is based on a recently developed Assignment Router Identify Protocol (ARIP) for the clustering-based MANET management. In the ARIP protocol, we design the ARIP architecture based on the new Identity instead of the vulnerable IP addresses to provide the required security that is embedded seamlessly into the overall network architecture. We make full use of ARIP's special property to monitor gateway forward packets by Reply Request Route Packets (RREP) without additional intrusion detection layer. We name this new algorithm IDMA because of its inherent capability to improve the defense against malicious attacks. Through IDMA, a watching algorithm can be established so as to counterattack the malicious node in the routing path when it unusually drops up packets. We provide analysis examples for IDMA for the defense against a malicious node that disrupts the route discovery by impersonating the destination, or by responding with state of corrupted routing information, or by disseminating forged control traffic. The IDMA algorithm is able to counterattack the malicious node in the cases when the node lunch DoS attack by broadcast a large number of route requests, or make Target traffic congestion by delivering huge mount of data; or spoof the IP addresses and send forge packets with a fake ID to the same Target causing traffic congestion at that destination. We have implemented IDMA algorism using the GloMoSim simulator and have demonstrated its performance under a variety of operational conditions.

Modeling of video traffic in packet networks, low rate video compression, and the development of a lossy+lossless image compression algorithm

NASA Technical Reports Server (NTRS)

Sayood, K.; Chen, Y. C.; Wang, X.

1992-01-01

During this reporting period we have worked on three somewhat different problems. These are modeling of video traffic in packet networks, low rate video compression, and the development of a lossy + lossless image compression algorithm, which might have some application in browsing algorithms. The lossy + lossless scheme is an extension of work previously done under this grant. It provides a simple technique for incorporating browsing capability. The low rate coding scheme is also a simple variation on the standard discrete cosine transform (DCT) coding approach. In spite of its simplicity, the approach provides surprisingly high quality reconstructions. The modeling approach is borrowed from the speech recognition literature, and seems to be promising in that it provides a simple way of obtaining an idea about the second order behavior of a particular coding scheme. Details about these are presented.

Design and implementation considerations of a MSAT packet data network

NASA Technical Reports Server (NTRS)

Karam, Fouad G.; Hearn, Terry; Rohr, Doug; Guibord, Arthur F.

1993-01-01

The Mobile Data System, which is intended to provide for packet switched data services is currently under development. The system is based on a star network topology consisting of a centralized Data Hub (DH) serving a large number of mobile terminals. Through the Data Hub, end-to-end connections can be established between terrestrial users on public or private data networks and mobile users. The MDS network will be capable of offering a variety of services some of which are based on the standard X.25 network interface protocol, and others optimized for short messages and broadcast messages. A description of these services and the trade-offs in the DH design are presented.

From Signature-Based Towards Behaviour-Based Anomaly Detection (Extended Abstract)

DTIC Science & Technology

2010-11-01

data acquisition can serve as sensors. De- facto standard for IP flow monitoring is NetFlow format. Although NetFlow was originally developed by Cisco...packets with some common properties that pass through a network device. These collected flows are exported to an external device, the NetFlow ...Thanks to the network-based approach using NetFlow data, the detection algorithm is host independent and highly scalable. Deep Packet Inspection

Identification of speech transients using variable frame rate analysis and wavelet packets.

PubMed

Rasetshwane, Daniel M; Boston, J Robert; Li, Ching-Chung

2006-01-01

Speech transients are important cues for identifying and discriminating speech sounds. Yoo et al. and Tantibundhit et al. were successful in identifying speech transients and, emphasizing them, improving the intelligibility of speech in noise. However, their methods are computationally intensive and unsuitable for real-time applications. This paper presents a method to identify and emphasize speech transients that combines subband decomposition by the wavelet packet transform with variable frame rate (VFR) analysis and unvoiced consonant detection. The VFR analysis is applied to each wavelet packet to define a transitivity function that describes the extent to which the wavelet coefficients of that packet are changing. Unvoiced consonant detection is used to identify unvoiced consonant intervals and the transitivity function is amplified during these intervals. The wavelet coefficients are multiplied by the transitivity function for that packet, amplifying the coefficients localized at times when they are changing and attenuating coefficients at times when they are steady. Inverse transform of the modified wavelet packet coefficients produces a signal corresponding to speech transients similar to the transients identified by Yoo et al. and Tantibundhit et al. A preliminary implementation of the algorithm runs more efficiently.

Research on the feature extraction and pattern recognition of the distributed optical fiber sensing signal

NASA Astrophysics Data System (ADS)

Wang, Bingjie; Sun, Qi; Pi, Shaohua; Wu, Hongyan

2014-09-01

In this paper, feature extraction and pattern recognition of the distributed optical fiber sensing signal have been studied. We adopt Mel-Frequency Cepstral Coefficient (MFCC) feature extraction, wavelet packet energy feature extraction and wavelet packet Shannon entropy feature extraction methods to obtain sensing signals (such as speak, wind, thunder and rain signals, etc.) characteristic vectors respectively, and then perform pattern recognition via RBF neural network. Performances of these three feature extraction methods are compared according to the results. We choose MFCC characteristic vector to be 12-dimensional. For wavelet packet feature extraction, signals are decomposed into six layers by Daubechies wavelet packet transform, in which 64 frequency constituents as characteristic vector are respectively extracted. In the process of pattern recognition, the value of diffusion coefficient is introduced to increase the recognition accuracy, while keeping the samples for testing algorithm the same. Recognition results show that wavelet packet Shannon entropy feature extraction method yields the best recognition accuracy which is up to 97%; the performance of 12-dimensional MFCC feature extraction method is less satisfactory; the performance of wavelet packet energy feature extraction method is the worst.

Parallel Algorithms for Switching Edges in Heterogeneous Graphs.

PubMed

Bhuiyan, Hasanuzzaman; Khan, Maleq; Chen, Jiangzhuo; Marathe, Madhav

2017-06-01

An edge switch is an operation on a graph (or network) where two edges are selected randomly and one of their end vertices are swapped with each other. Edge switch operations have important applications in graph theory and network analysis, such as in generating random networks with a given degree sequence, modeling and analyzing dynamic networks, and in studying various dynamic phenomena over a network. The recent growth of real-world networks motivates the need for efficient parallel algorithms. The dependencies among successive edge switch operations and the requirement to keep the graph simple (i.e., no self-loops or parallel edges) as the edges are switched lead to significant challenges in designing a parallel algorithm. Addressing these challenges requires complex synchronization and communication among the processors leading to difficulties in achieving a good speedup by parallelization. In this paper, we present distributed memory parallel algorithms for switching edges in massive networks. These algorithms provide good speedup and scale well to a large number of processors. A harmonic mean speedup of 73.25 is achieved on eight different networks with 1024 processors. One of the steps in our edge switch algorithms requires the computation of multinomial random variables in parallel. This paper presents the first non-trivial parallel algorithm for the problem, achieving a speedup of 925 using 1024 processors.

Parallel Algorithms for Switching Edges in Heterogeneous Graphs☆

PubMed Central

Khan, Maleq; Chen, Jiangzhuo; Marathe, Madhav

2017-01-01

An edge switch is an operation on a graph (or network) where two edges are selected randomly and one of their end vertices are swapped with each other. Edge switch operations have important applications in graph theory and network analysis, such as in generating random networks with a given degree sequence, modeling and analyzing dynamic networks, and in studying various dynamic phenomena over a network. The recent growth of real-world networks motivates the need for efficient parallel algorithms. The dependencies among successive edge switch operations and the requirement to keep the graph simple (i.e., no self-loops or parallel edges) as the edges are switched lead to significant challenges in designing a parallel algorithm. Addressing these challenges requires complex synchronization and communication among the processors leading to difficulties in achieving a good speedup by parallelization. In this paper, we present distributed memory parallel algorithms for switching edges in massive networks. These algorithms provide good speedup and scale well to a large number of processors. A harmonic mean speedup of 73.25 is achieved on eight different networks with 1024 processors. One of the steps in our edge switch algorithms requires the computation of multinomial random variables in parallel. This paper presents the first non-trivial parallel algorithm for the problem, achieving a speedup of 925 using 1024 processors. PMID:28757680

Research and development of a NYNEX switched multi-megabit data service prototype system

NASA Astrophysics Data System (ADS)

Maman, K. H.; Haines, Robert; Chatterjee, Samir

1991-02-01

Switched Multi-megabit Data Service (SMDS) is a proposed high-speed packet-switched service which will support broadband applications such as Local Area Network (LAN) interconnections across a metropolitan area and beyond. This service is designed to take advantage of evolving Metropolitan Area Network (MAN) standards and technology which will provide customers with 45-mbps and 1 . 5-mbps access to high-speed public data communications networks. This paper will briefly discuss SMDS and review its architecture including the Subscriber Network Interface (SNI) and the SMDS Interface Protocol (SIP). It will review the fundamental features of SMDS such as address screening addressing scheme and access classes. Then it will describe the SMDS prototype system developed in-house by NYNEX Science Technology.

Integrated SeismoGeodetic Systsem with High-Resolution, Real-Time GNSS and Accelerometer Observation For Earthquake Early Warning Application.

NASA Astrophysics Data System (ADS)

Passmore, P. R.; Jackson, M.; Zimakov, L. G.; Raczka, J.; Davidson, P.

2014-12-01

The key requirements for Earthquake Early Warning and other Rapid Event Notification Systems are: Quick delivery of digital data from a field station to the acquisition and processing center; Data integrity for real-time earthquake notification in order to provide warning prior to significant ground shaking in the given target area. These two requirements are met in the recently developed Trimble SG160-09 SeismoGeodetic System, which integrates both GNSS and acceleration measurements using the Kalman filter algorithm to create a new high-rate (200 sps), real-time displacement with sufficient accuracy and very low latency for rapid delivery of the acquired data to a processing center. The data acquisition algorithm in the SG160-09 System provides output of both acceleration and displacement digital data with 0.2 sec delay. This is a significant reduction in the time interval required for real-time transmission compared to data delivery algorithms available in digitizers currently used in other Earthquake Early Warning networks. Both acceleration and displacement data are recorded and transmitted to the processing site in a specially developed Multiplexed Recording Format (MRF) that minimizes the bandwidth required for real-time data transmission. In addition, a built in algorithm calculates the τc and Pd once the event is declared. The SG160-09 System keeps track of what data has not been acknowledged and re-transmits the data giving priority to current data. Modified REF TEK Protocol Daemon (RTPD) receives the digital data and acknowledges data received without error. It forwards this "good" data to processing clients of various real-time data processing software including Earthworm and SeisComP3. The processing clients cache packets when a data gap occurs due to a dropped packet or network outage. The cache packet time is settable, but should not exceed 0.5 sec in the Earthquake Early Warning network configuration. The rapid data transmission algorithm was tested with different communication media, including Internet, DSL, Wi-Fi, GPRS, etc. The test results show that the data latency via most communication media do not exceed 0.5 sec nominal from a first sample in the data packet. Detailed acquisition algorithm and results of data transmission via different communication media are presented.

A machine-learning approach for damage detection in aircraft structures using self-powered sensor data

NASA Astrophysics Data System (ADS)

Salehi, Hadi; Das, Saptarshi; Chakrabartty, Shantanu; Biswas, Subir; Burgueño, Rigoberto

2017-04-01

This study proposes a novel strategy for damage identification in aircraft structures. The strategy was evaluated based on the simulation of the binary data generated from self-powered wireless sensors employing a pulse switching architecture. The energy-aware pulse switching communication protocol uses single pulses instead of multi-bit packets for information delivery resulting in discrete binary data. A system employing this energy-efficient technology requires dealing with time-delayed binary data due to the management of power budgets for sensing and communication. This paper presents an intelligent machine-learning framework based on combination of the low-rank matrix decomposition and pattern recognition (PR) methods. Further, data fusion is employed as part of the machine-learning framework to take into account the effect of data time delay on its interpretation. Simulated time-delayed binary data from self-powered sensors was used to determine damage indicator variables. Performance and accuracy of the damage detection strategy was examined and tested for the case of an aircraft horizontal stabilizer. Damage states were simulated on a finite element model by reducing stiffness in a region of the stabilizer's skin. The proposed strategy shows satisfactory performance to identify the presence and location of the damage, even with noisy and incomplete data. It is concluded that PR is a promising machine-learning algorithm for damage detection for time-delayed binary data from novel self-powered wireless sensors.

Anderson localization and Mott insulator phase in the time domain

PubMed Central

Sacha, Krzysztof

2015-01-01

Particles in space periodic potentials constitute standard models for investigation of crystalline phenomena in solid state physics. Time periodicity of periodically driven systems is a close analogue of space periodicity of solid state crystals. There is an intriguing question if solid state phenomena can be observed in the time domain. Here we show that wave-packets localized on resonant classical trajectories of periodically driven systems are ideal elements to realize Anderson localization or Mott insulator phase in the time domain. Uniform superpositions of the wave-packets form stationary states of a periodically driven particle. However, an additional perturbation that fluctuates in time results in disorder in time and Anderson localization effects emerge. Switching to many-particle systems we observe that depending on how strong particle interactions are, stationary states can be Bose-Einstein condensates or single Fock states where definite numbers of particles occupy the periodically evolving wave-packets. Our study shows that non-trivial crystal-like phenomena can be observed in the time domain. PMID:26074169

Coherent structural trapping through wave packet dispersion during photoinduced spin state switching

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lemke, Henrik T.; Kjær, Kasper S.; Hartsock, Robert

The description of ultrafast nonadiabatic chemical dynamics during molecular photo-transformations remains challenging because electronic and nuclear configurations impact each other and cannot be treated independently. Here we gain experimental insights, beyond the Born–Oppenheimer approximation, into the light-induced spin-state trapping dynamics of the prototypical [Fe(bpy)3]2+ compound by time-resolved X-ray absorption spectroscopy at sub-30-femtosecond resolution and high signal-to-noise ratio. The electronic decay from the initial optically excited electronic state towards the high spin state is distinguished from the structural trapping dynamics, which launches a coherent oscillating wave packet (265 fs period), clearly identified as molecular breathing. Throughout the structural trapping, the dispersionmore » of the wave packet along the reaction coordinate reveals details of intramolecular vibronic coupling before a slower vibrational energy dissipation to the solution environment. These findings illustrate how modern time-resolved X-ray absorption spectroscopy can provide key information to unravel dynamic details of photo-functional molecules.« less

Coherent structural trapping through wave packet dispersion during photoinduced spin state switching

DOE PAGES

Lemke, Henrik T.; Kjær, Kasper S.; Hartsock, Robert; ...

2017-05-24

The description of ultrafast nonadiabatic chemical dynamics during molecular photo-transformations remains challenging because electronic and nuclear configurations impact each other and cannot be treated independently. Here we gain experimental insights, beyond the Born–Oppenheimer approximation, into the light-induced spin-state trapping dynamics of the prototypical [Fe(bpy)3]2+ compound by time-resolved X-ray absorption spectroscopy at sub-30-femtosecond resolution and high signal-to-noise ratio. The electronic decay from the initial optically excited electronic state towards the high spin state is distinguished from the structural trapping dynamics, which launches a coherent oscillating wave packet (265 fs period), clearly identified as molecular breathing. Throughout the structural trapping, the dispersionmore » of the wave packet along the reaction coordinate reveals details of intramolecular vibronic coupling before a slower vibrational energy dissipation to the solution environment. These findings illustrate how modern time-resolved X-ray absorption spectroscopy can provide key information to unravel dynamic details of photo-functional molecules.« less

Coherent structural trapping through wave packet dispersion during photoinduced spin state switching

NASA Astrophysics Data System (ADS)

Lemke, Henrik T.; Kjær, Kasper S.; Hartsock, Robert; van Driel, Tim B.; Chollet, Matthieu; Glownia, James M.; Song, Sanghoon; Zhu, Diling; Pace, Elisabetta; Matar, Samir F.; Nielsen, Martin M.; Benfatto, Maurizio; Gaffney, Kelly J.; Collet, Eric; Cammarata, Marco

2017-05-01

The description of ultrafast nonadiabatic chemical dynamics during molecular photo-transformations remains challenging because electronic and nuclear configurations impact each other and cannot be treated independently. Here we gain experimental insights, beyond the Born-Oppenheimer approximation, into the light-induced spin-state trapping dynamics of the prototypical [Fe(bpy)3]2+ compound by time-resolved X-ray absorption spectroscopy at sub-30-femtosecond resolution and high signal-to-noise ratio. The electronic decay from the initial optically excited electronic state towards the high spin state is distinguished from the structural trapping dynamics, which launches a coherent oscillating wave packet (265 fs period), clearly identified as molecular breathing. Throughout the structural trapping, the dispersion of the wave packet along the reaction coordinate reveals details of intramolecular vibronic coupling before a slower vibrational energy dissipation to the solution environment. These findings illustrate how modern time-resolved X-ray absorption spectroscopy can provide key information to unravel dynamic details of photo-functional molecules.

Gigabit ATM: another technical mistake?

NASA Astrophysics Data System (ADS)

Christ, Paul

1998-09-01

Once upon a time, or more precisely during February 1988 at the CCITT Seoul plenary, and definitely arriving as a revolution, ATM hit the hard-core B-ISDN circuit-switching gang. Initiated by the Telecoms' camp, but, surprisingly, soon to be pushed by computer minded people, ATM's generic technological history is somewhat richer than single-sided stories. Here are two classical elements of that history: Firstly, together with X.25, ATM suffers from the connection versus datagram dichotomy, well known for more than twenty years. Secondly, and lesser known, ATM's use of cells in support of the 'I' of B-ISDN was questioned from the very beginning by the packet switching camp. Furthermore, in this context, there are two other essential elements to be considered: Firstly, the exponential growth of the Internet and later intranets, using Internet technology, sparked by the success of the Web and the WINTEL alliance, resulted in a corresponding demand for both aggregate and end-system network bandwidth. Secondly, servers, historically restricted to the exclusive club of HIPPI-equipped supercomputers, suddenly become ordinary high-end PCs with 64-bit wide PCI busses -- definitely aiming at the Gigabit. Here, if your aim is for Gigabit ATM with 5000-transactions per second classical supercomputers, a 65K ATM MTU -- as implemented by Cray -- might be okay. Following Clark and others, another part of the story is the adoption and redefinition, by the IETF, of the Telecoms' notion of 'Integrated Services' and QoS mechanisms. The quest for low-delay IP packet forwarding, perhaps possible over ATM cut-throughs, has resulted in the switching versus/or integrated-with-routing movement. However, a blow for ATM may be the recent results concerning fast routing table lookup algorithms. This, by making Gigabit routing possible using ordinary Pentium processors may eventually render the much prophesized ATM switching performance unnecessary. Recently, with the rise of Gigabit Ethernet, many of the elements mentioned above are now being presented by standard 'Gigabit Ethernet and Gigabit ATM -- friends or foes' conferences. In- depth analyses are given concerning the canonical elements of such a setting: legacy, new use requirements, manageability, security LAN-WAN, architectures, standards, technologies and products, complexity, evolution-transition strategies, manufacturers, player organizations etc. Often in such conferences, Fiber Channel, being one of Gigabit Ethernet's physical media, is presented as the only other Gigabit LAN technology. In an attempt to sum up: Given the present state of ATM deployment measured in terms of functionalities and sophistication, after ten years of CCCITT/ITU and almost as many years of ATM Forum effort, does the question still being asked now represent the answer -- ATM is or was a mistake there some elements still missing? Here's a technical and a political example:

Characterization of Extremely Lightweight Intrusion Detection (ELIDe) Power Utilization with Varying Throughput and Payload Sizes

DTIC Science & Technology

2015-09-01

Extremely Lightweight Intrusion Detection (ELIDe) algorithm on an Android -based mobile device. Our results show that the hashing and inner product...approximately 2.5 megabits per second (assuming a normal distribution of packet sizes) with no significant packet loss. 15. SUBJECT TERMS ELIDe, Android , pcap...system (OS). To run ELIDe, the current version was ported for use on Android .4 2.1 Mobile Device After ELIDe was ported to the Android mobile

Implementation of a system to provide mobile satellite services in North America

NASA Technical Reports Server (NTRS)

Johanson, Gary A.; Davies, N. George; Tisdale, William R. H.

1993-01-01

This paper describes the implementation of the ground network to support Mobile Satellite Services (MSS). The system is designed to take advantage of a powerful new satellite series and provides significant improvements in capacity and throughput over systems in service today. The system is described in terms of the services provided and the system architecture being implemented to deliver those services. The system operation is described including examples of a circuit switched and packet switched call placement. The physical architecture is presented showing the major hardware components and software functionality placement within the hardware.

Analysis of Cisco Open Network Environment (ONE) OpenFlow Controller Implementation

DTIC Science & Technology

2014-08-01

Software - Defined Networking ( SDN ), when fully realized, offer many improvements over the current rigid and...functionalities like handshake, connection setup, switch management, and security. 15. SUBJECT TERMS OpenFlow, software - defined networking , Cisco ONE, SDN ...innovating packet-forwarding technologies. Network device roles are strictly defined with little or no flexibility. In Software - Defined Networks ( SDNs ),

The Use of Austpac at Deakin University for Distance Education. Computer Communications Working Group Report No. 1.

ERIC Educational Resources Information Center

Castro, Angela; Stirzaker, Lee

This paper discusses Australia's two packet-switching networks, AUSTPAC and MIDAS, which are used for data transmissions with other computers located within Australia or between overseas destinations. Although the facilities of both are similar, a comparison of their services based on traffic volume, connection, registration, and rental charges is…

Ship-Shore Packet Switched Communications System.

DTIC Science & Technology

1986-06-01

PERFORMING ORGANIZATION 6b OFFICE SYMBOL 7a. NAME OF MONITORING ORGANIZATION (If applicable ) Naval Postgraduate School 54 Naval Postgraduate School 6c...OFFICE SYMBOL 9 PROCUREMENT INSTRUMENT IDENTIFICATION NUMBER ORGANIZATION (If applicable ) 8c ADDRESS (City, State, and ZIPCode) 10 SOURCE OF FUNDING...level acknowledgement system. 37 Network Protocol Application P re sen tation Session ____ ____ ____ ___Internet TranportProtocol Network

Practical End-to-End Performance Testing Tool for High Speed 3G-Based Networks

NASA Astrophysics Data System (ADS)

Shinbo, Hiroyuki; Tagami, Atsushi; Ano, Shigehiro; Hasegawa, Toru; Suzuki, Kenji

High speed IP communication is a killer application for 3rd generation (3G) mobile systems. Thus 3G network operators should perform extensive tests to check whether expected end-to-end performances are provided to customers under various environments. An important objective of such tests is to check whether network nodes fulfill requirements to durations of processing packets because a long duration of such processing causes performance degradation. This requires testers (persons who do tests) to precisely know how long a packet is hold by various network nodes. Without any tool's help, this task is time-consuming and error prone. Thus we propose a multi-point packet header analysis tool which extracts and records packet headers with synchronized timestamps at multiple observation points. Such recorded packet headers enable testers to calculate such holding durations. The notable feature of this tool is that it is implemented on off-the shelf hardware platforms, i.e., lap-top personal computers. The key challenges of the implementation are precise clock synchronization without any special hardware and a sophisticated header extraction algorithm without any drop.

A hybrid optical switch architecture to integrate IP into optical networks to provide flexible and intelligent bandwidth on demand for cloud computing

NASA Astrophysics Data System (ADS)

Yang, Wei; Hall, Trevor J.

2013-12-01

The Internet is entering an era of cloud computing to provide more cost effective, eco-friendly and reliable services to consumer and business users. As a consequence, the nature of the Internet traffic has been fundamentally transformed from a pure packet-based pattern to today's predominantly flow-based pattern. Cloud computing has also brought about an unprecedented growth in the Internet traffic. In this paper, a hybrid optical switch architecture is presented to deal with the flow-based Internet traffic, aiming to offer flexible and intelligent bandwidth on demand to improve fiber capacity utilization. The hybrid optical switch is capable of integrating IP into optical networks for cloud-based traffic with predictable performance, for which the delay performance of the electronic module in the hybrid optical switch architecture is evaluated through simulation.

History-based route selection for reactive ad hoc routing protocols

NASA Astrophysics Data System (ADS)

Medidi, Sirisha; Cappetto, Peter

2007-04-01

Ad hoc networks rely on cooperation in order to operate, but in a resource constrained environment not all nodes behave altruistically. Selfish nodes preserve their own resources and do not forward packets not in their own self interest. These nodes degrade the performance of the network, but judicious route selection can help maintain performance despite this behavior. Many route selection algorithms place importance on shortness of the route rather than its reliability. We introduce a light-weight route selection algorithm that uses past behavior to judge the quality of a route rather than solely on the length of the route. It draws information from the underlying routing layer at no extra cost and selects routes with a simple algorithm. This technique maintains this data in a small table, which does not place a high cost on memory. History-based route selection's minimalism suits the needs the portable wireless devices and is easy to implement. We implemented our algorithm and tested it in the ns2 environment. Our simulation results show that history-based route selection achieves higher packet delivery and improved stability than its length-based counterpart.

Research on moving target defense based on SDN

NASA Astrophysics Data System (ADS)

Chen, Mingyong; Wu, Weimin

2017-08-01

An address mutation strategy was proposed. This strategy provided an unpredictable change in address, replacing the real address of the packet forwarding process and path mutation, thus hiding the real address of the host and path. a mobile object defense technology based on Spatio-temporal Mutation on this basis is proposed, Using the software Defined Network centralized control architecture advantage combines sFlow traffic monitoring technology and Moving Target Defense. A mutated time period which can be changed in real time according to the network traffic is changed, and the destination address is changed while the controller abruptly changes the address while the data packet is transferred between the switches to construct a moving target, confusing the host within the network, thereby protecting the host and network.

Switching algorithm for maglev train double-modular redundant positioning sensors.

PubMed

He, Ning; Long, Zhiqiang; Xue, Song

2012-01-01

High-resolution positioning for maglev trains is implemented by detecting the tooth-slot structure of the long stator installed along the rail, but there are large joint gaps between long stator sections. When a positioning sensor is below a large joint gap, its positioning signal is invalidated, thus double-modular redundant positioning sensors are introduced into the system. This paper studies switching algorithms for these redundant positioning sensors. At first, adaptive prediction is applied to the sensor signals. The prediction errors are used to trigger sensor switching. In order to enhance the reliability of the switching algorithm, wavelet analysis is introduced to suppress measuring disturbances without weakening the signal characteristics reflecting the stator joint gap based on the correlation between the wavelet coefficients of adjacent scales. The time delay characteristics of the method are analyzed to guide the algorithm simplification. Finally, the effectiveness of the simplified switching algorithm is verified through experiments.

Switching Algorithm for Maglev Train Double-Modular Redundant Positioning Sensors

PubMed Central

He, Ning; Long, Zhiqiang; Xue, Song

2012-01-01

High-resolution positioning for maglev trains is implemented by detecting the tooth-slot structure of the long stator installed along the rail, but there are large joint gaps between long stator sections. When a positioning sensor is below a large joint gap, its positioning signal is invalidated, thus double-modular redundant positioning sensors are introduced into the system. This paper studies switching algorithms for these redundant positioning sensors. At first, adaptive prediction is applied to the sensor signals. The prediction errors are used to trigger sensor switching. In order to enhance the reliability of the switching algorithm, wavelet analysis is introduced to suppress measuring disturbances without weakening the signal characteristics reflecting the stator joint gap based on the correlation between the wavelet coefficients of adjacent scales. The time delay characteristics of the method are analyzed to guide the algorithm simplification. Finally, the effectiveness of the simplified switching algorithm is verified through experiments. PMID:23112657

High-port low-latency optical switch architecture with optical feed-forward buffering for 256-node disaggregated data centers.

PubMed

Terzenidis, Nikos; Moralis-Pegios, Miltiadis; Mourgias-Alexandris, George; Vyrsokinos, Konstantinos; Pleros, Nikos

2018-04-02

Departing from traditional server-centric data center architectures towards disaggregated systems that can offer increased resource utilization at reduced cost and energy envelopes, the use of high-port switching with highly stringent latency and bandwidth requirements becomes a necessity. We present an optical switch architecture exploiting a hybrid broadcast-and-select/wavelength routing scheme with small-scale optical feedforward buffering. The architecture is experimentally demonstrated at 10Gb/s, reporting error-free performance with a power penalty of <2.5dB. Moreover, network simulations for a 256-node system, revealed low-latency values of only 605nsec, at throughput values reaching 80% when employing 2-packet-size optical buffers, while multi-rack network performance was also investigated.

Market capture by 30/20 GHz satellite systems. Volume 1: Executive summary

NASA Technical Reports Server (NTRS)

Gamble, R. B.; Saporta, L.

1981-01-01

Demand for 30/20 GHz satellite systems over the next two decades is projected. Topics include a profile of the communications market, switched, dedicated, and packet transmission modes, deferred and real-time traffic, quality and reliability considerations, the capacity of competing transmission media, and scenarios for the growth and development of 30/20 GHz satellite communications.

Market capture by 30/20 GHz satellite systems. Volume 1: Executive summary

NASA Astrophysics Data System (ADS)

Gamble, R. B.; Saporta, L.

1981-04-01

Demand for 30/20 GHz satellite systems over the next two decades is projected. Topics include a profile of the communications market, switched, dedicated, and packet transmission modes, deferred and real-time traffic, quality and reliability considerations, the capacity of competing transmission media, and scenarios for the growth and development of 30/20 GHz satellite communications.

Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad-Hoc Networks

NASA Astrophysics Data System (ADS)

Li, Xiaohua(Edward)

In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interference cancellation (SIC) and maximal ratio combining (MRC) to deal with mutual interference and to utilize all the received signal energy, we show that the signal-to-interference-plus-noise ratio (SINR) of a node is determined only by the nodes before it, not the nodes after it, along a packet forwarding path. Based on this observation, we propose an iterative procedure to select the relay nodes and to calculate the path SINR as well as capacity of an arbitrary multi-hop packet forwarding path. The complexity of the algorithm is extremely low, and scaling well with network size. The algorithm is applicable in arbitrarily large networks. Its performance is demonstrated as desirable by simulations. The algorithm can be helpful in analyzing the performance of multi-hop wireless networks.

Suboptimal Scheduling in Switched Systems With Continuous-Time Dynamics: A Least Squares Approach.

PubMed

Sardarmehni, Tohid; Heydari, Ali

2018-06-01

Two approximate solutions for optimal control of switched systems with autonomous subsystems and continuous-time dynamics are presented. The first solution formulates a policy iteration (PI) algorithm for the switched systems with recursive least squares. To reduce the computational burden imposed by the PI algorithm, a second solution, called single loop PI, is presented. Online and concurrent training algorithms are discussed for implementing each solution. At last, effectiveness of the presented algorithms is evaluated through numerical simulations.

Evolving PSTN to NGN

NASA Astrophysics Data System (ADS)

Wu, Liang T.

2004-04-01

The concept of Next Generation Network (NGN) was conceived around 1998 as an integrated solution to combine the quality and features of the PSTN with the low cost and routing flexibility of the Internet to provide a single infrastructure for the future public network. This carrier grade Internet solution calls for the creation of a consolidated, packet transport and switching infrastructure and the development of a flexible, open, software switch (softswitch) to handle voice telephony as well as multimedia services. Almost all the telecom equipment manufacturers as well as some Internet equipment vendors immediately subscribed to this vision and joined the race to create convergent products for the NGN market.

Prioritized packet video transmission over time-varying wireless channel using proactive FEC

NASA Astrophysics Data System (ADS)

Kumwilaisak, Wuttipong; Kim, JongWon; Kuo, C.-C. Jay

2000-12-01

Quality of video transmitted over time-varying wireless channels relies heavily on the coordinated effort to cope with both channel and source variations dynamically. Given the priority of each source packet and the estimated channel condition, an adaptive protection scheme based on joint source-channel criteria is investigated via proactive forward error correction (FEC). With proactive FEC in Reed Solomon (RS)/Rate-compatible punctured convolutional (RCPC) codes, we study a practical algorithm to match the relative priority of source packets and instantaneous channel conditions. The channel condition is estimated to capture the long-term fading effect in terms of the averaged SNR over a preset window. Proactive protection is performed for each packet based on the joint source-channel criteria with special attention to the accuracy, time-scale match, and feedback delay of channel status estimation. The overall gain of the proposed protection mechanism is demonstrated in terms of the end-to-end wireless video performance.

OSI Network-layer Abstraction: Analysis of Simulation Dynamics and Performance Indicators

NASA Astrophysics Data System (ADS)

Lawniczak, Anna T.; Gerisch, Alf; Di Stefano, Bruno

2005-06-01

The Open Systems Interconnection (OSI) reference model provides a conceptual framework for communication among computers in a data communication network. The Network Layer of this model is responsible for the routing and forwarding of packets of data. We investigate the OSI Network Layer and develop an abstraction suitable for the study of various network performance indicators, e.g. throughput, average packet delay, average packet speed, average packet path-length, etc. We investigate how the network dynamics and the network performance indicators are affected by various routing algorithms and by the addition of randomly generated links into a regular network connection topology of fixed size. We observe that the network dynamics is not simply the sum of effects resulting from adding individual links to the connection topology but rather is governed nonlinearly by the complex interactions caused by the existence of all randomly added and already existing links in the network. Data for our study was gathered using Netzwerk-1, a C++ simulation tool that we developed for our abstraction.

GLOBECOM '87 - Global Telecommunications Conference, Tokyo, Japan, Nov. 15-18, 1987, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

The present conference on global telecommunications discusses topics in the fields of Integrated Services Digital Network (ISDN) technology field trial planning and results to date, motion video coding, ISDN networking, future network communications security, flexible and intelligent voice/data networks, Asian and Pacific lightwave and radio systems, subscriber radio systems, the performance of distributed systems, signal processing theory, satellite communications modulation and coding, and terminals for the handicapped. Also discussed are knowledge-based technologies for communications systems, future satellite transmissions, high quality image services, novel digital signal processors, broadband network access interface, traffic engineering for ISDN design and planning, telecommunications software, coherent optical communications, multimedia terminal systems, advanced speed coding, portable and mobile radio communications, multi-Gbit/second lightwave transmission systems, enhanced capability digital terminals, communications network reliability, advanced antimultipath fading techniques, undersea lightwave transmission, image coding, modulation and synchronization, adaptive signal processing, integrated optical devices, VLSI technologies for ISDN, field performance of packet switching, CSMA protocols, optical transport system architectures for broadband ISDN, mobile satellite communications, indoor wireless communication, echo cancellation in communications, and distributed network algorithms.

A Localization-Free Interference and Energy Holes Minimization Routing for Underwater Wireless Sensor Networks.

PubMed

Khan, Anwar; Ahmedy, Ismail; Anisi, Mohammad Hossein; Javaid, Nadeem; Ali, Ihsan; Khan, Nawsher; Alsaqer, Mohammed; Mahmood, Hasan

2018-01-09

Interference and energy holes formation in underwater wireless sensor networks (UWSNs) threaten the reliable delivery of data packets from a source to a destination. Interference also causes inefficient utilization of the limited battery power of the sensor nodes in that more power is consumed in the retransmission of the lost packets. Energy holes are dead nodes close to the surface of water, and their early death interrupts data delivery even when the network has live nodes. This paper proposes a localization-free interference and energy holes minimization (LF-IEHM) routing protocol for UWSNs. The proposed algorithm overcomes interference during data packet forwarding by defining a unique packet holding time for every sensor node. The energy holes formation is mitigated by a variable transmission range of the sensor nodes. As compared to the conventional routing protocols, the proposed protocol does not require the localization information of the sensor nodes, which is cumbersome and difficult to obtain, as nodes change their positions with water currents. Simulation results show superior performance of the proposed scheme in terms of packets received at the final destination and end-to-end delay.

Efficient Network Coding-Based Loss Recovery for Reliable Multicast in Wireless Networks

NASA Astrophysics Data System (ADS)

Chi, Kaikai; Jiang, Xiaohong; Ye, Baoliu; Horiguchi, Susumu

Recently, network coding has been applied to the loss recovery of reliable multicast in wireless networks [19], where multiple lost packets are XOR-ed together as one packet and forwarded via single retransmission, resulting in a significant reduction of bandwidth consumption. In this paper, we first prove that maximizing the number of lost packets for XOR-ing, which is the key part of the available network coding-based reliable multicast schemes, is actually a complex NP-complete problem. To address this limitation, we then propose an efficient heuristic algorithm for finding an approximately optimal solution of this optimization problem. Furthermore, we show that the packet coding principle of maximizing the number of lost packets for XOR-ing sometimes cannot fully exploit the potential coding opportunities, and we then further propose new heuristic-based schemes with a new coding principle. Simulation results demonstrate that the heuristic-based schemes have very low computational complexity and can achieve almost the same transmission efficiency as the current coding-based high-complexity schemes. Furthermore, the heuristic-based schemes with the new coding principle not only have very low complexity, but also slightly outperform the current high-complexity ones.

A Localization-Free Interference and Energy Holes Minimization Routing for Underwater Wireless Sensor Networks

PubMed Central

Khan, Anwar; Anisi, Mohammad Hossein; Javaid, Nadeem; Khan, Nawsher; Alsaqer, Mohammed; Mahmood, Hasan

2018-01-01

Interference and energy holes formation in underwater wireless sensor networks (UWSNs) threaten the reliable delivery of data packets from a source to a destination. Interference also causes inefficient utilization of the limited battery power of the sensor nodes in that more power is consumed in the retransmission of the lost packets. Energy holes are dead nodes close to the surface of water, and their early death interrupts data delivery even when the network has live nodes. This paper proposes a localization-free interference and energy holes minimization (LF-IEHM) routing protocol for UWSNs. The proposed algorithm overcomes interference during data packet forwarding by defining a unique packet holding time for every sensor node. The energy holes formation is mitigated by a variable transmission range of the sensor nodes. As compared to the conventional routing protocols, the proposed protocol does not require the localization information of the sensor nodes, which is cumbersome and difficult to obtain, as nodes change their positions with water currents. Simulation results show superior performance of the proposed scheme in terms of packets received at the final destination and end-to-end delay. PMID:29315247

Fiber optic voice/data network

NASA Technical Reports Server (NTRS)

Bergman, Larry A. (Inventor)

1989-01-01

An asynchronous, high-speed, fiber optic local area network originally developed for tactical environments with additional benefits for other environments such as spacecraft, and the like. The network supports ordinary data packet traffic simultaneously with synchronous T1 voice traffic over a common token ring channel; however, the techniques and apparatus of this invention can be applied to any deterministic class of packet data networks, including multitier backbones, that must transport stream data (e.g., video, SAR, sensors) as well as data. A voice interface module parses, buffers, and resynchronizes the voice data to the packet network employing elastic buffers on both the sending and receiving ends. Voice call setup and switching functions are performed external to the network with ordinary PABX equipment. Clock information is passed across network boundaries in a token passing ring by preceeding the token with an idle period of non-transmission which allows the token to be used to re-establish a clock synchronized to the data. Provision is made to monitor and compensate the elastic receiving buffers so as to prevent them from overflowing or going empty.

Control of propagation of spatially localized polariton wave packets in a Bragg mirror with embedded quantum wells

NASA Astrophysics Data System (ADS)

Sedova, I. E.; Chestnov, I. Yu.; Arakelian, S. M.; Kavokin, A. V.; Sedov, E. S.

2018-01-01

We considered the nonlinear dynamics of Bragg polaritons in a specially designed stratified semiconductor structure with embedded quantum wells, which possesses a convex dispersion. The model for the ensemble of single periodically arranged quantum wells coupled with the Bragg photon fields has been developed. In particular, the generalized Gross-Pitaevskii equation with the non-parabolic dispersion has been obtained for the Bragg polariton wave function. We revealed a number of dynamical regimes for polariton wave packets resulting from competition of the convex dispersion and the repulsive nonlinearity effects. Among the regimes are spreading, breathing and soliton propagation. When the control parameters including the exciton-photon detuning, the matter-field coupling and the nonlinearity are manipulated, the dynamical regimes switch between themselves.

Rethinking Mobile Telephony with the IMP

DTIC Science & Technology

2011-01-01

in the telephony industry, and portions of it such as SS7 or SCTP signaling are packet-switched, deployed mobile telephony access infrastructure is...deployment of wireless LAN technology raises the question of how a mobile telephony system might instead be architected to use wireless LAN access ...and wireless access points has made universal Internet access increasingly convenient. There are clearly barriers to this vision of accessing a

Asynchronous State Estimation for Discrete-Time Switched Complex Networks With Communication Constraints.

PubMed

Zhang, Dan; Wang, Qing-Guo; Srinivasan, Dipti; Li, Hongyi; Yu, Li

2018-05-01

This paper is concerned with the asynchronous state estimation for a class of discrete-time switched complex networks with communication constraints. An asynchronous estimator is designed to overcome the difficulty that each node cannot access to the topology/coupling information. Also, the event-based communication, signal quantization, and the random packet dropout problems are studied due to the limited communication resource. With the help of switched system theory and by resorting to some stochastic system analysis method, a sufficient condition is proposed to guarantee the exponential stability of estimation error system in the mean-square sense and a prescribed performance level is also ensured. The characterization of the desired estimator gains is derived in terms of the solution to a convex optimization problem. Finally, the effectiveness of the proposed design approach is demonstrated by a simulation example.

Integrating mitosis, toxicity, and transgene expression in a telecommunications packet-switched network model of lipoplex-mediated gene delivery.

PubMed

Martin, Timothy M; Wysocki, Beata J; Beyersdorf, Jared P; Wysocki, Tadeusz A; Pannier, Angela K

2014-08-01

Gene delivery systems transport exogenous genetic information to cells or biological systems with the potential to directly alter endogenous gene expression and behavior with applications in functional genomics, tissue engineering, medical devices, and gene therapy. Nonviral systems offer advantages over viral systems because of their low immunogenicity, inexpensive synthesis, and easy modification but suffer from lower transfection levels. The representation of gene transfer using models offers perspective and interpretation of complex cellular mechanisms,including nonviral gene delivery where exact mechanisms are unknown. Here, we introduce a novel telecommunications model of the nonviral gene delivery process in which the delivery of the gene to a cell is synonymous with delivery of a packet of information to a destination computer within a packet-switched computer network. Such a model uses nodes and layers to simplify the complexity of modeling the transfection process and to overcome several challenges of existing models. These challenges include a limited scope and limited time frame, which often does not incorporate biological effects known to affect transfection. The telecommunication model was constructed in MATLAB to model lipoplex delivery of the gene encoding the green fluorescent protein to HeLa cells. Mitosis and toxicity events were included in the model resulting in simulation outputs of nuclear internalization and transfection efficiency that correlated with experimental data. A priori predictions based on model sensitivity analysis suggest that increasing endosomal escape and decreasing lysosomal degradation, protein degradation, and GFP-induced toxicity can improve transfection efficiency by three-fold. Application of the telecommunications model to nonviral gene delivery offers insight into the development of new gene delivery systems with therapeutically relevant transfection levels.

PHY-DLL dialogue: cross-layer design for optical-wireless OFDM downlink transmission

NASA Astrophysics Data System (ADS)

Wang, Xuguo; Li, Lee

2005-11-01

The use of radio over fiber to provide radio access has a number of advantages including the ability to deploy small, low-cost remote antenna units and ease of upgrade. And due to the great potential for increasing the capacity and quality of service, the combination of Orthogonal Frequency Division Multiplexing (OFDM) modulation and the sub-carrier multiplexed optical transmission is one of the best solutions for the future millimeter-wave mobile communication. And this makes the optimum utility of valuable radio resources essential. This paper devises a cross-layer adaptive algorithm for optical-wireless OFDM system, which takes into consideration not only transmission power limitation in the physical layer, but also traffic scheduling and user fairness at the data-link layer. According to proportional fairness principle and water-pouring theorem, we put forward the complete description of this cross-layer adaptive downlink transmission 6-step algorithm. Simulation results show that the proposed cross-layer algorithm outperforms the mere physical layer adaptive algorithm markedly. The novel scheme is able to improve performance of the packet success rate per time chip and average packet delay, support added active users.

An Emergency Packet Forwarding Scheme for V2V Communication Networks

PubMed Central

2014-01-01

This paper proposes an effective warning message forwarding scheme for cooperative collision avoidance. In an emergency situation, an emergency-detecting vehicle warns the neighbor vehicles via an emergency warning message. Since the transmission range is limited, the warning message is broadcast in a multihop manner. Broadcast packets lead two challenges to forward the warning message in the vehicular network: redundancy of warning messages and competition with nonemergency transmissions. In this paper, we study and address the two major challenges to achieve low latency in delivery of the warning message. To reduce the intervehicle latency and end-to-end latency, which cause chain collisions, we propose a two-way intelligent broadcasting method with an adaptable distance-dependent backoff algorithm. Considering locations of vehicles, the proposed algorithm controls the broadcast of a warning message to reduce redundant EWM messages and adaptively chooses the contention window to compete with nonemergency transmission. Via simulations, we show that our proposed algorithm reduces the probability of rear-end crashes by 70% compared to previous algorithms by reducing the intervehicle delay. We also show that the end-to-end propagation delay of the warning message is reduced by 55%. PMID:25054181

Data transmission system and method

NASA Technical Reports Server (NTRS)

Bruck, Jehoshua (Inventor); Langberg, Michael (Inventor); Sprintson, Alexander (Inventor)

2010-01-01

A method of transmitting data packets, where randomness is added to the schedule. Universal broadcast schedules using encoding and randomization techniques are also discussed, together with optimal randomized schedules and an approximation algorithm for finding near-optimal schedules.

Multirate parallel distributed compensation of a cluster in wireless sensor and actor networks

NASA Astrophysics Data System (ADS)

Yang, Chun-xi; Huang, Ling-yun; Zhang, Hao; Hua, Wang

2016-01-01

The stabilisation problem for one of the clusters with bounded multiple random time delays and packet dropouts in wireless sensor and actor networks is investigated in this paper. A new multirate switching model is constructed to describe the feature of this single input multiple output linear system. According to the difficulty of controller design under multi-constraints in multirate switching model, this model can be converted to a Takagi-Sugeno fuzzy model. By designing a multirate parallel distributed compensation, a sufficient condition is established to ensure this closed-loop fuzzy control system to be globally exponentially stable. The solution of the multirate parallel distributed compensation gains can be obtained by solving an auxiliary convex optimisation problem. Finally, two numerical examples are given to show, compared with solving switching controller, multirate parallel distributed compensation can be obtained easily. Furthermore, it has stronger robust stability than arbitrary switching controller and single-rate parallel distributed compensation under the same conditions.

Fuzzy Logic-based Intelligent Scheme for Enhancing QoS of Vertical Handover Decision in Vehicular Ad-hoc Networks

NASA Astrophysics Data System (ADS)

Azzali, F.; Ghazali, O.; Omar, M. H.

2017-08-01

The design of next generation networks in various technologies under the “Anywhere, Anytime” paradigm offers seamless connectivity across different coverage. A conventional algorithm such as RSSThreshold algorithm, that only uses the received strength signal (RSS) as a metric, will decrease handover performance regarding handover latency, delay, packet loss, and handover failure probability. Moreover, the RSS-based algorithm is only suitable for horizontal handover decision to examine the quality of service (QoS) compared to the vertical handover decision in advanced technologies. In the next generation network, vertical handover can be started based on the user’s convenience or choice rather than connectivity reasons. This study proposes a vertical handover decision algorithm that uses a Fuzzy Logic (FL) algorithm, to increase QoS performance in heterogeneous vehicular ad-hoc networks (VANET). The study uses network simulator 2.29 (NS 2.29) along with the mobility traffic network and generator to implement simulation scenarios and topologies. This helps the simulation to achieve a realistic VANET mobility scenario. The required analysis on the performance of QoS in the vertical handover can thus be conducted. The proposed Fuzzy Logic algorithm shows improvement over the conventional algorithm (RSSThreshold) in the average percentage of handover QoS whereby it achieves 20%, 21% and 13% improvement on handover latency, delay, and packet loss respectively. This is achieved through triggering a process in layer two and three that enhances the handover performance.

Wavelet-frequency analysis for the detection of discontinuities in switched system models of human balance.

PubMed

Nema, Salam; Kowalczyk, Piotr; Loram, Ian

2017-01-01

This paper is concerned with detecting the presence of switching behavior in experimentally obtained posturographic data sets by means of a novel algorithm that is based on a combination of wavelet analysis and Hilbert transform. As a test-bed for the algorithm, we first use a switched model of human balance control during quiet standing with known switching behavior in four distinct configurations. We obtain a time-frequency representation of a signal generated by our model system. We are then able to detect manifestations of discontinuities (switchings) in the signal as spiking behavior. The frequency of switchings, measured by means of our algorithm and detected in our models systems, agrees with the frequency of spiking behavior found in the experimentally obtained posturographic data. Copyright © 2016. Published by Elsevier B.V.

The art and science of switching antipsychotic medications, part 2.

PubMed

Weiden, Peter J; Miller, Alexander L; Lambert, Tim J; Buckley, Peter F

2007-01-01

In the presentation "Switching and Metabolic Syndrome," Weiden summarizes reasons to switch antipsychotics, highlighting weight gain and other metabolic adverse events as recent treatment targets. In "Texas Medication Algorithm Project (TMAP)," Miller reviews the TMAP study design, discusses results related to the algorithm versus treatment as usual, and concludes with the implications of the study. Lambert's presentation, "Dosing and Titration Strategies to Optimize Patient Outcome When Switching Antipsychotic Therapy," reviews the decision-making process when switching patients' medication, addresses dosing and titration strategies to effectively transition between medications, and examines other factors to consider when switching pharmacotherapy.

A Random Access Algorithm for Frequency Hopped Spread Spectrum Packet Radio Networks

DTIC Science & Technology

1986-03-01

in section 4.3, the probability p is given by the following expression. N rj 1-p - N1 (NR7-1). f -• (20)~ j=o j. F,=ji < N We now present a...Algorithms," Univ. of Connecticut, EECS Dept. Technical Report UCT/ DEECS /TR-86-1, January 1986. Also, submitted for publication. 119] W. Peterson and E

Unified Method for Delay Analysis of Random Multiple Access Algorithms.

DTIC Science & Technology

1985-08-01

packets in the first cell of the stack. The rules of the algorithm yield the following relation for the wi’s: n-1 n w 0= ; W =1; i i 9Q h I+ + zwI .+N...for computer communica- tions", in Proc. 1970 Fall Joint Computer Conf., AFIPS Press, vol. 37, 1970, pp. 281 -285. (15] N. D. Vvedenskaya and B. S

DTN routing in body sensor networks with dynamic postural partitioning.

PubMed

Quwaider, Muhannad; Biswas, Subir

2010-11-01

This paper presents novel store-and-forward packet routing algorithms for Wireless Body Area Networks ( WBAN ) with frequent postural partitioning. A prototype WBAN has been constructed for experimentally characterizing on-body topology disconnections in the presence of ultra short range radio links, unpredictable RF attenuation, and human postural mobility. On-body DTN routing protocols are then developed using a stochastic link cost formulation, capturing multi-scale topological localities in human postural movements. Performance of the proposed protocols are evaluated experimentally and via simulation, and are compared with a number of existing single-copy DTN routing protocols and an on-body packet flooding mechanism that serves as a performance benchmark with delay lower-bound. It is shown that via multi-scale modeling of the spatio-temporal locality of on-body link disconnection patterns, the proposed algorithms can provide better routing performance compared to a number of existing probabilistic, opportunistic, and utility-based DTN routing protocols in the literature.

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

DTIC Science & Technology

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

LEOPACK The integrated services communications system based on LEO satellites

NASA Astrophysics Data System (ADS)

Negoda, A.; Bunin, S.; Bushuev, E.; Dranovsky, V.

LEOPACK is yet another LEO satellite project which provides global integrated services for 'business' communications. It utilizes packet rather then circuit switching in both terrestrial and satellite chains as well as cellular approach for frequencies use. Original multiple access protocols and decentralized network control make it possible to organize regionally or logically independent and world-wide networks. Relatively small number of satellites (28) provides virtually global network coverage.

Second year technical report on-board processing for future satellite communications systems

NASA Technical Reports Server (NTRS)

Brandon, W. T.; Green, W. K.; Hoffman, M.; Jean, P. N.; Neal, W. R.; White, B. E.

1980-01-01

Advanced baseband and microwave switching techniques for large domestic communications satellites operating in the 30/20 GHz frequency bands are discussed. The nominal baseband processor throughput is one million packets per second (1.6 Gb/s) from one thousand T1 carrier rate customer premises terminals. A frequency reuse factor of sixteen is assumed by using 16 spot antenna beams with the same 100 MHz bandwidth per beam and a modulation with a one b/s per Hz bandwidth efficiency. Eight of the beams are fixed on major metropolitan areas and eight are scanning beams which periodically cover the remainder of the U.S. under dynamic control. User signals are regenerated (demodulated/remodulated) and message packages are reformatted on board. Frequency division multiple access and time division multiplex are employed on the uplinks and downlinks, respectively, for terminals within the coverage area and dwell interval of a scanning beam. Link establishment and packet routing protocols are defined. Also described is a detailed design of a separate 100 x 100 microwave switch capable of handling nonregenerated signals occupying the remaining 2.4 GHz bandwidth with 60 dB of isolation, at an estimated weight and power consumption of approximately 400 kg and 100 W, respectively.

Second year technical report on-board processing for future satellite communications systems

NASA Astrophysics Data System (ADS)

Brandon, W. T.; Green, W. K.; Hoffman, M.; Jean, P. N.; Neal, W. R.; White, B. E.

1980-10-01

Advanced baseband and microwave switching techniques for large domestic communications satellites operating in the 30/20 GHz frequency bands are discussed. The nominal baseband processor throughput is one million packets per second (1.6 Gb/s) from one thousand T1 carrier rate customer premises terminals. A frequency reuse factor of sixteen is assumed by using 16 spot antenna beams with the same 100 MHz bandwidth per beam and a modulation with a one b/s per Hz bandwidth efficiency. Eight of the beams are fixed on major metropolitan areas and eight are scanning beams which periodically cover the remainder of the U.S. under dynamic control. User signals are regenerated (demodulated/remodulated) and message packages are reformatted on board. Frequency division multiple access and time division multiplex are employed on the uplinks and downlinks, respectively, for terminals within the coverage area and dwell interval of a scanning beam. Link establishment and packet routing protocols are defined. Also described is a detailed design of a separate 100 x 100 microwave switch capable of handling nonregenerated signals occupying the remaining 2.4 GHz bandwidth with 60 dB of isolation, at an estimated weight and power consumption of approximately 400 kg and 100 W, respectively.

End-to-End QoS for Differentiated Services and ATM Internetworking

NASA Technical Reports Server (NTRS)

Su, Hongjun; Atiquzzaman, Mohammed

2001-01-01

The Internet was initially design for non real-time data communications and hence does not provide any Quality of Service (QoS). The next generation Internet will be characterized by high speed and QoS guarantee. The aim of this paper is to develop a prioritized early packet discard (PEPD) scheme for ATM switches to provide service differentiation and QoS guarantee to end applications running over next generation Internet. The proposed PEPD scheme differs from previous schemes by taking into account the priority of packets generated from different application. We develop a Markov chain model for the proposed scheme and verify the model with simulation. Numerical results show that the results from the model and computer simulation are in close agreement. Our PEPD scheme provides service differentiation to the end-to-end applications.

Chaos control of Hastings-Powell model by combining chaotic motions.

PubMed

Danca, Marius-F; Chattopadhyay, Joydev

2016-04-01

In this paper, we propose a Parameter Switching (PS) algorithm as a new chaos control method for the Hastings-Powell (HP) system. The PS algorithm is a convergent scheme that switches the control parameter within a set of values while the controlled system is numerically integrated. The attractor obtained with the PS algorithm matches the attractor obtained by integrating the system with the parameter replaced by the averaged value of the switched parameter values. The switching rule can be applied periodically or randomly over a set of given values. In this way, every stable cycle of the HP system can be approximated if its underlying parameter value equalizes the average value of the switching values. Moreover, the PS algorithm can be viewed as a generalization of Parrondo's game, which is applied for the first time to the HP system, by showing that losing strategy can win: "losing + losing = winning." If "loosing" is replaced with "chaos" and, "winning" with "order" (as the opposite to "chaos"), then by switching the parameter value in the HP system within two values, which generate chaotic motions, the PS algorithm can approximate a stable cycle so that symbolically one can write "chaos + chaos = regular." Also, by considering a different parameter control, new complex dynamics of the HP model are revealed.

Chaos control of Hastings-Powell model by combining chaotic motions

NASA Astrophysics Data System (ADS)

Danca, Marius-F.; Chattopadhyay, Joydev

2016-04-01

In this paper, we propose a Parameter Switching (PS) algorithm as a new chaos control method for the Hastings-Powell (HP) system. The PS algorithm is a convergent scheme that switches the control parameter within a set of values while the controlled system is numerically integrated. The attractor obtained with the PS algorithm matches the attractor obtained by integrating the system with the parameter replaced by the averaged value of the switched parameter values. The switching rule can be applied periodically or randomly over a set of given values. In this way, every stable cycle of the HP system can be approximated if its underlying parameter value equalizes the average value of the switching values. Moreover, the PS algorithm can be viewed as a generalization of Parrondo's game, which is applied for the first time to the HP system, by showing that losing strategy can win: "losing + losing = winning." If "loosing" is replaced with "chaos" and, "winning" with "order" (as the opposite to "chaos"), then by switching the parameter value in the HP system within two values, which generate chaotic motions, the PS algorithm can approximate a stable cycle so that symbolically one can write "chaos + chaos = regular." Also, by considering a different parameter control, new complex dynamics of the HP model are revealed.

Identifying Degenerative Brain Disease Using Rough Set Classifier Based on Wavelet Packet Method.

PubMed

Cheng, Ching-Hsue; Liu, Wei-Xiang

2018-05-28

Population aging has become a worldwide phenomenon, which causes many serious problems. The medical issues related to degenerative brain disease have gradually become a concern. Magnetic Resonance Imaging is one of the most advanced methods for medical imaging and is especially suitable for brain scans. From the literature, although the automatic segmentation method is less laborious and time-consuming, it is restricted in several specific types of images. In addition, hybrid techniques segmentation improves the shortcomings of the single segmentation method. Therefore, this study proposed a hybrid segmentation combined with rough set classifier and wavelet packet method to identify degenerative brain disease. The proposed method is a three-stage image process method to enhance accuracy of brain disease classification. In the first stage, this study used the proposed hybrid segmentation algorithms to segment the brain ROI (region of interest). In the second stage, wavelet packet was used to conduct the image decomposition and calculate the feature values. In the final stage, the rough set classifier was utilized to identify the degenerative brain disease. In verification and comparison, two experiments were employed to verify the effectiveness of the proposed method and compare with the TV-seg (total variation segmentation) algorithm, Discrete Cosine Transform, and the listing classifiers. Overall, the results indicated that the proposed method outperforms the listing methods.

Final Report for the project titled "Enabling Supernova Computations by Integrated Transport and Provisioning Methods Optimized for Dedicated Channels"

DOE Office of Scientific and Technical Information (OSTI.GOV)

Malathi Veeraraghavan

2007-10-31

A high-speed optical circuit network is one that offers users rate-guaranteed connectivity between two endpoints, unlike today’s IP-routed Internet in which the rate available to a pair of users fluctuates based on the volume of competing traffic. This particular research project advanced our understanding of circuit networks in two ways. First, transport protocols were developed for circuit networks. In a circuit network, since bandwidth resources are reserved for each circuit on an end-to-end basis (much like how a person reserves a seat on every leg of a multi-segment flight), and the sender is limited to send at the rate ofmore » the circuit, there is no possibility of congestion during data transfer. Therefore, no congestion control functions are necessary in a transport protocol designed for circuits. However, error control and flow control are still required because bits can become errored due to noise and interference even on highly reliable optical links, and receivers can, due to multitasking or other reasons, not deplete the receive buffer fast enough to keep up with the sending rate (e.g., if the receiving host is multitasking between receiving a file transfer and some other computation). In this work, we developed two transport protocols for circuits, both of which are described below. Second, this project developed techniques for internetworking different types of connection-oriented networks, which are of two types: circuit-switched or packet-switched. In circuit-switched networks, multiplexing on links is “position based,” where “position” refers to the frequency, time slot, and port (fiber), while connection-oriented packet-switched networks use packet header information to demultiplex packets and switch them from node to node. The latter are commonly referred to as virtual circuit networks. Examples of circuit networks are time-division multiplexed Synchronous Optical Network/Synchronous Digital Hierarchy (SONET/SDH) and Wavelength Division Multiplexing (WDM) networks, while examples of virtual-circuit networks are MultiProtocol Label Switched (MPLS) networks and Ethernet Virtual Local Area Network (VLAN) networks. A series of new technologies have been developed to carry Ethernet VLAN tagged frames on SONET/SDH and WDM networks, such as Generic Framing Procedure (GFP) and ITU G.709, respectively. These technologies form the basis of our solution for connection-oriented internetworking. The benefit of developing such an architecture is that it allows different providers to choose different connection-oriented networking technologies for their networks, and yet be able to allow their customers to connect to those of other providers. As Metcalfe, the inventor of Ethernet, noted, the value of a network service grows exponentially with the number of endpoints to which any single endpoint can connect. Therefore internetworking solutions are key to commercial success. The technical effectiveness of our solutions was measured with proof-of-concept prototypes and experiments. These solutions were shown to be highly effective. Economic feasibility requires business case analyses that were beyond the scope of this project. The project results are beneficial to the public as they demonstrate the viability of simultaneously supporting different types of networks and data communication services much like the variety of services available for the transportation of people and goods. For example, Fedex service offers a deadline based delivery while the USPS offers basic package delivery service. Similarly, a circuit network can offer a deadline based delivery of a data file while the IP-routed network offers only basic delivery service with no guarantees. Two project Web sites, 13 publications, 7 software programs, 21 presentations resulted from this work. This report provides the complete list of publications, software programs and presentations. As for student education and training (human resources), this DOE project, along with an NSF project, jointly supported two postdoctoral fellowships, three PhDs, three Masters, and two undergraduate students. Specifically, two of the Masters students were directly funded on this DOE project.« less

GLOBECOM '89 - IEEE Global Telecommunications Conference and Exhibition, Dallas, TX, Nov. 27-30, 1989, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

The present conference discusses topics in multiwavelength network technology and its applications, advanced digital radio systems in their propagation environment, mobile radio communications, switching programmability, advancements in computer communications, integrated-network management and security, HDTV and image processing in communications, basic exchange communications radio advancements in digital switching, intelligent network evolution, speech coding for telecommunications, and multiple access communications. Also discussed are network designs for quality assurance, recent progress in coherent optical systems, digital radio applications, advanced communications technologies for mobile users, communication software for switching systems, AI and expert systems in network management, intelligent multiplexing nodes, video and image coding, network protocols and performance, system methods in quality and reliability, the design and simulation of lightwave systems, local radio networks, mobile satellite communications systems, fiber networks restoration, packet video networks, human interfaces for future networks, and lightwave networking.

Communications Satellite Systems Conference, 9th, San Diego, CA, March 7-11, 1982, Collection of Technical Papers

NASA Astrophysics Data System (ADS)

The Shuttle-to-Geostationary Orbital Transfer by mid-level thrust is considered along with multibeam antenna concepts for global communications, the antenna pointing systems for large communication satellites, the connection phase of multidestination protocols for broadcast satellites, and an experiment in high-speed international packet switching. Attention is given to a dynamic switch matrix for the TDMA satellite switching system, the characterization of 16 bit microprocessors for space use, in-orbit operation and test of Intelsat V satellites, the first operational communications system via satellite in Europe, the Arab satellite communications systems, second generation business satellite systems for Europe, and a high performance Ku-band satellite for the 1980's. Other topics investigated are related to Ku-band terminal design tradeoffs, progress in the definition of the Italian satellite for domestic telecommunications, future global satellite systems for Intelsat, and satellite refuelling in orbit.

Development and evaluation of an algorithm to facilitate drug prescription for inpatients with feeding tubes.

PubMed

Lohmann, Kristina; Freigofas, Julia; Leichsenring, Julian; Wallenwein, Chantal Marie; Haefeli, Walter Emil; Seidling, Hanna Marita

2015-04-01

We aimed to develop and evaluate an algorithm to facilitate drug switching between primary and tertiary care for patients with feeding tubes. An expert consortium developed an algorithm and applied it manually to 267 preadmission drugs of 46 patients admitted to a surgical ward of a tertiary care university hospital between June 12 and December 2, 2013, and requiring a feeding tube during their inpatient stay. The new algorithm considered the following principles: Drugs should be ideally listed on the hospital drug formulary (HDF). Additionally, drugs should include the same ingredient instead of a therapeutic equivalent. Preferred dosage forms were appropriate liquids, followed by solid drugs with liquid administration form, and solid drugs that could be crushed and/or suspended. Of all evaluated drugs, 83.5% could be switched to suitable drugs listed on the HDF and another 6.0% to drugs available on the German drug market. Additionally, for 4.1% of the drugs, the integration of individual switching rules allowed the switch from enteric-coated to immediate-release drugs. Consequently, 6.4% of the drugs could not be automatically switched and required case-to-case decision by a clinical professional (e.g., from sustained-release to immediate-release). The predefined principles were successfully integrated in the new algorithm. Thus, the algorithm switched more than 90% of the evaluated preadmission drugs to suitable drugs for inpatients with feeding tubes. This finding suggests that the algorithm can readily be transferred to an electronic format and integrated into a clinical decision support system.

Compression of real time volumetric echocardiographic data using modified SPIHT based on the three-dimensional wavelet packet transform.

PubMed

Hang, X; Greenberg, N L; Shiota, T; Firstenberg, M S; Thomas, J D

2000-01-01

Real-time three-dimensional echocardiography has been introduced to provide improved quantification and description of cardiac function. Data compression is desired to allow efficient storage and improve data transmission. Previous work has suggested improved results utilizing wavelet transforms in the compression of medical data including 2D echocardiogram. Set partitioning in hierarchical trees (SPIHT) was extended to compress volumetric echocardiographic data by modifying the algorithm based on the three-dimensional wavelet packet transform. A compression ratio of at least 40:1 resulted in preserved image quality.

Hybrid ARQ Scheme with Autonomous Retransmission for Multicasting in Wireless Sensor Networks.

PubMed

Jung, Young-Ho; Choi, Jihoon

2017-02-25

A new hybrid automatic repeat request (HARQ) scheme for multicast service for wireless sensor networks is proposed in this study. In the proposed algorithm, the HARQ operation is combined with an autonomous retransmission method that ensure a data packet is transmitted irrespective of whether or not the packet is successfully decoded at the receivers. The optimal number of autonomous retransmissions is determined to ensure maximum spectral efficiency, and a practical method that adjusts the number of autonomous retransmissions for realistic conditions is developed. Simulation results show that the proposed method achieves higher spectral efficiency than existing HARQ techniques.

Energy-saving scheme based on downstream packet scheduling in ethernet passive optical networks

NASA Astrophysics Data System (ADS)

Zhang, Lincong; Liu, Yejun; Guo, Lei; Gong, Xiaoxue

2013-03-01

With increasing network sizes, the energy consumption of Passive Optical Networks (PONs) has grown significantly. Therefore, it is important to design effective energy-saving schemes in PONs. Generally, energy-saving schemes have focused on sleeping the low-loaded Optical Network Units (ONUs), which tends to bring large packet delays. Further, the traditional ONU sleep modes are not capable of sleeping the transmitter and receiver independently, though they are not required to transmit or receive packets. Clearly, this approach contributes to wasted energy. Thus, in this paper, we propose an Energy-Saving scheme that is based on downstream Packet Scheduling (ESPS) in Ethernet PON (EPON). First, we design both an algorithm and a rule for downstream packet scheduling at the inter- and intra-ONU levels, respectively, to reduce the downstream packet delay. After that, we propose a hybrid sleep mode that contains not only ONU deep sleep mode but also independent sleep modes for the transmitter and the receiver. This ensures that the energy consumed by the ONUs is minimal. To realize the hybrid sleep mode, a modified GATE control message is designed that involves 10 time points for sleep processes. In ESPS, the 10 time points are calculated according to the allocated bandwidths in both the upstream and the downstream. The simulation results show that ESPS outperforms traditional Upstream Centric Scheduling (UCS) scheme in terms of energy consumption and the average delay for both real-time and non-real-time packets downstream. The simulation results also show that the average energy consumption of each ONU in larger-sized networks is less than that in smaller-sized networks; hence, our ESPS is better suited for larger-sized networks.

Performance comparison between packet and continuous data transmission using two adaptive equalizers in shallow water

NASA Astrophysics Data System (ADS)

Yoon, Jong Rak; Park, Kyu-Chil; Park, Jihyun

2015-07-01

Transmitted signals are markedly affected by sea surface and bottom boundaries in shallow water. The time variant reflection signals from such boundaries characterize the channel as a frequency-selective fading channel and cause intersymbol interference (ISI) in underwater acoustic communication. A channel-estimate-based equalizer is usually adopted to compensate for the reflected signals under this kind of acoustic channel. In this study, we apply two approaches for packet and continuous data transmission of the quadrature phase shift keying (QPSK) system. One is the use of a two-dimensional (2D) rotation matrix in a non-frequency-selective channel. The other is the use of two equalizers of types — the feed forward equalizer (FFE) and decision-directed equalizer (DDE) — with a normalized least mean square (NLMS) algorithm in a frequency-selective channel. The percentage improvement of packet transmission is notably better than that of continuous transmission.

Evaluating CMA equalization of SOQPSK-TG data for aeronautical telemetry

NASA Astrophysics Data System (ADS)

Cole-Rhodes, Arlene; KoneDossongui, Serge; Umuolo, Henry; Rice, Michael

2015-05-01

This paper presents the results of using a constant modulus algorithm (CMA) to recover shaped offset quadrature-phase shift keying (SOQPSK)-TG modulated data, which has been transmitted using the iNET data packet structure. This standard is defined and used for aeronautical telemetry. Based on the iNET-packet structure, the adaptive block processing CMA equalizer can be initialized using the minimum mean square error (MMSE) equalizer [3]. This CMA equalizer is being evaluated for use on iNET structured data, with initial tests being conducted on measured data which has been received in a controlled laboratory environment. Thus the CMA equalizer is applied at the receiver to data packets which have been experimentally generated in order to determine the feasibility of our equalization approach, and its performance is compared to that of the MMSE equalizer. Performance evaluation is based on computed bit error rate (BER) counts for these equalizers.

Improvements in Routing for Packet-Switched Networks

DTIC Science & Technology

1975-02-18

PROGRAM FOR COMPUTER SIMULATION . . 90 B.l Flow Diagram of Adaptive Routine 90 B.2 Progiam ARPSIM 93 B.3 Explanation of Variables...equa. 90 APPENDIX B ADAPTIVE ROUTING PROGRAM FOR COMPUTER SIMULA HON The computer simulation for adaptive routing was initially run on a DDP-24 small...TRANSMIT OVER AVAILABLE LINKS MESSAGES IN QUEUE COMPUTE Ni NUMBER OF ARRIVALS AT EACH NODE i AT TIME T Fig. Bla - Flow Diagram of Program Routine 92

Assured Information Flow Capping Architecture.

DTIC Science & Technology

1985-05-01

Air Control System Deployment, ESD-TR-71-371, AD 733 584, Electronic Systems Division, AFSC, Hanscom Air Force Base, MA, November 1971. 3. I. Gitman and...H. Frank, "Economic Analysis of Integrated Voice and Data Networks: A Case Study," Proceedings of the IEEE, November 1978. 4. H. Frank and I. Gitman ... Gitman , "Study Shows Packet Switching Best for Voice Traffic, Too," Data Communications, March 1979. ___ "Economic Analysis of Integrated Voice and

Aircraft Simulator: Multiple-Cockpit Combat Mission Trainer Network.

DTIC Science & Technology

1984-01-01

Force Human Resources Laboratory (AFHRL), the Air Force Office of Scientific Research (AFOSR), and the Southeastern Center for Electrical Engineering...New York: IEEE Press. Rapumno, R. A. , A Shimsaki, N. (1974). Synchronization of earth stations to satellite-switched sequences. Comunications ...Satellite Technology, 33 (Progress in Astronautics and Aeronautics) , 411-429. Tobagi, F. A. (1980). Multiaccess protocols in packet comunication systems. IEEE TMS. C". , 4 (vol. CO-28), 468-488. 27 ORR .0--000

Chaos control of Hastings–Powell model by combining chaotic motions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Danca, Marius-F., E-mail: danca@rist.ro; Chattopadhyay, Joydev, E-mail: joydev@isical.ac.in

2016-04-15

In this paper, we propose a Parameter Switching (PS) algorithm as a new chaos control method for the Hastings–Powell (HP) system. The PS algorithm is a convergent scheme that switches the control parameter within a set of values while the controlled system is numerically integrated. The attractor obtained with the PS algorithm matches the attractor obtained by integrating the system with the parameter replaced by the averaged value of the switched parameter values. The switching rule can be applied periodically or randomly over a set of given values. In this way, every stable cycle of the HP system can bemore » approximated if its underlying parameter value equalizes the average value of the switching values. Moreover, the PS algorithm can be viewed as a generalization of Parrondo's game, which is applied for the first time to the HP system, by showing that losing strategy can win: “losing + losing = winning.” If “loosing” is replaced with “chaos” and, “winning” with “order” (as the opposite to “chaos”), then by switching the parameter value in the HP system within two values, which generate chaotic motions, the PS algorithm can approximate a stable cycle so that symbolically one can write “chaos + chaos = regular.” Also, by considering a different parameter control, new complex dynamics of the HP model are revealed.« less

Full Duplex, Spread Spectrum Radio System

NASA Technical Reports Server (NTRS)

Harvey, Bruce A.

2000-01-01

The goal of this project was to support the development of a full duplex, spread spectrum voice communications system. The assembly and testing of a prototype system consisting of a Harris PRISM spread spectrum radio, a TMS320C54x signal processing development board and a Zilog Z80180 microprocessor was underway at the start of this project. The efforts under this project were the development of multiple access schemes, analysis of full duplex voice feedback delays, and the development and analysis of forward error correction (FEC) algorithms. The multiple access analysis involved the selection between code division multiple access (CDMA), frequency division multiple access (FDMA) and time division multiple access (TDMA). Full duplex voice feedback analysis involved the analysis of packet size and delays associated with full loop voice feedback for confirmation of radio system performance. FEC analysis included studies of the performance under the expected burst error scenario with the relatively short packet lengths, and analysis of implementation in the TMS320C54x digital signal processor. When the capabilities and the limitations of the components used were considered, the multiple access scheme chosen was a combination TDMA/FDMA scheme that will provide up to eight users on each of three separate frequencies. Packets to and from each user will consist of 16 samples at a rate of 8,000 samples per second for a total of 2 ms of voice information. The resulting voice feedback delay will therefore be 4 - 6 ms. The most practical FEC algorithm for implementation was a convolutional code with a Viterbi decoder. Interleaving of the bits of each packet will be required to offset the effects of burst errors.

Optimizing Controlling-Value-Based Power Gating with Gate Count and Switching Activity

NASA Astrophysics Data System (ADS)

Chen, Lei; Kimura, Shinji

In this paper, a new heuristic algorithm is proposed to optimize the power domain clustering in controlling-value-based (CV-based) power gating technology. In this algorithm, both the switching activity of sleep signals (p) and the overall numbers of sleep gates (gate count, N) are considered, and the sum of the product of p and N is optimized. The algorithm effectively exerts the total power reduction obtained from the CV-based power gating. Even when the maximum depth is kept to be the same, the proposed algorithm can still achieve power reduction approximately 10% more than that of the prior algorithms. Furthermore, detailed comparison between the proposed heuristic algorithm and other possible heuristic algorithms are also presented. HSPICE simulation results show that over 26% of total power reduction can be obtained by using the new heuristic algorithm. In addition, the effect of dynamic power reduction through the CV-based power gating method and the delay overhead caused by the switching of sleep transistors are also shown in this paper.

Self-Organized Link State Aware Routing for Multiple Mobile Agents in Wireless Network

NASA Astrophysics Data System (ADS)

Oda, Akihiro; Nishi, Hiroaki

Recently, the importance of data sharing structures in autonomous distributed networks has been increasing. A wireless sensor network is used for managing distributed data. This type of distributed network requires effective information exchanging methods for data sharing. To reduce the traffic of broadcasted messages, reduction of the amount of redundant information is indispensable. In order to reduce packet loss in mobile ad-hoc networks, QoS-sensitive routing algorithm have been frequently discussed. The topology of a wireless network is likely to change frequently according to the movement of mobile nodes, radio disturbance, or fading due to the continuous changes in the environment. Therefore, a packet routing algorithm should guarantee QoS by using some quality indicators of the wireless network. In this paper, a novel information exchanging algorithm developed using a hash function and a Boolean operation is proposed. This algorithm achieves efficient information exchanges by reducing the overhead of broadcasting messages, and it can guarantee QoS in a wireless network environment. It can be applied to a routing algorithm in a mobile ad-hoc network. In the proposed routing algorithm, a routing table is constructed by using the received signal strength indicator (RSSI), and the neighborhood information is periodically broadcasted depending on this table. The proposed hash-based routing entry management by using an extended MAC address can eliminate the overhead of message flooding. An analysis of the collision of hash values contributes to the determination of the length of the hash values, which is minimally required. Based on the verification of a mathematical theory, an optimum hash function for determining the length of hash values can be given. Simulations are carried out to evaluate the effectiveness of the proposed algorithm and to validate the theory in a general wireless network routing algorithm.

IpexT: Integrated Planning and Execution for Military Satellite Tele-Communications

NASA Technical Reports Server (NTRS)

Plaunt, Christian; Rajan, Kanna

2004-01-01

The next generation of military communications satellites may be designed as a fast packet-switched constellation of spacecraft able to withstand substantial bandwidth capacity fluctuation in the face of dynamic resource utilization and rapid environmental changes including jamming of communication frequencies and unstable weather phenomena. We are in the process of designing an integrated scheduling and execution tool which will aid in the analysis of the design parameters needed for building such a distributed system for nominal and battlefield communications. This paper discusses the design of such a system based on a temporal constraint posting planner/scheduler and a smart executive which can cope with a dynamic environment to make a more optimal utilization of bandwidth than the current circuit switched based approach.

Bandwidth characteristics of multimedia data traffic on a local area network

NASA Technical Reports Server (NTRS)

Chuang, Shery L.; Doubek, Sharon; Haines, Richard F.

1993-01-01

Limited spacecraft communication links call for users to investigate the potential use of video compression and multimedia technologies to optimize bandwidth allocations. The objective was to determine the transmission characteristics of multimedia data - motion video, text or bitmap graphics, and files transmitted independently and simultaneously over an ethernet local area network. Commercial desktop video teleconferencing hardware and software and Intel's proprietary Digital Video Interactive (DVI) video compression algorithm were used, and typical task scenarios were selected. The transmission time, packet size, number of packets, and network utilization of the data were recorded. Each data type - compressed motion video, text and/or bitmapped graphics, and a compressed image file - was first transmitted independently and its characteristics recorded. The results showed that an average bandwidth of 7.4 kilobits per second (kbps) was used to transmit graphics; an average bandwidth of 86.8 kbps was used to transmit an 18.9-kilobyte (kB) image file; a bandwidth of 728.9 kbps was used to transmit compressed motion video at 15 frames per second (fps); and a bandwidth of 75.9 kbps was used to transmit compressed motion video at 1.5 fps. Average packet sizes were 933 bytes for graphics, 498.5 bytes for the image file, 345.8 bytes for motion video at 15 fps, and 341.9 bytes for motion video at 1.5 fps. Simultaneous transmission of multimedia data types was also characterized. The multimedia packets used transmission bandwidths of 341.4 kbps and 105.8kbps. Bandwidth utilization varied according to the frame rate (frames per second) setting for the transmission of motion video. Packet size did not vary significantly between the data types. When these characteristics are applied to Space Station Freedom (SSF), the packet sizes fall within the maximum specified by the Consultative Committee for Space Data Systems (CCSDS). The uplink of imagery to SSF may be performed at minimal frame rates and/or within seconds of delay, depending on the user's allocated bandwidth. Further research to identify the acceptable delay interval and its impact on human performance is required. Additional studies in network performance using various video compression algorithms and integrated multimedia techniques are needed to determine the optimal design approach for utilizing SSF's data communications system.

"Sunday-start" OC regimen popular but may pose risk.

PubMed

1991-03-01

There is a controversy over the effectiveness of the "Sunday-Start" oral contraceptive packaging. Some clinicians believe that the Sunday-start pills are dangerously ineffective because up to 6 days after menses can elapse before a new packet is started. This is particularly risky for women beginning orals, or switching from a combined pill to a new triphasic. These clinicians consider them merely a successful marketing strategy. Most physicians consider the Sunday-start pills more effective because of improved compliance. The reasons cited are that women are too confused to remember to start pill packets on odd days, and that they like having their menses occur on weekdays. Arguments on this side are studies showing that the length of the pill-free interval does not affect the efficacy of that cycle. There are not data to resolve this debate other than a report from Ortho Pharmaceuticals that women prefer Sunday-start 3:1.

Smart home design for electronic devices monitoring based wireless gateway network using cisco packet tracer

NASA Astrophysics Data System (ADS)

Sihombing, Oloan; Zendrato, Niskarto; Laia, Yonata; Nababan, Marlince; Sitanggang, Delima; Purba, Windania; Batubara, Diarmansyah; Aisyah, Siti; Indra, Evta; Siregar, Saut

2018-04-01

In the era of technological development today, the technology has become the need for the life of today's society. One is needed to create a smart home in turning on and off electronic devices via smartphone. So far in turning off and turning the home electronic device is done by pressing the switch or remote button, so in control of electronic device control less effective. The home smart design is done by simulation concept by testing system, network configuration, and wireless home gateway computer network equipment required by a smart home network on cisco packet tracer using Internet Thing (IoT) control. In testing the IoT home network wireless network gateway system, multiple electronic devices can be controlled and monitored via smartphone based on predefined configuration conditions. With the Smart Ho me can potentially increase energy efficiency, decrease energy usage costs, control electronics and change the role of residents.

A dynamic routing strategy with limited buffer on scale-free network

NASA Astrophysics Data System (ADS)

Wang, Yufei; Liu, Feng

2016-04-01

In this paper, we propose an integrated routing strategy based on global static topology information and local dynamic data packet queue lengths to improve the transmission efficiency of scale-free networks. The proposed routing strategy is a combination of a global static routing strategy (based on the shortest path algorithm) and local dynamic queue length management, in which, instead of using an infinite buffer, the queue length of each node i in the proposed routing strategy is limited by a critical queue length Qic. When the network traffic is lower and the queue length of each node i is shorter than its critical queue length Qic, it forwards packets according to the global routing table. With increasing network traffic, when the buffers of the nodes with higher degree are full, they do not receive packets due to their limited buffers and the packets have to be delivered to the nodes with lower degree. The global static routing strategy can shorten the transmission time that it takes a packet to reach its destination, and the local limited queue length can balance the network traffic. The optimal critical queue lengths of nodes have been analysed. Simulation results show that the proposed routing strategy can get better performance than that of the global static strategy based on topology, and almost the same performance as that of the global dynamic routing strategy with less complexity.

Estimating mental fatigue based on electroencephalogram and heart rate variability

NASA Astrophysics Data System (ADS)

Zhang, Chong; Yu, Xiaolin

2010-01-01

The effects of long term mental arithmetic task on psychology are investigated by subjective self-reporting measures and action performance test. Based on electroencephalogram (EEG) and heart rate variability (HRV), the impacts of prolonged cognitive activity on central nervous system and autonomic nervous system are observed and analyzed. Wavelet packet parameters of EEG and power spectral indices of HRV are combined to estimate the change of mental fatigue. Then wavelet packet parameters of EEG which change significantly are extracted as the features of brain activity in different mental fatigue state, support vector machine (SVM) algorithm is applied to differentiate two mental fatigue states. The experimental results show that long term mental arithmetic task induces the mental fatigue. The wavelet packet parameters of EEG and power spectral indices of HRV are strongly correlated with mental fatigue. The predominant activity of autonomic nervous system of subjects turns to the sympathetic activity from parasympathetic activity after the task. Moreover, the slow waves of EEG increase, the fast waves of EEG and the degree of disorder of brain decrease compared with the pre-task. The SVM algorithm can effectively differentiate two mental fatigue states, which achieves the maximum classification accuracy (91%). The SVM algorithm could be a promising tool for the evaluation of mental fatigue. Fatigue, especially mental fatigue, is a common phenomenon in modern life, is a persistent occupational hazard for professional. Mental fatigue is usually accompanied with a sense of weariness, reduced alertness, and reduced mental performance, which would lead the accidents in life, decrease productivity in workplace and harm the health. Therefore, the evaluation of mental fatigue is important for the occupational risk protection, productivity, and occupational health.

An Adaptive Method for Switching between Pedestrian/Car Indoor Positioning Algorithms based on Multilayer Time Sequences

PubMed Central

Gu, Zhining; Guo, Wei; Li, Chaoyang; Zhu, Xinyan; Guo, Tao

2018-01-01

Pedestrian dead reckoning (PDR) positioning algorithms can be used to obtain a target’s location only for movement with step features and not for driving, for which the trilateral Bluetooth indoor positioning method can be used. In this study, to obtain the precise locations of different states (pedestrian/car) using the corresponding positioning algorithms, we propose an adaptive method for switching between the PDR and car indoor positioning algorithms based on multilayer time sequences (MTSs). MTSs, which consider the behavior context, comprise two main aspects: filtering of noisy data in small-scale time sequences and using a state chain to reduce the time delay of algorithm switching in large-scale time sequences. The proposed method can be expected to realize the recognition of stationary, walking, driving, or other states; switch to the correct indoor positioning algorithm; and improve the accuracy of localization compared to using a single positioning algorithm. Our experiments show that the recognition of static, walking, driving, and other states improves by 5.5%, 45.47%, 26.23%, and 21% on average, respectively, compared with convolutional neural network (CNN) method. The time delay decreases by approximately 0.5–8.5 s for the transition between states and by approximately 24 s for the entire process. PMID:29495503

Exploring a QoS Driven Scheduling Approach for Peer-to-Peer Live Streaming Systems with Network Coding

PubMed Central

Cui, Laizhong; Lu, Nan; Chen, Fu

2014-01-01

Most large-scale peer-to-peer (P2P) live streaming systems use mesh to organize peers and leverage pull scheduling to transmit packets for providing robustness in dynamic environment. The pull scheduling brings large packet delay. Network coding makes the push scheduling feasible in mesh P2P live streaming and improves the efficiency. However, it may also introduce some extra delays and coding computational overhead. To improve the packet delay, streaming quality, and coding overhead, in this paper are as follows. we propose a QoS driven push scheduling approach. The main contributions of this paper are: (i) We introduce a new network coding method to increase the content diversity and reduce the complexity of scheduling; (ii) we formulate the push scheduling as an optimization problem and transform it to a min-cost flow problem for solving it in polynomial time; (iii) we propose a push scheduling algorithm to reduce the coding overhead and do extensive experiments to validate the effectiveness of our approach. Compared with previous approaches, the simulation results demonstrate that packet delay, continuity index, and coding ratio of our system can be significantly improved, especially in dynamic environments. PMID:25114968

Direct trust-based security scheme for RREQ flooding attack in mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Kumar, Sunil; Dutta, Kamlesh

2017-06-01

The routing algorithms in MANETs exhibit distributed and cooperative behaviour which makes them easy target for denial of service (DoS) attacks. RREQ flooding attack is a flooding-type DoS attack in context to Ad hoc On Demand Distance Vector (AODV) routing protocol, where the attacker broadcasts massive amount of bogus Route Request (RREQ) packets to set up the route with the non-existent or existent destination in the network. This paper presents direct trust-based security scheme to detect and mitigate the impact of RREQ flooding attack on the network, in which, every node evaluates the trust degree value of its neighbours through analysing the frequency of RREQ packets originated by them over a short period of time. Taking the node's trust degree value as the input, the proposed scheme is smoothly extended for suppressing the surplus RREQ and bogus RREQ flooding packets at one-hop neighbours during the route discovery process. This scheme distinguishes itself from existing techniques by not directly blocking the service of a normal node due to increased amount of RREQ packets in some unusual conditions. The results obtained throughout the simulation experiments clearly show the feasibility and effectiveness of the proposed defensive scheme.

Multiple Path Static Routing Protocols for Packet Switched Networks.

DTIC Science & Technology

1983-09-01

model are: (1) Physical Layer (2) Data Link Layer (3) Network Layer (4) Transport Layer (5) Session Layer (6) Presentation Layer (7) pplication Layer The...The transport layer, also known as the host-host layer, accepts data from the session layer, splits it into smaller units if needed, passes these to...the network layer, and ensures that all the pieces arrive correctly at the other end. It creates a distinct network connection for each transport

A novel coherent optical en/decoder for optical label processing of OCDM-based optical packets switching networks

NASA Astrophysics Data System (ADS)

Zhang, Chongfu; Qiu, Kun

2007-11-01

A coherent optical en/decoder based on photonic crystal (PhC) for optical code-division-multiple (OCDM)-based optical label (OCDM-OL) optical packets switching (OPS) networks is proposed in this paper. In this scheme, the optical pulse phase and time delay can be flexibly controlled by the photonic crystal phase shifter and delayer using the appropriate design of fabrication. In this design, the combination calculation of the impurity and normal period layers is applied, according to the PhC transmission matrix theorem. The design and theoretical analysis of the PhC-based optical coherent en/decoder is mainly focused. In addition, the performances of the PhC-based optical en/decoders are analyzed in detail. The reflection, the transmission, delay characteristic and the optical spectrum of pulse en/decoded are studied for the waves tuned in the photonic band-gap by the numerical calculation, taking into account 1-Dimension (1D) PhC. Theoretical analysis and numerical results show that optical pulse is achieved to properly phase modulation and time delay by the proposed scheme, optical label based on OCDM is rewrote successfully by new code for OCDM-based OPS (OCDM-OPS), and an over 8.5 dB ration of auto- and cross-correlation is gained, which demonstrates the applicability of true pulse phase modulation in a number of applications.

XML Tactical Chat (XTC): The Way Ahead for Navy Chat

DTIC Science & Technology

2007-09-01

multicast transmissions via sophisticated pruning algorithms, while allowing multicast packets to “ tunnel ” through IP routers. [Macedonia, Brutzman 1994...conference was Jabber Inc. who added some great insight into the power of Jabber. • Great features including blackberry handheld connectivity and

Data-Driven Packet Loss Estimation for Node Healthy Sensing in Decentralized Cluster.

PubMed

Fan, Hangyu; Wang, Huandong; Li, Yong

2018-01-23

Decentralized clustering of modern information technology is widely adopted in various fields these years. One of the main reason is the features of high availability and the failure-tolerance which can prevent the entire system form broking down by a failure of a single point. Recently, toolkits such as Akka are used by the public commonly to easily build such kind of cluster. However, clusters of such kind that use Gossip as their membership managing protocol and use link failure detecting mechanism to detect link failures cannot deal with the scenario that a node stochastically drops packets and corrupts the member status of the cluster. In this paper, we formulate the problem to be evaluating the link quality and finding a max clique (NP-Complete) in the connectivity graph. We then proposed an algorithm that consists of two models driven by data from application layer to respectively solving these two problems. Through simulations with statistical data and a real-world product, we demonstrate that our algorithm has a good performance.

A network monitor for HTTPS protocol based on proxy

NASA Astrophysics Data System (ADS)

Liu, Yangxin; Zhang, Lingcui; Zhou, Shuguang; Li, Fenghua

2016-10-01

With the explosive growth of harmful Internet information such as pornography, violence, and hate messages, network monitoring is essential. Traditional network monitors is based mainly on bypass monitoring. However, we can't filter network traffic using bypass monitoring. Meanwhile, only few studies focus on the network monitoring for HTTPS protocol. That is because HTTPS data is in the encrypted traffic, which makes it difficult to monitor. This paper proposes a network monitor for HTTPS protocol based on proxy. We adopt OpenSSL to establish TLS secure tunes between clients and servers. Epoll is used to handle a large number of concurrent client connections. We also adopt Knuth- Morris-Pratt string searching algorithm (or KMP algorithm) to speed up the search process. Besides, we modify request packets to reduce the risk of errors and modify response packets to improve security. Experiments show that our proxy can monitor the content of all tested HTTPS websites efficiently with little loss of network performance.

New distributed fusion filtering algorithm based on covariances over sensor networks with random packet dropouts

NASA Astrophysics Data System (ADS)

Caballero-Águila, R.; Hermoso-Carazo, A.; Linares-Pérez, J.

2017-07-01

This paper studies the distributed fusion estimation problem from multisensor measured outputs perturbed by correlated noises and uncertainties modelled by random parameter matrices. Each sensor transmits its outputs to a local processor over a packet-erasure channel and, consequently, random losses may occur during transmission. Different white sequences of Bernoulli variables are introduced to model the transmission losses. For the estimation, each lost output is replaced by its estimator based on the information received previously, and only the covariances of the processes involved are used, without requiring the signal evolution model. First, a recursive algorithm for the local least-squares filters is derived by using an innovation approach. Then, the cross-correlation matrices between any two local filters is obtained. Finally, the distributed fusion filter weighted by matrices is obtained from the local filters by applying the least-squares criterion. The performance of the estimators and the influence of both sensor uncertainties and transmission losses on the estimation accuracy are analysed in a numerical example.

QKD-Based Secured Burst Integrity Design for Optical Burst Switched Networks

NASA Astrophysics Data System (ADS)

Balamurugan, A. M.; Sivasubramanian, A.; Parvathavarthini, B.

2016-03-01

The field of optical transmission has undergone numerous advancements and is still being researched mainly due to the fact that optical data transmission can be done at enormous speeds. It is quite evident that people prefer optical communication when it comes to large amount of data involving its transmission. The concept of switching in networks has matured enormously with several researches, architecture to implement and methods starting with Optical circuit switching to Optical Burst Switching. Optical burst switching is regarded as viable solution for switching bursts over networks but has several security vulnerabilities. However, this work exploited the security issues associated with Optical Burst Switching with respect to integrity of burst. This proposed Quantum Key based Secure Hash Algorithm (QKBSHA-512) with enhanced compression function design provides better avalanche effect over the conventional integrity algorithms.

Nonuniform traffic spots (NUTS) in multistage interconnection networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lang, T.; Kurisaki, L.

1990-09-01

The performance of multistage interconnection networks for multiprocessors is degraded when the traffic pattern produces nonuniform congestion in the blocking switches, that is, when there exist nonuniform traffic spots. For some specific patterns the authors evaluate this degradation in performance and propose modifications to the network organization and operation to reduce the degradation. Successful modifications are the use of diverting switches and the extension of the network with additional links. The use of these modifications makes the network more effective for a larger variety of traffic patterns. The authors also consider the case in which the network carries the superpositionmore » of two types of traffic. One type is the high throughput data and instruction traffic, while the other consists of control and I/O packets which are of low throughput but have severe real-time constraints. The authors conclude that diverting switches and networks with additional links are also suitable for assuring low latency for the real-time traffic, especially when using the displacing mode.« less

Attosecond vacuum UV coherent control of molecular dynamics

PubMed Central

Ranitovic, Predrag; Hogle, Craig W.; Rivière, Paula; Palacios, Alicia; Tong, Xiao-Ming; Toshima, Nobuyuki; González-Castrillo, Alberto; Martin, Leigh; Martín, Fernando; Murnane, Margaret M.; Kapteyn, Henry

2014-01-01

High harmonic light sources make it possible to access attosecond timescales, thus opening up the prospect of manipulating electronic wave packets for steering molecular dynamics. However, two decades after the birth of attosecond physics, the concept of attosecond chemistry has not yet been realized; this is because excitation and manipulation of molecular orbitals requires precisely controlled attosecond waveforms in the deep UV, which have not yet been synthesized. Here, we present a unique approach using attosecond vacuum UV pulse-trains to coherently excite and control the outcome of a simple chemical reaction in a deuterium molecule in a non-Born–Oppenheimer regime. By controlling the interfering pathways of electron wave packets in the excited neutral and singly ionized molecule, we unambiguously show that we can switch the excited electronic state on attosecond timescales, coherently guide the nuclear wave packets to dictate the way a neutral molecule vibrates, and steer and manipulate the ionization and dissociation channels. Furthermore, through advanced theory, we succeed in rigorously modeling multiscale electron and nuclear quantum control in a molecule. The observed richness and complexity of the dynamics, even in this very simplest of molecules, is both remarkable and daunting, and presents intriguing new possibilities for bridging the gap between attosecond physics and attochemistry. PMID:24395768

A new clustering strategy

NASA Astrophysics Data System (ADS)

Feng, Jian-xin; Tang, Jia-fu; Wang, Guang-xing

2007-04-01

On the basis of the analysis of clustering algorithm that had been proposed for MANET, a novel clustering strategy was proposed in this paper. With the trust defined by statistical hypothesis in probability theory and the cluster head selected by node trust and node mobility, this strategy can realize the function of the malicious nodes detection which was neglected by other clustering algorithms and overcome the deficiency of being incapable of implementing the relative mobility metric of corresponding nodes in the MOBIC algorithm caused by the fact that the receiving power of two consecutive HELLO packet cannot be measured. It's an effective solution to cluster MANET securely.

Evaluation of Swift Start TCP in Long-Delay Environment

NASA Technical Reports Server (NTRS)

Lawas-Grodek, Frances J.; Tran, Diepchi T.

2004-01-01

This report presents the test results of the Swift Start algorithm in single-flow and multiple-flow testbeds under the effects of high propagation delays, various slow bottlenecks, and small queue sizes. Although this algorithm estimates capacity and implements packet pacing, the findings were that in a heavily congested link, the Swift Start algorithm will not be applicable. The reason is that the bottleneck estimation is falsely influenced by timeouts induced by retransmissions and the expiration of delayed acknowledgment (ACK) timers, thus causing the modified Swift Start code to fall back to regular transmission control protocol (TCP).

A system architecture for an advanced Canadian wideband mobile satellite system

NASA Technical Reports Server (NTRS)

Takats, P.; Keelty, M.; Moody, H.

1993-01-01

In this paper, the system architecture for an advanced Canadian ka-band geostationary mobile satellite system is described, utilizing hopping spot beams to support a 256 kbps wideband service for both N-ISDN and packet-switched interconnectivity to small briefcase-size portable and mobile terminals. An assessment is given of the technical feasibility of the satellite payload and terminal design in the post year 2000 timeframe. The satellite payload includes regeneration and on-board switching to permit single hop interconnectivity between mobile terminals. The mobile terminal requires antenna tracking and platform stabilization to ensure acquisition of the satellite signal. The potential user applications targeted for this wideband service includes: home-office, multimedia, desk-top (PC) videoconferencing, digital audio broadcasting, single and multi-user personal communications.

Development of the network architecture of the Canadian MSAT system

NASA Technical Reports Server (NTRS)

Davies, N. George; Shoamanesh, Alireza; Leung, Victor C. M.

1988-01-01

A description is given of the present concept for the Canadian Mobile Satellite (MSAT) System and the development of the network architecture which will accommodate the planned family of three categories of service: a mobile radio service (MRS), a mobile telephone service (MTS), and a mobile data service (MDS). The MSAT satellite will have cross-strapped L-band and Ku-band transponders to provide communications services between L-band mobile terminals and fixed base stations supporting dispatcher-type MRS, gateway stations supporting MTS interconnections to the public telephone network, data hub stations supporting the MDS, and the network control center. The currently perceived centralized architecture with demand assignment multiple access for the circuit switched MRS, MTS and permanently assigned channels for the packet switched MDS is discussed.

Development of the network architecture of the Canadian MSAT system

NASA Astrophysics Data System (ADS)

Davies, N. George; Shoamanesh, Alireza; Leung, Victor C. M.

1988-05-01

A description is given of the present concept for the Canadian Mobile Satellite (MSAT) System and the development of the network architecture which will accommodate the planned family of three categories of service: a mobile radio service (MRS), a mobile telephone service (MTS), and a mobile data service (MDS). The MSAT satellite will have cross-strapped L-band and Ku-band transponders to provide communications services between L-band mobile terminals and fixed base stations supporting dispatcher-type MRS, gateway stations supporting MTS interconnections to the public telephone network, data hub stations supporting the MDS, and the network control center. The currently perceived centralized architecture with demand assignment multiple access for the circuit switched MRS, MTS and permanently assigned channels for the packet switched MDS is discussed.

Implementation of the MSAT network in Canada

NASA Astrophysics Data System (ADS)

Roscoe, Orest S.

1991-10-01

MSAT will be launched into geostationary orbit at 106.5 degrees west longitude. It will have an aggregate EIRP in excess of 57 dBw, making it the highest powered mobile satellite launched or planned to date. The MSAT ground segment will comprise hundreds of thousands of mobile terminals, as well as numerous feederlink earth stations. This requires a large scale network control system which is unprecedented in a satellite environment. The network control system must support circuit-switched voice and data services and packet-switched data services. In addition to assignment of capacity on demand, the control system must be able to support a variety of service features required by customers, as well as record information for billing. It must operate in a multi-beam, multi-satellite environment as the system grows.

A real-time and closed-loop control algorithm for cascaded multilevel inverter based on artificial neural network.

PubMed

Wang, Libing; Mao, Chengxiong; Wang, Dan; Lu, Jiming; Zhang, Junfeng; Chen, Xun

2014-01-01

In order to control the cascaded H-bridges (CHB) converter with staircase modulation strategy in a real-time manner, a real-time and closed-loop control algorithm based on artificial neural network (ANN) for three-phase CHB converter is proposed in this paper. It costs little computation time and memory. It has two steps. In the first step, hierarchical particle swarm optimizer with time-varying acceleration coefficient (HPSO-TVAC) algorithm is employed to minimize the total harmonic distortion (THD) and generate the optimal switching angles offline. In the second step, part of optimal switching angles are used to train an ANN and the well-designed ANN can generate optimal switching angles in a real-time manner. Compared with previous real-time algorithm, the proposed algorithm is suitable for a wider range of modulation index and results in a smaller THD and a lower calculation time. Furthermore, the well-designed ANN is embedded into a closed-loop control algorithm for CHB converter with variable direct voltage (DC) sources. Simulation results demonstrate that the proposed closed-loop control algorithm is able to quickly stabilize load voltage and minimize the line current's THD (<5%) when subjecting the DC sources disturbance or load disturbance. In real design stage, a switching angle pulse generation scheme is proposed and experiment results verify its correctness.

Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability

NASA Astrophysics Data System (ADS)

Lin, Yi-Kuei; Huang, Cheng-Fu

2015-04-01

From a quality of service viewpoint, the transmission packet unreliability and transmission time are both critical performance indicators in a computer system when assessing the Internet quality for supervisors and customers. A computer system is usually modelled as a network topology where each branch denotes a transmission medium and each vertex represents a station of servers. Almost every branch has multiple capacities/states due to failure, partial failure, maintenance, etc. This type of network is known as a multi-state computer network (MSCN). This paper proposes an efficient algorithm that computes the system reliability, i.e., the probability that a specified amount of data can be sent through k (k ≥ 2) disjoint minimal paths within both the tolerable packet unreliability and time threshold. Furthermore, two routing schemes are established in advance to indicate the main and spare minimal paths to increase the system reliability (referred to as spare reliability). Thus, the spare reliability can be readily computed according to the routing scheme.

Pithy Review on Routing Protocols in Wireless Sensor Networks and Least Routing Time Opportunistic Technique in WSN

NASA Astrophysics Data System (ADS)

Salman Arafath, Mohammed; Rahman Khan, Khaleel Ur; Sunitha, K. V. N.

2018-01-01

Nowadays due to most of the telecommunication standard development organizations focusing on using device-to-device communication so that they can provide proximity-based services and add-on services on top of the available cellular infrastructure. An Oppnets and wireless sensor network play a prominent role here. Routing in these networks plays a significant role in fields such as traffic management, packet delivery etc. Routing is a prodigious research area with diverse unresolved issues. This paper firstly focuses on the importance of Opportunistic routing and its concept then focus is shifted to prime aspect i.e. on packet reception ratio which is one of the highest QoS Awareness parameters. This paper discusses the two important functions of routing in wireless sensor networks (WSN) namely route selection using least routing time algorithm (LRTA) and data forwarding using clustering technique. Finally, the simulation result reveals that LRTA performs relatively better than the existing system in terms of average packet reception ratio and connectivity.

Protecting the Homeland Report of the Defense Science Board Task Force on Defensive Information Operations. 2000 Summer Study. Volume II

DTIC Science & Technology

2001-03-01

between attacks and other events such as accidents, system failures, or hacking by thrill-seekers. This challenge is exacerbated by the speed of events in...International Telegraph and Telephone (CCITT) international standards body and is referred to as Signaling System # 7 ( SS7 ). Commerc" I Intelligent...point to fixed infrastructure "" Signaling Transfer Point (STP) - Packet switch in CCITT#7 Network STP ... SS7 * System Data Bases i Network

Advances in Mechanisms Supporting Data Collection on Future Force Networks: Product Manager C4ISR On-the-Move

DTIC Science & Technology

2008-12-01

for Layer 3 data capture: NetPoll ncap tget Monitor session Radio System switch router User App interface box GPS This model applies to most fixed...developed a lightweight, custom implementation, termed ncap . As described in Section 3.1, the Ground Truth System provides a linkage between host...computer CPU time and GPS time, and ncap leverages this to perform highly precise (əmsec) time tagging of offered and received packets. Such

WavePacket: A Matlab package for numerical quantum dynamics.II: Open quantum systems, optimal control, and model reduction

NASA Astrophysics Data System (ADS)

Schmidt, Burkhard; Hartmann, Carsten

2018-07-01

WavePacket is an open-source program package for numeric simulations in quantum dynamics. It can solve time-independent or time-dependent linear Schrödinger and Liouville-von Neumann-equations in one or more dimensions. Also coupled equations can be treated, which allows, e.g., to simulate molecular quantum dynamics beyond the Born-Oppenheimer approximation. Optionally accounting for the interaction with external electric fields within the semi-classical dipole approximation, WavePacket can be used to simulate experiments involving tailored light pulses in photo-induced physics or chemistry. Being highly versatile and offering visualization of quantum dynamics 'on the fly', WavePacket is well suited for teaching or research projects in atomic, molecular and optical physics as well as in physical or theoretical chemistry. Building on the previous Part I [Comp. Phys. Comm. 213, 223-234 (2017)] which dealt with closed quantum systems and discrete variable representations, the present Part II focuses on the dynamics of open quantum systems, with Lindblad operators modeling dissipation and dephasing. This part also describes the WavePacket function for optimal control of quantum dynamics, building on rapid monotonically convergent iteration methods. Furthermore, two different approaches to dimension reduction implemented in WavePacket are documented here. In the first one, a balancing transformation based on the concepts of controllability and observability Gramians is used to identify states that are neither well controllable nor well observable. Those states are either truncated or averaged out. In the other approach, the H2-error for a given reduced dimensionality is minimized by H2 optimal model reduction techniques, utilizing a bilinear iterative rational Krylov algorithm. The present work describes the MATLAB version of WavePacket 5.3.0 which is hosted and further developed at the Sourceforge platform, where also extensive Wiki-documentation as well as numerous worked-out demonstration examples with animated graphics can be found.

An Efficient Downlink Scheduling Strategy Using Normal Graphs for Multiuser MIMO Wireless Systems

NASA Astrophysics Data System (ADS)

Chen, Jung-Chieh; Wu, Cheng-Hsuan; Lee, Yao-Nan; Wen, Chao-Kai

Inspired by the success of the low-density parity-check (LDPC) codes in the field of error-control coding, in this paper we propose transforming the downlink multiuser multiple-input multiple-output scheduling problem into an LDPC-like problem using the normal graph. Based on the normal graph framework, soft information, which indicates the probability that each user will be scheduled to transmit packets at the access point through a specified angle-frequency sub-channel, is exchanged among the local processors to iteratively optimize the multiuser transmission schedule. Computer simulations show that the proposed algorithm can efficiently schedule simultaneous multiuser transmission which then increases the overall channel utilization and reduces the average packet delay.

Research in network management techniques for tactical data communications networks

NASA Astrophysics Data System (ADS)

Boorstyn, R.; Kershenbaum, A.; Maglaris, B.; Sarachik, P.

1982-09-01

This is the final technical report for work performed on network management techniques for tactical data networks. It includes all technical papers that have been published during the control period. Research areas include Packet Network modelling, adaptive network routing, network design algorithms, network design techniques, and local area networks.

Application guide for universal source encoding for space

NASA Technical Reports Server (NTRS)

Yeh, Pen-Shu; Miller, Warner H.

1993-01-01

Lossless data compression was studied for many NASA missions. The Rice algorithm was demonstrated to provide better performance than other available techniques on most scientific data. A top-level description of the Rice algorithm is first given, along with some new capabilities implemented in both software and hardware forms. Systems issues important for onboard implementation, including sensor calibration, error propagation, and data packetization, are addressed. The latter part of the guide provides twelve case study examples drawn from a broad spectrum of science instruments.

A novel downlink scheduling strategy for traffic communication system based on TD-LTE technology.

PubMed

Chen, Ting; Zhao, Xiangmo; Gao, Tao; Zhang, Licheng

2016-01-01

There are many existing classical scheduling algorithms which can obtain better system throughput and user equality, however, they are not designed for traffic transportation environment, which cannot consider whether the transmission performance of various information flows could meet comprehensive requirements of traffic safety and delay tolerance. This paper proposes a novel downlink scheduling strategy for traffic communication system based on TD-LTE technology, which can perform two classification mappings for various information flows in the eNodeB: firstly, associate every information flow packet with traffic safety importance weight according to its relevance to the traffic safety; secondly, associate every traffic information flow with service type importance weight according to its quality of service (QoS) requirements. Once the connection is established, at every scheduling moment, scheduler would decide the scheduling order of all buffers' head of line packets periodically according to the instant value of scheduling importance weight function, which calculated by the proposed algorithm. From different scenario simulations, it can be verified that the proposed algorithm can provide superior differentiated transmission service and reliable QoS guarantee to information flows with different traffic safety levels and service types, which is more suitable for traffic transportation environment compared with the existing popularity PF algorithm. With the limited wireless resource, information flow closed related to traffic safety will always obtain priority scheduling right timely, which can help the passengers' journey more safe. Moreover, the proposed algorithm cannot only obtain good flow throughput and user fairness which are almost equal to those of the PF algorithm without significant differences, but also provide better realtime transmission guarantee to realtime information flow.

Electronically nonadiabatic wave packet propagation using frozen Gaussian scattering

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kondorskiy, Alexey D., E-mail: kondor@sci.lebedev.ru; Nanbu, Shinkoh, E-mail: shinkoh.nanbu@sophia.ac.jp

2015-09-21

We present an approach, which allows to employ the adiabatic wave packet propagation technique and semiclassical theory to treat the nonadiabatic processes by using trajectory hopping. The approach developed generates a bunch of hopping trajectories and gives all additional information to incorporate the effect of nonadiabatic coupling into the wave packet dynamics. This provides an interface between a general adiabatic frozen Gaussian wave packet propagation method and the trajectory surface hopping technique. The basic idea suggested in [A. D. Kondorskiy and H. Nakamura, J. Chem. Phys. 120, 8937 (2004)] is revisited and complemented in the present work by the elaborationmore » of efficient numerical algorithms. We combine our approach with the adiabatic Herman-Kluk frozen Gaussian approximation. The efficiency and accuracy of the resulting method is demonstrated by applying it to popular benchmark model systems including three Tully’s models and 24D model of pyrazine. It is shown that photoabsorption spectrum is successfully reproduced by using a few hundreds of trajectories. We employ the compact finite difference Hessian update scheme to consider feasibility of the ab initio “on-the-fly” simulations. It is found that this technique allows us to obtain the reliable final results using several Hessian matrix calculations per trajectory.« less

Design and implementation of a random neural network routing engine.

PubMed

Kocak, T; Seeber, J; Terzioglu, H

2003-01-01

Random neural network (RNN) is an analytically tractable spiked neural network model that has been implemented in software for a wide range of applications for over a decade. This paper presents the hardware implementation of the RNN model. Recently, cognitive packet networks (CPN) is proposed as an alternative packet network architecture where there is no routing table, instead the RNN based reinforcement learning is used to route packets. Particularly, we describe implementation details for the RNN based routing engine of a CPN network processor chip: the smart packet processor (SPP). The SPP is a dual port device that stores, modifies, and interprets the defining characteristics of multiple RNN models. In addition to hardware design improvements over the software implementation such as the dual access memory, output calculation step, and reduced output calculation module, this paper introduces a major modification to the reinforcement learning algorithm used in the original CPN specification such that the number of weight terms are reduced from 2n/sup 2/ to 2n. This not only yields significant memory savings, but it also simplifies the calculations for the steady state probabilities (neuron outputs in RNN). Simulations have been conducted to confirm the proper functionality for the isolated SPP design as well as for the multiple SPP's in a networked environment.

Selective randomized load balancing and mesh networks with changing demands

NASA Astrophysics Data System (ADS)

Shepherd, F. B.; Winzer, P. J.

2006-05-01

We consider the problem of building cost-effective networks that are robust to dynamic changes in demand patterns. We compare several architectures using demand-oblivious routing strategies. Traditional approaches include single-hop architectures based on a (static or dynamic) circuit-switched core infrastructure and multihop (packet-switched) architectures based on point-to-point circuits in the core. To address demand uncertainty, we seek minimum cost networks that can carry the class of hose demand matrices. Apart from shortest-path routing, Valiant's randomized load balancing (RLB), and virtual private network (VPN) tree routing, we propose a third, highly attractive approach: selective randomized load balancing (SRLB). This is a blend of dual-hop hub routing and randomized load balancing that combines the advantages of both architectures in terms of network cost, delay, and delay jitter. In particular, we give empirical analyses for the cost (in terms of transport and switching equipment) for the discussed architectures, based on three representative carrier networks. Of these three networks, SRLB maintains the resilience properties of RLB while achieving significant cost reduction over all other architectures, including RLB and multihop Internet protocol/multiprotocol label switching (IP/MPLS) networks using VPN-tree routing.

(abstract) Experimental Results From Internetworking Data Applications Over Various Wireless Networks Using a Single Flexible Error Control Protocol

NASA Technical Reports Server (NTRS)

Kanai, T.; Kramer, M.; McAuley, A. J.; Nowack, S.; Pinck, D. S.; Ramirez, G.; Stewart, I.; Tohme, H.; Tong, L.

1995-01-01

This paper describes results from several wireless field trials in New Jersey, California, and Colorado, conducted jointly by researchers at Bellcore, JPL, and US West over the course of 1993 and 1994. During these trials, applications communicated over multiple wireless networks including satellite, low power PCS, high power cellular, packet data, and the wireline Public Switched Telecommunications Network (PSTN). Key goals included 1) designing data applications and an API suited to mobile users, 2) investigating internetworking issues, 3) characterizing wireless networks under various field conditions, and 4) comparing the performance of different protocol mechanisms over the diverse networks and applications. We describe experimental results for different protocol mechanisms and parameters, such as acknowledgment schemes and packet sizes. We show the need for powerful error control mechanisms such as selective acknowledgements and combining data from multiple transmissions. We highlight the possibility of a common protocol for all wireless networks, from micro-cellular PCS to satellite networks.

Quality of Service for Real-Time Applications Over Next Generation Data Networks

NASA Technical Reports Server (NTRS)

Ivancic, William; Atiquzzaman, Mohammed; Bai, Haowei; Su, Hongjun; Jain, Raj; Duresi, Arjan; Goyal, Mukyl; Bharani, Venkata; Liu, Chunlei; Kota, Sastri

2001-01-01

This project, which started on January 1, 2000, was funded by NASA Glenn Research Center for duration of one year. The deliverables of the project included the following tasks: Study of QoS mapping between the edge and core networks envisioned in the Next Generation networks will provide us with the QoS guarantees that can be obtained from next generation networks. Buffer management techniques to provide strict guarantees to real-time end-to-end applications through preferential treatment to packets belonging to real-time applications. In particular, use of ECN to help reduce the loss on high bandwidth-delay product satellite networks needs to be studied. Effect of Prioritized Packet Discard to increase goodput of the network and reduce the buffering requirements in the ATM switches. Provision of new IP circuit emulation services over Satellite IP backbones using MPLS will be studied. Determine the architecture and requirements for internetworking ATN and the Next Generation Internet for real-time applications.

Inertial Gait Phase Detection for control of a drop foot stimulator Inertial sensing for gait phase detection.

PubMed

Kotiadis, D; Hermens, H J; Veltink, P H

2010-05-01

An Inertial Gait Phase Detection system was developed to replace heel switches and footswitches currently being used for the triggering of drop foot stimulators. A series of four algorithms utilising accelerometers and gyroscopes individually and in combination were tested and initial results are shown. Sensors were positioned on the outside of the upper shank. Tests were performed on data gathered from a subject, sufferer of stroke, implanted with a drop foot stimulator and triggered with the current trigger, the heel switch. Data tested includes a variety of activities representing everyday life. Flat surface walking, rough terrain and carpet walking show 100% detection and the ability of the algorithms to ignore non-gait events such as weight shifts. Timing analysis is performed against the current triggering method, the heel switch. After evaluating the heel switch timing against a reference system, namely the Vicon 370 marker and force plates system. Initial results show a close correlation between the current trigger detection and the inertial sensor based triggering algorithms. Algorithms were tested for stairs up and stairs down. Best results are observed for algorithms using gyroscope data. Algorithms were designed using threshold techniques for lowest possible computational load and with least possible sensor components to minimize power requirements and to allow for potential future implantation of sensor system.

Network congestion control algorithm based on Actor-Critic reinforcement learning model

NASA Astrophysics Data System (ADS)

Xu, Tao; Gong, Lina; Zhang, Wei; Li, Xuhong; Wang, Xia; Pan, Wenwen

2018-04-01

Aiming at the network congestion control problem, a congestion control algorithm based on Actor-Critic reinforcement learning model is designed. Through the genetic algorithm in the congestion control strategy, the network congestion problems can be better found and prevented. According to Actor-Critic reinforcement learning, the simulation experiment of network congestion control algorithm is designed. The simulation experiments verify that the AQM controller can predict the dynamic characteristics of the network system. Moreover, the learning strategy is adopted to optimize the network performance, and the dropping probability of packets is adaptively adjusted so as to improve the network performance and avoid congestion. Based on the above finding, it is concluded that the network congestion control algorithm based on Actor-Critic reinforcement learning model can effectively avoid the occurrence of TCP network congestion.

Performance Enhancement of Radial Distributed System with Distributed Generators by Reconfiguration Using Binary Firefly Algorithm

NASA Astrophysics Data System (ADS)

Rajalakshmi, N.; Padma Subramanian, D.; Thamizhavel, K.

2015-03-01

The extent of real power loss and voltage deviation associated with overloaded feeders in radial distribution system can be reduced by reconfiguration. Reconfiguration is normally achieved by changing the open/closed state of tie/sectionalizing switches. Finding optimal switch combination is a complicated problem as there are many switching combinations possible in a distribution system. Hence optimization techniques are finding greater importance in reducing the complexity of reconfiguration problem. This paper presents the application of firefly algorithm (FA) for optimal reconfiguration of radial distribution system with distributed generators (DG). The algorithm is tested on IEEE 33 bus system installed with DGs and the results are compared with binary genetic algorithm. It is found that binary FA is more effective than binary genetic algorithm in achieving real power loss reduction and improving voltage profile and hence enhancing the performance of radial distribution system. Results are found to be optimum when DGs are added to the test system, which proved the impact of DGs on distribution system.

Optimal route discovery for soft QOS provisioning in mobile ad hoc multimedia networks

NASA Astrophysics Data System (ADS)

Huang, Lei; Pan, Feng

2007-09-01

In this paper, we propose an optimal routing discovery algorithm for ad hoc multimedia networks whose resource keeps changing, First, we use stochastic models to measure the network resource availability, based on the information about the location and moving pattern of the nodes, as well as the link conditions between neighboring nodes. Then, for a certain multimedia packet flow to be transmitted from a source to a destination, we formulate the optimal soft-QoS provisioning problem as to find the best route that maximize the probability of satisfying its desired QoS requirements in terms of the maximum delay constraints. Based on the stochastic network resource model, we developed three approaches to solve the formulated problem: A centralized approach serving as the theoretical reference, a distributed approach that is more suitable to practical real-time deployment, and a distributed dynamic approach that utilizes the updated time information to optimize the routing for each individual packet. Examples of numerical results demonstrated that using the route discovered by our distributed algorithm in a changing network environment, multimedia applications could achieve better QoS statistically.

Intelligent Fault Diagnosis of HVCB with Feature Space Optimization-Based Random Forest

PubMed Central

Ma, Suliang; Wu, Jianwen; Wang, Yuhao; Jia, Bowen; Jiang, Yuan

2018-01-01

Mechanical faults of high-voltage circuit breakers (HVCBs) always happen over long-term operation, so extracting the fault features and identifying the fault type have become a key issue for ensuring the security and reliability of power supply. Based on wavelet packet decomposition technology and random forest algorithm, an effective identification system was developed in this paper. First, compared with the incomplete description of Shannon entropy, the wavelet packet time-frequency energy rate (WTFER) was adopted as the input vector for the classifier model in the feature selection procedure. Then, a random forest classifier was used to diagnose the HVCB fault, assess the importance of the feature variable and optimize the feature space. Finally, the approach was verified based on actual HVCB vibration signals by considering six typical fault classes. The comparative experiment results show that the classification accuracy of the proposed method with the origin feature space reached 93.33% and reached up to 95.56% with optimized input feature vector of classifier. This indicates that feature optimization procedure is successful, and the proposed diagnosis algorithm has higher efficiency and robustness than traditional methods. PMID:29659548

Towards a hybrid energy efficient multi-tree-based optimized routing protocol for wireless networks.

PubMed

Mitton, Nathalie; Razafindralambo, Tahiry; Simplot-Ryl, David; Stojmenovic, Ivan

2012-12-13

This paper considers the problem of designing power efficient routing with guaranteed delivery for sensor networks with unknown geographic locations. We propose HECTOR, a hybrid energy efficient tree-based optimized routing protocol, based on two sets of virtual coordinates. One set is based on rooted tree coordinates, and the other is based on hop distances toward several landmarks. In HECTOR, the node currently holding the packet forwards it to its neighbor that optimizes ratio of power cost over distance progress with landmark coordinates, among nodes that reduce landmark coordinates and do not increase distance in tree coordinates. If such a node does not exist, then forwarding is made to the neighbor that reduces tree-based distance only and optimizes power cost over tree distance progress ratio. We theoretically prove the packet delivery and propose an extension based on the use of multiple trees. Our simulations show the superiority of our algorithm over existing alternatives while guaranteeing delivery, and only up to 30% additional power compared to centralized shortest weighted path algorithm.

Towards a Hybrid Energy Efficient Multi-Tree-Based Optimized Routing Protocol for Wireless Networks

PubMed Central

Mitton, Nathalie; Razafindralambo, Tahiry; Simplot-Ryl, David; Stojmenovic, Ivan

2012-01-01

This paper considers the problem of designing power efficient routing with guaranteed delivery for sensor networks with unknown geographic locations. We propose HECTOR, a hybrid energy efficient tree-based optimized routing protocol, based on two sets of virtual coordinates. One set is based on rooted tree coordinates, and the other is based on hop distances toward several landmarks. In HECTOR, the node currently holding the packet forwards it to its neighbor that optimizes ratio of power cost over distance progress with landmark coordinates, among nodes that reduce landmark coordinates and do not increase distance in tree coordinates. If such a node does not exist, then forwarding is made to the neighbor that reduces tree-based distance only and optimizes power cost over tree distance progress ratio. We theoretically prove the packet delivery and propose an extension based on the use of multiple trees. Our simulations show the superiority of our algorithm over existing alternatives while guaranteeing delivery, and only up to 30% additional power compared to centralized shortest weighted path algorithm. PMID:23443398

Data-Driven Packet Loss Estimation for Node Healthy Sensing in Decentralized Cluster

PubMed Central

Fan, Hangyu; Wang, Huandong; Li, Yong

2018-01-01

Decentralized clustering of modern information technology is widely adopted in various fields these years. One of the main reason is the features of high availability and the failure-tolerance which can prevent the entire system form broking down by a failure of a single point. Recently, toolkits such as Akka are used by the public commonly to easily build such kind of cluster. However, clusters of such kind that use Gossip as their membership managing protocol and use link failure detecting mechanism to detect link failures cannot deal with the scenario that a node stochastically drops packets and corrupts the member status of the cluster. In this paper, we formulate the problem to be evaluating the link quality and finding a max clique (NP-Complete) in the connectivity graph. We then proposed an algorithm that consists of two models driven by data from application layer to respectively solving these two problems. Through simulations with statistical data and a real-world product, we demonstrate that our algorithm has a good performance. PMID:29360792

Performance analysis of cross-layer design with average PER constraint over MIMO fading channels

NASA Astrophysics Data System (ADS)

Dang, Xiaoyu; Liu, Yan; Yu, Xiangbin

2015-12-01

In this article, a cross-layer design (CLD) scheme for multiple-input and multiple-output system with the dual constraints of imperfect feedback and average packet error rate (PER) is presented, which is based on the combination of the adaptive modulation and the automatic repeat request protocols. The design performance is also evaluated over wireless Rayleigh fading channel. With the constraint of target PER and average PER, the optimum switching thresholds (STs) for attaining maximum spectral efficiency (SE) are developed. An effective iterative algorithm for finding the optimal STs is proposed via Lagrange multiplier optimisation. With different thresholds available, the analytical expressions of the average SE and PER are provided for the performance evaluation. To avoid the performance loss caused by the conventional single estimate, multiple outdated estimates (MOE) method, which utilises multiple previous channel estimation information, is presented for CLD to improve the system performance. It is shown that numerical simulations for average PER and SE are in consistent with the theoretical analysis and that the developed CLD with average PER constraint can meet the target PER requirement and show better performance in comparison with the conventional CLD with instantaneous PER constraint. Especially, the CLD based on the MOE method can obviously increase the system SE and reduce the impact of feedback delay greatly.

Error control techniques for satellite and space communications

NASA Technical Reports Server (NTRS)

Costello, Daniel J., Jr.

1994-01-01

The unequal error protection capabilities of convolutional and trellis codes are studied. In certain environments, a discrepancy in the amount of error protection placed on different information bits is desirable. Examples of environments which have data of varying importance are a number of speech coding algorithms, packet switched networks, multi-user systems, embedded coding systems, and high definition television. Encoders which provide more than one level of error protection to information bits are called unequal error protection (UEP) codes. In this work, the effective free distance vector, d, is defined as an alternative to the free distance as a primary performance parameter for UEP convolutional and trellis encoders. For a given (n, k), convolutional encoder, G, the effective free distance vector is defined as the k-dimensional vector d = (d(sub 0), d(sub 1), ..., d(sub k-1)), where d(sub j), the j(exp th) effective free distance, is the lowest Hamming weight among all code sequences that are generated by input sequences with at least one '1' in the j(exp th) position. It is shown that, although the free distance for a code is unique to the code and independent of the encoder realization, the effective distance vector is dependent on the encoder realization.

CFTLB: a novel cross-layer fault tolerant and load balancing protocol for WMN

NASA Astrophysics Data System (ADS)

Krishnaveni, N. N.; Chitra, K.

2017-12-01

Wireless mesh network (WMN) forms a wireless backbone framework for multi-hop transmission among the routers and clients in the extensible coverage area. To improve the throughput of WMNs with multiple gateways (GWs), several issues related to GW selection, load balancing and frequent link failures due to the presence of dynamic obstacles and channel interference should be addressed. This paper presents a novel cross-layer fault tolerant and load balancing (CFTLB) protocol to overcome the issues in WMN. Initially, the neighbour GW is searched and channel load is calculated. The GW having least channel load is selected which is estimated during the arrival of the new node. The proposed algorithm finds the alternate GWs and calculates the channel availability under high loading scenarios. If the current load in the GW is high, another GW is found and channel availability is calculated. Besides, it initiates the channel switching and establishes the communication with the mesh client effectively. The utilisation of hashing technique in proposed CFTLB verifies the status of the packets and achieves better performance in terms of router average throughput, throughput, average channel access time and lower end-to-end delay, communication overhead and average data loss in the channel compared to the existing protocols.

Harmonic Optimization in Voltage Source Inverter for PV Application using Heuristic Algorithms

NASA Astrophysics Data System (ADS)

Kandil, Shaimaa A.; Ali, A. A.; El Samahy, Adel; Wasfi, Sherif M.; Malik, O. P.

2016-12-01

Selective Harmonic Elimination (SHE) technique is the fundamental switching frequency scheme that is used to eliminate specific order harmonics. Its application to minimize low order harmonics in a three level inverter is proposed in this paper. The modulation strategy used here is SHEPWM and the nonlinear equations, that characterize the low order harmonics, are solved using Harmony Search Algorithm (HSA) to obtain the optimal switching angles that minimize the required harmonics and maintain the fundamental at the desired value. Total Harmonic Distortion (THD) of the output voltage is minimized maintaining selected harmonics within allowable limits. A comparison has been drawn between HSA, Genetic Algorithm (GA) and Newton Raphson (NR) technique using MATLAB software to determine the effectiveness of getting optimized switching angles.

Coverage-maximization in networks under resource constraints.

PubMed

Nandi, Subrata; Brusch, Lutz; Deutsch, Andreas; Ganguly, Niloy

2010-06-01

Efficient coverage algorithms are essential for information search or dispersal in all kinds of networks. We define an extended coverage problem which accounts for constrained resources of consumed bandwidth B and time T . Our solution to the network challenge is here studied for regular grids only. Using methods from statistical mechanics, we develop a coverage algorithm with proliferating message packets and temporally modulated proliferation rate. The algorithm performs as efficiently as a single random walker but O(B(d-2)/d) times faster, resulting in significant service speed-up on a regular grid of dimension d . The algorithm is numerically compared to a class of generalized proliferating random walk strategies and on regular grids shown to perform best in terms of the product metric of speed and efficiency.

Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games

NASA Astrophysics Data System (ADS)

Kozma, William; Lazos, Loukas

We address the problem of identifying misbehaving nodes that refuse to forward packets in wireless multi-hop networks. We map the process of locating the misbehaving nodes to the classic Rényi-Ulam game of 20 questions. Compared to previous methods, our mapping allows the evaluation of node behavior on a per-packet basis, without the need for energy-expensive overhearing techniques or intensive acknowledgment schemes. Furthermore, it copes with colluding adversaries that coordinate their behavioral patterns to avoid identification and frame honest nodes. We show via simulations that our algorithms reduce the communication overhead for identifying misbehaving nodes by at least one order of magnitude compared to other methods, while increasing the identification delay logarithmically with the path size.

Real-Time Station Grouping under Dynamic Traffic for IEEE 802.11ah

PubMed Central

Tian, Le; Latré, Steven

2017-01-01

IEEE 802.11ah, marketed as Wi-Fi HaLow, extends Wi-Fi to the sub-1 GHz spectrum. Through a number of physical layer (PHY) and media access control (MAC) optimizations, it aims to bring greatly increased range, energy-efficiency, and scalability. This makes 802.11ah the perfect candidate for providing connectivity to Internet of Things (IoT) devices. One of these new features, referred to as the Restricted Access Window (RAW), focuses on improving scalability in highly dense deployments. RAW divides stations into groups and reduces contention and collisions by only allowing channel access to one group at a time. However, the standard does not dictate how to determine the optimal RAW grouping parameters. The optimal parameters depend on the current network conditions, and it has been shown that incorrect configuration severely impacts throughput, latency and energy efficiency. In this paper, we propose a traffic-adaptive RAW optimization algorithm (TAROA) to adapt the RAW parameters in real time based on the current traffic conditions, optimized for sensor networks in which each sensor transmits packets with a certain (predictable) frequency and may change the transmission frequency over time. The TAROA algorithm is executed at each target beacon transmission time (TBTT), and it first estimates the packet transmission interval of each station only based on packet transmission information obtained by access point (AP) during the last beacon interval. Then, TAROA determines the RAW parameters and assigns stations to RAW slots based on this estimated transmission frequency. The simulation results show that, compared to enhanced distributed channel access/distributed coordination function (EDCA/DCF), the TAROA algorithm can highly improve the performance of IEEE 802.11ah dense networks in terms of throughput, especially when hidden nodes exist, although it does not always achieve better latency performance. This paper contributes with a practical approach to optimizing RAW grouping under dynamic traffic in real time, which is a major leap towards applying RAW mechanism in real-life IoT networks. PMID:28677617

Real-Time Station Grouping under Dynamic Traffic for IEEE 802.11ah.

PubMed

Tian, Le; Khorov, Evgeny; Latré, Steven; Famaey, Jeroen

2017-07-04

IEEE 802.11ah, marketed as Wi-Fi HaLow, extends Wi-Fi to the sub-1 GHz spectrum. Through a number of physical layer (PHY) and media access control (MAC) optimizations, it aims to bring greatly increased range, energy-efficiency, and scalability. This makes 802.11ah the perfect candidate for providing connectivity to Internet of Things (IoT) devices. One of these new features, referred to as the Restricted Access Window (RAW), focuses on improving scalability in highly dense deployments. RAW divides stations into groups and reduces contention and collisions by only allowing channel access to one group at a time. However, the standard does not dictate how to determine the optimal RAW grouping parameters. The optimal parameters depend on the current network conditions, and it has been shown that incorrect configuration severely impacts throughput, latency and energy efficiency. In this paper, we propose a traffic-adaptive RAW optimization algorithm (TAROA) to adapt the RAW parameters in real time based on the current traffic conditions, optimized for sensor networks in which each sensor transmits packets with a certain (predictable) frequency and may change the transmission frequency over time. The TAROA algorithm is executed at each target beacon transmission time (TBTT), and it first estimates the packet transmission interval of each station only based on packet transmission information obtained by access point (AP) during the last beacon interval. Then, TAROA determines the RAW parameters and assigns stations to RAW slots based on this estimated transmission frequency. The simulation results show that, compared to enhanced distributed channel access/distributed coordination function (EDCA/DCF), the TAROA algorithm can highly improve the performance of IEEE 802.11ah dense networks in terms of throughput, especially when hidden nodes exist, although it does not always achieve better latency performance. This paper contributes with a practical approach to optimizing RAW grouping under dynamic traffic in real time, which is a major leap towards applying RAW mechanism in real-life IoT networks.

A knowledge-based system with learning for computer communication network design

NASA Technical Reports Server (NTRS)

Pierre, Samuel; Hoang, Hai Hoc; Tropper-Hausen, Evelyne

1990-01-01

Computer communication network design is well-known as complex and hard. For that reason, the most effective methods used to solve it are heuristic. Weaknesses of these techniques are listed and a new approach based on artificial intelligence for solving this problem is presented. This approach is particularly recommended for large packet switched communication networks, in the sense that it permits a high degree of reliability and offers a very flexible environment dealing with many relevant design parameters such as link cost, link capacity, and message delay.

A Study of the IEEE 802.16 MAC Layer and its Utility in Augmenting the ADNS Architecture to Provide Adaptable Intra-Strike Group High-Speed Packet Switched Data, Imagery, and Voice Communications

DTIC Science & Technology

2005-09-01

This research explores the need for a high throughput, high speed network for use in a network centric wartime environment and how commercial...Automated Digital Network System (ADNS). This research explores the need for a high-throughput, high-speed network for use in a network centric ...1 C. DEPARTMENT OF DEFENSE (DOD) DESIRED END STATE ..............2 1. DOD Transformation to Network Centric Warfare (NCW) Operations

DDN New User Guide, 3rd Edition

DTIC Science & Technology

1993-04-05

Network Security Officer) 38. 58 MILNET 1, 87, 88 contacts (CMMC, EMMC , PMMC) 71, 72 Packet-switched network 5 , 6 definition of 1. 7-9 Passwords 24, 28...2* `1CUMENTATION PAGE jA4 Nom 0704-41 AD A2 P’fo ~W. Uf ýto JI toot IPU ~ 409 -�.s~ I ~ 2.REPORT OAT[ 3. REPORT TYPE AND DATES COVERED 4- 5 -9 Draft...Systems Interconnection Profile (COSIP), and gateway, concentrators. BES 93 4- ý 0 APBLE COPY .93-07561 14. SUBJECT TERMS NIC, TAG, WIIOIS, DDN, MILNET

Proceedings of a Conference on Telecommunication Technologies, Networkings and Libraries

NASA Astrophysics Data System (ADS)

Knight, N. K.

1981-12-01

Current and developing technologies for digital transmission of image data likely to have an impact on the operations of libraries and information centers or provide support for information networking are reviewed. Technologies reviewed include slow scan television, teleconferencing, and videodisc technology and standards development for computer network interconnection through hardware and software, particularly packet switched networks computer network protocols for library and information service applications, the structure of a national bibliographic telecommunications network; and the major policy issues involved in the regulation or deregulation of the common communications carriers industry.

Avoiding Biased-Feeding in the Scheduling of Collaborative Multipath TCP.

PubMed

Tsai, Meng-Hsun; Chou, Chien-Ming; Lan, Kun-Chan

2016-01-01

Smartphones have become the major communication and portable computing devices that access the Internet through Wi-Fi or mobile networks. Unfortunately, users without a mobile data subscription can only access the Internet at limited locations, such as hotspots. In this paper, we propose a collaborative bandwidth sharing protocol (CBSP) built on top of MultiPath TCP (MPTCP). CBSP enables users to buy bandwidth on demand from neighbors (called Helpers) and uses virtual interfaces to bind the subflows of MPTCP to avoid modifying the implementation of MPTCP. However, although MPTCP provides the required multi-homing functionality for bandwidth sharing, the current packet scheduling in collaborative MPTCP (e.g., Co-MPTCP) leads to the so-called biased-feeding problem. In this problem, the fastest link might always be selected to send packets whenever it has available cwnd, which results in other links not being fully utilized. In this work, we set out to design an algorithm, called Scheduled Window-based Transmission Control (SWTC), to improve the performance of packet scheduling in MPTCP, and we perform extensive simulations to evaluate its performance.

GREEN + IDMaps: A practical soulution for ensuring fairness in a biased internet

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kapadia, A. C.; Thulasidasan, S.; Feng, W. C.

2002-01-01

GREEN is a proactive queue-management (PQM) algorithm that removes TCP's bias against connections with longer round-trip times, while maintaining high link utilization and low packet-loss. GREEN applies knowledge of the steady-state behavior of TCP connections to proactively drop packets, thus preventing congestion from ever occurring. As a result, GREEN ensures much higher fairness between flows than other active queue management schemes like Flow Random Early Drop (FRED) and Stochastic Fair Blue (SFB), which suffer in topologies where a large number of flows have widely varying round-trip times. GREEN'S performance relies on its ability to gauge a flow's round-trip time (RTT).more » In previous work, we presented results for an ideal GREEN router which has accurate RTT information for a flow. In this paper, we present a practical solution based on IDMaps, an Internet distance-estimation service, and compare its performance to an ideal GREEN router. We show that a solution based on IDMaps is practical and maintains high fairness and link utilization, and low packet-loss rates.« less

Avoiding Biased-Feeding in the Scheduling of Collaborative Multipath TCP

PubMed Central

2016-01-01

Smartphones have become the major communication and portable computing devices that access the Internet through Wi-Fi or mobile networks. Unfortunately, users without a mobile data subscription can only access the Internet at limited locations, such as hotspots. In this paper, we propose a collaborative bandwidth sharing protocol (CBSP) built on top of MultiPath TCP (MPTCP). CBSP enables users to buy bandwidth on demand from neighbors (called Helpers) and uses virtual interfaces to bind the subflows of MPTCP to avoid modifying the implementation of MPTCP. However, although MPTCP provides the required multi-homing functionality for bandwidth sharing, the current packet scheduling in collaborative MPTCP (e.g., Co-MPTCP) leads to the so-called biased-feeding problem. In this problem, the fastest link might always be selected to send packets whenever it has available cwnd, which results in other links not being fully utilized. In this work, we set out to design an algorithm, called Scheduled Window-based Transmission Control (SWTC), to improve the performance of packet scheduling in MPTCP, and we perform extensive simulations to evaluate its performance. PMID:27529783

Information Theory Filters for Wavelet Packet Coefficient Selection with Application to Corrosion Type Identification from Acoustic Emission Signals

PubMed Central

Van Dijck, Gert; Van Hulle, Marc M.

2011-01-01

The damage caused by corrosion in chemical process installations can lead to unexpected plant shutdowns and the leakage of potentially toxic chemicals into the environment. When subjected to corrosion, structural changes in the material occur, leading to energy releases as acoustic waves. This acoustic activity can in turn be used for corrosion monitoring, and even for predicting the type of corrosion. Here we apply wavelet packet decomposition to extract features from acoustic emission signals. We then use the extracted wavelet packet coefficients for distinguishing between the most important types of corrosion processes in the chemical process industry: uniform corrosion, pitting and stress corrosion cracking. The local discriminant basis selection algorithm can be considered as a standard for the selection of the most discriminative wavelet coefficients. However, it does not take the statistical dependencies between wavelet coefficients into account. We show that, when these dependencies are ignored, a lower accuracy is obtained in predicting the corrosion type. We compare several mutual information filters to take these dependencies into account in order to arrive at a more accurate prediction. PMID:22163921

Experimentation and evaluation of advanced integrated system concepts

NASA Astrophysics Data System (ADS)

Ross, M.; Garrigus, K.; Gottschalck, J.; Rinearson, L.; Longee, E.

1980-09-01

This final report examines the implementation of a time-phased test bed for experimentation and evaluation of advanced system concepts relative to the future Defense Switched Network (DSN). After identifying issues pertinent to the DSN, a set of experiments which address these issues are developed. Experiments are ordered based on their immediacy and relative importance to DSN development. The set of experiments thus defined allows requirements for a time phased implementation of a test bed to be identified, and several generic test bed architectures which meet these requirements are examined. Specific architecture implementations are costed and cost/schedule profiles are generated as a function of experimental capability. The final recommended system consists of two separate test beds: a circuit switch test bed, configured around an off-the-shelf commercial switch, and directed toward the examination of nearer term and transitional issues raised by the evolving DSN; and a packet/hybrid test bed, featuring a discrete buildup of new hardware and software modules, and directed toward examination of the more advanced integrated voice and data telecommunications issues and concepts.

Impact of packet losses in scalable 3D holoscopic video coding

NASA Astrophysics Data System (ADS)

Conti, Caroline; Nunes, Paulo; Ducla Soares, Luís.

2014-05-01

Holoscopic imaging became a prospective glassless 3D technology to provide more natural 3D viewing experiences to the end user. Additionally, holoscopic systems also allow new post-production degrees of freedom, such as controlling the plane of focus or the viewing angle presented to the user. However, to successfully introduce this technology into the consumer market, a display scalable coding approach is essential to achieve backward compatibility with legacy 2D and 3D displays. Moreover, to effectively transmit 3D holoscopic content over error-prone networks, e.g., wireless networks or the Internet, error resilience techniques are required to mitigate the impact of data impairments in the user quality perception. Therefore, it is essential to deeply understand the impact of packet losses in terms of decoding video quality for the specific case of 3D holoscopic content, notably when a scalable approach is used. In this context, this paper studies the impact of packet losses when using a three-layer display scalable 3D holoscopic video coding architecture previously proposed, where each layer represents a different level of display scalability (i.e., L0 - 2D, L1 - stereo or multiview, and L2 - full 3D holoscopic). For this, a simple error concealment algorithm is used, which makes use of inter-layer redundancy between multiview and 3D holoscopic content and the inherent correlation of the 3D holoscopic content to estimate lost data. Furthermore, a study of the influence of 2D views generation parameters used in lower layers on the performance of the used error concealment algorithm is also presented.

Energy-Efficient Deadline-Aware Data-Gathering Scheme Using Multiple Mobile Data Collectors.

PubMed

Dasgupta, Rumpa; Yoon, Seokhoon

2017-04-01

In wireless sensor networks, the data collected by sensors are usually forwarded to the sink through multi-hop forwarding. However, multi-hop forwarding can be inefficient due to the energy hole problem and high communications overhead. Moreover, when the monitored area is large and the number of sensors is small, sensors cannot send the data via multi-hop forwarding due to the lack of network connectivity. In order to address those problems of multi-hop forwarding, in this paper, we consider a data collection scheme that uses mobile data collectors (MDCs), which visit sensors and collect data from them. Due to the recent breakthroughs in wireless power transfer technology, MDCs can also be used to recharge the sensors to keep them from draining their energy. In MDC-based data-gathering schemes, a big challenge is how to find the MDCs' traveling paths in a balanced way, such that their energy consumption is minimized and the packet-delay constraint is satisfied. Therefore, in this paper, we aim at finding the MDCs' paths, taking energy efficiency and delay constraints into account. We first define an optimization problem, named the delay-constrained energy minimization (DCEM) problem, to find the paths for MDCs. An integer linear programming problem is formulated to find the optimal solution. We also propose a two-phase path-selection algorithm to efficiently solve the DCEM problem. Simulations are performed to compare the performance of the proposed algorithms with two heuristics algorithms for the vehicle routing problem under various scenarios. The simulation results show that the proposed algorithms can outperform existing algorithms in terms of energy efficiency and packet delay.

Energy-Efficient Deadline-Aware Data-Gathering Scheme Using Multiple Mobile Data Collectors

PubMed Central

Dasgupta, Rumpa; Yoon, Seokhoon

2017-01-01

In wireless sensor networks, the data collected by sensors are usually forwarded to the sink through multi-hop forwarding. However, multi-hop forwarding can be inefficient due to the energy hole problem and high communications overhead. Moreover, when the monitored area is large and the number of sensors is small, sensors cannot send the data via multi-hop forwarding due to the lack of network connectivity. In order to address those problems of multi-hop forwarding, in this paper, we consider a data collection scheme that uses mobile data collectors (MDCs), which visit sensors and collect data from them. Due to the recent breakthroughs in wireless power transfer technology, MDCs can also be used to recharge the sensors to keep them from draining their energy. In MDC-based data-gathering schemes, a big challenge is how to find the MDCs’ traveling paths in a balanced way, such that their energy consumption is minimized and the packet-delay constraint is satisfied. Therefore, in this paper, we aim at finding the MDCs’ paths, taking energy efficiency and delay constraints into account. We first define an optimization problem, named the delay-constrained energy minimization (DCEM) problem, to find the paths for MDCs. An integer linear programming problem is formulated to find the optimal solution. We also propose a two-phase path-selection algorithm to efficiently solve the DCEM problem. Simulations are performed to compare the performance of the proposed algorithms with two heuristics algorithms for the vehicle routing problem under various scenarios. The simulation results show that the proposed algorithms can outperform existing algorithms in terms of energy efficiency and packet delay. PMID:28368300

Improving HybrID: How to best combine indirect and direct encoding in evolutionary algorithms.

PubMed

Helms, Lucas; Clune, Jeff

2017-01-01

Many challenging engineering problems are regular, meaning solutions to one part of a problem can be reused to solve other parts. Evolutionary algorithms with indirect encoding perform better on regular problems because they reuse genomic information to create regular phenotypes. However, on problems that are mostly regular, but contain some irregularities, which describes most real-world problems, indirect encodings struggle to handle the irregularities, hurting performance. Direct encodings are better at producing irregular phenotypes, but cannot exploit regularity. An algorithm called HybrID combines the best of both: it first evolves with indirect encoding to exploit problem regularity, then switches to direct encoding to handle problem irregularity. While HybrID has been shown to outperform both indirect and direct encoding, its initial implementation required the manual specification of when to switch from indirect to direct encoding. In this paper, we test two new methods to improve HybrID by eliminating the need to manually specify this parameter. Auto-Switch-HybrID automatically switches from indirect to direct encoding when fitness stagnates. Offset-HybrID simultaneously evolves an indirect encoding with directly encoded offsets, eliminating the need to switch. We compare the original HybrID to these alternatives on three different problems with adjustable regularity. The results show that both Auto-Switch-HybrID and Offset-HybrID outperform the original HybrID on different types of problems, and thus offer more tools for researchers to solve challenging problems. The Offset-HybrID algorithm is particularly interesting because it suggests a path forward for automatically and simultaneously combining the best traits of indirect and direct encoding.

Information-based management mode based on value network analysis for livestock enterprises

NASA Astrophysics Data System (ADS)

Liu, Haoqi; Lee, Changhoon; Han, Mingming; Su, Zhongbin; Padigala, Varshinee Anu; Shen, Weizheng

2018-01-01

With the development of computer and IT technologies, enterprise management has gradually become information-based management. Moreover, due to poor technical competence and non-uniform management, most breeding enterprises show a lack of organisation in data collection and management. In addition, low levels of efficiency result in increasing production costs. This paper adopts 'struts2' in order to construct an information-based management system for standardised and normalised management within the process of production in beef cattle breeding enterprises. We present a radio-frequency identification system by studying multiple-tag anti-collision via a dynamic grouping ALOHA algorithm. This algorithm is based on the existing ALOHA algorithm and uses an improved packet dynamic of this algorithm, which is characterised by a high-throughput rate. This new algorithm can reach a throughput 42% higher than that of the general ALOHA algorithm. With a change in the number of tags, the system throughput is relatively stable.

Random-access algorithms for multiuser computer communication networks. Doctoral thesis, 1 September 1986-31 August 1988

DOE Office of Scientific and Technical Information (OSTI.GOV)

Papantoni-Kazakos, P.; Paterakis, M.

1988-07-01

For many communication applications with time constraints (e.g., transmission of packetized voice messages), a critical performance measure is the percentage of messages transmitted within a given amount of time after their generation at the transmitting station. This report presents a random-access algorithm (RAA) suitable for time-constrained applications. Performance analysis demonstrates that significant message-delay improvement is attained at the expense of minimal traffic loss. Also considered is the case of noisy channels. The noise effect appears at erroneously observed channel feedback. Error sensitivity analysis shows that the proposed random-access algorithm is insensitive to feedback channel errors. Window Random-Access Algorithms (RAAs) aremore » considered next. These algorithms constitute an important subclass of Multiple-Access Algorithms (MAAs); they are distributive, and they attain high throughput and low delays by controlling the number of simultaneously transmitting users.« less

Optimization of OSPF Routing in IP Networks

NASA Astrophysics Data System (ADS)

Bley, Andreas; Fortz, Bernard; Gourdin, Eric; Holmberg, Kaj; Klopfenstein, Olivier; Pióro, Michał; Tomaszewski, Artur; Ümit, Hakan

The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct subnetworks, referred to as Autonomous Systems (ASs) autonomous system AS . They all rely on the Internet Protocol (IP) internet protocol IP for transport of packets across the network. And most of them use shortest path routing protocols shortest path routing!protocols , such as OSPF or IS-IS, to control the routing of IP packets routing!of IP packets within an AS. The idea of the routing is extremely simple — every packet is forwarded on IP links along the shortest route between its source and destination nodes of the AS. The AS network administrator can manage the routing of packets in the AS by supplying the so-called administrative weights of IP links, which specify the link lengths that are used by the routing protocols for their shortest path computations. The main advantage of the shortest path routing policy is its simplicity, allowing for little administrative overhead. From the network engineering perspective, however, shortest path routing can pose problems in achieving satisfactory traffic handling efficiency. As all routing paths depend on the same routing metric routing!metric , it is not possible to configure the routing paths for the communication demands between different pairs of nodes explicitly or individually; the routing can be controlled only indirectly and only as a whole by modifying the routing metric. Thus, one of the main tasks when planning such networks is to find administrative link weights that induce a globally efficient traffic routing traffic!routing configuration of an AS. It turns out that this task leads to very difficult mathematical optimization problems. In this chapter, we discuss and describe exact integer programming models and solution approaches as well as practically efficient smart heuristics for such shortest path routing problems shortest path routing!problems .

High speed packet switching

NASA Technical Reports Server (NTRS)

1991-01-01

This document constitutes the final report prepared by Proteon, Inc. of Westborough, Massachusetts under contract NAS 5-30629 entitled High-Speed Packet Switching (SBIR 87-1, Phase 2) prepared for NASA-Greenbelt, Maryland. The primary goal of this research project is to use the results of the SBIR Phase 1 effort to develop a sound, expandable hardware and software router architecture capable of forwarding 25,000 packets per second through the router and passing 300 megabits per second on the router's internal busses. The work being delivered under this contract received its funding from three different sources: the SNIPE/RIG contract (Contract Number F30602-89-C-0014, CDRL Sequence Number A002), the SBIR contract, and Proteon. The SNIPE/RIG and SBIR contracts had many overlapping requirements, which allowed the research done under SNIPE/RIG to be applied to SBIR. Proteon funded all of the work to develop new router interfaces other than FDDI, in addition to funding the productization of the router itself. The router being delivered under SBIR will be a fully product-quality machine. The work done during this contract produced many significant findings and results, summarized here and explained in detail in later sections of this report. The SNIPE/RIG contract was completed. That contract had many overlapping requirements with the SBIR contract, and resulted in the successful demonstration and delivery of a high speed router. The development that took place during the SNIPE/RIG contract produced findings that included the choice of processor and an understanding of the issues surrounding inter processor communications in a multiprocessor environment. Many significant speed enhancements to the router software were made during that time. Under the SBIR contract (and with help from Proteon-funded work), it was found that a single processor router achieved a throughput significantly higher than originally anticipated. For this reason, a single processor router was developed and the final delivery under this contract will include a single processor CNX-500 router. The router and its interface boards (2 FDDIs and 2 dual-ethernets) are all product-quality components.

40-Gbps optical backbone network deep packet inspection based on FPGA

NASA Astrophysics Data System (ADS)

Zuo, Yuan; Huang, Zhiping; Su, Shaojing

2014-11-01

In the era of information, the big data, which contains huge information, brings about some problems, such as high speed transmission, storage and real-time analysis and process. As the important media for data transmission, the Internet is the significant part for big data processing research. With the large-scale usage of the Internet, the data streaming of network is increasing rapidly. The speed level in the main fiber optic communication of the present has reached 40Gbps, even 100Gbps, therefore data on the optical backbone network shows some features of massive data. Generally, data services are provided via IP packets on the optical backbone network, which is constituted with SDH (Synchronous Digital Hierarchy). Hence this method that IP packets are directly mapped into SDH payload is named POS (Packet over SDH) technology. Aiming at the problems of real time process of high speed massive data, this paper designs a process system platform based on ATCA for 40Gbps POS signal data stream recognition and packet content capture, which employs the FPGA as the CPU. This platform offers pre-processing of clustering algorithms, service traffic identification and data mining for the following big data storage and analysis with high efficiency. Also, the operational procedure is proposed in this paper. Four channels of 10Gbps POS signal decomposed by the analysis module, which chooses FPGA as the kernel, are inputted to the flow classification module and the pattern matching component based on TCAM. Based on the properties of the length of payload and net flows, buffer management is added to the platform to keep the key flow information. According to data stream analysis, DPI (deep packet inspection) and flow balance distribute, the signal is transmitted to the backend machine through the giga Ethernet ports on back board. Practice shows that the proposed platform is superior to the traditional applications based on ASIC and NP.

Secured Hash Based Burst Header Authentication Design for Optical Burst Switched Networks

NASA Astrophysics Data System (ADS)

Balamurugan, A. M.; Sivasubramanian, A.; Parvathavarthini, B.

2017-12-01

The optical burst switching (OBS) is a promising technology that could meet the fast growing network demand. They are featured with the ability to meet the bandwidth requirement of applications that demand intensive bandwidth. OBS proves to be a satisfactory technology to tackle the huge bandwidth constraints, but suffers from security vulnerabilities. The objective of this proposed work is to design a faster and efficient burst header authentication algorithm for core nodes. There are two important key features in this work, viz., header encryption and authentication. Since the burst header is an important in optical burst switched network, it has to be encrypted; otherwise it is be prone to attack. The proposed MD5&RC4-4S based burst header authentication algorithm runs 20.75 ns faster than the conventional algorithms. The modification suggested in the proposed RC4-4S algorithm gives a better security and solves the correlation problems between the publicly known outputs during key generation phase. The modified MD5 recommended in this work provides 7.81 % better avalanche effect than the conventional algorithm. The device utilization result also shows the suitability of the proposed algorithm for header authentication in real time applications.

Delivery of video-on-demand services using local storages within passive optical networks.

PubMed

Abeywickrama, Sandu; Wong, Elaine

2013-01-28

At present, distributed storage systems have been widely studied to alleviate Internet traffic build-up caused by high-bandwidth, on-demand applications. Distributed storage arrays located locally within the passive optical network were previously proposed to deliver Video-on-Demand services. As an added feature, a popularity-aware caching algorithm was also proposed to dynamically maintain the most popular videos in the storage arrays of such local storages. In this paper, we present a new dynamic bandwidth allocation algorithm to improve Video-on-Demand services over passive optical networks using local storages. The algorithm exploits the use of standard control packets to reduce the time taken for the initial request communication between the customer and the central office, and to maintain the set of popular movies in the local storage. We conduct packet level simulations to perform a comparative analysis of the Quality-of-Service attributes between two passive optical networks, namely the conventional passive optical network and one that is equipped with a local storage. Results from our analysis highlight that strategic placement of a local storage inside the network enables the services to be delivered with improved Quality-of-Service to the customer. We further formulate power consumption models of both architectures to examine the trade-off between enhanced Quality-of-Service performance versus the increased power requirement from implementing a local storage within the network.

Noise reduction algorithm with the soft thresholding based on the Shannon entropy and bone-conduction speech cross- correlation bands.

PubMed

Na, Sung Dae; Wei, Qun; Seong, Ki Woong; Cho, Jin Ho; Kim, Myoung Nam

2018-01-01

The conventional methods of speech enhancement, noise reduction, and voice activity detection are based on the suppression of noise or non-speech components of the target air-conduction signals. However, air-conduced speech is hard to differentiate from babble or white noise signals. To overcome this problem, the proposed algorithm uses the bone-conduction speech signals and soft thresholding based on the Shannon entropy principle and cross-correlation of air- and bone-conduction signals. A new algorithm for speech detection and noise reduction is proposed, which makes use of the Shannon entropy principle and cross-correlation with the bone-conduction speech signals to threshold the wavelet packet coefficients of the noisy speech. The proposed method can be get efficient result by objective quality measure that are PESQ, RMSE, Correlation, SNR. Each threshold is generated by the entropy and cross-correlation approaches in the decomposed bands using the wavelet packet decomposition. As a result, the noise is reduced by the proposed method using the MATLAB simulation. To verify the method feasibility, we compared the air- and bone-conduction speech signals and their spectra by the proposed method. As a result, high performance of the proposed method is confirmed, which makes it quite instrumental to future applications in communication devices, noisy environment, construction, and military operations.

Rate-based congestion control in networks with smart links, revision. B.S. Thesis - May 1988

NASA Technical Reports Server (NTRS)

Heybey, Andrew Tyrrell

1990-01-01

The author uses a network simulator to explore rate-based congestion control in networks with smart links that can feed back information to tell senders to adjust their transmission rates. This method differs in a very important way from congestion control in which a congested network component just drops packets - the most commonly used method. It is clearly advantageous for the links in the network to communicate with the end users about the network capacity, rather than the users unilaterally picking a transmission rate. The components in the middle of the network, not the end users, have information about the capacity and traffic in the network. The author experiments with three different algorithms for calculating the control rate to feed back to the users. All of the algorithms exhibit problems in the form of large queues when simulated with a configuration modeling the dynamics of a packet-voice system. However, the problems are not with the algorithms themselves, but with the fact that feedback takes time. If the network steady-state utilization is low enough that it can absorb transients in the traffic through it, then the large queues disappear. If the users are modified to start sending slowly, to allow the network to adapt to a new flow without causing congestion, a greater portion of the network's bandwidth can be used.

Experimental demonstration of time- and mode-division multiplexed passive optical network

NASA Astrophysics Data System (ADS)

Ren, Fang; Li, Juhao; Tang, Ruizhi; Hu, Tao; Yu, Jinyi; Mo, Qi; He, Yongqi; Chen, Zhangyuan; Li, Zhengbin

2017-07-01

A time- and mode-division multiplexed passive optical network (TMDM-PON) architecture is proposed, in which each optical network unit (ONU) communicates with the optical line terminal (OLT) independently utilizing both different time slots and switched optical linearly polarized (LP) spatial modes. Combination of a mode multiplexer/demultiplexer (MUX/DEUX) and a simple N × 1 optical switch is employed to select the specific LP mode in each ONU. A mode-insensitive power splitter is used for signal broadcast/combination between OLT and ONUs. We theoretically propose a dynamic mode and time slot assignment scheme for TMDM-PON based on inter-ONU priority rating, in which the time delay and packet loss ratio's variation tendency are investigated by simulation. Moreover, we experimentally demonstrate 2-mode TMDM-PON transmission over 10 km FMF with 10-Gb/s on-off keying (OOK) signal and direct detection.

GLOBECOM '85 - Global Telecommunications Conference, New Orleans, LA, December 2-5, 1985, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

Various papers on global telecommunications are presented. The general topics addressed include: multiservice integration with optical fibers, multicompany owned telecommunication networks, softworks quality and reliability, advanced on-board processing, impact of new services and systems on operations and maintenance, analytical studies of protocols for data communication networks, topics in packet radio networking, CCITT No. 7 to support new services, document processing and communication, antenna technology and system aspects in satellite communications. Also considered are: communication systems modelling methodology, experimental integrated local area voice/data nets, spread spectrum communications, motion video at the DS-0 rate, optical and data communications, intelligent work stations, switch performance analysis, novel radio communication systems, wireless local networks, ISDN services, LAN communication protocols, user-system interface, radio propagation and performance, mobile satellite system, software for computer networks, VLSI for ISDN terminals, quality management, man-machine interfaces in switching, and local area network performance.

Advanced optical fiber communication systems

NASA Astrophysics Data System (ADS)

Kazovsky, Leonid G.

1994-03-01

Our research is focused on three major aspects of advanced optical fiber communication systems: dynamic wavelength division multiplexing (WDM) networks, fiber nonlinearities, and high dynamic range coherent analog optical links. In the area of WDM networks, we have designed and implemented two high-speed interface boards and measured their throughput and latency. Furthermore, we designed and constructed an experimental PSK/ASK transceiver that simultaneously transmits packet-switched ASK data and circuit-switched PSK data on the same optical carrier. In the area of fiber nonlinearities, we investigated the theoretical impact of modulation frequency on cross-phase modulation (XPM) in dispersive fibers. In the area of high dynamic range coherent analog optical links, we developed theoretical expressions for the RF power transfer ratio (or RF power gain) and the noise figure (NF) of angle-modulated links. We then compared the RF power gains and noise figures of these links to that of an intensity modulated direct detection (DD) link.

All-IP-Ethernet architecture for real-time sensor-fusion processing

NASA Astrophysics Data System (ADS)

Hiraki, Kei; Inaba, Mary; Tezuka, Hiroshi; Tomari, Hisanobu; Koizumi, Kenichi; Kondo, Shuya

2016-03-01

Serendipter is a device that distinguishes and selects very rare particles and cells from huge amount of population. We are currently designing and constructing information processing system for a Serendipter. The information processing system for Serendipter is a kind of sensor-fusion system but with much more difficulties: To fulfill these requirements, we adopt All IP based architecture: All IP-Ethernet based data processing system consists of (1) sensor/detector directly output data as IP-Ethernet packet stream, (2) single Ethernet/TCP/IP streams by a L2 100Gbps Ethernet switch, (3) An FPGA board with 100Gbps Ethernet I/F connected to the switch and a Xeon based server. Circuits in the FPGA include 100Gbps Ethernet MAC, buffers and preprocessing, and real-time Deep learning circuits using multi-layer neural networks. Proposed All-IP architecture solves existing problem to construct large-scale sensor-fusion systems.

A least-squares parameter estimation algorithm for switched hammerstein systems with applications to the VOR

NASA Technical Reports Server (NTRS)

Kukreja, Sunil L.; Kearney, Robert E.; Galiana, Henrietta L.

2005-01-01

A "Multimode" or "switched" system is one that switches between various modes of operation. When a switch occurs from one mode to another, a discontinuity may result followed by a smooth evolution under the new regime. Characterizing the switching behavior of these systems is not well understood and, therefore, identification of multimode systems typically requires a preprocessing step to classify the observed data according to a mode of operation. A further consequence of the switched nature of these systems is that data available for parameter estimation of any subsystem may be inadequate. As such, identification and parameter estimation of multimode systems remains an unresolved problem. In this paper, we 1) show that the NARMAX model structure can be used to describe the impulsive-smooth behavior of switched systems, 2) propose a modified extended least squares (MELS) algorithm to estimate the coefficients of such models, and 3) demonstrate its applicability to simulated and real data from the Vestibulo-Ocular Reflex (VOR). The approach will also allow the identification of other nonlinear bio-systems, suspected of containing "hard" nonlinearities.

Novel analytical model for optimizing the pull-in voltage in a flexured MEMS switch incorporating beam perforation effect

NASA Astrophysics Data System (ADS)

Guha, K.; Laskar, N. M.; Gogoi, H. J.; Borah, A. K.; Baishnab, K. L.; Baishya, S.

2017-11-01

This paper presents a new method for the design, modelling and optimization of a uniform serpentine meander based MEMS shunt capacitive switch with perforation on upper beam. The new approach is proposed to improve the Pull-in Voltage performance in a MEMS switch. First a new analytical model of the Pull-in Voltage is proposed using the modified Mejis-Fokkema capacitance model taking care of the nonlinear electrostatic force, the fringing field effect due to beam thickness and etched holes on the beam simultaneously followed by the validation of same with the simulated results of benchmark full 3D FEM solver CoventorWare in a wide range of structural parameter variations. It shows a good agreement with the simulated results. Secondly, an optimization method is presented to determine the optimum configuration of switch for achieving minimum Pull-in voltage considering the proposed analytical mode as objective function. Some high performance Evolutionary Optimization Algorithms have been utilized to obtain the optimum dimensions with less computational cost and complexity. Upon comparing the applied algorithms between each other, the Dragonfly Algorithm is found to be most suitable in terms of minimum Pull-in voltage and higher convergence speed. Optimized values are validated against the simulated results of CoventorWare which shows a very satisfactory results with a small deviation of 0.223 V. In addition to these, the paper proposes, for the first time, a novel algorithmic approach for uniform arrangement of square holes in a given beam area of RF MEMS switch for perforation. The algorithm dynamically accommodates all the square holes within a given beam area such that the maximum space is utilized. This automated arrangement of perforation holes will further improve the computational complexity and design accuracy of the complex design of perforated MEMS switch.

Nonlinear-Based MEMS Sensors and Active Switches for Gas Detection.

PubMed

Bouchaala, Adam; Jaber, Nizar; Yassine, Omar; Shekhah, Osama; Chernikova, Valeriya; Eddaoudi, Mohamed; Younis, Mohammad I

2016-05-25

The objective of this paper is to demonstrate the integration of a MOF thin film on electrostatically actuated microstructures to realize a switch triggered by gas and a sensing algorithm based on amplitude tracking. The devices are based on the nonlinear response of micromachined clamped-clamped beams. The microbeams are coated with a metal-organic framework (MOF), namely HKUST-1, to achieve high sensitivity. The softening and hardening nonlinear behaviors of the microbeams are exploited to demonstrate the ideas. For gas sensing, an amplitude-based tracking algorithm is developed to quantify the captured quantity of gas. Then, a MEMS switch triggered by gas using the nonlinear response of the microbeam is demonstrated. Noise analysis is conducted, which shows that the switch has high stability against thermal noise. The proposed switch is promising for delivering binary sensing information, and also can be used directly to activate useful functionalities, such as alarming.

Nonlinear-Based MEMS Sensors and Active Switches for Gas Detection

PubMed Central

Bouchaala, Adam; Jaber, Nizar; Yassine, Omar; Shekhah, Osama; Chernikova, Valeriya; Eddaoudi, Mohamed; Younis, Mohammad I.

2016-01-01

The objective of this paper is to demonstrate the integration of a MOF thin film on electrostatically actuated microstructures to realize a switch triggered by gas and a sensing algorithm based on amplitude tracking. The devices are based on the nonlinear response of micromachined clamped-clamped beams. The microbeams are coated with a metal-organic framework (MOF), namely HKUST-1, to achieve high sensitivity. The softening and hardening nonlinear behaviors of the microbeams are exploited to demonstrate the ideas. For gas sensing, an amplitude-based tracking algorithm is developed to quantify the captured quantity of gas. Then, a MEMS switch triggered by gas using the nonlinear response of the microbeam is demonstrated. Noise analysis is conducted, which shows that the switch has high stability against thermal noise. The proposed switch is promising for delivering binary sensing information, and also can be used directly to activate useful functionalities, such as alarming. PMID:27231914

Fiber-wireless for smart grid: A survey

NASA Astrophysics Data System (ADS)

Radzi, NAM; Ridwan, MA; Din, NM; Abdullah, F.; Mustafa, IS; l-Mansoori, MH

2017-11-01

Smart grid allows two-way communication between power utility companies and their customers while having the ability to sense along the transmission lines. However, the downside is such, when the smart devices are transmitting data simultaneously, it results in network congestion. Fiber wireless (FiWi) network is one of the best congestion solutions for smart grid up to date. In this paper, a survey of current literature on FiWi for smart grid will be reviewed and a testbed to test the protocols and algorithms for FiWi in smart grid will be proposed. The results of number of packets received and delay vs packet transmitted obtained via the testbed are compared with the results obtained via simulation and they show that they are in line with each other, validating the accuracy of the testbed.

Gait Planning and Stability Control of a Quadruped Robot

PubMed Central

Li, Junmin; Wang, Jinge; Yang, Simon X.; Zhou, Kedong; Tang, Huijuan

2016-01-01

In order to realize smooth gait planning and stability control of a quadruped robot, a new controller algorithm based on CPG-ZMP (central pattern generator-zero moment point) is put forward in this paper. To generate smooth gait and shorten the adjusting time of the model oscillation system, a new CPG model controller and its gait switching strategy based on Wilson-Cowan model are presented in the paper. The control signals of knee-hip joints are obtained by the improved multi-DOF reduced order control theory. To realize stability control, the adaptive speed adjustment and gait switch are completed by the real-time computing of ZMP. Experiment results show that the quadruped robot's gaits are efficiently generated and the gait switch is smooth in the CPG control algorithm. Meanwhile, the stability of robot's movement is improved greatly with the CPG-ZMP algorithm. The algorithm in this paper has good practicability, which lays a foundation for the production of the robot prototype. PMID:27143959

Gait Planning and Stability Control of a Quadruped Robot.

PubMed

Li, Junmin; Wang, Jinge; Yang, Simon X; Zhou, Kedong; Tang, Huijuan

2016-01-01

In order to realize smooth gait planning and stability control of a quadruped robot, a new controller algorithm based on CPG-ZMP (central pattern generator-zero moment point) is put forward in this paper. To generate smooth gait and shorten the adjusting time of the model oscillation system, a new CPG model controller and its gait switching strategy based on Wilson-Cowan model are presented in the paper. The control signals of knee-hip joints are obtained by the improved multi-DOF reduced order control theory. To realize stability control, the adaptive speed adjustment and gait switch are completed by the real-time computing of ZMP. Experiment results show that the quadruped robot's gaits are efficiently generated and the gait switch is smooth in the CPG control algorithm. Meanwhile, the stability of robot's movement is improved greatly with the CPG-ZMP algorithm. The algorithm in this paper has good practicability, which lays a foundation for the production of the robot prototype.

Multiphase complete exchange on a circuit switched hypercube

NASA Technical Reports Server (NTRS)

Bokhari, Shahid H.

1991-01-01

On a distributed memory parallel computer, the complete exchange (all-to-all personalized) communication pattern requires each of n processors to send a different block of data to each of the remaining n - 1 processors. This pattern is at the heart of many important algorithms, most notably the matrix transpose. For a circuit switched hypercube of dimension d(n = 2(sup d)), two algorithms for achieving complete exchange are known. These are (1) the Standard Exchange approach that employs d transmissions of size 2(sup d-1) blocks each and is useful for small block sizes, and (2) the Optimal Circuit Switched algorithm that employs 2(sup d) - 1 transmissions of 1 block each and is best for large block sizes. A unified multiphase algorithm is described that includes these two algorithms as special cases. The complete exchange on a hypercube of dimension d and block size m is achieved by carrying out k partial exchange on subcubes of dimension d(sub i) Sigma(sup k)(sub i=1) d(sub i) = d and effective block size m(sub i) = m2(sup d-di). When k = d and all d(sub i) = 1, this corresponds to algorithm (1) above. For the case of k = 1 and d(sub i) = d, this becomes the circuit switched algorithm (2). Changing the subcube dimensions d, varies the effective block size and permits a compromise between the data permutation and block transmission overhead of (1) and the startup overhead of (2). For a hypercube of dimension d, the number of possible combinations of subcubes is p(d), the number of partitions of the integer d. This is an exponential but very slowly growing function and it is feasible over these partitions to discover the best combination for a given message size. The approach was analyzed for, and implemented on, the Intel iPSC-860 circuit switched hypercube. Measurements show good agreement with predictions and demonstrate that the multiphase approach can substantially improve performance for block sizes in the 0 to 160 byte range. This range, which corresponds to 0 to 40 floating point numbers per processor, is commonly encountered in practical numeric applications. The multiphase technique is applicable to all circuit-switched hypercubes that use the common e-cube routing strategy.

A New TCP Congestion Control Supporting RTT-Fairness

NASA Astrophysics Data System (ADS)

Ogura, Kazumine; Nemoto, Yohei; Su, Zhou; Katto, Jiro

This paper focuses on RTT-fairness of multiple TCP flows over the Internet, and proposes a new TCP congestion control named “HRF (Hybrid RTT-Fair)-TCP”. Today, it is a serious problem that the flows having smaller RTT utilize more bandwidth than others when multiple flows having different RTT values compete in the same network. This means that a user with longer RTT may not be able to obtain sufficient bandwidth by the current methods. This RTT fairness issue has been discussed in many TCP papers. An example is CR (Constant Rate) algorithm, which achieves RTT-fairness by multiplying the square of RTT value in its window increment phase against TCP-Reno. However, the method halves its windows size same as TCP-Reno when a packet loss is detected. This makes worse its efficiency in certain network cases. On the other hand, recent proposed TCP versions essentially require throughput efficiency and TCP-friendliness with TCP-Reno. Therefore, we try to keep these advantages in our TCP design in addition to RTT-fairness. In this paper, we make intuitive analytical models in which we separate resource utilization processes into two cases: utilization of bottleneck link capacity and that of buffer space at the bottleneck link router. These models take into account three characteristic algorithms (Reno, Constant Rate, Constant Increase) in window increment phase where a sender receives an acknowledgement successfully. Their validity is proved by both simulations and implementations. From these analyses, we propose HRF-TCP which switches two modes according to observed RTT values and achieves RTT fairness. Experiments are carried out to validate the proposed method. Finally, HRF-TCP outperforms conventional methods in RTT-fairness, efficiency and friendliness with TCP-Reno.

CATO: a CAD tool for intelligent design of optical networks and interconnects

NASA Astrophysics Data System (ADS)

Chlamtac, Imrich; Ciesielski, Maciej; Fumagalli, Andrea F.; Ruszczyk, Chester; Wedzinga, Gosse

1997-10-01

Increasing communication speed requirements have created a great interest in very high speed optical and all-optical networks and interconnects. The design of these optical systems is a highly complex task, requiring the simultaneous optimization of various parts of the system, ranging from optical components' characteristics to access protocol techniques. Currently there are no computer aided design (CAD) tools on the market to support the interrelated design of all parts of optical communication systems, thus the designer has to rely on costly and time consuming testbed evaluations. The objective of the CATO (CAD tool for optical networks and interconnects) project is to develop a prototype of an intelligent CAD tool for the specification, design, simulation and optimization of optical communication networks. CATO allows the user to build an abstract, possible incomplete, model of the system, and determine its expected performance. Based on design constraints provided by the user, CATO will automatically complete an optimum design, using mathematical programming techniques, intelligent search methods and artificial intelligence (AI). Initial design and testing of a CATO prototype (CATO-1) has been completed recently. The objective was to prove the feasibility of combining AI techniques, simulation techniques, an optical device library and a graphical user interface into a flexible CAD tool for obtaining optimal communication network designs in terms of system cost and performance. CATO-1 is an experimental tool for designing packet-switching wavelength division multiplexing all-optical communication systems using a LAN/MAN ring topology as the underlying network. The two specific AI algorithms incorporated are simulated annealing and a genetic algorithm. CATO-1 finds the optimal number of transceivers for each network node, using an objective function that includes the cost of the devices and the overall system performance.

Improving HybrID: How to best combine indirect and direct encoding in evolutionary algorithms

PubMed Central

Helms, Lucas; Clune, Jeff

2017-01-01

Many challenging engineering problems are regular, meaning solutions to one part of a problem can be reused to solve other parts. Evolutionary algorithms with indirect encoding perform better on regular problems because they reuse genomic information to create regular phenotypes. However, on problems that are mostly regular, but contain some irregularities, which describes most real-world problems, indirect encodings struggle to handle the irregularities, hurting performance. Direct encodings are better at producing irregular phenotypes, but cannot exploit regularity. An algorithm called HybrID combines the best of both: it first evolves with indirect encoding to exploit problem regularity, then switches to direct encoding to handle problem irregularity. While HybrID has been shown to outperform both indirect and direct encoding, its initial implementation required the manual specification of when to switch from indirect to direct encoding. In this paper, we test two new methods to improve HybrID by eliminating the need to manually specify this parameter. Auto-Switch-HybrID automatically switches from indirect to direct encoding when fitness stagnates. Offset-HybrID simultaneously evolves an indirect encoding with directly encoded offsets, eliminating the need to switch. We compare the original HybrID to these alternatives on three different problems with adjustable regularity. The results show that both Auto-Switch-HybrID and Offset-HybrID outperform the original HybrID on different types of problems, and thus offer more tools for researchers to solve challenging problems. The Offset-HybrID algorithm is particularly interesting because it suggests a path forward for automatically and simultaneously combining the best traits of indirect and direct encoding. PMID:28334002

Effective algorithm for routing integral structures with twolayer switching

NASA Astrophysics Data System (ADS)

Nazarov, A. V.; Shakhnov, V. A.; Vlasov, A. I.; Novikov, A. N.

2018-05-01

The paper presents an algorithm for routing switching objects such as large-scale integrated circuits (LSICs) with two layers of metallization, embossed printed circuit boards, microboards with pairs of wiring layers on each side, and other similar constructs. The algorithm allows eliminating the effect of mutual blocking of routes in the classical wave algorithm by implementing a special circuit of digital wave motion in two layers of metallization, allowing direct intersections of all circuit conductors in a combined layer. However, information about the belonging of the topology elements to the circuits is sufficient for layering and minimizing the number of contact holes. In addition, the paper presents a specific example which shows that, in contrast to the known routing algorithms using a wave model, just one byte of memory per discrete of the work field is sufficient to implement the proposed algorithm.

The Speech multi features fusion perceptual hash algorithm based on tensor decomposition

NASA Astrophysics Data System (ADS)

Huang, Y. B.; Fan, M. H.; Zhang, Q. Y.

2018-03-01

With constant progress in modern speech communication technologies, the speech data is prone to be attacked by the noise or maliciously tampered. In order to make the speech perception hash algorithm has strong robustness and high efficiency, this paper put forward a speech perception hash algorithm based on the tensor decomposition and multi features is proposed. This algorithm analyses the speech perception feature acquires each speech component wavelet packet decomposition. LPCC, LSP and ISP feature of each speech component are extracted to constitute the speech feature tensor. Speech authentication is done by generating the hash values through feature matrix quantification which use mid-value. Experimental results showing that the proposed algorithm is robust for content to maintain operations compared with similar algorithms. It is able to resist the attack of the common background noise. Also, the algorithm is highly efficiency in terms of arithmetic, and is able to meet the real-time requirements of speech communication and complete the speech authentication quickly.

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

PubMed

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.

A ray tracing model of gravity wave propagation and breakdown in the middle atmosphere

NASA Technical Reports Server (NTRS)

Schoeberl, M. R.

1985-01-01

Gravity wave ray tracing and wave packet theory is used to parameterize wave breaking in the mesosphere. Rays are tracked by solving the group velocity equations, and the interaction with the basic state is determined by considering the evolution of the packet wave action density. The ray tracing approach has a number of advantages over the steady state parameterization as the effects of gravity wave focussing and refraction, local dissipation, and wave response to rapid changes in the mean flow are more realistically considered; however, if steady state conditions prevail, the method gives identical results. The ray tracing algorithm is tested using both interactive and noninteractive models of the basic state. In the interactive model, gravity wave interaction with the polar night jet on a beta-plane is considered. The algorithm produces realistic polar night jet closure for weak topographic forcing of gravity waves. Planetary scale waves forced by local transfer of wave action into the basic flow in turn transfer their wave action into the zonal mean flow. Highly refracted rays are also found not to contribute greatly to the climatology of the mesosphere, as their wave action is severely reduced by dissipation during their lateral travel.

High capacity low delay packet broadcasting multiaccess schemes for satellite repeater systems

NASA Astrophysics Data System (ADS)

Bose, S. K.

1980-12-01

Demand assigned packet radio schemes using satellite repeaters can achieve high capacities but often exhibit relatively large delays under low traffic conditions when compared to random access. Several schemes which improve delay performance at low traffic but which have high capacity are presented and analyzed. These schemes allow random acess attempts by users, who are waiting for channel assignments. The performance of these are considered in the context of a multiple point communication system carrying fixed length messages between geographically distributed (ground) user terminals which are linked via a satellite repeater. Channel assignments are done following a BCC queueing discipline by a (ground) central controller on the basis of requests correctly received over a collision type access channel. In TBACR Scheme A, some of the forward message channels are set aside for random access transmissions; the rest are used in a demand assigned mode. Schemes B and C operate all their forward message channels in a demand assignment mode but, by means of appropriate algorithms for trailer channel selection, allow random access attempts on unassigned channels. The latter scheme also introduces framing and slotting of the time axis to implement a more efficient algorithm for trailer channel selection than the former.

A Fourier analysis for a fast simulation algorithm. [for switching converters

NASA Technical Reports Server (NTRS)

King, Roger J.

1988-01-01

This paper presents a derivation of compact expressions for the Fourier series analysis of the steady-state solution of a typical switching converter. The modeling procedure for the simulation and the steady-state solution is described, and some desirable traits for its matrix exponential subroutine are discussed. The Fourier analysis algorithm was tested on a phase-controlled parallel-loaded resonant converter, providing an experimental confirmation.

A decision support system for telemedicine through the mobile telecommunications platform.

PubMed

Eren, Ali; Subasi, Abdulhamit; Coskun, Osman

2008-02-01

In this paper we have discussed the application of artificial intelligence in telemedicine using mobile device. The main goal of our research is to develop methods and systems to collect, analyze, distribute and use medical diagnostics information from multiple knowledge sources and areas of expertise. Physicians may collect and analyze information obtained from experts worldwide with the help of a medical decision support system. In this information retrieval system, modern communication tools such as computers and mobile phones can be used efficiently. In this work we propose a medical decision support system using the general packet radio service (GPRS). GPRS, a data extension of the mobile telephony standard Global system for mobile communications (GSM) is emerging as the first true packet-switched architecture to allow mobile subscribers to benefit from high-speed transmission rates and run JAVA based applications from their mobile terminals. An academic prototype of a medical decision support system using mobile device was implemented. The results reveal that the system could find acceptance from the medical community and it could be an effective means of providing quality health care in developing countries.

Using cyber vulnerability testing techniques to expose undocumented security vulnerabilities in DCS and SCADA equipment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pollet, J.

2006-07-01

This session starts by providing an overview of typical DCS (Distributed Control Systems) and SCADA (Supervisory Control and Data Acquisition) architectures, and exposes cyber security vulnerabilities that vendors never admit, but are found through a comprehensive cyber testing process. A complete assessment process involves testing all of the layers and components of a SCADA or DCS environment, from the perimeter firewall all the way down to the end devices controlling the process, including what to look for when conducting a vulnerability assessment of real-time control systems. The following systems are discussed: 1. Perimeter (isolation from corporate IT or other non-criticalmore » networks) 2. Remote Access (third Party access into SCADA or DCS networks) 3. Network Architecture (switch, router, firewalls, access controls, network design) 4. Network Traffic Analysis (what is running on the network) 5. Host Operating Systems Hardening 6. Applications (how they communicate with other applications and end devices) 7. End Device Testing (PLCs, RTUs, DCS Controllers, Smart Transmitters) a. System Discovery b. Functional Discovery c. Attack Methodology i. DoS Tests (at what point does the device fail) ii. Malformed Packet Tests (packets that can cause equipment failure) iii. Session Hijacking (do anything that the operator can do) iv. Packet Injection (code and inject your own SCADA commands) v. Protocol Exploitation (Protocol Reverse Engineering / Fuzzing) This paper will provide information compiled from over five years of conducting cyber security testing on control systems hardware, software, and systems. (authors)« less

Least mean square fourth based microgrid state estimation algorithm using the internet of things technology.

PubMed

Rana, Md Masud

2017-01-01

This paper proposes an innovative internet of things (IoT) based communication framework for monitoring microgrid under the condition of packet dropouts in measurements. First of all, the microgrid incorporating the renewable distributed energy resources is represented by a state-space model. The IoT embedded wireless sensor network is adopted to sense the system states. Afterwards, the information is transmitted to the energy management system using the communication network. Finally, the least mean square fourth algorithm is explored for estimating the system states. The effectiveness of the developed approach is verified through numerical simulations.

Cross Layer Design for Optimizing Transmission Reliability, Energy Efficiency, and Lifetime in Body Sensor Networks.

PubMed

Chen, Xi; Xu, Yixuan; Liu, Anfeng

2017-04-19

High transmission reliability, energy efficiency, and long lifetime are pivotal issues for wireless body area networks (WBANs. However, these performance metrics are not independent of each other, making it hard to obtain overall improvements through optimizing one single aspect. Therefore, a Cross Layer Design Optimal (CLDO) scheme is proposed to simultaneously optimize transmission reliability, energy efficiency, and lifetime of WBANs from several layers. Firstly, due to the fact that the transmission power of nodes directly influences the reliability of links, the optimized transmission power of different nodes is deduced, which is able to maximize energy efficiency in theory under the premise that requirements on delay and jitter are fulfilled. Secondly, a relay decision algorithm is proposed to choose optimized relay nodes. Using this algorithm, nodes will choose relay nodes that ensure a balance of network energy consumption, provided that all nodes transmit with optimized transmission power and the same packet size. Thirdly, the energy consumption of nodes is still unbalanced even with optimized transmission power because of their different locations in the topology of the network. In addition, packet size also has an impact on final performance metrics. Therefore, a synthesized cross layer method for optimization is proposed. With this method, the transmission power of nodes with more residual energy will be enhanced while suitable packet size is determined for different links in the network, leading to further improvements in the WBAN system. Both our comprehensive theoretical analysis and experimental results indicate that the performance of our proposed scheme is better than reported in previous studies. Relative to the relay selection and power control game (RSPCG) scheme, the CLDO scheme can enhance transmission reliability by more than 44.6% and prolong the lifetime by as much as 33.2%.

Cross Layer Design for Optimizing Transmission Reliability, Energy Efficiency, and Lifetime in Body Sensor Networks

PubMed Central

Chen, Xi; Xu, Yixuan; Liu, Anfeng

2017-01-01

High transmission reliability, energy efficiency, and long lifetime are pivotal issues for wireless body area networks (WBANs). However, these performance metrics are not independent of each other, making it hard to obtain overall improvements through optimizing one single aspect. Therefore, a Cross Layer Design Optimal (CLDO) scheme is proposed to simultaneously optimize transmission reliability, energy efficiency, and lifetime of WBANs from several layers. Firstly, due to the fact that the transmission power of nodes directly influences the reliability of links, the optimized transmission power of different nodes is deduced, which is able to maximize energy efficiency in theory under the premise that requirements on delay and jitter are fulfilled. Secondly, a relay decision algorithm is proposed to choose optimized relay nodes. Using this algorithm, nodes will choose relay nodes that ensure a balance of network energy consumption, provided that all nodes transmit with optimized transmission power and the same packet size. Thirdly, the energy consumption of nodes is still unbalanced even with optimized transmission power because of their different locations in the topology of the network. In addition, packet size also has an impact on final performance metrics. Therefore, a synthesized cross layer method for optimization is proposed. With this method, the transmission power of nodes with more residual energy will be enhanced while suitable packet size is determined for different links in the network, leading to further improvements in the WBAN system. Both our comprehensive theoretical analysis and experimental results indicate that the performance of our proposed scheme is better than reported in previous studies. Relative to the relay selection and power control game (RSPCG) scheme, the CLDO scheme can enhance transmission reliability by more than 44.6% and prolong the lifetime by as much as 33.2%. PMID:28422062

Distributed Denial of Service Attack Source Detection Using Efficient Traceback Technique (ETT) in Cloud-Assisted Healthcare Environment.

PubMed

Latif, Rabia; Abbas, Haider; Latif, Seemab; Masood, Ashraf

2016-07-01

Security and privacy are the first and foremost concerns that should be given special attention when dealing with Wireless Body Area Networks (WBANs). As WBAN sensors operate in an unattended environment and carry critical patient health information, Distributed Denial of Service (DDoS) attack is one of the major attacks in WBAN environment that not only exhausts the available resources but also influence the reliability of information being transmitted. This research work is an extension of our previous work in which a machine learning based attack detection algorithm is proposed to detect DDoS attack in WBAN environment. However, in order to avoid complexity, no consideration was given to the traceback mechanism. During traceback, the challenge lies in reconstructing the attack path leading to identify the attack source. Among existing traceback techniques, Probabilistic Packet Marking (PPM) approach is the most commonly used technique in conventional IP- based networks. However, since marking probability assignment has significant effect on both the convergence time and performance of a scheme, it is not directly applicable in WBAN environment due to high convergence time and overhead on intermediate nodes. Therefore, in this paper we have proposed a new scheme called Efficient Traceback Technique (ETT) based on Dynamic Probability Packet Marking (DPPM) approach and uses MAC header in place of IP header. Instead of using fixed marking probability, the proposed scheme uses variable marking probability based on the number of hops travelled by a packet to reach the target node. Finally, path reconstruction algorithms are proposed to traceback an attacker. Evaluation and simulation results indicate that the proposed solution outperforms fixed PPM in terms of convergence time and computational overhead on nodes.

Multi-Domain SDN Survivability for Agricultural Wireless Sensor Networks.

PubMed

Huang, Tao; Yan, Siyu; Yang, Fan; Liu, Jiang

2016-11-06

Wireless sensor networks (WSNs) have been widely applied in agriculture field; meanwhile, the advent of multi-domain software-defined networks (SDNs) have improved the wireless resource utilization rate and strengthened network management. In recent times, multi-domain SDNs have been applied to agricultural sensor networks, namely multi-domain software-defined wireless sensor networks (SDWSNs). However, when the SDNs controlling agriculture networks suddenly become unavailable, whether intra-domain or inter-domain, sensor network communication is abnormal because of the loss of control. Moreover, there are controller and switch info-updating problems even if the controller becomes available again. To resolve these problems, this paper proposes a new approach based on an Open vSwitch extension for multi-domain SDWSNs, which can enhance agriculture network survivability and stability. We achieved this by designing a connection-state mechanism, a communication mechanism on both L2 and L3, and an info-updating mechanism based on Open vSwitch. The experimental results show that, whether it is agricultural inter-domain or intra-domain during the controller failure period, the sensor switches can enter failure recovery mode as soon as possible so that the sensor network keeps a stable throughput, a short failure recovery time below 300 ms, and low packet loss. Further, the domain can smoothly control the domain network again once the controller becomes available. This approach based on an Open vSwitch extension can enhance the survivability and stability of multi-domain SDWSNs in precision agriculture.

Multi-Domain SDN Survivability for Agricultural Wireless Sensor Networks

PubMed Central

Huang, Tao; Yan, Siyu; Yang, Fan; Liu, Jiang

2016-01-01

Wireless sensor networks (WSNs) have been widely applied in agriculture field; meanwhile, the advent of multi-domain software-defined networks (SDNs) have improved the wireless resource utilization rate and strengthened network management. In recent times, multi-domain SDNs have been applied to agricultural sensor networks, namely multi-domain software-defined wireless sensor networks (SDWSNs). However, when the SDNs controlling agriculture networks suddenly become unavailable, whether intra-domain or inter-domain, sensor network communication is abnormal because of the loss of control. Moreover, there are controller and switch info-updating problems even if the controller becomes available again. To resolve these problems, this paper proposes a new approach based on an Open vSwitch extension for multi-domain SDWSNs, which can enhance agriculture network survivability and stability. We achieved this by designing a connection-state mechanism, a communication mechanism on both L2 and L3, and an info-updating mechanism based on Open vSwitch. The experimental results show that, whether it is agricultural inter-domain or intra-domain during the controller failure period, the sensor switches can enter failure recovery mode as soon as possible so that the sensor network keeps a stable throughput, a short failure recovery time below 300 ms, and low packet loss. Further, the domain can smoothly control the domain network again once the controller becomes available. This approach based on an Open vSwitch extension can enhance the survivability and stability of multi-domain SDWSNs in precision agriculture. PMID:27827971

Optimization of multicast optical networks with genetic algorithm

NASA Astrophysics Data System (ADS)

Lv, Bo; Mao, Xiangqiao; Zhang, Feng; Qin, Xi; Lu, Dan; Chen, Ming; Chen, Yong; Cao, Jihong; Jian, Shuisheng

2007-11-01

In this letter, aiming to obtain the best multicast performance of optical network in which the video conference information is carried by specified wavelength, we extend the solutions of matrix games with the network coding theory and devise a new method to solve the complex problems of multicast network switching. In addition, an experimental optical network has been testified with best switching strategies by employing the novel numerical solution designed with an effective way of genetic algorithm. The result shows that optimal solutions with genetic algorithm are accordance with the ones with the traditional fictitious play method.

A sweep algorithm for massively parallel simulation of circuit-switched networks

NASA Technical Reports Server (NTRS)

Gaujal, Bruno; Greenberg, Albert G.; Nicol, David M.

1992-01-01

A new massively parallel algorithm is presented for simulating large asymmetric circuit-switched networks, controlled by a randomized-routing policy that includes trunk-reservation. A single instruction multiple data (SIMD) implementation is described, and corresponding experiments on a 16384 processor MasPar parallel computer are reported. A multiple instruction multiple data (MIMD) implementation is also described, and corresponding experiments on an Intel IPSC/860 parallel computer, using 16 processors, are reported. By exploiting parallelism, our algorithm increases the possible execution rate of such complex simulations by as much as an order of magnitude.

A microprocessor based high speed packet switch for satellite communications

NASA Technical Reports Server (NTRS)

Arozullah, M.; Crist, S. C.

1980-01-01

The architectures of a single processor, a three processor, and a multiple processor system are described. The hardware circuits, and software routines required for implementing the three and multiple processor designs are presented. A bit-slice microprocessor was designed and microprogrammed. Maximum throughput was calculated for all three designs. Queue theoretic models for these three designs were developed and utilized to obtain analytical expressions for the average waiting times, overall average response times and average queue sizes. From these expressions, graphs were obtained showing the effect on the system performance of a number of design parameters.

All optical logic for optical pattern recognition and networking applications

NASA Astrophysics Data System (ADS)

Khoury, Jed

2017-05-01

In this paper, we propose architectures for the implementation 16 Boolean optical gates from two inputs using externally pumped phase- conjugate Michelson interferometer. Depending on the gate to be implemented, some require single stage interferometer and others require two stages interferometer. The proposed optical gates can be used in several applications in optical networks including, but not limited to, all-optical packet routers switching, and all-optical error detection. The optical logic gates can also be used in recognition of noiseless rotation and scale invariant objects such as finger prints for home land security applications.

Linking: Today's Libraries, Tomorrow's Technologies. Report of the Bibliographic and Communications Network Pilot Project. Canadian Network Papers Number 7 = Le Lien entre les Bibliotheques d'Aujourd'hui et les Technologies de Demain. Rapport du Projet Pilote du Reseau de Services Bibliographiques et de Communications. Documents sur les Reseaux Canadiens Numero 7.

ERIC Educational Resources Information Center

National Library of Canada, Ottawa (Ontario).

A pilot project was conducted from May 1980 to November 1983 to test the application of iNet--a decentralized, packet-switched telecommunications network--to bibliographic data interchange in Canada. The principal components of the project were participation of the Bibliographic Common Interest Group (BCIP), a group of libraries with stand-alone,…

Priority-based methods for reducing the impact of packet loss on HEVC encoded video streams

NASA Astrophysics Data System (ADS)

Nightingale, James; Wang, Qi; Grecos, Christos

2013-02-01

The rapid growth in the use of video streaming over IP networks has outstripped the rate at which new network infrastructure has been deployed. These bandwidth-hungry applications now comprise a significant part of all Internet traffic and present major challenges for network service providers. The situation is more acute in mobile networks where the available bandwidth is often limited. Work towards the standardisation of High Efficiency Video Coding (HEVC), the next generation video coding scheme, is currently on track for completion in 2013. HEVC offers the prospect of a 50% improvement in compression over the current H.264 Advanced Video Coding standard (H.264/AVC) for the same quality. However, there has been very little published research on HEVC streaming or the challenges of delivering HEVC streams in resource-constrained network environments. In this paper we consider the problem of adapting an HEVC encoded video stream to meet the bandwidth limitation in a mobile networks environment. Video sequences were encoded using the Test Model under Consideration (TMuC HM6) for HEVC. Network abstraction layers (NAL) units were packetized, on a one NAL unit per RTP packet basis, and transmitted over a realistic hybrid wired/wireless testbed configured with dynamically changing network path conditions and multiple independent network paths from the streamer to the client. Two different schemes for the prioritisation of RTP packets, based on the NAL units they contain, have been implemented and empirically compared using a range of video sequences, encoder configurations, bandwidths and network topologies. In the first prioritisation method the importance of an RTP packet was determined by the type of picture and the temporal switching point information carried in the NAL unit header. Packets containing parameter set NAL units and video coding layer (VCL) NAL units of the instantaneous decoder refresh (IDR) and the clean random access (CRA) pictures were given the highest priority followed by NAL units containing pictures used as reference pictures from which others can be predicted. The second method assigned a priority to each NAL unit based on the rate-distortion cost of the VCL coding units contained in the NAL unit. The sum of the rate-distortion costs of each coding unit contained in a NAL unit was used as the priority weighting. The preliminary results of extensive experiments have shown that all three schemes offered an improvement in PSNR, when comparing original and decoded received streams, over uncontrolled packet loss. Using the first method consistently delivered a significant average improvement of 0.97dB over the uncontrolled scenario while the second method provided a measurable, but less consistent, improvement across the range of testing conditions and encoder configurations.

Bio-inspired online variable recruitment control of fluidic artificial muscles

NASA Astrophysics Data System (ADS)

Jenkins, Tyler E.; Chapman, Edward M.; Bryant, Matthew

2016-12-01

This paper details the creation of a hybrid variable recruitment control scheme for fluidic artificial muscle (FAM) actuators with an emphasis on maximizing system efficiency and switching control performance. Variable recruitment is the process of altering a system’s active number of actuators, allowing operation in distinct force regimes. Previously, FAM variable recruitment was only quantified with offline, manual valve switching; this study addresses the creation and characterization of novel, on-line FAM switching control algorithms. The bio-inspired algorithms are implemented in conjunction with a PID and model-based controller, and applied to a simulated plant model. Variable recruitment transition effects and chatter rejection are explored via a sensitivity analysis, allowing a system designer to weigh tradeoffs in actuator modeling, algorithm choice, and necessary hardware. Variable recruitment is further developed through simulation of a robotic arm tracking a variety of spline position inputs, requiring several levels of actuator recruitment. Switching controller performance is quantified and compared with baseline systems lacking variable recruitment. The work extends current variable recruitment knowledge by creating novel online variable recruitment control schemes, and exploring how online actuator recruitment affects system efficiency and control performance. Key topics associated with implementing a variable recruitment scheme, including the effects of modeling inaccuracies, hardware considerations, and switching transition concerns are also addressed.

SCADA Protocol Anomaly Detection Utilizing Compression (SPADUC) 2013

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gordon Rueff; Lyle Roybal; Denis Vollmer

2013-01-01

There is a significant need to protect the nation’s energy infrastructures from malicious actors using cyber methods. Supervisory, Control, and Data Acquisition (SCADA) systems may be vulnerable due to the insufficient security implemented during the design and deployment of these control systems. This is particularly true in older legacy SCADA systems that are still commonly in use. The purpose of INL’s research on the SCADA Protocol Anomaly Detection Utilizing Compression (SPADUC) project was to determine if and how data compression techniques could be used to identify and protect SCADA systems from cyber attacks. Initially, the concept was centered on howmore » to train a compression algorithm to recognize normal control system traffic versus hostile network traffic. Because large portions of the TCP/IP message traffic (called packets) are repetitive, the concept of using compression techniques to differentiate “non-normal” traffic was proposed. In this manner, malicious SCADA traffic could be identified at the packet level prior to completing its payload. Previous research has shown that SCADA network traffic has traits desirable for compression analysis. This work investigated three different approaches to identify malicious SCADA network traffic using compression techniques. The preliminary analyses and results presented herein are clearly able to differentiate normal from malicious network traffic at the packet level at a very high confidence level for the conditions tested. Additionally, the master dictionary approach used in this research appears to initially provide a meaningful way to categorize and compare packets within a communication channel.« less

Interacting Multiple Model (IMM) Fifth-Degree Spherical Simplex-Radial Cubature Kalman Filter for Maneuvering Target Tracking

PubMed Central

Liu, Hua; Wu, Wen

2017-01-01

For improving the tracking accuracy and model switching speed of maneuvering target tracking in nonlinear systems, a new algorithm named the interacting multiple model fifth-degree spherical simplex-radial cubature Kalman filter (IMM5thSSRCKF) is proposed in this paper. The new algorithm is a combination of the interacting multiple model (IMM) filter and the fifth-degree spherical simplex-radial cubature Kalman filter (5thSSRCKF). The proposed algorithm makes use of Markov process to describe the switching probability among the models, and uses 5thSSRCKF to deal with the state estimation of each model. The 5thSSRCKF is an improved filter algorithm, which utilizes the fifth-degree spherical simplex-radial rule to improve the filtering accuracy. Finally, the tracking performance of the IMM5thSSRCKF is evaluated by simulation in a typical maneuvering target tracking scenario. Simulation results show that the proposed algorithm has better tracking performance and quicker model switching speed when disposing maneuver models compared with the interacting multiple model unscented Kalman filter (IMMUKF), the interacting multiple model cubature Kalman filter (IMMCKF) and the interacting multiple model fifth-degree cubature Kalman filter (IMM5thCKF). PMID:28608843

Interacting Multiple Model (IMM) Fifth-Degree Spherical Simplex-Radial Cubature Kalman Filter for Maneuvering Target Tracking.

PubMed

Liu, Hua; Wu, Wen

2017-06-13

For improving the tracking accuracy and model switching speed of maneuvering target tracking in nonlinear systems, a new algorithm named the interacting multiple model fifth-degree spherical simplex-radial cubature Kalman filter (IMM5thSSRCKF) is proposed in this paper. The new algorithm is a combination of the interacting multiple model (IMM) filter and the fifth-degree spherical simplex-radial cubature Kalman filter (5thSSRCKF). The proposed algorithm makes use of Markov process to describe the switching probability among the models, and uses 5thSSRCKF to deal with the state estimation of each model. The 5thSSRCKF is an improved filter algorithm, which utilizes the fifth-degree spherical simplex-radial rule to improve the filtering accuracy. Finally, the tracking performance of the IMM5thSSRCKF is evaluated by simulation in a typical maneuvering target tracking scenario. Simulation results show that the proposed algorithm has better tracking performance and quicker model switching speed when disposing maneuver models compared with the interacting multiple model unscented Kalman filter (IMMUKF), the interacting multiple model cubature Kalman filter (IMMCKF) and the interacting multiple model fifth-degree cubature Kalman filter (IMM5thCKF).

Improved routing strategy based on gravitational field theory

NASA Astrophysics Data System (ADS)

Song, Hai-Quan; Guo, Jin

2015-10-01

Routing and path selection are crucial for many communication and logistic applications. We study the interaction between nodes and packets and establish a simple model for describing the attraction of the node to the packet in transmission process by using the gravitational field theory, considering the real and potential congestion of the nodes. On the basis of this model, we propose a gravitational field routing strategy that considers the attractions of all of the nodes on the travel path to the packet. In order to illustrate the efficiency of proposed routing algorithm, we introduce the order parameter to measure the throughput of the network by the critical value of phase transition from a free flow phase to a congested phase, and study the distribution of betweenness centrality and traffic jam. Simulations show that, compared with the shortest path routing strategy, the gravitational field routing strategy considerably enhances the throughput of the network and balances the traffic load, and nearly all of the nodes are used efficiently. Project supported by the Technology and Development Research Project of China Railway Corporation (Grant No. 2012X007-D) and the Key Program of Technology and Development Research Foundation of China Railway Corporation (Grant No. 2012X003-A).

Maximization of the Supportable Number of Sensors in QoS-Aware Cluster-Based Underwater Acoustic Sensor Networks

PubMed Central

Nguyen, Thi-Tham; Van Le, Duc; Yoon, Seokhoon

2014-01-01

This paper proposes a practical low-complexity MAC (medium access control) scheme for quality of service (QoS)-aware and cluster-based underwater acoustic sensor networks (UASN), in which the provision of differentiated QoS is required. In such a network, underwater sensors (U-sensor) in a cluster are divided into several classes, each of which has a different QoS requirement. The major problem considered in this paper is the maximization of the number of nodes that a cluster can accommodate while still providing the required QoS for each class in terms of the PDR (packet delivery ratio). In order to address the problem, we first estimate the packet delivery probability (PDP) and use it to formulate an optimization problem to determine the optimal value of the maximum packet retransmissions for each QoS class. The custom greedy and interior-point algorithms are used to find the optimal solutions, which are verified by extensive simulations. The simulation results show that, by solving the proposed optimization problem, the supportable number of underwater sensor nodes can be maximized while satisfying the QoS requirements for each class. PMID:24608009

Maximization of the supportable number of sensors in QoS-aware cluster-based underwater acoustic sensor networks.

PubMed

Nguyen, Thi-Tham; Le, Duc Van; Yoon, Seokhoon

2014-03-07

This paper proposes a practical low-complexity MAC (medium access control) scheme for quality of service (QoS)-aware and cluster-based underwater acoustic sensor networks (UASN), in which the provision of differentiated QoS is required. In such a network, underwater sensors (U-sensor) in a cluster are divided into several classes, each of which has a different QoS requirement. The major problem considered in this paper is the maximization of the number of nodes that a cluster can accommodate while still providing the required QoS for each class in terms of the PDR (packet delivery ratio). In order to address the problem, we first estimate the packet delivery probability (PDP) and use it to formulate an optimization problem to determine the optimal value of the maximum packet retransmissions for each QoS class. The custom greedy and interior-point algorithms are used to find the optimal solutions, which are verified by extensive simulations. The simulation results show that, by solving the proposed optimization problem, the supportable number of underwater sensor nodes can be maximized while satisfying the QoS requirements for each class.

Fair and efficient network congestion control based on minority game

NASA Astrophysics Data System (ADS)

Wang, Zuxi; Wang, Wen; Hu, Hanping; Deng, Zhaozhang

2011-12-01

Low link utility, RTT unfairness and unfairness of Multi-Bottleneck network are the existing problems in the present network congestion control algorithms at large. Through the analogy of network congestion control with the "El Farol Bar" problem, we establish a congestion control model based on minority game(MG), and then present a novel network congestion control algorithm based on the model. The result of simulations indicates that the proposed algorithm can make the achievements of link utility closing to 100%, zero packet lose rate, and small of queue size. Besides, the RTT unfairness and the unfairness of Multi-Bottleneck network can be solved, to achieve the max-min fairness in Multi-Bottleneck network, while efficiently weaken the "ping-pong" oscillation caused by the overall synchronization.

SFTP: A Secure and Fault-Tolerant Paradigm against Blackhole Attack in MANET

NASA Astrophysics Data System (ADS)

KumarRout, Jitendra; Kumar Bhoi, Sourav; Kumar Panda, Sanjaya

2013-02-01

Security issues in MANET are a challenging task nowadays. MANETs are vulnerable to passive attacks and active attacks because of a limited number of resources and lack of centralized authority. Blackhole attack is an attack in network layer which degrade the network performance by dropping the packets. In this paper, we have proposed a Secure Fault-Tolerant Paradigm (SFTP) which checks the Blackhole attack in the network. The three phases used in SFTP algorithm are designing of coverage area to find the area of coverage, Network Connection algorithm to design a fault-tolerant model and Route Discovery algorithm to discover the route and data delivery from source to destination. SFTP gives better network performance by making the network fault free.

On securing wireless sensor network--novel authentication scheme against DOS attacks.

PubMed

Raja, K Nirmal; Beno, M Marsaline

2014-10-01

Wireless sensor networks are generally deployed for collecting data from various environments. Several applications specific sensor network cryptography algorithms have been proposed in research. However WSN's has many constrictions, including low computation capability, less memory, limited energy resources, vulnerability to physical capture, which enforce unique security challenges needs to make a lot of improvements. This paper presents a novel security mechanism and algorithm for wireless sensor network security and also an application of this algorithm. The proposed scheme is given to strong authentication against Denial of Service Attacks (DOS). The scheme is simulated using network simulator2 (NS2). Then this scheme is analyzed based on the network packet delivery ratio and found that throughput has improved.

Design and analysis of a model predictive controller for active queue management.

PubMed

Wang, Ping; Chen, Hong; Yang, Xiaoping; Ma, Yan

2012-01-01

Model predictive (MP) control as a novel active queue management (AQM) algorithm in dynamic computer networks is proposed. According to the predicted future queue length in the data buffer, early packets at the router are dropped reasonably by the MPAQM controller so that the queue length reaches the desired value with minimal tracking error. The drop probability is obtained by optimizing the network performance. Further, randomized algorithms are applied to analyze the robustness of MPAQM successfully, and also to provide the stability domain of systems with uncertain network parameters. The performances of MPAQM are evaluated through a series of simulations in NS2. The simulation results show that the MPAQM algorithm outperforms RED, PI, and REM algorithms in terms of stability, disturbance rejection, and robustness. Copyright © 2011 ISA. Published by Elsevier Ltd. All rights reserved.

Fast polar decomposition of an arbitrary matrix

NASA Technical Reports Server (NTRS)

Higham, Nicholas J.; Schreiber, Robert S.

1988-01-01

The polar decomposition of an m x n matrix A of full rank, where m is greater than or equal to n, can be computed using a quadratically convergent algorithm. The algorithm is based on a Newton iteration involving a matrix inverse. With the use of a preliminary complete orthogonal decomposition the algorithm can be extended to arbitrary A. How to use the algorithm to compute the positive semi-definite square root of a Hermitian positive semi-definite matrix is described. A hybrid algorithm which adaptively switches from the matrix inversion based iteration to a matrix multiplication based iteration due to Kovarik, and to Bjorck and Bowie is formulated. The decision when to switch is made using a condition estimator. This matrix multiplication rich algorithm is shown to be more efficient on machines for which matrix multiplication can be executed 1.5 times faster than matrix inversion.

Unsupervised algorithms for intrusion detection and identification in wireless ad hoc sensor networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

2009-05-01

In previous work by the author, parameters across network protocol layers were selected as features in supervised algorithms that detect and identify certain intrusion attacks on wireless ad hoc sensor networks (WSNs) carrying multisensor data. The algorithms improved the residual performance of the intrusion prevention measures provided by any dynamic key-management schemes and trust models implemented among network nodes. The approach of this paper does not train algorithms on the signature of known attack traffic, but, instead, the approach is based on unsupervised anomaly detection techniques that learn the signature of normal network traffic. Unsupervised learning does not require the data to be labeled or to be purely of one type, i.e., normal or attack traffic. The approach can be augmented to add any security attributes and quantified trust levels, established during data exchanges among nodes, to the set of cross-layer features from the WSN protocols. A two-stage framework is introduced for the security algorithms to overcome the problems of input size and resource constraints. The first stage is an unsupervised clustering algorithm which reduces the payload of network data packets to a tractable size. The second stage is a traditional anomaly detection algorithm based on a variation of support vector machines (SVMs), whose efficiency is improved by the availability of data in the packet payload. In the first stage, selected algorithms are adapted to WSN platforms to meet system requirements for simple parallel distributed computation, distributed storage and data robustness. A set of mobile software agents, acting like an ant colony in securing the WSN, are distributed at the nodes to implement the algorithms. The agents move among the layers involved in the network response to the intrusions at each active node and trustworthy neighborhood, collecting parametric values and executing assigned decision tasks. This minimizes the need to move large amounts of audit-log data through resource-limited nodes and locates routines closer to that data. Performance of the unsupervised algorithms is evaluated against the network intrusions of black hole, flooding, Sybil and other denial-of-service attacks in simulations of published scenarios. Results for scenarios with intentionally malfunctioning sensors show the robustness of the two-stage approach to intrusion anomalies.

Temporal Precedence Checking for Switched Models and its Application to a Parallel Landing Protocol

NASA Technical Reports Server (NTRS)

Duggirala, Parasara Sridhar; Wang, Le; Mitra, Sayan; Viswanathan, Mahesh; Munoz, Cesar A.

2014-01-01

This paper presents an algorithm for checking temporal precedence properties of nonlinear switched systems. This class of properties subsume bounded safety and capture requirements about visiting a sequence of predicates within given time intervals. The algorithm handles nonlinear predicates that arise from dynamics-based predictions used in alerting protocols for state-of-the-art transportation systems. It is sound and complete for nonlinear switch systems that robustly satisfy the given property. The algorithm is implemented in the Compare Execute Check Engine (C2E2) using validated simulations. As a case study, a simplified model of an alerting system for closely spaced parallel runways is considered. The proposed approach is applied to this model to check safety properties of the alerting logic for different operating conditions such as initial velocities, bank angles, aircraft longitudinal separation, and runway separation.

The design and testing of a novel mechanomyogram-driven switch controlled by small eyebrow movements

PubMed Central

2010-01-01

Background Individuals with severe physical disabilities and minimal motor behaviour may be unable to use conventional mechanical switches for access. These persons may benefit from access technologies that harness the volitional activity of muscles. In this study, we describe the design and demonstrate the performance of a binary switch controlled by mechanomyogram (MMG) signals recorded from the frontalis muscle during eyebrow movements. Methods Muscle contractions, detected in real-time with a continuous wavelet transform algorithm, were used to control a binary switch for computer access. The automatic selection of scale-specific thresholds reduced the effect of artefact, such as eye blinks and head movement, on the performance of the switch. Switch performance was estimated by cued response-tests performed by eleven participants (one with severe physical disabilities). Results The average sensitivity and specificity of the switch was 99.7 ± 0.4% and 99.9 ± 0.1%, respectively. The algorithm performance was robust against typical participant movement. Conclusions The results suggest that the frontalis muscle is a suitable site for controlling the MMG-driven switch. The high accuracies combined with the minimal requisite effort and training show that MMG is a promising binary control signal. Further investigation of the potential benefits of MMG-control for the target population is warranted. PMID:20492680

The design and testing of a novel mechanomyogram-driven switch controlled by small eyebrow movements.

PubMed

Alves, Natasha; Chau, Tom

2010-05-21

Individuals with severe physical disabilities and minimal motor behaviour may be unable to use conventional mechanical switches for access. These persons may benefit from access technologies that harness the volitional activity of muscles. In this study, we describe the design and demonstrate the performance of a binary switch controlled by mechanomyogram (MMG) signals recorded from the frontalis muscle during eyebrow movements. Muscle contractions, detected in real-time with a continuous wavelet transform algorithm, were used to control a binary switch for computer access. The automatic selection of scale-specific thresholds reduced the effect of artefact, such as eye blinks and head movement, on the performance of the switch. Switch performance was estimated by cued response-tests performed by eleven participants (one with severe physical disabilities). The average sensitivity and specificity of the switch was 99.7 +/- 0.4% and 99.9 +/- 0.1%, respectively. The algorithm performance was robust against typical participant movement. The results suggest that the frontalis muscle is a suitable site for controlling the MMG-driven switch. The high accuracies combined with the minimal requisite effort and training show that MMG is a promising binary control signal. Further investigation of the potential benefits of MMG-control for the target population is warranted.

End-to-end communication test on variable length packet structures utilizing AOS testbed

NASA Technical Reports Server (NTRS)

Miller, Warner H.; Sank, V.; Fong, Wai; Miko, J.; Powers, M.; Folk, John; Conaway, B.; Michael, K.; Yeh, Pen-Shu

1994-01-01

This paper describes a communication test, which successfully demonstrated the transfer of losslessly compressed images in an end-to-end system. These compressed images were first formatted into variable length Consultative Committee for Space Data Systems (CCSDS) packets in the Advanced Orbiting System Testbed (AOST). The CCSDS data Structures were transferred from the AOST to the Radio Frequency Simulations Operations Center (RFSOC), via a fiber optic link, where data was then transmitted through the Tracking and Data Relay Satellite System (TDRSS). The received data acquired at the White Sands Complex (WSC) was transferred back to the AOST where the data was captured and decompressed back to the original images. This paper describes the compression algorithm, the AOST configuration, key flight components, data formats, and the communication link characteristics and test results.

Quasi-soliton scattering in quantum spin chains

NASA Astrophysics Data System (ADS)

Vlijm, R.; Ganahl, M.; Fioretto, D.; Brockmann, M.; Haque, M.; Evertz, H. G.; Caux, J.-S.

2015-12-01

The quantum scattering of magnon bound states in the anisotropic Heisenberg spin chain is shown to display features similar to the scattering of solitons in classical exactly solvable models. Localized colliding Gaussian wave packets of bound magnons are constructed from string solutions of the Bethe equations and subsequently evolved in time, relying on an algebraic Bethe ansatz based framework for the computation of local expectation values in real space-time. The local magnetization profile shows the trajectories of colliding wave packets of bound magnons, which obtain a spatial displacement upon scattering. Analytic predictions on the displacements for various values of anisotropy and string lengths are derived from scattering theory and Bethe ansatz phase shifts, matching time-evolution fits on the displacements. The time-evolved block decimation algorithm allows for the study of scattering displacements from spin-block states, showing similar scattering displacement features.

Quasi-soliton scattering in quantum spin chains

NASA Astrophysics Data System (ADS)

Fioretto, Davide; Vljim, Rogier; Ganahl, Martin; Brockmann, Michael; Haque, Masud; Evertz, Hans-Gerd; Caux, Jean-Sébastien

The quantum scattering of magnon bound states in the anisotropic Heisenberg spin chain is shown to display features similar to the scattering of solitons in classical exactly solvable models. Localized colliding Gaussian wave packets of bound magnons are constructed from string solutions of the Bethe equations and subsequently evolved in time, relying on an algebraic Bethe ansatz based framework for the computation of local expectation values in real space-time. The local magnetization profile shows the trajectories of colliding wave packets of bound magnons, which obtain a spatial displacement upon scattering. Analytic predictions on the displacements for various values of anisotropy and string lengths are derived from scattering theory and Bethe ansatz phase shifts, matching time evolution fits on the displacements. The TEBD algorithm allows for the study of scattering displacements from spin-block states, showing similar displacement scattering features.

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

PubMed Central

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. PMID:26690571

Random early detection for congestion avoidance in wired networks: a discretized pursuit learning-automata-like solution.

PubMed

Misra, Sudip; Oommen, B John; Yanamandra, Sreekeerthy; Obaidat, Mohammad S

2010-02-01

In this paper, we present a learning-automata-like The reason why the mechanism is not a pure LA, but rather why it yet mimics one, will be clarified in the body of this paper. (LAL) mechanism for congestion avoidance in wired networks. Our algorithm, named as LAL Random Early Detection (LALRED), is founded on the principles of the operations of existing RED congestion-avoidance mechanisms, augmented with a LAL philosophy. The primary objective of LALRED is to optimize the value of the average size of the queue used for congestion avoidance and to consequently reduce the total loss of packets at the queue. We attempt to achieve this by stationing a LAL algorithm at the gateways and by discretizing the probabilities of the corresponding actions of the congestion-avoidance algorithm. At every time instant, the LAL scheme, in turn, chooses the action that possesses the maximal ratio between the number of times the chosen action is rewarded and the number of times that it has been chosen. In LALRED, we simultaneously increase the likelihood of the scheme converging to the action, which minimizes the number of packet drops at the gateway. Our approach helps to improve the performance of congestion avoidance by adaptively minimizing the queue-loss rate and the average queue size. Simulation results obtained using NS2 establish the improved performance of LALRED over the traditional RED methods which were chosen as the benchmarks for performance comparison purposes.

Building SDN-Based Agricultural Vehicular Sensor Networks Based on Extended Open vSwitch.

PubMed

Huang, Tao; Yan, Siyu; Yang, Fan; Pan, Tian; Liu, Jiang

2016-01-19

Software-defined vehicular sensor networks in agriculture, such as autonomous vehicle navigation based on wireless multi-sensor networks, can lead to more efficient precision agriculture. In SDN-based vehicle sensor networks, the data plane is simplified and becomes more efficient by introducing a centralized controller. However, in a wireless environment, the main controller node may leave the sensor network due to the dynamic topology change or the unstable wireless signal, leaving the rest of network devices without control, e.g., a sensor node as a switch may forward packets according to stale rules until the controller updates the flow table entries. To solve this problem, this paper proposes a novel SDN-based vehicular sensor networks architecture which can minimize the performance penalty of controller connection loss. We achieve this by designing a connection state detection and self-learning mechanism. We build prototypes based on extended Open vSwitch and Ryu. The experimental results show that the recovery time from controller connection loss is under 100 ms and it keeps rule updating in real time with a stable throughput. This architecture enhances the survivability and stability of SDN-based vehicular sensor networks in precision agriculture.

On the impact of fiber-delay-lines (FDL) in an all-optical network (AON) bottleneck without wavelength conversion

NASA Astrophysics Data System (ADS)

Argibay-Losada, Pablo Jesus; Sahin, Gokhan

2014-08-01

Random access memories (RAM) are fundamental in conventional electronic switches and routers to manage short-term congestion and to decrease data loss probabilities. Switches in all-optical networks (AONs), however, do not have access to optical RAM, and therefore are prone to much higher loss levels than their electronic counterparts. Fiber-delay-lines (FDLs), able to delay an optical data packet a fixed amount of time, have been proposed in the literature as a means to alleviate those high loss levels. However, they are extremely bulky to manage, so their usage introduces a trade-off between practicality and performance in the design and operation of the AON. In this paper we study the influence that FDLs have in the performance of flows crossing an all-optical switch that acts as their bottleneck. We show how extremely low numbers of FDLs (e.g., 1 or 2) can help in reducing losses by several orders of magnitude in several illustrative scenarios with high aggregation levels. Our results therefore suggest that FDLs can be a practical means of dealing with congestion in AONs in the absence of optical RAM buffers or of suitable data interchange protocols specifically designed for AONs.

Building SDN-Based Agricultural Vehicular Sensor Networks Based on Extended Open vSwitch

PubMed Central

Huang, Tao; Yan, Siyu; Yang, Fan; Pan, Tian; Liu, Jiang

2016-01-01

Software-defined vehicular sensor networks in agriculture, such as autonomous vehicle navigation based on wireless multi-sensor networks, can lead to more efficient precision agriculture. In SDN-based vehicle sensor networks, the data plane is simplified and becomes more efficient by introducing a centralized controller. However, in a wireless environment, the main controller node may leave the sensor network due to the dynamic topology change or the unstable wireless signal, leaving the rest of network devices without control, e.g., a sensor node as a switch may forward packets according to stale rules until the controller updates the flow table entries. To solve this problem, this paper proposes a novel SDN-based vehicular sensor networks architecture which can minimize the performance penalty of controller connection loss. We achieve this by designing a connection state detection and self-learning mechanism. We build prototypes based on extended Open vSwitch and Ryu. The experimental results show that the recovery time from controller connection loss is under 100 ms and it keeps rule updating in real time with a stable throughput. This architecture enhances the survivability and stability of SDN-based vehicular sensor networks in precision agriculture. PMID:26797616

Optimizing Retransmission Threshold in Wireless Sensor Networks

PubMed Central

Bi, Ran; Li, Yingshu; Tan, Guozhen; Sun, Liang

2016-01-01

The retransmission threshold in wireless sensor networks is critical to the latency of data delivery in the networks. However, existing works on data transmission in sensor networks did not consider the optimization of the retransmission threshold, and they simply set the same retransmission threshold for all sensor nodes in advance. The method did not take link quality and delay requirement into account, which decreases the probability of a packet passing its delivery path within a given deadline. This paper investigates the problem of finding optimal retransmission thresholds for relay nodes along a delivery path in a sensor network. The object of optimizing retransmission thresholds is to maximize the summation of the probability of the packet being successfully delivered to the next relay node or destination node in time. A dynamic programming-based distributed algorithm for finding optimal retransmission thresholds for relay nodes along a delivery path in the sensor network is proposed. The time complexity is OnΔ·max1≤i≤n{ui}, where ui is the given upper bound of the retransmission threshold of sensor node i in a given delivery path, n is the length of the delivery path and Δ is the given upper bound of the transmission delay of the delivery path. If Δ is greater than the polynomial, to reduce the time complexity, a linear programming-based (1+pmin)-approximation algorithm is proposed. Furthermore, when the ranges of the upper and lower bounds of retransmission thresholds are big enough, a Lagrange multiplier-based distributed O(1)-approximation algorithm with time complexity O(1) is proposed. Experimental results show that the proposed algorithms have better performance. PMID:27171092

Research in Network Management Techniques for Tactical Data Communications Network.

DTIC Science & Technology

1982-09-01

the control period. Research areas include Packet Network modelling, adaptive network routing, network design algorithms, network design techniques...contro!lers are designed to perform their limited tasks optimally. For the dynamic routing problem considered here, the local controllers are node...feedback to finding in optimum stead-o-state routing (static strategies) under non - control which can be easily implemented in real time. congested

Distributed fault detection over sensor networks with Markovian switching topologies

NASA Astrophysics Data System (ADS)

Ge, Xiaohua; Han, Qing-Long

2014-05-01

This paper deals with the distributed fault detection for discrete-time Markov jump linear systems over sensor networks with Markovian switching topologies. The sensors are scatteredly deployed in the sensor field and the fault detectors are physically distributed via a communication network. The system dynamics changes and sensing topology variations are modeled by a discrete-time Markov chain with incomplete mode transition probabilities. Each of these sensor nodes firstly collects measurement outputs from its all underlying neighboring nodes, processes these data in accordance with the Markovian switching topologies, and then transmits the processed data to the remote fault detector node. Network-induced delays and accumulated data packet dropouts are incorporated in the data transmission between the sensor nodes and the distributed fault detector nodes through the communication network. To generate localized residual signals, mode-independent distributed fault detection filters are proposed. By means of the stochastic Lyapunov functional approach, the residual system performance analysis is carried out such that the overall residual system is stochastically stable and the error between each residual signal and the fault signal is made as small as possible. Furthermore, a sufficient condition on the existence of the mode-independent distributed fault detection filters is derived in the simultaneous presence of incomplete mode transition probabilities, Markovian switching topologies, network-induced delays, and accumulated data packed dropouts. Finally, a stirred-tank reactor system is given to show the effectiveness of the developed theoretical results.

Switched Antenna Array Tile for Real-Time Microwave Imaging Aperture

DTIC Science & Technology

2016-06-26

Switched Antenna Array Tile for Real -Time Microwave Imaging Aperture William F. Moulder, Janusz J. Majewski, Charles M. Coldwell, James D. Krieger...Fast Imaging Algorithm 10mm 250mm Switched Array Tile Fig. 1. Diagram of real -time imaging array, with fabricated antenna tile. except for antenna...formed. IV. CONCLUSIONS A switched array tile to be used in a real time imaging aperture has been presented. Design and realization of the tile were

RF MEMS devices for multifunctional integrated circuits and antennas

NASA Astrophysics Data System (ADS)

Peroulis, Dimitrios

Micromachining and RF Micro-Electro-Mechanical Systems (RF MEMS) have been identified as two of the most significant enabling technologies in developing miniaturized low-cost communications systems and sensor networks. The key components in these MEMS-based architectures are the RF MEMS switches and varactors. The first part of this thesis focuses on three novel RF MEMS components with state-of-the-art performance. In particular, a broadband 6 V capacitive MEMS switch is presented with insertion loss of only 0.04 and 0.17 dB at 10 and 40 GHz respectively. Special consideration is given to particularly challenging issues, such as residual stress, planarity, power handling capability and switching speed. The need for switches operating below 1 GHz is also identified and a spring-loaded metal-to-metal contact switch is developed. The measured on-state contact resistance and off-state series capacitance are 0.5 O and 10 fF respectively for this switch. An analog millimeter-wave variable capacitor is the third MEMS component presented in this thesis. This variable capacitor shows an ultra high measured tuning range of nearly 4:1, which is the highest reported value for the millimeter-wave region. The second part of this thesis primarily concentrates on MEMS-based reconfigurable systems and their potential to revolutionize the design of future RF/microwave multifunctional systems. High-isolation switches and switch packets with isolation of more than 60 dB are designed and implemented. Furthermore, lowpass and bandpass tunable filters with 3:1 and 2:1 tuning ratios respectively are demonstrated. Similar methods have been also applied to the field of slot antennas and a novel design technique for compact reconfigurable antennas has been developed. The main advantage of these antennas is that they essentially preserve their impedance, radiation pattern, polarization, gain and efficiency for all operating frequencies. The thesis concludes by discussing the future challenges of RF MEMS, such as packaging and reliability.

A parallel algorithm for switch-level timing simulation on a hypercube multiprocessor

NASA Technical Reports Server (NTRS)

Rao, Hariprasad Nannapaneni

1989-01-01

The parallel approach to speeding up simulation is studied, specifically the simulation of digital LSI MOS circuitry on the Intel iPSC/2 hypercube. The simulation algorithm is based on RSIM, an event driven switch-level simulator that incorporates a linear transistor model for simulating digital MOS circuits. Parallel processing techniques based on the concepts of Virtual Time and rollback are utilized so that portions of the circuit may be simulated on separate processors, in parallel for as large an increase in speed as possible. A partitioning algorithm is also developed in order to subdivide the circuit for parallel processing.

Dwell time-based stabilisation of switched delay systems using free-weighting matrices

NASA Astrophysics Data System (ADS)

Koru, Ahmet Taha; Delibaşı, Akın; Özbay, Hitay

2018-01-01

In this paper, we present a quasi-convex optimisation method to minimise an upper bound of the dwell time for stability of switched delay systems. Piecewise Lyapunov-Krasovskii functionals are introduced and the upper bound for the derivative of Lyapunov functionals is estimated by free-weighting matrices method to investigate non-switching stability of each candidate subsystems. Then, a sufficient condition for the dwell time is derived to guarantee the asymptotic stability of the switched delay system. Once these conditions are represented by a set of linear matrix inequalities , dwell time optimisation problem can be formulated as a standard quasi-convex optimisation problem. Numerical examples are given to illustrate the improvements over previously obtained dwell time bounds. Using the results obtained in the stability case, we present a nonlinear minimisation algorithm to synthesise the dwell time minimiser controllers. The algorithm solves the problem with successive linearisation of nonlinear conditions.

Earthquake Early Warning: Real-time Testing of an On-site Method Using Waveform Data from the Southern California Seismic Network

NASA Astrophysics Data System (ADS)

Solanki, K.; Hauksson, E.; Kanamori, H.; Wu, Y.; Heaton, T.; Boese, M.

2007-12-01

We have implemented an on-site early warning algorithm using the infrastructure of the Caltech/USGS Southern California Seismic Network (SCSN). We are evaluating the real-time performance of the software system and the algorithm for rapid assessment of earthquakes. In addition, we are interested in understanding what parts of the SCSN need to be improved to make early warning practical. Our EEW processing system is composed of many independent programs that process waveforms in real-time. The codes were generated by using a software framework. The Pd (maximum displacement amplitude of P wave during the first 3sec) and Tau-c (a period parameter during the first 3 sec) values determined during the EEW processing are being forwarded to the California Integrated Seismic Network (CISN) web page for independent evaluation of the results. The on-site algorithm measures the amplitude of the P-wave (Pd) and the frequency content of the P-wave during the first three seconds (Tau-c). The Pd and the Tau-c values make it possible to discriminate between a variety of events such as large distant events, nearby small events, and potentially damaging nearby events. The Pd can be used to infer the expected maximum ground shaking. The method relies on data from a single station although it will become more reliable if readings from several stations are associated. To eliminate false triggers from stations with high background noise level, we have created per station Pd threshold configuration for the Pd/Tau-c algorithm. To determine appropriate values for the Pd threshold we calculate Pd thresholds for stations based on the information from the EEW logs. We have operated our EEW test system for about a year and recorded numerous earthquakes in the magnitude range from M3 to M5. Two recent examples are a M4.5 earthquake near Chatsworth and a M4.7 earthquake near Elsinore. In both cases, the Pd and Tau-c parameters were determined successfully within 10 to 20 sec of the arrival of the P-wave at the station. The Tau-c values predicted the magnitude within 0.1 and the predicted average peak-ground-motion was 0.7 cm/s and 0.6 cm/s. The delays in the system are caused mostly by the packetizing delay because our software system is based on processing miniseed packets. Most recently we have begun reducing the data latency using new qmaserv2 software for the Q330 Quanterra datalogger. We implemented qmaserv2 based multicast receiver software to receive the native 1 sec packets from the dataloggers. The receiver reads multicast packets from the network and writes them into shared memory area. This new software will fully take advantage of the capabilities of the Q330 datalogger and significantly reduce data latency for EEW system. We have also implemented a new EEW sub-system that compliments the currently running EEW system by associating Pd and Tau-c values from multiple stations. So far, we have implemented a new trigger generation algorithm for real-time processing for the sub-system, and are able to routinely locate events and determine magnitudes using the Pd and Tau-c values.

A group-based tasks allocation algorithm for the optimization of long leave opportunities in academic departments

NASA Astrophysics Data System (ADS)

Eyono Obono, S. D.; Basak, Sujit Kumar

2011-12-01

The general formulation of the assignment problem consists in the optimal allocation of a given set of tasks to a workforce. This problem is covered by existing literature for different domains such as distributed databases, distributed systems, transportation, packets radio networks, IT outsourcing, and teaching allocation. This paper presents a new version of the assignment problem for the allocation of academic tasks to staff members in departments with long leave opportunities. It presents the description of a workload allocation scheme and its algorithm, for the allocation of an equitable number of tasks in academic departments where long leaves are necessary.

Least mean square fourth based microgrid state estimation algorithm using the internet of things technology

PubMed Central

2017-01-01

This paper proposes an innovative internet of things (IoT) based communication framework for monitoring microgrid under the condition of packet dropouts in measurements. First of all, the microgrid incorporating the renewable distributed energy resources is represented by a state-space model. The IoT embedded wireless sensor network is adopted to sense the system states. Afterwards, the information is transmitted to the energy management system using the communication network. Finally, the least mean square fourth algorithm is explored for estimating the system states. The effectiveness of the developed approach is verified through numerical simulations. PMID:28459848

Fuzzy Logic Based Anomaly Detection for Embedded Network Security Cyber Sensor

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ondrej Linda; Todd Vollmer; Jason Wright

Resiliency and security in critical infrastructure control systems in the modern world of cyber terrorism constitute a relevant concern. Developing a network security system specifically tailored to the requirements of such critical assets is of a primary importance. This paper proposes a novel learning algorithm for anomaly based network security cyber sensor together with its hardware implementation. The presented learning algorithm constructs a fuzzy logic rule based model of normal network behavior. Individual fuzzy rules are extracted directly from the stream of incoming packets using an online clustering algorithm. This learning algorithm was specifically developed to comply with the constrainedmore » computational requirements of low-cost embedded network security cyber sensors. The performance of the system was evaluated on a set of network data recorded from an experimental test-bed mimicking the environment of a critical infrastructure control system.« less

HF band filter bank multi-carrier spread spectrum

DOE Office of Scientific and Technical Information (OSTI.GOV)

Laraway, Stephen Andrew; Moradi, Hussein; Farhang-Boroujeny, Behrouz

Abstract—This paper describes modifications to the filter bank multicarrier spread spectrum (FB-MC-SS) system, that was presented in [1] and [2], to enable transmission of this waveform in the HF skywave channel. FB-MC-SS is well suited for the HF channel because it performs well in channels with frequency selective fading and interference. This paper describes new algorithms for packet detection, timing recovery and equalization that are suitable for the HF channel. Also, an algorithm for optimizing the peak to average power ratio (PAPR) of the FBMC- SS waveform is presented. Application of this algorithm results in a waveform with low PAPR.more » Simulation results using a wide band HF channel model demonstrate the robustness of this system over a wide range of delay and Doppler spreads.« less

Ultrascalable petaflop parallel supercomputer

DOEpatents

Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Chiu, George [Cross River, NY; Cipolla, Thomas M [Katonah, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Hall, Shawn [Pleasantville, NY; Haring, Rudolf A [Cortlandt Manor, NY; Heidelberger, Philip [Cortlandt Manor, NY; Kopcsay, Gerard V [Yorktown Heights, NY; Ohmacht, Martin [Yorktown Heights, NY; Salapura, Valentina [Chappaqua, NY; Sugavanam, Krishnan [Mahopac, NY; Takken, Todd [Brewster, NY

2010-07-20

A massively parallel supercomputer of petaOPS-scale includes node architectures based upon System-On-a-Chip technology, where each processing node comprises a single Application Specific Integrated Circuit (ASIC) having up to four processing elements. The ASIC nodes are interconnected by multiple independent networks that optimally maximize the throughput of packet communications between nodes with minimal latency. The multiple networks may include three high-speed networks for parallel algorithm message passing including a Torus, collective network, and a Global Asynchronous network that provides global barrier and notification functions. These multiple independent networks may be collaboratively or independently utilized according to the needs or phases of an algorithm for optimizing algorithm processing performance. The use of a DMA engine is provided to facilitate message passing among the nodes without the expenditure of processing resources at the node.

Defense switched network technology and experiments program

NASA Astrophysics Data System (ADS)

Weinstein, C. J.

1983-09-01

This report documents work performed during FY 1983 on the DCA-sponsored Defense Switched Network Technology and Experiments Program. The areas of work reported are: (1) development of routing algorithms for application in the Defense Switched Network (DSN); (2) instrumentation and integration of the Experimental Integrated Switched Network (EISN) test facility; (3) development and test of data communication techniques using DoD-standard data protocols in an integrated voice/data network; and (4) EISN system coordination and experiment planning.

The American mobile satellite system

NASA Technical Reports Server (NTRS)

Garner, William B.

1990-01-01

During 1989, the American Mobile Satellite Corporation (AMSC) was authorized to construct, launch, and operate satellites to provide mobile satellite services (MSS) to the U.S. and Puerto Rico. The AMSC has undertaken three major development programs to bring a full range of MSS services to the U.S. The first program is the space segment program that will result in the construction and launch of the satellites as well as the construction and installation of the supporting ground telemetry and command system. The second segment will result in the specification, design, development, construction, and installation of the Network Control System necessary for managing communications access to the satellites, and the specification and development of ground equipment for standard circuit switched and packet switched communications services. The third program is the Phase 1 program to provide low speed data services within the U.S. prior to availability of the AMSC satellites and ground segment. Described here are the present status and plans for these three programs as well as an update on related business arrangements and regulatory matters.

System services and architecture of the TMI satellite mobile data system

NASA Technical Reports Server (NTRS)

Gokhale, D.; Agarwal, A.; Guibord, A.

1993-01-01

The North American Mobile Satellite Service (MSS) system being developed by AMSC/TMI and scheduled to go into service in early 1995 will include the provision for real time packet switched services (mobile data service - MDS) and circuit switched services (mobile telephony service - MTS). These services will utilize geostationary satellites which provide access to mobile terminals (MT's) through L-band beams. The MDS system utilizes a star topology with a centralized data hub (DH) and will support a large number of mobile terminals. The DH, which accesses the satellite via a single Ku band beam, is responsible for satellite resource management, for providing mobile users with access to public and private data networks, and for comprehensive network management of the system. This paper describes the various MDS services available for the users, the ground segment elements involved in the provisioning of these services, and a summary description of the channel types, protocol architecture, and network management capabilities provided within the system.

Studies in integrated line-and packet-switched computer communication systems

NASA Astrophysics Data System (ADS)

Maglaris, B. S.

1980-06-01

The problem of efficiently allocating the bandwidth of a trunk to both types of traffic is handled for various system and traffic models. A performance analysis is carried out both for variable and fixed frame schemes. It is shown that variable frame schemes, adjusting the frame length according to the traffic variations, offer better trunk utilization at the cost of the additional hardware and software complexity needed because of the lack of synchronization. An optimization study on the fixed frame schemes follows. The problem of dynamically allocating the fixed frame to both types of traffic is formulated as a Markovian Decision process. It is shown that the movable boundary scheme, suggested for commercial implementations of integrated multiplexors, offers optimal or near optimal performance and simplicity of implementation. Finally, the behavior of the movable boundary integrated scheme is studied for tandem link connections. Under the assumptions made for the line-switched traffic, the forward allocation technique is found to offer the best alternative among different path set-up strategies.

[Wavelet packet extraction and entropy analysis of telemetry EEG from the prelimbic cortex of medial prefrontal cortex in morphine-induced CPP rats].

PubMed

Bai, Yu; Bai, Jia-Ming; Li, Jing; Li, Min; Yu, Ran; Pan, Qun-Wan

2014-12-25

The purpose of the present study is to analyze the relationship between the telemetry electroencephalogram (EEG) changes of the prelimbic (PL) cortex and the drug-seeking behavior of morphine-induced conditioned place preference (CPP) rats by using the wavelet packet extraction and entropy measurement. The recording electrode was stereotactically implanted into the PL cortex of rats. The animals were then divided randomly into operation-only control and morphine-induced CPP groups, respectively. A CPP video system in combination with an EEG wireless telemetry device was used for recording EEG of PL cortex when the rats shuttled between black-white or white-black chambers. The telemetry recorded EEGs were analyzed by wavelet packet extraction, Welch power spectrum estimate, normalized amplitude and Shannon entropy algorithm. The results showed that, compared with operation-only control group, the left PL cortex's EEG of morphine-induced CPP group during black-white chamber shuttling exhibited the following changes: (1) the amplitude of average EEG for each frequency bands extracted by wavelet packet was reduced; (2) the Welch power intensity was increased significantly in 10-50 Hz EEG band (P < 0.01 or P < 0.05); (3) Shannon entropy was increased in β, γ₁, and γ₂waves of the EEG (P < 0.01 or P < 0.05); and (4) the average information entropy was reduced (P < 0.01). The results suggest that above mentioned EEG changes in morphine-induced CPP group rat may be related to animals' drug-seeking motivation and behavior launching.

Establishment of a definitive protocol for the diagnosis and management of body packers (drug mules).

PubMed

Mandava, Nageswara; Chang, Richard S; Wang, John H; Bertocchi, Michael; Yrad, Jonathan; Allamaneni, Shyam; Aboian, Edouard; Lall, Malini H; Mariano, Rosalind; Richards, Neil

2011-02-01

'Mules' or body packers are people who transport illegal drugs by packet ingestion into the gastrointestinal tract. These people are otherwise healthy and their management should maintain minimal morbidity. In this study, experience with body packers is presented and an algorithm for conservative and surgical management is provided. The clinical patient database for all body packer admissions at Mary Immaculate Hospital of the Caritas Health Care Inc. from 1993 to 2005 was interrogated. 56 patients (4.5%) required admission out of a total of 1250 subjects confirmed to be body packers and apprehended by United State Customs officials at JFK International Airport, New York. The retrieved patient data were analysed retrospectively. 70% of the body packers were men, with a male to female ratio of 2.8 to 1. The mean age was 33 years and 52% were from Columbia. Heroin was the most common illegally transported substance (73%). 25 patients (45%) required surgical intervention, whereas 31 patients (55%) were successfully managed conservatively. Indications for intervention included: bowel obstruction, packet rupture/toxicity, and delayed progression of packet transit on conservative management. Multiple intraoperative manoeuvres were used to remove the foreign bodies: gastrotomy, enterotomy and colotomy. Wound infection was the most common complication and is associated with distal enterotomy and colotomy. Men were more likely to present as body packers than women. Proximal enterotomies are preferred and multiple enterotomies should be avoided. A confirmatory radiological study is needed to demonstrate complete clearance of packets. A systematic protocol for the management of body packers results in minimal morbidity and no mortality.

Simulation for Dynamic Situation Awareness and Prediction III

DTIC Science & Technology

2010-03-01

source Java ™ library for capturing and sending network packets; 4) Groovy – an open source, Java -based scripting language (version 1.6 or newer). Open...DMOTH Analyzer application. Groovy is an open source dynamic scripting language for the Java Virtual Machine. It is consistent with Java syntax...between temperature, pressure, wind and relative humidity, and 3) a precipitation editing algorithm. The Editor can be used to prepare scripted changes

Wireless Sensor Network Metrics for Real-Time Systems

DTIC Science & Technology

2009-05-20

to compute the probability of end-to-end packet delivery as a function of latency, the expected radio energy consumption on the nodes from relaying... schedules for WSNs. Particularly, we focus on the impact scheduling has on path diversity, using short repeating schedules and Greedy Maximal Matching...a greedy algorithm for constructing a mesh routing topology. Finally, we study the implications of using distributed scheduling schemes to generate

Power-efficient distributed resource allocation under goodput QoS constraints for heterogeneous networks

NASA Astrophysics Data System (ADS)

Andreotti, Riccardo; Del Fiorentino, Paolo; Giannetti, Filippo; Lottici, Vincenzo

2016-12-01

This work proposes a distributed resource allocation (RA) algorithm for packet bit-interleaved coded OFDM transmissions in the uplink of heterogeneous networks (HetNets), characterized by small cells deployed over a macrocell area and sharing the same band. Every user allocates its transmission resources, i.e., bits per active subcarrier, coding rate, and power per subcarrier, to minimize the power consumption while both guaranteeing a target quality of service (QoS) and accounting for the interference inflicted by other users transmitting over the same band. The QoS consists of the number of information bits delivered in error-free packets per unit of time, or goodput (GP), estimated at the transmitter by resorting to an efficient effective SNR mapping technique. First, the RA problem is solved in the point-to-point case, thus deriving an approximate yet accurate closed-form expression for the power allocation (PA). Then, the interference-limited HetNet case is examined, where the RA problem is described as a non-cooperative game, providing a solution in terms of generalized Nash equilibrium. Thanks to the closed-form of the PA, the solution analysis is based on the best response concept. Hence, sufficient conditions for existence and uniqueness of the solution are analytically derived, along with a distributed algorithm capable of reaching the game equilibrium.

Genetic algorithm for the optimization of features and neural networks in ECG signals classification

NASA Astrophysics Data System (ADS)

Li, Hongqiang; Yuan, Danyang; Ma, Xiangdong; Cui, Dianyin; Cao, Lu

2017-01-01

Feature extraction and classification of electrocardiogram (ECG) signals are necessary for the automatic diagnosis of cardiac diseases. In this study, a novel method based on genetic algorithm-back propagation neural network (GA-BPNN) for classifying ECG signals with feature extraction using wavelet packet decomposition (WPD) is proposed. WPD combined with the statistical method is utilized to extract the effective features of ECG signals. The statistical features of the wavelet packet coefficients are calculated as the feature sets. GA is employed to decrease the dimensions of the feature sets and to optimize the weights and biases of the back propagation neural network (BPNN). Thereafter, the optimized BPNN classifier is applied to classify six types of ECG signals. In addition, an experimental platform is constructed for ECG signal acquisition to supply the ECG data for verifying the effectiveness of the proposed method. The GA-BPNN method with the MIT-BIH arrhythmia database achieved a dimension reduction of nearly 50% and produced good classification results with an accuracy of 97.78%. The experimental results based on the established acquisition platform indicated that the GA-BPNN method achieved a high classification accuracy of 99.33% and could be efficiently applied in the automatic identification of cardiac arrhythmias.

An activity recognition model using inertial sensor nodes in a wireless sensor network for frozen shoulder rehabilitation exercises.

PubMed

Lin, Hsueh-Chun; Chiang, Shu-Yin; Lee, Kai; Kan, Yao-Chiang

2015-01-19

This paper proposes a model for recognizing motions performed during rehabilitation exercises for frozen shoulder conditions. The model consists of wearable wireless sensor network (WSN) inertial sensor nodes, which were developed for this study, and enables the ubiquitous measurement of bodily motions. The model employs the back propagation neural network (BPNN) algorithm to compute motion data that are formed in the WSN packets; herein, six types of rehabilitation exercises were recognized. The packets sent by each node are converted into six components of acceleration and angular velocity according to three axes. Motor features such as basic acceleration, angular velocity, and derivative tilt angle were input into the training procedure of the BPNN algorithm. In measurements of thirteen volunteers, the accelerations and included angles of nodes were adopted from possible features to demonstrate the procedure. Five exercises involving simple swinging and stretching movements were recognized with an accuracy of 85%-95%; however, the accuracy with which exercises entailing spiral rotations were recognized approximately 60%. Thus, a characteristic space and enveloped spectrum improving derivative features were suggested to enable identifying customized parameters. Finally, a real-time monitoring interface was developed for practical implementation. The proposed model can be applied in ubiquitous healthcare self-management to recognize rehabilitation exercises.

A two-hop based adaptive routing protocol for real-time wireless sensor networks.

PubMed

Rachamalla, Sandhya; Kancherla, Anitha Sheela

2016-01-01

One of the most important and challenging issues in wireless sensor networks (WSNs) is to optimally manage the limited energy of nodes without degrading the routing efficiency. In this paper, we propose an energy-efficient adaptive routing mechanism for WSNs, which saves energy of nodes by removing the much delayed packets without degrading the real-time performance of the used routing protocol. It uses the adaptive transmission power algorithm which is based on the attenuation of the wireless link to improve the energy efficiency. The proposed routing mechanism can be associated with any geographic routing protocol and its performance is evaluated by integrating with the well known two-hop based real-time routing protocol, PATH and the resulting protocol is energy-efficient adaptive routing protocol (EE-ARP). The EE-ARP performs well in terms of energy consumption, deadline miss ratio, packet drop and end-to-end delay.

Evaluation Study of a Wireless Multimedia Traffic-Oriented Network Model

NASA Astrophysics Data System (ADS)

Vasiliadis, D. C.; Rizos, G. E.; Vassilakis, C.

2008-11-01

In this paper, a wireless multimedia traffic-oriented network scheme over a fourth generation system (4-G) is presented and analyzed. We conducted an extensive evaluation study for various mobility configurations in order to incorporate the behavior of the IEEE 802.11b standard over a test-bed wireless multimedia network model. In this context, the Quality of Services (QoS) over this network is vital for providing a reliable high-bandwidth platform for data-intensive sources like video streaming. Therefore, the main issues concerned in terms of QoS were the metrics for bandwidth of both dropped and lost packets and their mean packet delay under various traffic conditions. Finally, we used a generic distance-vector routing protocol which was based on an implementation of Distributed Bellman-Ford algorithm. The performance of the test-bed network model has been evaluated by using the simulation environment of NS-2.

The use of wavelet packet transform and artificial neural networks in analysis and classification of dysphonic voices.

PubMed

Crovato, César David Paredes; Schuck, Adalberto

2007-10-01

This paper presents a dysphonic voice classification system using the wavelet packet transform and the best basis algorithm (BBA) as dimensionality reductor and 06 artificial neural networks (ANN) acting as specialist systems. Each ANN was a 03-layer multilayer perceptron with 64 input nodes, 01 output node and in the intermediary layer the number of neurons depends on the related training pathology group. The dysphonic voice database was separated in five pathology groups and one healthy control group. Each ANN was trained and associated with one of the 06 groups, and fed by the best base tree (BBT) nodes' entropy values, using the multiple cross validation (MCV) method and the leave-one-out (LOO) variation technique and success rates obtained were 87.5%, 95.31%, 87.5%, 100%, 96.87% and 89.06% for the groups 01 to 06, respectively.

A Gaussian Wave Packet Propagation Approach to Vibrationally Resolved Optical Spectra at Non-Zero Temperatures.

PubMed

Reddy, Ch Sridhar; Prasad, M Durga

2016-04-28

An effective time dependent approach based on a method that is similar to the Gaussian wave packet propagation (GWP) technique of Heller is developed for the computation of vibrationally resolved electronic spectra at finite temperatures in the harmonic, Franck-Condon/Hertzberg-Teller approximations. Since the vibrational thermal density matrix of the ground electronic surface and the time evolution operator on that surface commute, it is possible to write the spectrum generating correlation function as a trace of the time evolved doorway state. In the stated approximations, the doorway state is a superposition of the harmonic oscillator zero and one quantum eigenfunctions and thus can be propagated by the GWP. The algorithm has an O(N(3)) dependence on the number of vibrational modes. An application to pyrene absorption spectrum at two temperatures is presented as a proof of the concept.

Scattering of an electronic wave packet by a one-dimensional electron-phonon-coupled structure

NASA Astrophysics Data System (ADS)

Brockt, C.; Jeckelmann, E.

2017-02-01

We investigate the scattering of an electron by phonons in a small structure between two one-dimensional tight-binding leads. This model mimics the quantum electron transport through atomic wires or molecular junctions coupled to metallic leads. The electron-phonon-coupled structure is represented by the Holstein model. We observe permanent energy transfer from the electron to the phonon system (dissipation), transient self-trapping of the electron in the electron-phonon-coupled structure (due to polaron formation and multiple reflections at the structure edges), and transmission resonances that depend strongly on the strength of the electron-phonon coupling and the adiabaticity ratio. A recently developed TEBD algorithm, optimized for bosonic degrees of freedom, is used to simulate the quantum dynamics of a wave packet launched against the electron-phonon-coupled structure. Exact results are calculated for a single electron-phonon site using scattering theory and analytical approximations are obtained for limiting cases.

A new method for solving the quantum hydrodynamic equations of motion: application to two-dimensional reactive scattering.

PubMed

Pauler, Denise K; Kendrick, Brian K

2004-01-08

The de Broglie-Bohm hydrodynamic equations of motion are solved using a meshless method based on a moving least squares approach and an arbitrary Lagrangian-Eulerian frame of reference. A regridding algorithm adds and deletes computational points as needed in order to maintain a uniform interparticle spacing, and unitary time evolution is obtained by propagating the wave packet using averaged fields. The numerical instabilities associated with the formation of nodes in the reflected portion of the wave packet are avoided by adding artificial viscosity to the equations of motion. The methodology is applied to a two-dimensional model collinear reaction with an activation barrier. Reaction probabilities are computed as a function of both time and energy, and are in excellent agreement with those based on the quantum trajectory method. (c) 2004 American Institute of Physics

Optimal control of switching time in switched stochastic systems with multi-switching times and different costs

NASA Astrophysics Data System (ADS)

Liu, Xiaomei; Li, Shengtao; Zhang, Kanjian

2017-08-01

In this paper, we solve an optimal control problem for a class of time-invariant switched stochastic systems with multi-switching times, where the objective is to minimise a cost functional with different costs defined on the states. In particular, we focus on problems in which a pre-specified sequence of active subsystems is given and the switching times are the only control variables. Based on the calculus of variation, we derive the gradient of the cost functional with respect to the switching times on an especially simple form, which can be directly used in gradient descent algorithms to locate the optimal switching instants. Finally, a numerical example is given, highlighting the validity of the proposed methodology.

HNET - A National Computerized Health Network

PubMed Central

Casey, Mark; Hamilton, Richard

1988-01-01

The HNET system demonstrated conceptually and technically a national text (and limited bit mapped graphics) computer network for use between innovative members of the health care industry. The HNET configuration of a leased high speed national packet switching network connecting any number of mainframe, mini, and micro computers was unique in it's relatively low capital costs and freedom from obsolescence. With multiple simultaneous conferences, databases, bulletin boards, calendars, and advanced electronic mail and surveys, it is marketable to innovative hospitals, clinics, physicians, health care associations and societies, nurses, multisite research projects libraries, etc.. Electronic publishing and education capabilities along with integrated voice and video transmission are identified as future enhancements.

A communications model for an ISAS to NASA span link

NASA Technical Reports Server (NTRS)

Green, James L.; Mcguire, Robert E.; Lopez-Swafford, Brian

1987-01-01

The authors propose that an initial computer-to-computer communication link use the public packet switched networks (PPSN) Venus-P in Japan and TELENET in the U.S. When the traffic warrants it, this link would then be upgraded to a dedicated leased line that directly connects into the Space Physics Analysis Network (SPAN). The proposed system of hardware and software will easily support migration to such a dedicated link. It therefore provides a cost effective approach to the network problem. Once a dedicated line becomes operation it is suggested that the public networks link and continue to coexist, providing a backup capability.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks.

PubMed

Javaid, Nadeem; Muhammad; Sher, Arshad; Abdul, Wadood; Niaz, Iftikhar Azim; Almogren, Ahmad; Alamri, Atif

2017-03-19

In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs) are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast), second technique is the improved Hydrocast (improved-Hydrocast), and third one is the cooperative improved Hydrocast (Co-improved Hydrocast). In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR) of the received signal is not within the predefined threshold then the maximal ratio combining (MRC) is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks

PubMed Central

Javaid, Nadeem; Muhammad; Sher, Arshad; Abdul, Wadood; Niaz, Iftikhar Azim; Almogren, Ahmad; Alamri, Atif

2017-01-01

In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs) are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast), second technique is the improved Hydrocast (improved-Hydrocast), and third one is the cooperative improved Hydrocast (Co-improved Hydrocast). In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR) of the received signal is not within the predefined threshold then the maximal ratio combining (MRC) is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast. PMID:28335494