Synchronous optical packet switch architecture with tunable single and multi-channels wavelength converters

Science.gov (United States)

Hamza, Haitham S.; Adel, Reham

2017-07-01

In this paper, we propose a bufferless synchronous optical packet switch (OPS) architecture named the Limited-range wavelength conversion with Dynamic Pump-wavelength Selection (LDPS) architecture. LDPS is equipped with a dedicated limited-range wavelength converters (LRWCs, and a shared pool of parametric wavelength converters (PWCs) with dynamic pump-wavelength selection (DPS). The adoption of hybrid conversion types in the proposed architecture aims at improving the packet loss rate (PLR) compared to conventional architecture with single conversion types, while reducing (or at least maintaining) the conversion distance (d) of used wavelength converters. Packet contention in the proposed architecture is resolved using the first available algorithm (FAA) and the dynamic pump-wavelength selection algorithm (DPSA). The performance of the proposed architecture is compared to two well-known conventional architectures; namely, the LRWC architecture that uses dedicated LRWCS for each input wavelength, and the DPS architecture that uses a shared pool of dynamic pump-wavelength converters (PWCs). Simulation results show that, for the same value of d, the new architecture reduces the PLR compared to the LRWC architecture by up to 40 % and 99.7 % for traffic loads, 0.5 and 1; respectively. In addition, for d = 1 , the new architecture reduces the PLR compared to the DPS architecture by up to 10 % and 99.3 % for traffic loads, 0.5 and 1; respectively.

Combining SDM-Based Circuit Switching with Packet Switching in a Router for On-Chip Networks

Directory of Open Access Journals (Sweden)

Angelo Kuti Lusala

2012-01-01

Full Text Available A Hybrid router architecture for Networks-on-Chip “NoC” is presented, it combines Spatial Division Multiplexing “SDM” based circuit switching and packet switching in order to efficiently and separately handle both streaming and best-effort traffic generated in real-time applications. Furthermore the SDM technique is combined with Time Division Multiplexing “TDM” technique in the circuit switching part in order to increase path diversity, thus improving throughput while sharing communication resources among multiple connections. Combining these two techniques allows mitigating the poor resource usage inherent to circuit switching. In this way Quality of Service “QoS” is easily provided for the streaming traffic through the circuit-switched sub-router while the packet-switched sub-router handles best-effort traffic. The proposed hybrid router architectures were synthesized, placed and routed on an FPGA. Results show that a practicable Network-on-Chip “NoC” can be built using the proposed router architectures. 7 × 7 mesh NoCs were simulated in SystemC. Simulation results show that the probability of establishing paths through the NoC increases with the number of sub-channels and has its highest value when combining SDM with TDM, thereby significantly reducing contention in the NoC.

640 Gbit/s Optical Packet Switching using a Novel In-Band Optical Notch-Filter Labeling Scheme

DEFF Research Database (Denmark)

Medhin, Ashenafi Kiros; Galili, Michael; Oxenløwe, Leif Katsuo

2014-01-01

Optical packet switching of 640 Gbit/s data packets is reported using an in-band optical labeling technique based on notch-filtering of the data spectrum and extracting the label using a bandpass filter. BER 10􀀀9 is achieved.......Optical packet switching of 640 Gbit/s data packets is reported using an in-band optical labeling technique based on notch-filtering of the data spectrum and extracting the label using a bandpass filter. BER 10􀀀9 is achieved....

Node design in optical packet switched networks

DEFF Research Database (Denmark)

Nord, Martin

2006-01-01

The thesis discusses motivation, realisation and performance of the Optical Packet Switching (OPS) network paradigm. The work includes proposals for designs and methods to efficiently use both the wavelength- and time domain for contention resolution in asynchronous operation. The project has also......S parameter. Finally, the thesis includes a proposal for a node design and associated MAC protocol for an OPS ring topology metropolitan area network with high throughput and fairness, also for unbalanced traffic....... proposed parallel designs to overcome scalability constraints and to support migration scenarios. Furthermore, it has proposed and demonstrated optical input processing schemes for hybrids networks to simultaneously support OPS and Optical Circuit Switching. Quality of Service (QoS) differentiation enables...

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

Directory of Open Access Journals (Sweden)

Chun-Liang Lee

Full Text Available 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.

40 Gbit/s NRZ Packet-Length Insensitive Header Extraction for Optical Label Switching Networks

DEFF Research Database (Denmark)

Seoane, Jorge; Kehayas, E; Avramopoulos, H.

2006-01-01

A simple method for 40 Gbit/s NRZ header extraction based on envelope detection for optical label switching networks is presented. The scheme is insensitive to packet length and spacing and can be single-chip integrated cost-effectively......A simple method for 40 Gbit/s NRZ header extraction based on envelope detection for optical label switching networks is presented. The scheme is insensitive to packet length and spacing and can be single-chip integrated cost-effectively...

Self-Management of Hybrid Optical and Packet Switching Networks

NARCIS (Netherlands)

Fioreze, Tiago; Pras, Aiko

Hybrid optical and packet switching networks enable data to be forwarded at multiple levels. Large IP flows at the IP level may be therefore moved to the optical level bypassing the per hop routing decisions of the IP level. Such move could be beneficial since congested IP networks could be

Self-Management of Hybrid Optical and Packet Switching Networks

NARCIS (Netherlands)

Fioreze, Tiago

2010-01-01

Hybrid optical and packet switching networks are composed of multi-service hybrid devices that enable forwarding of data at multiple levels. Large IP flows at the IP level may be therefore moved to the optical level bypassing therefore the per hop routing decisions of the IP level. Such move could

On the fly all-optical packet switching based on hybrid WDM/OCDMA labeling scheme

Science.gov (United States)

Brahmi, Houssem; Giannoulis, Giannis; Menif, Mourad; Katopodis, Vasilis; Kalavrouziotis, Dimitrios; Kouloumentas, Christos; Groumas, Panos; Kanakis, Giannis; Stamatiadis, Christos; Avramopoulos, Hercules; Erasme, Didier

2014-02-01

We introduce a novel design of an all-optical packet routing node that allows for the selection and forwarding of optical packets based on the routing information contained in hybrid wavelength division multiplexing/optical code division multiple access (WDM/OCDMA) labels. A stripping paradigm of optical code-label is adopted. The router is built around an optical-code gate that consists in an optical flip-flop controlled by two fiber Bragg grating correlators and is combined with a Mach-Zehnder interferometer (MZI)-based forwarding gate. We experimentally verify the proof-of-principle operation of the proposed self-routing node under NRZ and OCDMA packet traffic conditions. The successful switching of elastic NRZ payload at 40 Gb/s controlled by DS-OCDMA coded labels and the forwarding operation of encoded data using EQC codes are presented. Proper auto-correlation functions are obtained with higher than 8.1 dB contrast ratio, suitable to efficiently trigger the latching device with a contrast ratio of 11.6 dB and switching times below 3.8 ns. Error-free operation is achieved with 1.5 dB penalty for 40 Gb/s NRZ data and with 2.1 dB penalty for DS-OCDMA packets. The scheme can further be applied to large-scale optical packet switching networks by exploiting efficient optical coders allocated at different WDM channels.

Packet-Based Control Algorithms for Cooperative Surveillance and Reconnaissance

National Research Council Canada - National Science Library

Murray, Richard M

2007-01-01

..., and repeated transmissions. Results include analysis and design of estimation and control algorithms in the presence of packet loss and across multi-hop data networks, distributed estimation and sensor fusion algorithms...

Architectures of electro-optical packet switched networks

DEFF Research Database (Denmark)

Berger, Michael Stubert

2004-01-01

and examines possible architectures for future high capacity networks with high capacity nodes. It is assumed that optics will play a key role in this scenario, and in this respect, the European IST research project DAVID aimed at proposing viable architectures for optical packet switching, exploiting the best...... from optics and electronics. An overview of the DAVID network architecture is given, focusing on the MAN and WAN architecture as well as the MPLS based network hierarchy. A statistical model of the optical slot generation process is presented and utilised to evaluate delay vs. efficiency. Furthermore...... architecture for a buffered crossbar switch is presented. The architecture uses two levels of backpressure (flow control) with different constraints on round trip time. No additional scheduling complexity is introduced, and for the actual example shown, a reduction in memory of 75% was obtained at the cost...

Field trial of 160 Gb/s all-optical packet switching

NARCIS (Netherlands)

Liu, Y.; Herrera Llorente, J.; Raz, O.; Tangdiongga, E.; Marti, J.; Ramos, F.; Maxwell, G.D.; Poustie, A.; Mulvad, H.C.H.; Hill, M.T.; Waardt, de H.; Khoe, G.D.; Koonen, A.M.J.; Dorren, H.J.S.; Nakano, Y.

2007-01-01

We present the results of a transmission experiment, over 110 km of field installed fiber, for an all-optical 160 Gb/s packet switching system. The system uses in-band optical labels which are processed entirely in the optical domain using a narrow-band all-optical filter. The label decision

A distributed, hardware reconfigurable and packet switched real-time control and data acquisition system

International Nuclear Information System (INIS)

Batista, A.J.N.; Combo, A.; Sousa, J.; Varandas, C.A.F.

2002-01-01

The architecture of a synchronized event-based control and data acquisition system that aims to improve significantly the performance of actual systems is presented. The design explores recent developments in data transport, signal processing and system synchronization. Data transport between the acquisition, processing and storing devices and at backplane level will be performed by InfiniBand, a low latency packet switched network standard. Data processing algorithms will be performed in a mixture of digital signal processors and reconfigurable field programmable gate arrays. Both devices will be programmed from a descriptive high-level mathematical language. Acquisition synchronization, data stamping and event management will be performed through a specialized low latency synchronous optical network for the time critical signals

An NMR log echo data de-noising method based on the wavelet packet threshold algorithm

International Nuclear Information System (INIS)

Meng, Xiangning; Xie, Ranhong; Li, Changxi; Hu, Falong; Li, Chaoliu; Zhou, Cancan

2015-01-01

To improve the de-noising effects of low signal-to-noise ratio (SNR) nuclear magnetic resonance (NMR) log echo data, this paper applies the wavelet packet threshold algorithm to the data. The principle of the algorithm is elaborated in detail. By comparing the properties of a series of wavelet packet bases and the relevance between them and the NMR log echo train signal, ‘sym7’ is found to be the optimal wavelet packet basis of the wavelet packet threshold algorithm to de-noise the NMR log echo train signal. A new method is presented to determine the optimal wavelet packet decomposition scale; this is within the scope of its maximum, using the modulus maxima and the Shannon entropy minimum standards to determine the global and local optimal wavelet packet decomposition scales, respectively. The results of applying the method to the simulated and actual NMR log echo data indicate that compared with the wavelet threshold algorithm, the wavelet packet threshold algorithm, which shows higher decomposition accuracy and better de-noising effect, is much more suitable for de-noising low SNR–NMR log echo data. (paper)

Optical switching and detection of 640 Gb/s OTDM data packets transmitted over 50 km of fibre

NARCIS (Netherlands)

Gomez-Agis, F.; Hu, H.; Luo, J.; Mulvad, H.C.H.; Galili, M.; Calabretta, N.; Oxenløwe, L.K.; Dorren, H.J.S.; Jeppesen, P.

2011-01-01

We demonstrate 1×4 optical-packet switching with error-free transmission of 640 Gb/s single-wavelength OTDM data-packets including instantaneous clock extraction and short pulse generation for optical time-demultiplexing based on a cavity-less pulse source.

Packet Classification by Multilevel Cutting of the Classification Space: An Algorithmic-Architectural Solution for IP Packet Classification in Next Generation Networks

Directory of Open Access Journals (Sweden)

Motasem Aldiab

2008-01-01

Full Text Available Traditionally, the Internet provides only a “best-effort” service, treating all packets going to the same destination equally. However, providing differentiated services for different users based on their quality requirements is increasingly becoming a demanding issue. For this, routers need to have the capability to distinguish and isolate traffic belonging to different flows. This ability to determine the flow each packet belongs to is called packet classification. Technology vendors are reluctant to support algorithmic solutions for classification due to their nondeterministic performance. Although content addressable memories (CAMs are favoured by technology vendors due to their deterministic high-lookup rates, they suffer from the problems of high-power consumption and high-silicon cost. This paper provides a new algorithmic-architectural solution for packet classification that mixes CAMs with algorithms based on multilevel cutting of the classification space into smaller spaces. The provided solution utilizes the geometrical distribution of rules in the classification space. It provides the deterministic performance of CAMs, support for dynamic updates, and added flexibility for system designers.

A Scheduling Algorithm for Minimizing the Packet Error Probability in Clusterized TDMA Networks

Directory of Open Access Journals (Sweden)

Arash T. Toyserkani

2009-01-01

Full Text Available We consider clustered wireless networks, where transceivers in a cluster use a time-slotted mechanism (TDMA to access a wireless channel that is shared among several clusters. An approximate expression for the packet-loss probability is derived for networks with one or more mutually interfering clusters in Rayleigh fading environments, and the approximation is shown to be good for relevant scenarios. We then present a scheduling algorithm, based on Lagrangian duality, that exploits the derived packet-loss model in an attempt to minimize the average packet-loss probability in the network. Computer simulations of the proposed scheduling algorithm show that a significant increase in network throughput can be achieved compared to uncoordinated scheduling. Empirical trials also indicate that the proposed optimization algorithm almost always converges to an optimal schedule with a reasonable number of iterations. Thus, the proposed algorithm can also be used for bench-marking suboptimal scheduling algorithms.

Fuzzy-Based Adaptive Hybrid Burst Assembly Technique for Optical Burst Switched Networks

Directory of Open Access Journals (Sweden)

Abubakar Muhammad Umaru

2014-01-01

Full Text Available The optical burst switching (OBS paradigm is perceived as an intermediate switching technology for future all-optical networks. Burst assembly that is the first process in OBS is the focus of this paper. In this paper, an intelligent hybrid burst assembly algorithm that is based on fuzzy logic is proposed. The new algorithm is evaluated against the traditional hybrid burst assembly algorithm and the fuzzy adaptive threshold (FAT burst assembly algorithm via simulation. Simulation results show that the proposed algorithm outperforms the hybrid and the FAT algorithms in terms of burst end-to-end delay, packet end-to-end delay, and packet loss ratio.

A Scheduling Algorithm for Time Bounded Delivery of Packets on the Internet

NARCIS (Netherlands)

I. Vaishnavi (Ishan)

2008-01-01

htmlabstractThis thesis aims to provide a better scheduling algorithm for Real-Time delivery of packets. A number of emerging applications such as VoIP, Tele-immersive environments, distributed media viewing and distributed gaming require real-time delivery of packets. Currently the scheduling

High-speed packet switching network to link computers

CERN Document Server

Gerard, F M

1980-01-01

Virtually all of the experiments conducted at CERN use minicomputers today; some simply acquire data and store results on magnetic tape while others actually control experiments and help to process the resulting data. Currently there are more than two hundred minicomputers being used in the laboratory. In order to provide the minicomputer users with access to facilities available on mainframes and also to provide intercommunication between various experimental minicomputers, CERN opted for a packet switching network back in 1975. It was decided to use Modcomp II computers as switching nodes. The only software to be taken was a communications-oriented operating system called Maxcom. Today eight Modcomp II 16-bit computers plus six newer Classic minicomputers from Modular Computer Services have been purchased for the CERNET data communications networks. The current configuration comprises 11 nodes connecting more than 40 user machines to one another and to the laboratory's central computing facility. (0 refs).

Packets Distributing Evolutionary Algorithm Based on PSO for Ad Hoc Network

Science.gov (United States)

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.

Traffic analysis and signal processing in optical packet switched networks

DEFF Research Database (Denmark)

Fjelde, Tina

2002-01-01

/s optical packet switched network exploiting the best of optics and electronics, is used as a thread throughout the thesis. An overview of the DAVID network architecture is given, focussing on the MAN and WAN architecture as well as the MPLS-based network hierarchy. Subsequently, the traffic performance...... of the DAVID core optical packet router, which exploits wavelength conversion and fibre delay-line buffers for contention resolution, is analysed using a numerical model developed for that purpose. The robustness of the shared recirculating loop buffer with respect to´bursty traffic is demonstrated...... the injection of an additional clock signal into the IWC is presented. Results show very good transmission capabilities combined with a high-speed response. It is argued that signal regeneration is an inherent attribute of the IWC employed as a wavelength converter due to the sinusoidal transfer function...

Cross-layer designed adaptive modulation algorithm with packet combining and truncated ARQ over MIMO Nakagami fading channels

KAUST Repository

Aniba, Ghassane

2011-04-01

This paper presents an optimal adaptive modulation (AM) algorithm designed using a cross-layer approach which combines truncated automatic repeat request (ARQ) protocol and packet combining. Transmissions are performed over multiple-input multiple-output (MIMO) Nakagami fading channels, and retransmitted packets are not necessarily modulated using the same modulation format as in the initial transmission. Compared to traditional approach, cross-layer design based on the coupling across the physical and link layers, has proven to yield better performance in wireless communications. However, there is a lack for the performance analysis and evaluation of such design when the ARQ protocol is used in conjunction with packet combining. Indeed, previous works addressed the link layer performance of AM with truncated ARQ but without packet combining. In addition, previously proposed AM algorithms are not optimal and can provide poor performance when packet combining is implemented. Herein, we first show that the packet loss rate (PLR) resulting from the combining of packets modulated with different constellations can be well approximated by an exponential function. This model is then used in the design of an optimal AM algorithm for systems employing packet combining, truncated ARQ and MIMO antenna configurations, considering transmission over Nakagami fading channels. Numerical results are provided for operation with or without packet combining, and show the enhanced performance and efficiency of the proposed algorithm in comparison with existing ones. © 2011 IEEE.

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

Science.gov (United States)

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.

Principles of broadband switching and networking

CERN Document Server

Liew, Soung C

2010-01-01

An authoritative introduction to the roles of switching and transmission in broadband integrated services networks Principles of Broadband Switching and Networking explains the design and analysis of switch architectures suitable for broadband integrated services networks, emphasizing packet-switched interconnection networks with distributed routing algorithms. The text examines the mathematical properties of these networks, rather than specific implementation technologies. Although the pedagogical explanations in this book are in the context of switches, many of the fundamenta

First Field Trial of Optical Label-Based Switching and Packet Drop on a 477km NTON/Sprint Link

International Nuclear Information System (INIS)

Hernandez, V J; Pan, Z; Cao, J; Tsui, V K; Bansal, Y; Fong, S K H; Zhang, Y; Jeon, M Y; Yoo, S J B; Bodtker, B; Bond, S; Lennon, W J; Higashi, H; Lyles, B; McDonald, R

2001-01-01

We demonstrate the first field trial of optical label-based wavelength switching and packet drop on 476.8km of the National Transparent Optical Network. Subcarrier multiplexed labels control a switch fabric that includes a tunable wavelength converter and arrayed waveguide grating router

Hybrid Wavelength Routed and Optical Packet Switched Ring Networks for the Metropolitan Area Network

DEFF Research Database (Denmark)

Nord, Martin

2005-01-01

Increased data traffic in the metropolitan area network calls for new network architectures. This paper evaluates optical ring architectures based on optical packet switching, wavelength routing, and hybrid combinations of the two concepts. The evaluation includes overall throughput and fairness...... attractive when traffic is unbalanced....

IP Traceback through modified Probabilistic Packet Marking algorithm using Chinese Remainder Theorem

Directory of Open Access Journals (Sweden)

Y. Bhavani

2015-06-01

Full Text Available Probabilistic Packet Marking algorithm suggests a methodology to identify all the participated routers of the attack path by probabilistically marking the packets. In this approach, these marked packets contain partial information regarding the routers of the attack path. At receiver, to get the complete information of every router, it requires more number of marked packets and hence more combinations and more false positives. To overcome this drawback we have presented a novel idea in finding the exact IP address of the routers in the attack path by applying Chinese Remainder Theorem. The result of our implementation reveals that our idea requires less number of marked packets and takes no time in constructing the attack path. The same idea is true even in the case of multiple attackers.

A Novel Algorithm for Efficient Downlink Packet Scheduling for Multiple-Component-Carrier Cellular Systems

Directory of Open Access Journals (Sweden)

Yao-Liang Chung

2016-11-01

Full Text Available The simultaneous aggregation of multiple component carriers (CCs for use by a base station constitutes one of the more promising strategies for providing substantially enhanced bandwidths for packet transmissions in 4th and 5th generation cellular systems. To the best of our knowledge, however, few previous studies have undertaken a thorough investigation of various performance aspects of the use of a simple yet effective packet scheduling algorithm in which multiple CCs are aggregated for transmission in such systems. Consequently, the present study presents an efficient packet scheduling algorithm designed on the basis of the proportional fair criterion for use in multiple-CC systems for downlink transmission. The proposed algorithm includes a focus on providing simultaneous transmission support for both real-time (RT and non-RT traffic. This algorithm can, when applied with sufficiently efficient designs, provide adequate utilization of spectrum resources for the purposes of transmissions, while also improving energy efficiency to some extent. According to simulation results, the performance of the proposed algorithm in terms of system throughput, mean delay, and fairness constitute substantial improvements over those of an algorithm in which the CCs are used independently instead of being aggregated.

Development of optical packet and circuit integrated ring network testbed.

Science.gov (United States)

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 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

WDM packet switch architectures and analysis of the influence of tunable wavelength converters on the performance

DEFF Research Database (Denmark)

Danielsen, Søren Lykke; Mikkelsen, Benny; Jørgensen, Carsten

1997-01-01

A detailed analytical traffic model for a photonic wavelength division multiplexing (WDM) packet switch block is presented and the requirements to the buffer size is analyzed. Three different switch architectures are considered, each of them representing different complexities in terms of component.......e., the possibility of several outlets sharing the same physical buffer. For the three architectures presented here, a tradeoff in the buffer architectures is addressed: a buffer physically shared among an outlets requires many wavelengths internally in the switch block, whereas, architectures with buffers dedicated...

a pyramid algorithm for the haar discrete wavelet packet transform

African Journals Online (AJOL)

PROF EKWUEME

computer-aided signal processing of non-stationary signals, this paper develops a pyramid algorithm for the discrete wavelet packet ... Edith T. Luhanga, School of Computational and Communication Sciences and Engineering, Nelson Mandela African. Institute of ..... Mathematics, Washington University. 134. EDITH T.

Call for Papers: Photonics in Switching

Science.gov (United States)

Wosinska, Lena; Glick, Madeleine

2006-04-01

Call for Papers: Photonics in Switching Guest Editors: Lena Wosinska, Royal Institute of Technology (KTH) / ICT Sweden Madeleine Glick, Intel Research, Cambridge, UK Technologies based on DWDM systems allow data transmission with bit rates of Tbit/s on a single fiber. To facilitate this enormous transmission volume, high-capacity and high-speed network nodes become inevitable in the optical network. Wideband switching, WDM switching, optical burst switching (OBS), and optical packet switching (OPS) are promising technologies for harnessing the bandwidth of WDM optical fiber networks in a highly flexible and efficient manner. As a number of key optical component technologies approach maturity, photonics in switching is becoming an increasingly attractive and practical solution for the next-generation of optical networks. The scope of this special issue is focused on the technology and architecture of optical switching nodes, including the architectural and algorithmic aspects of high-speed optical networks. Scope of Submission The scope of the papers includes, but is not limited to, the following topics: WDM node architectures Novel device technologies enabling photonics in switching, such as optical switch fabrics, optical memory, and wavelength conversion Routing protocols WDM switching and routing Quality of service Performance measurement and evaluation Next-generation optical networks: architecture, signaling, and control Traffic measurement and field trials Optical burst and packet switching OBS/OPS node architectures Burst/Packet scheduling and routing algorithms Contention resolution/avoidance strategies Services and applications for OBS/OPS (e.g., grid networks, storage-area networks, etc.) Burst assembly and ingress traffic shaping Hybrid OBS/TDM or OBS/wavelength routing Manuscript Submission To submit to this special issue, follow the normal procedure for submission to JON and select ``Photonics in Switching' in the features indicator of the online

Packet Guide to Routing and Switching

CERN Document Server

Hartpence, Bruce

2011-01-01

Go beyond layer 2 broadcast domains with this in-depth tour of advanced link and internetwork layer protocols, and learn how they enable you to expand to larger topologies. An ideal follow-up to Packet Guide to Core Network Protocols, this concise guide dissects several of these protocols to explain their structure and operation. This isn't a book on packet theory. Author Bruce Hartpence built topologies in a lab as he wrote this guide, and each chapter includes several packet captures. You'll learn about protocol classification, static vs. dynamic topologies, and reasons for installing a pa

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Improved algorithms for circuit fault diagnosis based on wavelet packet and neural network

International Nuclear Information System (INIS)

Zhang, W-Q; Xu, C

2008-01-01

In this paper, two improved BP neural network algorithms of fault diagnosis for analog circuit are presented through using optimal wavelet packet transform(OWPT) or incomplete wavelet packet transform(IWPT) as preprocessor. The purpose of preprocessing is to reduce the nodes in input layer and hidden layer of BP neural network, so that the neural network gains faster training and convergence speed. At first, we apply OWPT or IWPT to the response signal of circuit under test(CUT), and then calculate the normalization energy of each frequency band. The normalization energy is used to train the BP neural network to diagnose faulty components in the analog circuit. These two algorithms need small network size, while have faster learning and convergence speed. Finally, simulation results illustrate the two algorithms are effective for fault diagnosis

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

Directory of Open Access Journals (Sweden)

Yi-Shan Lin

2017-01-01

Full Text Available Since frequent communication between applications takes place in high speed networks, deep packet inspection (DPI plays an important role in the network application awareness. The signature-based network intrusion detection system (NIDS contains a DPI technique that examines the incoming packet payloads by employing a pattern matching algorithm that dominates the overall inspection performance. Existing studies focused on implementing efficient pattern matching algorithms by parallel programming on software platforms because of the advantages of lower cost and higher scalability. Either the central processing unit (CPU or the graphic processing unit (GPU were involved. Our studies focused on designing a pattern matching algorithm based on the cooperation between both CPU and GPU. In this paper, we present an enhanced design for our previous work, a length-bounded hybrid CPU/GPU pattern matching algorithm (LHPMA. In the preliminary experiment, the performance and comparison with the previous work are displayed, and the experimental results show that the LHPMA can achieve not only effective CPU/GPU cooperation but also higher throughput than the previous method.

Buffer Management of Multi-Queue QoS Switches with Class Segregation

OpenAIRE

Itoh, Toshiya; Yoshimoto, Seiji

2013-01-01

In this paper, we focus on buffer management of multi-queue QoS switches in which packets of different values are segregated in different queues. Our model consists of $m$ queues and $m$ packet values $0 < v_{1} < v_{2} < ... < v_{m}$. Recently, Al-Bawani and Souza [IPL 113(4), pp.145-150, 2013] presented an online algorithm GREEDY for buffer management of multi-queue QoS switches with class segregation and showed thatif $m$ queues have the same size, then the competitive ratio of GREEDY is $...

Comparison of switching control algorithms effective in restricting the switching in the neighborhood of the origin

International Nuclear Information System (INIS)

Joung, JinWook; Chung, Lan; Smyth, Andrew W

2010-01-01

The active interaction control (AIC) system consisting of a primary structure, an auxiliary structure and an interaction element was proposed to protect the primary structure against earthquakes and winds. The objective of the AIC system in reducing the responses of the primary structure is fulfilled by activating or deactivating the switching between the engagement and the disengagement of the primary and auxiliary structures through the interaction element. The status of the interaction element is controlled by switching control algorithms. The previously developed switching control algorithms require an excessive amount of switching, which is inefficient. In this paper, the excessive amount of switching is restricted by imposing an appropriately designed switching boundary region, where switching is prohibited, on pre-designed engagement–disengagement conditions. Two different approaches are used in designing the newly proposed AID-off and AID-off 2 algorithms. The AID-off 2 algorithm is designed to affect deactivated switching regions explicitly, unlike the AID-off algorithm, which follows the same procedure of designing the engagement–disengagement conditions of the previously developed algorithms, by using the current status of the AIC system. Both algorithms are shown to be effective in reducing the amount of switching times triggered from the previously developed AID algorithm under an appropriately selected control sampling period for different earthquakes, but the AID-off 2 algorithm outperforms the AID-off algorithm in reducing the number of switching times

Cross-layer designed adaptive modulation algorithm with packet combining and truncated ARQ over MIMO Nakagami fading channels

KAUST Repository

Aniba, Ghassane; Aissa, Sonia

2011-01-01

works addressed the link layer performance of AM with truncated ARQ but without packet combining. In addition, previously proposed AM algorithms are not optimal and can provide poor performance when packet combining is implemented. Herein, we first show

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

Science.gov (United States)

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 optical packets of various packet lengths. In addition, successful avoidance of packet collisions by optical buffers was confirmed.

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

Science.gov (United States)

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.

Hardware Accelerators Targeting a Novel Group Based Packet Classification Algorithm

Directory of Open Access Journals (Sweden)

O. Ahmed

2013-01-01

Full Text Available Packet classification is a ubiquitous and key building block for many critical network devices. However, it remains as one of the main bottlenecks faced when designing fast network devices. In this paper, we propose a novel Group Based Search packet classification Algorithm (GBSA that is scalable, fast, and efficient. GBSA consumes an average of 0.4 megabytes of memory for a 10 k rule set. The worst-case classification time per packet is 2 microseconds, and the preprocessing speed is 3 M rules/second based on an Xeon processor operating at 3.4 GHz. When compared with other state-of-the-art classification techniques, the results showed that GBSA outperforms the competition with respect to speed, memory usage, and processing time. Moreover, GBSA is amenable to implementation in hardware. Three different hardware implementations are also presented in this paper including an Application Specific Instruction Set Processor (ASIP implementation and two pure Register-Transfer Level (RTL implementations based on Impulse-C and Handel-C flows, respectively. Speedups achieved with these hardware accelerators ranged from 9x to 18x compared with a pure software implementation running on an Xeon processor.

Accelerometer North Finding System Based on the Wavelet Packet De-noising Algorithm and Filtering Circuit

Directory of Open Access Journals (Sweden)

LU Yongle

2014-07-01

Full Text Available This paper demonstrates a method and system for north finding with a low-cost piezoelectricity accelerometer based on the Coriolis acceleration principle. The proposed setup is based on the choice of an accelerometer with residual noise of 35 ng•Hz-1/2. The plane of the north finding system is aligned parallel to the local level, which helps to eliminate the effect of plane error. The Coriolis acceleration caused by the earth’s rotation and the acceleration’s instantaneous velocity is much weaker than the g-sensitivity acceleration. To get a high accuracy and a shorter time for north finding system, in this paper, the Filtering Circuit and the wavelet packet de-nosing algorithm are used as the following. First, the hardware is designed as the alternating currents across by filtering circuit, so the DC will be isolated and the weak AC signal will be amplified. The DC is interfering signal generated by the earth's gravity. Then, we have used a wavelet packet to filter the signal which has been done through the filtering circuit. Finally, compare the north finding results measured by wavelet packet filtering with those measured by a low-pass filter. Wavelet filter de-noise data shows that wavelet packet filtering and wavelet filter measurement have high accuracy. Wavelet Packet filtering has stronger ability to remove burst noise and higher engineering environment adaptability than that of Wavelet filtering. Experimental results prove the effectiveness and project implementation of the accelerometer north finding method based on wavelet packet de-noising algorithm.

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

Science.gov (United States)

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.

Parallel Algorithms for Switching Edges in Heterogeneous Graphs.

Science.gov (United States)

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.

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

Science.gov (United States)

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.

The Control Packet Collision Avoidance Algorithm for the Underwater Multichannel MAC Protocols via Time-Frequency Masking

Directory of Open Access Journals (Sweden)

Yang Yu

2016-01-01

Full Text Available Establishing high-speed and reliable underwater acoustic networks among multiunmanned underwater vehicles (UUVs is basic to realize cooperative and intelligent control among different UUVs. Nevertheless, different from terrestrial network, the propagation speed of the underwater acoustic network is 1500 m/s, which makes the design of the underwater acoustic network MAC protocols a big challenge. In accordance with multichannel MAC protocols, data packets and control packets are transferred through different channels, which lowers the adverse effect of acoustic network and gradually becomes the popular issues of underwater acoustic networks MAC protocol research. In this paper, we proposed a control packet collision avoidance algorithm utilizing time-frequency masking to deal with the control packets collision in the control channel. This algorithm is based on the scarcity of the noncoherent underwater acoustic communication signals, which regards collision avoiding as separation of the mixtures of communication signals from different nodes. We first measure the W-Disjoint Orthogonality of the MFSK signals and the simulation result demonstrates that there exists time-frequency mask which can separate the source signals from the mixture of the communication signals. Then we present a pairwise hydrophones separation system based on deep networks and the location information of the nodes. Consequently, the time-frequency mask can be estimated.

NEBULAS A High Performance Data-Driven Event-Building Architecture based on an Asynchronous Self-Routing Packet-Switching Network

CERN Multimedia

Costa, M; Letheren, M; Djidi, K; Gustafsson, L; Lazraq, T; Minerskjold, M; Tenhunen, H; Manabe, A; Nomachi, M; Watase, Y

2002-01-01

RD31 : The project is evaluating a new approach to event building for level-two and level-three processor farms at high rate experiments. It is based on the use of commercial switching fabrics to replace the traditional bus-based architectures used in most previous data acquisition sytems. Switching fabrics permit the construction of parallel, expandable, hardware-driven event builders that can deliver higher aggregate throughput than the bus-based architectures. A standard industrial switching fabric technology is being evaluated. It is based on Asynchronous Transfer Mode (ATM) packet-switching network technology. Commercial, expandable ATM switching fabrics and processor interfaces, now being developed for the future Broadband ISDN infrastructure, could form the basis of an implementation. The goals of the project are to demonstrate the viability of this approach, to evaluate the trade-offs involved in make versus buy options, to study the interfacing of the physics frontend data buffers to such a fabric, a...

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

Science.gov (United States)

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.

Adaptive switching gravitational search algorithm: an attempt to ...

Indian Academy of Sciences (India)

Nor Azlina Ab Aziz

An adaptive gravitational search algorithm (GSA) that switches between synchronous and ... genetic algorithm (GA), bat-inspired algorithm (BA) and grey wolf optimizer (GWO). ...... heuristic with applications in applied electromagnetics. Prog.

Optical packet networks - conclusions from the IST DAVID project

DEFF Research Database (Denmark)

Dittmann, Lars

2004-01-01

This work outlines the result from the European research project DAVID working with optical packet switch solutions for both WAN and MAN. The project started July 2000 and has been completed successfully by the end of 2003.......This work outlines the result from the European research project DAVID working with optical packet switch solutions for both WAN and MAN. The project started July 2000 and has been completed successfully by the end of 2003....

All-optical header recognizer for optical packet switched networks : exploiting nonlinear gain and index dynamics in semiconductor optical amplifiers for low power operation and photonic integration device

NARCIS (Netherlands)

Calabretta, N.; Dorren, H.J.S.

2009-01-01

The increase of the internet traffic leads to future optical networks requiring tens of Tb/s of capacity. Current electronic circuit switches are limited by the scalability of the electronic switching fabrics, power consumption and dissipation in the opto- electronic conversion. All-optical packet

An Enhanced Feedback-Base Downlink Packet Scheduling Algorithm for Mobile TV in WIMAX Networks

Directory of Open Access Journals (Sweden)

Joseph Oyewale

2013-06-01

Full Text Available With high speed access network technology like WIMAX, there is the need for efficient management of radio resources where the throughput and Qos requirements for Multicasting Broadcasting Services (MBS for example TV are to be met. An enhanced  feedback-base downlink Packet scheduling algorithm  that can be used in IEEE 802.16d/e networks for mobile TV “one way traffic”(MBS is needed to support many users utilizing multiuser diversity of the  broadband of WIMAX systems where a group of users(good/worst channels share allocated resources (bandwidth. This paper proposes a WIMAX framework feedback-base (like a channel-awareness downlink packet scheduling algorithm for Mobile TV traffics in IEEE806.16, in which network Physical Timing Slots (PSs resource blocks are allocated in a dynamic way to mobile TV subscribers based on the Channel State information (CSI feedback, and then considering users with worst channels with the aim of improving system throughput while system coverage is being guaranteed. The algorithm was examined by changing the PSs bandwidth allocation of the users and different number of users of a cell. Simulation results show our proposed algorithm performed better than other algorithms (blind algorithms in terms of improvement in system throughput performance. /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso

SDRAM-based packet buffer model for high speed switches

DEFF Research Database (Denmark)

Rasmussen, Anders; Ruepp, Sarah Renée; Berger, Michael Stübert

2011-01-01

based on the specifications of a real-life DDR3-SDRAM chip. Based on this model the performance of different schemes for optimizing the performance of such a packet buffer can be evaluated. The purpose of this study is to find efficient schemes for memory mapping of the packet queues and I/O traffic...

Perceived Speech Quality Estimation Using DTW Algorithm

Directory of Open Access Journals (Sweden)

S. Arsenovski

2009-06-01

Full Text Available In this paper a method for speech quality estimation is evaluated by simulating the transfer of speech over packet switched and mobile networks. The proposed system uses Dynamic Time Warping algorithm for test and received speech comparison. Several tests have been made on a test speech sample of a single speaker with simulated packet (frame loss effects on the perceived speech. The achieved results have been compared with measured PESQ values on the used transmission channel and their correlation has been observed.

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

Science.gov (United States)

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

Directory of Open Access Journals (Sweden)

Song Xue

2012-08-01

Full Text Available 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.

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

Science.gov (United States)

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.

Design of Packet-Based Block Codes with Shift Operators

Directory of Open Access Journals (Sweden)

Ilow Jacek

2010-01-01

Full Text Available This paper introduces packet-oriented block codes for the recovery of lost packets and the correction of an erroneous single packet. Specifically, a family of systematic codes is proposed, based on a Vandermonde matrix applied to a group of information packets to construct redundant packets, where the elements of the Vandermonde matrix are bit-level right arithmetic shift operators. The code design is applicable to packets of any size, provided that the packets within a block of information packets are of uniform length. In order to decrease the overhead associated with packet padding using shift operators, non-Vandermonde matrices are also proposed for designing packet-oriented block codes. An efficient matrix inversion procedure for the off-line design of the decoding algorithm is presented to recover lost packets. The error correction capability of the design is investigated as well. The decoding algorithm, based on syndrome decoding, to correct a single erroneous packet in a group of received packets is presented. The paper is equipped with examples of codes using different parameters. The code designs and their performance are tested using Monte Carlo simulations; the results obtained exhibit good agreement with the corresponding theoretical results.

Novel scheme for efficient and cost-effective forwarding of packets in optical networks without header modification

DEFF Research Database (Denmark)

Wessing, Henrik; Fjelde, Tina; Christiansen, Henrik Lehrmann

2001-01-01

We present a novel scheme for addressing the outputs in optical packet switches and demonstrate its good scalability. The scheme requires neither header modification nor distribution of routing information to the packet switches, thus reducing optical component count while simplifying network...

Design of Packet-Based Block Codes with Shift Operators

Directory of Open Access Journals (Sweden)

Jacek Ilow

2010-01-01

Full Text Available This paper introduces packet-oriented block codes for the recovery of lost packets and the correction of an erroneous single packet. Specifically, a family of systematic codes is proposed, based on a Vandermonde matrix applied to a group of k information packets to construct r redundant packets, where the elements of the Vandermonde matrix are bit-level right arithmetic shift operators. The code design is applicable to packets of any size, provided that the packets within a block of k information packets are of uniform length. In order to decrease the overhead associated with packet padding using shift operators, non-Vandermonde matrices are also proposed for designing packet-oriented block codes. An efficient matrix inversion procedure for the off-line design of the decoding algorithm is presented to recover lost packets. The error correction capability of the design is investigated as well. The decoding algorithm, based on syndrome decoding, to correct a single erroneous packet in a group of n=k+r received packets is presented. The paper is equipped with examples of codes using different parameters. The code designs and their performance are tested using Monte Carlo simulations; the results obtained exhibit good agreement with the corresponding theoretical results.

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

Science.gov (United States)

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.

Novel Scheme for Packet Forwarding without Header Modifications in Optical Networks

DEFF Research Database (Denmark)

Wessing, Henrik; Christiansen, Henrik Lehrmann; Fjelde, Tina

2002-01-01

We present a novel scheme for packet forwarding in optical packet-switched networks and we further demonstrate its good scalability through simulations. The scheme requires neither header modification nor any label distribution protocol, thus reducing component cost while simplifying network...

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

Science.gov (United States)

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.

Packet-aware transport for video distribution [Invited

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Final Report - Dynamic Path Scheduling through Extensions to Generalized Multiprotocol Label Switching (GMPLS)

Energy Technology Data Exchange (ETDEWEB)

Principal Investigator: Dr. Abdella Battou

2009-05-22

The major accomplishments of the project are the successful software implementation of the Phase I scheduling algorithms for GMPLS Label Switched Paths (LSPs) and the extension of the IETF Path Computation Element (PCE) Protocol to support scheduling extensions. In performing this work, we have demonstrated the theoretical work of Phase I, analyzed key issues, and made relevant extensions. Regarding the software implementation, we developed a proof of concept prototype as part of our Algorithm Evaluation System (AES). This implementation uses the Linux operating system to provide software portability and will be the foundation for our commercial software. To demonstrate proof of concept, we have implemented LSP scheduling algorithms to support two of the key GMPLS switching technologies (Lambda and Packet) and support both Fixed Path (FP) and Switched Path (SP) routing. We chose Lambda and Packet because we felt it was essential to include both circuit and packet switching technologies as well as to address all-optical switching in the study. As conceptualized in Phase I, the FP algorithms use a traditional approach where the LSP uses the same physical path for the entire service duration while the innovative SP algorithms allow the physical path to vary during the service duration. As part of this study, we have used the AES to conduct a performance analysis using metro size networks (up to 32 nodes) that showed that these algorithms are suitable for commercial implementation. Our results showed that the CPU time required to compute an LSP schedule was small compared to expected inter-arrival time between LSP requests. Also, when the network size increased from 7 to 15 to 32 nodes with 10, 26, and 56 TE links, the CPU processing time showed excellent scaling properties. When Fixed Path and Switched Path routing were compared, SP provided only modestly better performance with respect to LSP completion rate, service duration, path length, and start time deviation

Scalable Packet Classification with Hash Tables

Science.gov (United States)

Wang, Pi-Chung

In the last decade, the technique of packet classification has been widely deployed in various network devices, including routers, firewalls and network intrusion detection systems. In this work, we improve the performance of packet classification by using multiple hash tables. The existing hash-based algorithms have superior scalability with respect to the required space; however, their search performance may not be comparable to other algorithms. To improve the search performance, we propose a tuple reordering algorithm to minimize the number of accessed hash tables with the aid of bitmaps. We also use pre-computation to ensure the accuracy of our search procedure. Performance evaluation based on both real and synthetic filter databases shows that our scheme is effective and scalable and the pre-computation cost is moderate.

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

Science.gov (United States)

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

Optimization and Assessment of Wavelet Packet Decompositions with Evolutionary Computation

Directory of Open Access Journals (Sweden)

Schell Thomas

2003-01-01

Full Text Available In image compression, the wavelet transformation is a state-of-the-art component. Recently, wavelet packet decomposition has received quite an interest. A popular approach for wavelet packet decomposition is the near-best-basis algorithm using nonadditive cost functions. In contrast to additive cost functions, the wavelet packet decomposition of the near-best-basis algorithm is only suboptimal. We apply methods from the field of evolutionary computation (EC to test the quality of the near-best-basis results. We observe a phenomenon: the results of the near-best-basis algorithm are inferior in terms of cost-function optimization but are superior in terms of rate/distortion performance compared to EC methods.

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

Science.gov (United States)

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.

Dynamic optical fiber delivery of Ka-band packet transmissions for wireless access networks

DEFF Research Database (Denmark)

Rodríguez Páez, Juan Sebastián; Madsen, Peter; Tafur Monroy, Idelfonso

2017-01-01

A Reconfigurable Radio Access Unit is presented and experimentally demonstrated. In the unit, an optical switching system is set to dynamically deliver different packets to different points in the network. The packets are transmitted wirelesslty on the Ka-band (26–40 GHz), achieving BER values...

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

Science.gov (United States)

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.

Joint Connection and Packet level Analysis in W-CDMA Radio Interface

DEFF Research Database (Denmark)

Benetis, Vilius; Popova, Larissa; Iversen, Villy Bæk

2007-01-01

algorithm which defines the feasible state space at packet level. At packet level we take into consideration wireless interference (soft blocking). The traffic is modeled as multi-rate Binomial-Poisson-Pascal (BPP-) traffic at connection level and on-off traffic at packet level. We obtain individual...

PCIU: Hardware Implementations of an Efficient Packet Classification Algorithm with an Incremental Update Capability

Directory of Open Access Journals (Sweden)

O. Ahmed

2011-01-01

Full Text Available Packet classification plays a crucial role for a number of network services such as policy-based routing, firewalls, and traffic billing, to name a few. However, classification can be a bottleneck in the above-mentioned applications if not implemented properly and efficiently. In this paper, we propose PCIU, a novel classification algorithm, which improves upon previously published work. PCIU provides lower preprocessing time, lower memory consumption, ease of incremental rule update, and reasonable classification time compared to state-of-the-art algorithms. The proposed algorithm was evaluated and compared to RFC and HiCut using several benchmarks. Results obtained indicate that PCIU outperforms these algorithms in terms of speed, memory usage, incremental update capability, and preprocessing time. The algorithm, furthermore, was improved and made more accessible for a variety of applications through implementation in hardware. Two such implementations are detailed and discussed in this paper. The results indicate that a hardware/software codesign approach results in a slower, but easier to optimize and improve within time constraints, PCIU solution. A hardware accelerator based on an ESL approach using Handel-C, on the other hand, resulted in a 31x speed-up over a pure software implementation running on a state of the art Xeon processor.

Multi-planed unified switching topologies

Science.gov (United States)

Chen, Dong; Heidelberger, Philip; Sugawara, Yutaka

2017-07-04

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 of 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.

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

DEFF Research Database (Denmark)

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

2017-01-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...... 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...

Optical packet switched design with relaxed maximum hardware parameters and high service-class granularity for flexible switch node dimensioning

DEFF Research Database (Denmark)

Nord, Martin

2004-01-01

This work proposes a quality of service differentiation algorithm, improving the service class granularity and isolation of our recently presented waveband plane based design. The design aims at overcoming potential hardware limitations and increasing the switch node dimensioning flexibility...... in core networks. Exploiting the wavelength dimension for contention resolution, using partially shared wavelength converter pools, avoids optical buffers and reduces wavelength converter count. These benefits are illustrated by numerical simulations, and are highlighted in a dimensioning study with three...

Application of Cisco Packet Trace in the Inter-VLAN Communication Teaching%浅析Cisco Packet Tracer在Vlan间通信教学的应用

Institute of Scientific and Technical Information of China (English)

郑耿凡

2014-01-01

Cisco Packet Tracer is a network simulation platform developed by Cisco Company. And Cisco packet tracer 5.3 allows three layer switch vlan communication in the experimental teaching. Real equipment is replaced by the analog simulation software, which solves the problem of lacking teaching experimental equipment in practice and im-proves the quality of teaching.%Cisco packet tracer是由思科公司开发的一个网络模拟辅助平台，在实验教学中可以借助Cisco packet tracer5.3实现三层交换机Vlan间通信，通过模拟防真软件来代替现实的设备，以解决在实践教学中实验设备缺乏的问题，提高教学质量。

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

Science.gov (United States)

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

2018-04-16

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

Advanced driver assistance system for AHS over communication links with random packet dropouts

Science.gov (United States)

Srinivasan, Seshadhri; Ayyagari, Ramakalyan

2014-12-01

In this paper, we propose an advanced driver assist system (ADAS) for platoon based automated highway system (AHS) with packet loss in inter-vehicle communication. Using the concept of rigidity, we first show that vehicles in a platoon tend to fall apart in the event of a packet loss among vehicles. To overcome this, we propose an estimation based dynamic platooning algorithm which employs the state estimate to maintain the platoon. Communication among the vehicle is reduced by using minimum spanning tree (MST) in state estimation algorithm. Effectiveness of the proposed ADAS scheme is illustrated by simulation wherein, dynamic platoons of holonomic vehicles with integrator dynamics are considered. Simulation studies indicate that the proposed algorithm maintains the platoon up to a packet loss rate of 48%. State transmission scheme proposed in our algorithm has three significant advantages, they are: (1) it handles packet loss in inter-vehicle communication, (2) reduces the effect of error in measured output, and (3) reduces the inter-vehicle communication. These advantages significantly increase the reliability and safety of the AHS.

Wavelet Entropy-Based Traction Inverter Open Switch Fault Diagnosis in High-Speed Railways

Directory of Open Access Journals (Sweden)

Keting Hu

2016-03-01

Full Text Available In this paper, a diagnosis plan is proposed to settle the detection and isolation problem of open switch faults in high-speed railway traction system traction inverters. Five entropy forms are discussed and compared with the traditional fault detection methods, namely, discrete wavelet transform and discrete wavelet packet transform. The traditional fault detection methods cannot efficiently detect the open switch faults in traction inverters because of the low resolution or the sudden change of the current. The performances of Wavelet Packet Energy Shannon Entropy (WPESE, Wavelet Packet Energy Tsallis Entropy (WPETE with different non-extensive parameters, Wavelet Packet Energy Shannon Entropy with a specific sub-band (WPESE3,6, Empirical Mode Decomposition Shannon Entropy (EMDESE, and Empirical Mode Decomposition Tsallis Entropy (EMDETE with non-extensive parameters in detecting the open switch fault are evaluated by the evaluation parameter. Comparison experiments are carried out to select the best entropy form for the traction inverter open switch fault detection. In addition, the DC component is adopted to isolate the failure Isolated Gate Bipolar Transistor (IGBT. The simulation experiments show that the proposed plan can diagnose single and simultaneous open switch faults correctly and timely.

Novel Optical Labeling Scheme for Ultra-High Bit Rate Data Packets

DEFF Research Database (Denmark)

Medhin, Ashenafi Kiros; Galili, Michael; Oxenløwe, Leif Katsuo

2013-01-01

We propose and verify by simulations an optical in-band labeling scheme for ultra-fast optical switching. The scheme is able to label more than 60 different 640-Gbit/s OTDM packets with eye opening penalty <1 dB....

Quality of service in optical packet switched networks

CERN Document Server

Rahbar, Akbar G

2015-01-01

This book is a comprehensive study on OPS networks, its architectures, and developed techniques for improving its quality of switching and managing quality of service.  The book includes: Introduction to OPS networks, OOFDM networks, GMPLS-enabled optical networks, QoS in OPS networks Hybrid contention avoidance/resolution schemes in both long-haul and metro optical networks Hybrid optical switching schemes

A first packet processing subdomain cluster model based on SDN

Science.gov (United States)

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.

Dynamics of Number of Packets in Transit in Free Flow State of Data Network

International Nuclear Information System (INIS)

Shengkun Xie; Lawniczak, A.T.

2011-01-01

We study how the dynamics of Number of Packets in Transit (NPT) is affected by the coupling of a routing type with a volume of incoming packet traffic in a data network model of packet switching type. The NPT is a network performance indicator of an aggregate type that measures in '' real time '', how many packets are in the network on their routes to their destinations. We conduct our investigation using a time-discrete simulation model that is an abstraction of the Network Layer of the ISO OSI Seven Layer Reference Model. This model focuses on packets and their routing. We consider a static routing and two different types of dynamic routings coupled with different volumes of incoming packet traffic in the network free flow state. Our study shows that the order of the values of the NPT mean value time series depends on the coupling of a routing type with a volume of incoming packet traffic and changes when the volume of incoming packet traffic increases and is closed to the critical source load values, i.e. when it is closed to the phase transition points from the network free flow state to its congested states. (authors)

Study of the Subjective Visibility of Packet Loss Artifacts in Decoded Video Sequences

DEFF Research Database (Denmark)

Korhonen, Jari

2018-01-01

Packet loss is a significant cause of visual impairments in video broadcasting over packet-switched networks. There are several subjective and objective video quality assessment methods focused on the overall perception of video quality. However, less attention has been paid on the visibility...... of packet loss artifacts appearing in spatially and temporally limited regions of a video sequence. In this paper, we present the results of a subjective study, using a methodology where a video sequence is displayed on a touchscreen and the users tap it in the positions where they observe artifacts. We...... also analyze the objective features derived from those artifacts, and propose different models for combining those features into an objective metric for assessing the noticeability of the artifacts. The practical results show that the proposed metric predicts visibility of packet loss impairments...

Synchronization Algorithm for SDN-controlled All-Optical TDM Switching in a Random Length Ring Network

DEFF Research Database (Denmark)

Kamchevska, Valerija; Cristofori, Valentina; Da Ros, Francesco

2016-01-01

We propose and demonstrate an algorithm that allows for automatic synchronization of SDN-controlled all-optical TDM switching nodes connected in a ring network. We experimentally show successful WDM-SDM transmission of data bursts between all ring nodes.......We propose and demonstrate an algorithm that allows for automatic synchronization of SDN-controlled all-optical TDM switching nodes connected in a ring network. We experimentally show successful WDM-SDM transmission of data bursts between all ring nodes....

Internal Backpressure for Terabit Switch Fabrics

DEFF Research Database (Denmark)

Fagertun, Anna Manolova; Ruepp, Sarah Renée; Rytlig, Andreas

2012-01-01

This paper proposes and analyzes the efficiency of novel backpressure schemes for Terabit switch fabrics. The proposed schemes aim at buffer optimization under uniform traffic distribution with Bernoulli packet arrival process. Results show that a reduction of the needed maximum buffer capacity w...... with up to 47% can be achieved with switch-internal backpressure mechanisms at the expense of a small control overhead....

Pump-dump iterative squeezing of vibrational wave packets.

Science.gov (United States)

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.

Path searching in switching networks using cellular algorithm

Energy Technology Data Exchange (ETDEWEB)

Koczy, L T; Langer, J; Legendi, T

1981-01-01

After a survey of the important statements in the paper A Mathematical Model of Path Searching in General Type Switching Networks (see IBID., vol.25, no.1, p.31-43, 1981) the authors consider the possible implementation for cellular automata of the algorithm introduced there. The cellular field used consists of 5 neighbour 8 state cells. Running times required by a traditional serial processor and by the cellular field, respectively, are compared. By parallel processing this running time can be reduced. 5 references.

Research on Matrix-type Packet Loss Compensation Scheme for Wireless Video Transmission on Subway

Directory of Open Access Journals (Sweden)

Fan Qing-Wu

2017-01-01

Full Text Available As the mainstream wireless LAN technology, Wi-Fi can achieve fast data transfer. With the subway moving in a high speed, video data transmission between the metro and the ground is achieved through Wi-Fi technology. This paper aims at solving the Caton problem caused by switching packet loss in the process of playing real-time video on the train terminal, and proposes matrix-type packet loss compensation scheme. Finally, the feasibility of the scheme is verified by experiments.

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

Directory of Open Access Journals (Sweden)

Zhining Gu

2018-02-01

Full Text Available 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.

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

Science.gov (United States)

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

2018-02-27

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.

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

Science.gov (United States)

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.

FAS: Using FPGA to Accelerate and Secure SDN Software Switches

Directory of Open Access Journals (Sweden)

Wenwen Fu

2018-01-01

Full Text Available Software-Defined Networking (SDN promises the vision of more flexible and manageable networks but requires certain level of programmability in the data plane to accommodate different forwarding abstractions. SDN software switches running on commodity multicore platforms are programmable and are with low deployment cost. However, the performance of SDN software switches is not satisfactory due to the complex forwarding operations on packets. Moreover, this may hinder the performance of real-time security on software switch. In this paper, we analyze the forwarding procedure and identify the performance bottleneck of SDN software switches. An FPGA-based mechanism for accelerating and securing SDN switches, named FAS (FPGA-Accelerated SDN software switch, is proposed to take advantage of the reconfigurability and high-performance advantages of FPGA. FAS improves the performance as well as the capacity against malicious traffic attacks of SDN software switches by offloading some functional modules. We validate FAS on an FPGA-based network processing platform. Experiment results demonstrate that the forwarding rate of FAS can be 44% higher than the original SDN software switch. In addition, FAS provides new opportunity to enhance the security of SDN software switches by allowing the deployment of bump-in-the-wire security modules (such as packet detectors and filters in FPGA.

Voice Quality Measuring Setup with Automatic Voice over IP Call Generator and Lawful Interception Packet Analyzer

Directory of Open Access Journals (Sweden)

PLEVA Matus

Full Text Available This paper describes the packet measuring laboratory setup, which could be used also for lawful interception applications, using professional packet analyzer, Voice over IP call generator, free call server (Asterisk linux setup and appropriate software and hardware described below. This setup was used for measuring the quality of the automatically generated VoIP calls under stressed network conditions, when the call manager server was flooded with high bandwidth traffic, near the bandwidth limit of the connected switch. The call generator realizes 30 calls simultaneously and the packet capturer & analyzercould decode the VoIP traffic, extract RTP session data, automatically analyze the voice quality using standardized MOS (Mean Opinion Score values and describe also the source of the voice degradation (jitter, packet loss, codec, delay, etc..

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

Science.gov (United States)

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.

Gabor Wave Packet Method to Solve Plasma Wave Equations

International Nuclear Information System (INIS)

Pletzer, A.; Phillips, C.K.; Smithe, D.N.

2003-01-01

A numerical method for solving plasma wave equations arising in the context of mode conversion between the fast magnetosonic and the slow (e.g ion Bernstein) wave is presented. The numerical algorithm relies on the expansion of the solution in Gaussian wave packets known as Gabor functions, which have good resolution properties in both real and Fourier space. The wave packets are ideally suited to capture both the large and small wavelength features that characterize mode conversion problems. The accuracy of the scheme is compared with a standard finite element approach

Packet loss replacement in voip using a recursive low-order autoregressive modelbased speech

International Nuclear Information System (INIS)

Miralavi, Seyed Reza; Ghorshi, Seyed; Mortazavi, Mohammad; Choupan, Jeiran

2011-01-01

In real-time packet-based communication systems one major problem is misrouted or delayed packets which results in degraded perceived voice quality. When some speech packets are not available on time, the packet is known as lost packet in real-time communication systems. The easiest task of a network terminal receiver is to replace silence for the duration of lost speech segments. In a high quality communication system in order to avoid quality reduction due to packet loss a suitable method and/or algorithm is needed to replace the missing segments of speech. In this paper, we introduce a recursive low order autoregressive (AR) model for replacement of lost speech segment. The evaluation results show that this method has a lower mean square error (MSE) and low complexity compared to the other efficient methods like high-order AR model without any substantial degradation in perceived voice quality.

Seismic Target Classification Using a Wavelet Packet Manifold in Unattended Ground Sensors Systems

Directory of Open Access Journals (Sweden)

Enliang Song

2013-07-01

Full Text Available One of the most challenging problems in target classification is the extraction of a robust feature, which can effectively represent a specific type of targets. The use of seismic signals in unattended ground sensor (UGS systems makes this problem more complicated, because the seismic target signal is non-stationary, geology-dependent and with high-dimensional feature space. This paper proposes a new feature extraction algorithm, called wavelet packet manifold (WPM, by addressing the neighborhood preserving embedding (NPE algorithm of manifold learning on the wavelet packet node energy (WPNE of seismic signals. By combining non-stationary information and low-dimensional manifold information, WPM provides a more robust representation for seismic target classification. By using a K nearest neighbors classifier on the WPM signature, the algorithm of wavelet packet manifold classification (WPMC is proposed. Experimental results show that the proposed WPMC can not only reduce feature dimensionality, but also improve the classification accuracy up to 95.03%. Moreover, compared with state-of-the-art methods, WPMC is more suitable for UGS in terms of recognition ratio and computational complexity.

Switch and examine transmit diversity for spectrum sharing systems

KAUST Repository

Abdallah, Mohamed M.

2011-06-01

In this paper, we develop a switch and examine transmit diversity algorithm for spectrum sharing cognitive networks. We consider a cognitive network composed of a primary link that employs constant rate and constant power transmission scheme with automatic-and-repeat request (ARQ) protocol, while the secondary link is composed of a fixed power multiple-antenna secondary transmitter and a single antenna receiver. Our objective is to develop a low complex transmit diversity algorithm at the secondary transmitter that maximizes the performance of the secondary link in terms of the effective throughput while maintaining a predetermined maximum loss in the packet rate of the primary link. In achieving this objective, we develop an algorithm that selects the best antenna, which maintains the quality of the secondary link in terms of signal-to-noise ratio above a specific threshold, based on overhearing the acknowledgment (ACK) and negative acknowledgment (NACK) feedback messages transmitted over the primary link. We also develop closed form expressions for the bit error rates and the effective throughput of the secondary link. © 2011 IEEE.

Binary Systematic Network Coding for Progressive Packet Decoding

OpenAIRE

Jones, Andrew L.; Chatzigeorgiou, Ioannis; Tassi, Andrea

2015-01-01

We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show that systematic network coding outperforms conventional net- work coding. We also develop an algorithm based on Gaussian elimination that allows progressive decoding of source packets. Simulation results show that the proposed decoding algorithm can achieve ...

QoS Differentiated and Fair Packet Scheduling in Broadband Wireless Access Networks

Directory of Open Access Journals (Sweden)

Zhang Yan

2009-01-01

Full Text Available This paper studies the packet scheduling problem in Broadband Wireless Access (BWA networks. The key difficulties of the BWA scheduling problem lie in the high variability of wireless channel capacity and the unknown model of packet arrival process. It is difficult for traditional heuristic scheduling algorithms to handle the situation and guarantee satisfying performance in BWA networks. In this paper, we introduce learning-based approach for a better solution. Specifically, we formulate the packet scheduling problem as an average cost Semi-Markov Decision Process (SMDP. Then, we solve the SMDP by using reinforcement learning. A feature-based linear approximation and the Temporal-Difference learning technique are employed to produce a near optimal solution of the corresponding SMDP problem. The proposed algorithm, called Reinforcement Learning Scheduling (RLS, has in-built capability of self-training. It is able to adaptively and timely regulate its scheduling policy according to the instantaneous network conditions. Simulation results indicate that RLS outperforms two classical scheduling algorithms and simultaneously considers: (i effective QoS differentiation, (ii high bandwidth utilization, and (iii both short-term and long-term fairness.

Cross entropy-based memetic algorithms: An application study over the tool switching problem

Directory of Open Access Journals (Sweden)

Jhon Edgar Amaya

2013-05-01

Full Text Available This paper presents a parameterized schema for building memetic algorithms based on cross-entropy (CE methods. This novel schema is general in nature, and features multiple probability mass functions and Lamarckian learning. The applicability of the approach is assessed by considering the Tool Switching Problem, a complex combinatorial problem in the field of Flexible Manufacturing Systems. An exhaustive evaluation (including techniques ranging from local search and evolutionary algorithms to constructive methods provides evidence of the effectiveness of CE-based memetic algorithms.

Extensible packet processing architecture

Science.gov (United States)

Robertson, Perry J.; Hamlet, Jason R.; Pierson, Lyndon G.; Olsberg, Ronald R.; Chun, Guy D.

2013-08-20

A technique for distributed packet processing includes sequentially passing packets associated with packet flows between a plurality of processing engines along a flow through data bus linking the plurality of processing engines in series. At least one packet within a given packet flow is marked by a given processing engine to signify by the given processing engine to the other processing engines that the given processing engine has claimed the given packet flow for processing. A processing function is applied to each of the packet flows within the processing engines and the processed packets are output on a time-shared, arbitered data bus coupled to the plurality of processing engines.

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

Science.gov (United States)

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.

Time-resolved dynamics of two-channel molecular systems in cw laser fields: Wave-packet construction in the Floquet formalism

International Nuclear Information System (INIS)

Nguyen-Dang, T.T.; Chateauneuf, F.; Atabek, O.; He, X.

1995-01-01

The description of the wave-packet time-resolved dynamics in a two-channel molecular system driven by a cw laser field is considered within the time-independent Floquet representation. It is shown that, at high field intensity, the wave-packet motions are governed solely by the pair of adiabatic dressed potential-energy surfaces (PES's) associated with a single Brillouin zone. The same expressions of the wave-packet motions in terms of the adiabatic PES's are obtained within a short-time approximation, thereby furnishing a new numerical algorithm for the wave-packet propagation in a laser-driven two-channel system at any intensity. Numerical tests of this algorithm are presented. The numerical results establish unambiguously the adiabaticity of nuclear motions at high field intensities

A study of artificial speech quality assessors of VoIP calls subject to limited bursty packet losses

Directory of Open Access Journals (Sweden)

Jelassi Sofiene

2011-01-01

Full Text Available Abstract A revolutionary feature of emerging media services over the Internet is their ability to account for human perception during service delivery processes, which surely increases their popularity and incomes. In such a situation, it is necessary to understand the users' perception, what should obviously be done using standardized subjective experiences. However, it is also important to develop artificial quality assessors that enable to automatically quantify the perceived quality. This efficiently helps performing optimal network and service management at the core and edges of the delivery systems. In our article, we explore the behavior rating of new emerging artificial speech quality assessors of VoIP calls subject to moderately bursty packet loss processes. The examined Speech Quality Assessment (SQA algorithms are able to estimate speech quality of live VoIP calls at run-time using control information extracted from header content of received packets. They are especially designed to be sensitive to packet loss burstiness. The performance evaluation study is performed using a dedicated set-up software-based SQA framework. It offers a specialized packet killer and includes the implementation of four SQA algorithms. A speech quality database, which covers a wide range of bursty packet loss conditions, has been created and then thoroughly analyzed. Our main findings are the following: (1 all examined automatic bursty-loss aware speech quality assessors achieve a satisfactory correlation under upper (> 20% and lower (< 10% ranges of packet loss processes; (2 they exhibit a clear weakness to assess speech quality under a moderated packet loss process; (3 the accuracy of sequence-by-sequence basis of examined SQA algorithms should be addressed in detail for further precision.

Exact analysis of Packet Reversed Packet Combining Scheme and Modified Packet Combining Scheme; and a combined scheme

International Nuclear Information System (INIS)

Bhunia, C.T.

2007-07-01

Packet combining scheme is a well defined simple error correction scheme for the detection and correction of errors at the receiver. Although it permits a higher throughput when compared to other basic ARQ protocols, packet combining (PC) scheme fails to correct errors when errors occur in the same bit locations of copies. In a previous work, a scheme known as Packet Reversed Packet Combining (PRPC) Scheme that will correct errors which occur at the same bit location of erroneous copies, was studied however PRPC does not handle a situation where a packet has more than 1 error bit. The Modified Packet Combining (MPC) Scheme that can correct double or higher bit errors was studied elsewhere. Both PRPC and MPC schemes are believed to offer higher throughput in previous studies, however neither adequate investigation nor exact analysis was done to substantiate this claim of higher throughput. In this work, an exact analysis of both PRPC and MPC is carried out and the results reported. A combined protocol (PRPC and MPC) is proposed and the analysis shows that it is capable of offering even higher throughput and better error correction capability at high bit error rate (BER) and larger packet size. (author)

Improving the Energy Market: Algorithms, Market Implications, and Transmission Switching

Science.gov (United States)

Lipka, Paula Ann

This dissertation aims to improve ISO operations through a better real-time market solution algorithm that directly considers both real and reactive power, finds a feasible Alternating Current Optimal Power Flow solution, and allows for solving transmission switching problems in an AC setting. Most of the IEEE systems do not contain any thermal limits on lines, and the ones that do are often not binding. Chapter 3 modifies the thermal limits for the IEEE systems to create new, interesting test cases. Algorithms created to better solve the power flow problem often solve the IEEE cases without line limits. However, one of the factors that makes the power flow problem hard is thermal limits on the lines. The transmission networks in practice often have transmission lines that become congested, and it is unrealistic to ignore line limits. Modifying the IEEE test cases makes it possible for other researchers to be able to test their algorithms on a setup that is closer to the actual ISO setup. This thesis also examines how to convert limits given on apparent power---as is in the case in the Polish test systems---to limits on current. The main consideration in setting line limits is temperature, which linearly relates to current. Setting limits on real or apparent power is actually a proxy for using the limits on current. Therefore, Chapter 3 shows how to convert back to the best physical representation of line limits. A sequential linearization of the current-voltage formulation of the Alternating Current Optimal Power Flow (ACOPF) problem is used to find an AC-feasible generator dispatch. In this sequential linearization, there are parameters that are set to the previous optimal solution. Additionally, to improve accuracy of the Taylor series approximations that are used, the movement of the voltage is restricted. The movement of the voltage is allowed to be very large at the first iteration and is restricted further on each subsequent iteration, with the restriction

On Maximizing the Throughput of Packet Transmission under Energy Constraints.

Science.gov (United States)

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.

The Design of the M-B-Quadro Optical Switch and Its Access Control Strategies

Institute of Scientific and Technical Information of China (English)

无

2003-01-01

This paper proposes a new simple contention resolution switching architecture, M-B-Quadro, and its underlying access control strategies. By incorporating delay and buffer lines, the switching node can effectively obtain very low packet deflection probability.

Compensation of position errors in passivity based teleoperation over packet switched communication networks

NARCIS (Netherlands)

Secchi, C; Stramigioli, Stefano; Fantuzzi, C.

Because of the use of scattering based communication channels, passivity based telemanipulation systems can be subject to a steady state position error between master and slave robots. In this paper, we consider the case in which the passive master and slave sides communicate through a packet

Hybrid Multiple Soft-Sensor Models of Grinding Granularity Based on Cuckoo Searching Algorithm and Hysteresis Switching Strategy

Directory of Open Access Journals (Sweden)

Jie-Sheng Wang

2015-01-01

Full Text Available According to the characteristics of grinding process and accuracy requirements of technical indicators, a hybrid multiple soft-sensor modeling method of grinding granularity is proposed based on cuckoo searching (CS algorithm and hysteresis switching (HS strategy. Firstly, a mechanism soft-sensor model of grinding granularity is deduced based on the technique characteristics and a lot of experimental data of grinding process. Meanwhile, the BP neural network soft-sensor model and wavelet neural network (WNN soft-sensor model are set up. Then, the hybrid multiple soft-sensor model based on the hysteresis switching strategy is realized. That is to say, the optimum model is selected as the current predictive model according to the switching performance index at each sampling instant. Finally the cuckoo searching algorithm is adopted to optimize the performance parameters of hysteresis switching strategy. Simulation results show that the proposed model has better generalization results and prediction precision, which can satisfy the real-time control requirements of grinding classification process.

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

Science.gov (United States)

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.

A Time-Varied Probabilistic ON/OFF Switching Algorithm for Cellular Networks

KAUST Repository

Rached, Nadhir B.; Ghazzai, Hakim; Kadri, Abdullah; Alouini, Mohamed-Slim

2018-01-01

In this letter, we develop a time-varied probabilistic on/off switching planning method for cellular networks to reduce their energy consumption. It consists in a risk-aware optimization approach that takes into consideration the randomness of the user profile associated with each base station (BS). The proposed approach jointly determines (i) the instants of time at which the current active BS configuration must be updated due to an increase or decrease of the network traffic load, and (ii) the set of minimum BSs to be activated to serve the networks’ subscribers. Probabilistic metrics modeling the traffic profile variation are developed to trigger this dynamic on/off switching operation. Selected simulation results are then performed to validate the proposed algorithm for different system parameters.

A Time-Varied Probabilistic ON/OFF Switching Algorithm for Cellular Networks

KAUST Repository

Rached, Nadhir B.

2018-01-11

In this letter, we develop a time-varied probabilistic on/off switching planning method for cellular networks to reduce their energy consumption. It consists in a risk-aware optimization approach that takes into consideration the randomness of the user profile associated with each base station (BS). The proposed approach jointly determines (i) the instants of time at which the current active BS configuration must be updated due to an increase or decrease of the network traffic load, and (ii) the set of minimum BSs to be activated to serve the networks’ subscribers. Probabilistic metrics modeling the traffic profile variation are developed to trigger this dynamic on/off switching operation. Selected simulation results are then performed to validate the proposed algorithm for different system parameters.

Packet reversed packet combining scheme

International Nuclear Information System (INIS)

Bhunia, C.T.

2006-07-01

The packet combining scheme is a well defined simple error correction scheme with erroneous copies at the receiver. It offers higher throughput combined with ARQ protocols in networks than that of basic ARQ protocols. But packet combining scheme fails to correct errors when the errors occur in the same bit locations of two erroneous copies. In the present work, we propose a scheme that will correct error if the errors occur at the same bit location of the erroneous copies. The proposed scheme when combined with ARQ protocol will offer higher throughput. (author)

A Fourier analysis for a fast simulation algorithm. [for switching converters

Science.gov (United States)

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.

Traction Inverter Open Switch Fault Diagnosis Based on Choi–Williams Distribution Spectral Kurtosis and Wavelet-Packet Energy Shannon Entropy

Directory of Open Access Journals (Sweden)

Shuangshuang Lin

2017-09-01

Full Text Available In this paper, a new approach for fault detection and location of open switch faults in the closed-loop inverter fed vector controlled drives of Electric Multiple Units is proposed. Spectral kurtosis (SK based on Choi–Williams distribution (CWD as a statistical tool can effectively indicate the presence of transients and locations in the frequency domain. Wavelet-packet energy Shannon entropy (WPESE is appropriate for the transient changes detection of complex non-linear and non-stationary signals. Based on the analyses of currents in normal and fault conditions, SK based on CWD and WPESE are combined with the DC component method. SK based on CWD and WPESE are used for the fault detection, and the DC component method is used for the fault localization. This approach can diagnose the specific locations of faulty Insulated Gate Bipolar Transistors (IGBTs with high accuracy, and it requires no additional devices. Experiments on the RT-LAB platform are carried out and the experimental results verify the feasibility and effectiveness of the diagnosis method.

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

Science.gov (United States)

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.

A parallel algorithm for switch-level timing simulation on a hypercube multiprocessor

Science.gov (United States)

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.

Revivals of Rydberg wave packets

International Nuclear Information System (INIS)

Bluhm, R.; Kostelecky, V.A.; Tudose, B.

1998-01-01

We examine the revival structure of Rydberg wave packets. These wave packets exhibit initial classical periodic motion followed by a sequence of collapse, fractional (or full) revivals, and fractional (or full) superrevivals. The effects of quantum defects on wave packets in alkali-metal atoms and a squeezed-state description of the initial wave packets are also considered. We then examine the revival structure of Rydberg wave packets in the presence of an external electric field - that is, the revival structure of Stark wave packets. These wave packets have energies that depend on two quantum numbers and exhibit new types of interference behavior

revivals of Rydberg wave packets

International Nuclear Information System (INIS)

Bluhm, R.; Kostelecky, V.A.; Tudose, B.

1998-01-01

We examine the revival structure of Rydberg wave packets. The effects of quantum defects on wave packets in alkali-metal atoms and a squeezed-state description of the initial wave packets are also described. We then examine the revival structure of Rydberg wave packets in the presence of an external electric field, i.e., the revival structure of Stark wave packets. These wave packets have energies that depend on two quantum numbers and exhibit new types of interference behaviour

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

Science.gov (United States)

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.

Adaptive Conflict-Free Optimization of Rule Sets for Network Security Packet Filtering Devices

Directory of Open Access Journals (Sweden)

Andrea Baiocchi

2015-01-01

Full Text Available Packet filtering and processing rules management in firewalls and security gateways has become commonplace in increasingly complex networks. On one side there is a need to maintain the logic of high level policies, which requires administrators to implement and update a large amount of filtering rules while keeping them conflict-free, that is, avoiding security inconsistencies. On the other side, traffic adaptive optimization of large rule lists is useful for general purpose computers used as filtering devices, without specific designed hardware, to face growing link speeds and to harden filtering devices against DoS and DDoS attacks. Our work joins the two issues in an innovative way and defines a traffic adaptive algorithm to find conflict-free optimized rule sets, by relying on information gathered with traffic logs. The proposed approach suits current technology architectures and exploits available features, like traffic log databases, to minimize the impact of ACO development on the packet filtering devices. We demonstrate the benefit entailed by the proposed algorithm through measurements on a test bed made up of real-life, commercial packet filtering devices.

Efficiency improvement and torque ripple minimization of Switched Reluctance Motor using FEM and Seeker Optimization Algorithm

International Nuclear Information System (INIS)

Navardi, Mohammad Javad; Babaghorbani, Behnaz; Ketabi, Abbas

2014-01-01

Highlights: • This paper proposes a new method to optimize a Switched Reluctance Motor (SRM). • A combination of SOA and GA with Finite Element Method (FEM) analysis is employed to solve the SRM design optimization. • The results show that optimized SRM obtains higher average torque and higher efficiency. - Abstract: In this paper, performance optimization of Switched Reluctance Motor (SRM) was determined using Seeker Optimization Algorithm (SOA). The most efficient aim of the algorithm was found for maximum torque value at a minimum mass of the entire construction, following changing the geometric parameters. The optimization process was carried out using a combination of Seeker Optimization Algorithm and Finite Element Method (FEM). Fitness value was calculated by FEM analysis using COMSOL3.4, and the SOA was realized by MATLAB. The proposed method has been applied for a case study and it has been also compared with Genetic Algorithm (GA). The results show that the optimized motor using SOA had higher torque value and efficiency with lower mass and torque ripple, exhibiting the validity of this methodology for SRM design

Manipulating the Shape of Electronic Non-Dispersive Wave-Packets in the Hydrogen Atom: Numerical Tests in Realistic Experimental Conditions

International Nuclear Information System (INIS)

Delande, D.; Sacha, K.; Zakrzewski, J.

2002-01-01

We show that combination of a linearly polarized resonant microwave field and a parallel static electric field may be used to create a non-dispersive electronic wave packet in Rydberg atoms. The static electric field allows for manipulation of the shape of the elliptical trajectory the wave packet is propagating on. Exact quantum numerical calculations for realistic experimental parameters show that the wave packet evolving on a linear orbit can be very easily prepared in a laboratory either by a direct optical excitation or by preparing an atom in an extremal Stark state and then slowly switching on the micro wave field. The latter scheme seems to be very resistant to experimental imperfections. Once the wave packet on the linear orbit is excited, the static field may be used to manipulate the shape of the orbit. (author)

A network-flow based valve-switching aware binding algorithm for flow-based microfluidic biochips

DEFF Research Database (Denmark)

Tseng, Kai-Han; You, Sheng-Chi; Minhass, Wajid Hassan

2013-01-01

-flow based resource binding algorithm based on breadth-first search (BFS) and minimum cost maximum flow (MCMF) in architectural-level synthesis. The experimental results show that our methodology not only makes significant reduction of valve-switching activities but also diminishes the application completion......Designs of flow-based microfluidic biochips are receiving much attention recently because they replace conventional biological automation paradigm and are able to integrate different biochemical analysis functions on a chip. However, as the design complexity increases, a flow-based microfluidic...... biochip needs more chip-integrated micro-valves, i.e., the basic unit of fluid-handling functionality, to manipulate the fluid flow for biochemical applications. Moreover, frequent switching of micro-valves results in decreased reliability. To minimize the valve-switching activities, we develop a network...

A Performance Analysis for UMTS Packet Switched Network Based on Multivariate KPIS

OpenAIRE

Ouyang, Ye; Fallah, M. Hosein

2010-01-01

Mobile data services are penetrating mobile markets rapidly. The mobile industry relies heavily on data service to replace the traditional voice services with the evolution of the wireless technology and market. A reliable packet service network is critical to the mobile operators to maintain their core competence in data service market. Furthermore, mobile operators need to develop effective operational models to manage the varying mix of voice, data and video traffic on a single network. Ap...

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

Science.gov (United States)

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.

Integrated DoD Voice and Data Networks and Ground Packet Radio Technology

Science.gov (United States)

1976-08-01

as the traffic requirement level increases. Moreover, the satellite switch selection problem is only meaningful over a limited traffic range. When...5: CPU TIMES VS. NUMBER OF SWITCHES SATELLITE SWITCH SELECTION ALGORITHM Computer Used: PDP-10 ♦O’S" means 0 minutes and 5 seconds. 5.30...Saturation Algorithm for Topo\\ogical Design of Parket-Switched Communications Networks," National Te3 ecommunications Conference Proceed- ings, San

A multicast tree aggregation algorithm in wavelength-routed WDM networks

Science.gov (United States)

Cheng, Hsu-Chen; Kuo, Chin-Chun; Lin, Frank Y.

2005-02-01

Wavelength division multiplexing (WDM) has been considered a promising transmission technology in optical communication networks. With the continuous advance in optical technology, WDM network will play an important role in wide area backbone networks. Optical wavelength switching, compared with optical packet switching, is a more mature and more cost-effective choice for optical switching technologies. Besides, the technology of time division multiplexing in optical communication networks has been working smoothly for a long time. In the proposed research, the problem of multicast groups aggregation and multicast routing and wavelength assignment in wavelength-routed WDM network is studied. The optical cross connect switches in the problem are assumed to have limited optical multicast/splitting and TDM functionalities. Given the physical network topology and capacity, the objective is to maximize the total revenue by means of utmost merging multicast groups into larger macro-groups. The groups in the same macro-group will share a multicast tree to conduct data transmission. The problem is formulated as an optimization problem, where the objective function is to maximize the total revenue subject to capacity constraints of components in the optical network, wavelength continuity constraints, and tree topology constraints. The decision variables in the formulations include the merging results between groups, multicast tree routing assignment and wavelength assignment. The basic approach to the algorithm development for this model is Lagrangean relaxation in conjunction with a number of optimization techniques. In computational experiments, the proposed algorithms are evaluated on different network topologies and perform efficiently and effectively according to the experiment results.

Uplink Packet-Data Scheduling in DS-CDMA Systems

Science.gov (United States)

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.

Rotating quantum Gaussian packets

International Nuclear Information System (INIS)

Dodonov, V V

2015-01-01

We study two-dimensional quantum Gaussian packets with a fixed value of mean angular momentum. This value is the sum of two independent parts: the ‘external’ momentum related to the motion of the packet center and the ‘internal’ momentum due to quantum fluctuations. The packets minimizing the mean energy of an isotropic oscillator with the fixed mean angular momentum are found. They exist for ‘co-rotating’ external and internal motions, and they have nonzero correlation coefficients between coordinates and momenta, together with some (moderate) amount of quadrature squeezing. Variances of angular momentum and energy are calculated, too. Differences in the behavior of ‘co-rotating’ and ‘anti-rotating’ packets are shown. The time evolution of rotating Gaussian packets is analyzed, including the cases of a charge in a homogeneous magnetic field and a free particle. In the latter case, the effect of initial shrinking of packets with big enough coordinate-momentum correlation coefficients (followed by the well known expansion) is discovered. This happens due to a competition of ‘focusing’ and ‘de-focusing’ in the orthogonal directions. (paper)

Effective Packet Number for 5G IM WeChat Application at Early Stage Traffic Classification

Directory of Open Access Journals (Sweden)

Muhammad Shafiq

2017-01-01

Full Text Available Accurate network traffic classification at early stage is very important for 5G network applications. During the last few years, researchers endeavored hard to propose effective machine learning model for classification of Internet traffic applications at early stage with few packets. Nevertheless, this essential problem still needs to be studied profoundly to find out effective packet number as well as effective machine learning (ML model. In this paper, we tried to solve the above-mentioned problem. For this purpose, five Internet traffic datasets are utilized. Initially, we extract packet size of 20 packets and then mutual information analysis is carried out to find out the mutual information of each packet on n flow type. Thereafter, we execute 10 well-known machine learning algorithms using crossover classification method. Two statistical analysis tests, Friedman and Wilcoxon pairwise tests, are applied for the experimental results. Moreover, we also apply the statistical tests for classifiers to find out effective ML classifier. Our experimental results show that 13–19 packets are the effective packet numbers for 5G IM WeChat application at early stage network traffic classification. We also find out effective ML classifier, where Random Forest ML classifier is effective classifier at early stage Internet traffic classification.

Position Control of Switched Reluctance Motor Using Super Twisting Algorithm

Directory of Open Access Journals (Sweden)

Muhammad Rafiq Mufti

2016-01-01

Full Text Available The inherent problem of chattering in traditional sliding mode control is harmful for practical application of control system. This paper pays a considerable attention to a chattering-free control method, that is, higher-order sliding mode (super twisting algorithm. The design of a position controller for switched reluctance motor is presented and its stability is assured using Lyapunov stability theorem. In order to highlight the advantages of higher-order sliding mode controller (HOSMC, a classical first-order sliding mode controller (FOSMC is also applied to the same system and compared. The simulation results reflect the effectiveness of the proposed technique.

System-Level Demonstration of a Dynamically Reconfigured Burst-Mode Link Using a Nanosecond Si-Photonic Switch

DEFF Research Database (Denmark)

Forencich, Alex; Kamchevska, Valerija; Dupuis, Nicolas

2018-01-01

Using a novel FPGA-based network emulator, microsecond-scale packets with 12.5-20-Gb/s data are generated, routed through a nanosecond Si-photonic switch, and received in a fast-locking burst-mode receiver. Error-free links with <382-ns system-level switching are shown....

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

Science.gov (United States)

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.

Adaptive sampling rate control for networked systems based on statistical characteristics of packet disordering.

Science.gov (United States)

Li, Jin-Na; Er, Meng-Joo; Tan, Yen-Kheng; Yu, Hai-Bin; Zeng, Peng

2015-09-01

This paper investigates an adaptive sampling rate control scheme for networked control systems (NCSs) subject to packet disordering. The main objectives of the proposed scheme are (a) to avoid heavy packet disordering existing in communication networks and (b) to stabilize NCSs with packet disordering, transmission delay and packet loss. First, a novel sampling rate control algorithm based on statistical characteristics of disordering entropy is proposed; secondly, an augmented closed-loop NCS that consists of a plant, a sampler and a state-feedback controller is transformed into an uncertain and stochastic system, which facilitates the controller design. Then, a sufficient condition for stochastic stability in terms of Linear Matrix Inequalities (LMIs) is given. Moreover, an adaptive tracking controller is designed such that the sampling period tracks a desired sampling period, which represents a significant contribution. Finally, experimental results are given to illustrate the effectiveness and advantages of the proposed scheme. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

FAST TCP over optical burst switched networks: Modeling and stability analysis

KAUST Repository

Shihada, Basem; El-Ferik, Sami; Ho, Pin-Han

2013-01-01

congestion-control mechanism in bufferless Optical Burst Switched Networks (OBS). The paper first shows that random burst contentions are essential to stabilize the network, but cause throughput degradation in FAST TCP flows when a burst with all the packets

Modified Aggressive Packet Combining Scheme

International Nuclear Information System (INIS)

Bhunia, C.T.

2010-06-01

In this letter, a few schemes are presented to improve the performance of aggressive packet combining scheme (APC). To combat error in computer/data communication networks, ARQ (Automatic Repeat Request) techniques are used. Several modifications to improve the performance of ARQ are suggested by recent research and are found in literature. The important modifications are majority packet combining scheme (MjPC proposed by Wicker), packet combining scheme (PC proposed by Chakraborty), modified packet combining scheme (MPC proposed by Bhunia), and packet reversed packet combining (PRPC proposed by Bhunia) scheme. These modifications are appropriate for improving throughput of conventional ARQ protocols. Leung proposed an idea of APC for error control in wireless networks with the basic objective of error control in uplink wireless data network. We suggest a few modifications of APC to improve its performance in terms of higher throughput, lower delay and higher error correction capability. (author)

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

Science.gov (United States)

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.

The structure of the polynomials in preconditioned BiCG algorithms and the switching direction of preconditioned systems

OpenAIRE

Itoh, Shoji; Sugihara, Masaaki

2016-01-01

We present a theorem that defines the direction of a preconditioned system for the bi-conjugate gradient (BiCG) method, and we extend it to preconditioned bi-Lanczos-type algorithms. We show that the direction of a preconditioned system is switched by construction and by the settings of the initial shadow residual vector. We analyze and compare the polynomial structures of four preconditioned BiCG algorithms.

Revivals of Quantum Wave Packets

OpenAIRE

Bluhm, Robert; Kostelecky, Alan; Porter, James; Tudose, Bogdan

1997-01-01

We present a generic treatment of wave-packet revivals for quantum-mechanical systems. This treatment permits a classification of certain ideal revival types. For example, wave packets for a particle in a one-dimensional box are shown to exhibit perfect revivals. We also examine the revival structure of wave packets for quantum systems with energies that depend on two quantum numbers. Wave packets in these systems exhibit quantum beats in the initial motion as well as new types of long-term r...

Effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks

Science.gov (United States)

Jiang, Zhong-Yuan; Ma, Jian-Feng

Existing routing strategies such as the global dynamic routing [X. Ling, M. B. Hu, R. Jiang and Q. S. Wu, Phys. Rev. E 81, 016113 (2010)] can achieve very high traffic capacity at the cost of extremely long packet traveling delay. In many real complex networks, especially for real-time applications such as the instant communication software, extremely long packet traveling time is unacceptable. In this work, we propose to assign a finite Time-to-Live (TTL) parameter for each packet. To guarantee every packet to arrive at its destination within its TTL, we assume that a packet is retransmitted by its source once its TTL expires. We employ source routing mechanisms in the traffic model to avoid the routing-flaps induced by the global dynamic routing. We compose extensive simulations to verify our proposed mechanisms. With small TTL, the effects of packet retransmission on network traffic capacity are obvious, and the phase transition from flow free state to congested state occurs. For the purpose of reducing the computation frequency of the routing table, we employ a computing cycle Tc within which the routing table is recomputed once. The simulation results show that the traffic capacity decreases with increasing Tc. Our work provides a good insight into the understanding of effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks.

Effect of latency and packet loss on achievable bandwidth

CERN Multimedia

CERN. Geneva

2015-01-01

Following an incident with a slow database replication between CERN's data centers, we discovered that even a very low rate packet loss in the network can induce significant penalties to long distance single stream TCP transfers. We explore the behaviour of multiple congestion control algorithms in a controlled loss environment in order to understand what is the achievable throughput of TCP data transfers between the Meyrin and Wigner data centres.

Impact of Bimodal Traffic on Latency in Optical Burst Switching Networks

Directory of Open Access Journals (Sweden)

Yuhua Chen

2008-01-01

Full Text Available This paper analyzes the impact of bimodal traffic composition on latency in optical burst switching networks. In particular, it studies the performance degradation to short-length packets caused by longer packets, both of which are part of a heterogeneous traffic model. The paper defines a customer satisfaction index for each of the classes of traffic, and a composite satisfaction index. The impact of higher overall utilization of the network as well as that of the ratio of the traffic mix on each of the customer satisfaction indices is specifically addressed.

Packet Tracer network simulator

CERN Document Server

Jesin, A

2014-01-01

A practical, fast-paced guide that gives you all the information you need to successfully create networks and simulate them using Packet Tracer.Packet Tracer Network Simulator is aimed at students, instructors, and network administrators who wish to use this simulator to learn how to perform networking instead of investing in expensive, specialized hardware. This book assumes that you have a good amount of Cisco networking knowledge, and it will focus more on Packet Tracer rather than networking.

Nondispersive Wave Packets.

Science.gov (United States)

Shaarawi, Amr Mohamed

In this work, nondispersive wavepacket solutions to linear partial differential equations are investigated. These solutions are characterized by infinite energy content; otherwise they are continuous, nonsingular and propagate in free space without spreading out. Examples of such solutions are Berry and Balazs' Airy packet, MacKinnon's wave packet and Brittingham's Focus Wave Mode (FWM). It is demonstrated in this thesis that the infinite energy content is not a basic problem per se and that it can be dealt with in two distinct ways. First these wave packets can be used as bases to construct highly localized, slowly decaying, time-limited pulsed solutions. In the case of the FWMs, this path leads to the formulation of the bidirectional representation, a technique that provides the most natural basis for synthesizing Brittingham-like solutions. This representation is used to derive new exact solutions to the 3-D scalar wave equation. It is also applied to problems involving boundaries, in particular to the propagation of a localized pulse in a infinite acoustic waveguide and to the launchability of such a pulse from the opening of a semi-infinite waveguide. The second approach in dealing with the infinite energy content utilizes the bump-like structure of nondispersive solutions. With an appropriate choice of parameters, these bump fields have very large amplitudes around the centers, in comparison to their tails. In particular, the FWM solutions are used to model massless particles and are capable of providing an interesting interpretation to the results of Young's two slit experiment and to the wave-particle duality of light. The bidirectional representation provides, also, a systematic way of deriving packet solutions to the Klein-Gordon, the Schrodinger and the Dirac equations. Nondispersive solutions of the former two equations are compared to previously derived ones, e.g., the Airy packet and MacKinnon's wave packet.

Scattering of accelerated wave packets

Science.gov (United States)

Longhi, S.; Horsley, S. A. R.; Della Valle, G.

2018-03-01

Wave-packet scattering from a stationary potential is significantly modified when the wave packet is subject to an external time-dependent force during the interaction. In the semiclassical limit, wave-packet motion is simply described by Newtonian equations, and the external force can, for example, cancel the potential force, making a potential barrier transparent. Here we consider wave-packet scattering from reflectionless potentials, where in general the potential becomes reflective when probed by an accelerated wave packet. In the particular case of the recently introduced class of complex Kramers-Kronig potentials we show that a broad class of time-dependent forces can be applied without inducing any scattering, while there is a breakdown of the reflectionless property when there is a broadband distribution of initial particle momentum, involving both positive and negative components.

Performance of the L3 second level trigger implemented for the LEP II with the SGS Thomson C104 packet switch

International Nuclear Information System (INIS)

Blaising, J.J.; Chollet-Le Flour, F.; Cai, X.

1998-01-01

The L3 experiment is one of the four experiments collecting data at LEP. For the LEP phase 2, the second level trigger has been upgraded to a network of 28 ST T9000 transputers and 2 ST C104 asynchronous packet switches interconnected by IEEE1355 links. It collects trigger data at each LEP crossing (22 micros), builds-up the trigger data block, processes it and rejects online the background events in a few milliseconds. The L3 data acquisition has been running with this system since July 1995. In the data-taking environment and for different hardware and software implementations, the event building throughput rate has been measured. A bandwidth of 5.9 Mbytes per second per link has been measured in a configuration with 12 sources and one processing unit connected with 2 links. The expected global throughput of 70 Mbytes per second has been measured in a farm of 6 processing units. While varying the number of sources and destinations, the authors didn't observe any significant bandwidth loss. Nevertheless performance relies strongly on some software implementation choices, which are presented and discussed

Performance analysis of signaling protocols on OBS switches

Science.gov (United States)

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.

Modelling Packet Departure Times using a Known PDF

Directory of Open Access Journals (Sweden)

Stanislav Klucik

2014-01-01

Full Text Available This paper deals with IPTV traffic source modelling and describes a packet generator based on a known probability density function which is measured and formed from a histogram. Histogram based probability density functions destroy an amount of information, because classes used to form the histogram often cover significantly more events than one. In this work, we propose an algorithm to generate far more output states of random variable X than the input probability distribution function is made from. In this generator is assumed that all IPTV packets of the same video stream are the same length. Therefore, only packet times are generated. These times are generated using the measured normalized histogram that is converted to a cumulative distribution function which acts as a finite number of states that can be addressed. To address these states we use an ON/OFF model that is driven by an uniform random number generator in (0, 1. When a state is chosen then the resulting value is equal to a histogram class. To raise the number of possible output states of the random variable X, we propose to use an uniform random number generator that generates numbers within the range of the chosen histogram class. This second uniform random number generator assures that the number of output states is far more larger than the number of histogram classes.

Deep Packet/Flow Analysis using GPUs

Energy Technology Data Exchange (ETDEWEB)

Gong, Qian [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States); Wu, Wenji [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States); DeMar, Phil [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States)

2017-11-12

Deep packet inspection (DPI) faces severe performance challenges in high-speed networks (40/100 GE) as it requires a large amount of raw computing power and high I/O throughputs. Recently, researchers have tentatively used GPUs to address the above issues and boost the performance of DPI. Typically, DPI applications involve highly complex operations in both per-packet and per-flow data level, often in real-time. The parallel architecture of GPUs fits exceptionally well for per-packet network traffic processing. However, for stateful network protocols such as TCP, their data stream need to be reconstructed in a per-flow level to deliver a consistent content analysis. Since the flow-centric operations are naturally antiparallel and often require large memory space for buffering out-of-sequence packets, they can be problematic for GPUs, whose memory is normally limited to several gigabytes. In this work, we present a highly efficient GPU-based deep packet/flow analysis framework. The proposed design includes a purely GPU-implemented flow tracking and TCP stream reassembly. Instead of buffering and waiting for TCP packets to become in sequence, our framework process the packets in batch and uses a deterministic finite automaton (DFA) with prefix-/suffix- tree method to detect patterns across out-of-sequence packets that happen to be located in different batches. In conclusion, evaluation shows that our code can reassemble and forward tens of millions of packets per second and conduct a stateful signature-based deep packet inspection at 55 Gbit/s using an NVIDIA K40 GPU.

All-optical Data Vortex node using an MZI-SOA switch array

DEFF Research Database (Denmark)

Jung, H.D.; Tafur Monroy, Idelfonso; Koonen, A.M.J.

2007-01-01

We propose and demonstrate a new structure of a Data Vortex switch node for all-optical routing of wavelength-division-multiplexing (WDM) 10-Gb/s optical packets. The proposed node consists of two Mach-Zehnder interferometers with integrated semiconductor optical amplifier: an optical AND gate...

Path Diversity Media Streaming over Best Effort Packet Switched Networks

Science.gov (United States)

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

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

Science.gov (United States)

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.

Multistage switching hardware and software implementations for student experiment purpose

Science.gov (United States)

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.

Data Aggregation and Packet Bundling of Uplink Small Packets for Monitoring Applications in LTE

DEFF Research Database (Denmark)

Kim, Dong Min; Sørensen, René Brandborg; Mahmood, Kashif

2017-01-01

topic. In this article we analyze the deployment scenarios in which aggregators can perform cellular access on behalf of multiple MTC devices. We study the effect of packet bundling at the aggregator, which alleviates overhead and resource waste when sending small packets. The aggregators give rise...... of aggregators and packet bundle size. Our results show that, in general, data aggregation can benefit the uplink massive MTC in LTE by reducing the signaling overhead....

Architecture and evaluation of software-defined optical switching matrix for hybrid data centers

DEFF Research Database (Denmark)

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

2016-01-01

A software architecture is proposed for hybrid packet/optical data centers employing programmable NETCONF-enabled optical switching matrix, and a performance evaluation is presented comparing hybrid and electrical-only architectures for elephant flows under different traffic patterns. Network...

A packet-switched network for data readout from the LHC inner detector

International Nuclear Information System (INIS)

Ostby, J.M.; Sorasen, O.

1994-01-01

This paper presents a network which can be used for data fusion in the planned LHC (Large Hadron Collider) ATLAS experiment at CERN. The network named SWIPP (SWitched Interconnection of Parallel Processors), is built of 16 x 16 star switches and protocol engines connected by pairs of optical fibers. Each channel is designed to carry up to 1 Gbps in each direction. The paper will give a brief introduction to SWIPP principles and ASIC implementation. Some of the advantages offered by the network will be mentioned

Technology Corner: Internet Packet Sniffers

Directory of Open Access Journals (Sweden)

Nick Flor

2011-03-01

Full Text Available A packet sniffer is a piece of software that allows a person to eavesdrop on computer communications over the internet.  A packet sniffer can be used as a diagnostic tool by network administrators or as a spying tool by hackers who can use it to steal passwords and other private information from computer users.  Whether you are a network administrator or information assurance specialist, it helps to have a detailed understanding of how packet sniffers work.  And one of the best ways to acquire such an understanding is to build and modify an actual packet sniffer.

Quantum wave packet revivals

International Nuclear Information System (INIS)

Robinett, R.W.

2004-01-01

The numerical prediction, theoretical analysis, and experimental verification of the phenomenon of wave packet revivals in quantum systems has flourished over the last decade and a half. Quantum revivals are characterized by initially localized quantum states which have a short-term, quasi-classical time evolution, which then can spread significantly over several orbits, only to reform later in the form of a quantum revival in which the spreading reverses itself, the wave packet relocalizes, and the semi-classical periodicity is once again evident. Relocalization of the initial wave packet into a number of smaller copies of the initial packet ('minipackets' or 'clones') is also possible, giving rise to fractional revivals. Systems exhibiting such behavior are a fundamental realization of time-dependent interference phenomena for bound states with quantized energies in quantum mechanics and are therefore of wide interest in the physics and chemistry communities. We review the theoretical machinery of quantum wave packet construction leading to the existence of revivals and fractional revivals, in systems with one (or more) quantum number(s), as well as discussing how information on the classical period and revival time is encoded in the energy eigenvalue spectrum. We discuss a number of one-dimensional model systems which exhibit revival behavior, including the infinite well, the quantum bouncer, and others, as well as several two-dimensional integrable quantum billiard systems. Finally, we briefly review the experimental evidence for wave packet revivals in atomic, molecular, and other systems, and related revival phenomena in condensed matter and optical systems

End to end adaptive congestion control in TCP/IP networks

CERN Document Server

Houmkozlis, Christos N

2012-01-01

This book provides an adaptive control theory perspective on designing congestion controls for packet-switching networks. Relevant to a wide range of disciplines and industries, including the music industry, computers, image trading, and virtual groups, the text extensively discusses source oriented, or end to end, congestion control algorithms. The book empowers readers with clear understanding of the characteristics of packet-switching networks and their effects on system stability and performance. It provides schemes capable of controlling congestion and fairness and presents real-world app

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

Science.gov (United States)

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.

Optimal algorithm switching for the estimation of systole period from cardiac microacceleration signals (SonR).

Science.gov (United States)

Giorgis, L; Frogerais, P; Amblard, A; Donal, E; Mabo, P; Senhadji, L; Hernández, A I

2012-11-01

Previous studies have shown that cardiac microacceleration signals, recorded either cutaneously, or embedded into the tip of an endocardial pacing lead, provide meaningful information to characterize the cardiac mechanical function. This information may be useful to personalize and optimize the cardiac resynchronization therapy, delivered by a biventricular pacemaker, for patients suffering from chronic heart failure (HF). This paper focuses on the improvement of a previously proposed method for the estimation of the systole period from a signal acquired with a cardiac microaccelerometer (SonR sensor, Sorin CRM SAS, France). We propose an optimal algorithm switching approach, to dynamically select the best configuration of the estimation method, as a function of different control variables, such as the signal-to-noise ratio or heart rate. This method was evaluated on a database containing recordings from 31 patients suffering from chronic HF and implanted with a biventricular pacemaker, for which various cardiac pacing configurations were tested. Ultrasound measurements of the systole period were used as a reference and the improved method was compared with the original estimator. A reduction of 11% on the absolute estimation error was obtained for the systole period with the proposed algorithm switching approach.

Switching neuronal state: optimal stimuli revealed using a stochastically-seeded gradient algorithm.

Science.gov (United States)

Chang, Joshua; Paydarfar, David

2014-12-01

Inducing a switch in neuronal state using energy optimal stimuli is relevant to a variety of problems in neuroscience. Analytical techniques from optimal control theory can identify such stimuli; however, solutions to the optimization problem using indirect variational approaches can be elusive in models that describe neuronal behavior. Here we develop and apply a direct gradient-based optimization algorithm to find stimulus waveforms that elicit a change in neuronal state while minimizing energy usage. We analyze standard models of neuronal behavior, the Hodgkin-Huxley and FitzHugh-Nagumo models, to show that the gradient-based algorithm: (1) enables automated exploration of a wide solution space, using stochastically generated initial waveforms that converge to multiple locally optimal solutions; and (2) finds optimal stimulus waveforms that achieve a physiological outcome condition, without a priori knowledge of the optimal terminal condition of all state variables. Analysis of biological systems using stochastically-seeded gradient methods can reveal salient dynamical mechanisms underlying the optimal control of system behavior. The gradient algorithm may also have practical applications in future work, for example, finding energy optimal waveforms for therapeutic neural stimulation that minimizes power usage and diminishes off-target effects and damage to neighboring tissue.

A Novel Approach to Detect Network Attacks Using G-HMM-Based Temporal Relations between Internet Protocol Packets

Directory of Open Access Journals (Sweden)

Han Kyusuk

2011-01-01

Full Text Available This paper introduces novel attack detection approaches on mobile and wireless device security and network which consider temporal relations between internet packets. In this paper we first present a field selection technique using a Genetic Algorithm and generate a Packet-based Mining Association Rule from an original Mining Association Rule for Support Vector Machine in mobile and wireless network environment. Through the preprocessing with PMAR, SVM inputs can account for time variation between packets in mobile and wireless network. Third, we present Gaussian observation Hidden Markov Model to exploit the hidden relationships between packets based on probabilistic estimation. In our G-HMM approach, we also apply G-HMM feature reduction for better initialization. We demonstrate the usefulness of our SVM and G-HMM approaches with GA on MIT Lincoln Lab datasets and a live dataset that we captured on a real mobile and wireless network. Moreover, experimental results are verified by -fold cross-validation test.

Three-dimensional electromagnetic strong turbulence. II. Wave packet collapse and structure of wave packets during strong turbulence

International Nuclear Information System (INIS)

Graham, D. B.; Robinson, P. A.; Cairns, Iver H.; Skjaeraasen, O.

2011-01-01

Large-scale simulations of wave packet collapse are performed by numerically solving the three-dimensional (3D) electromagnetic Zakharov equations, focusing on individual wave packet collapses and on wave packets that form in continuously driven strong turbulence. The collapse threshold is shown to decrease as the electron thermal speed ν e /c increases and as the temperature ratio T i /T e of ions to electrons decreases. Energy lost during wave packet collapse and dissipation is shown to depend on ν e /c. The dynamics of density perturbations after collapse are studied in 3D electromagnetic strong turbulence for a range of T i /T e . The structures of the Langmuir, transverse, and total electric field components of wave packets during strong turbulence are investigated over a range of ν e /c. For ν e /c e /c > or approx. 0.17, transverse modes become trapped in density wells and contribute significantly to the structure of the total electric field. At all ν e /c, the Langmuir energy density contours of wave packets are predominantly oblate (pancake shaped). The transverse energy density contours of wave packets are predominantly prolate (sausage shaped), with the major axis being perpendicular to the major axes of the Langmuir component. This results in the wave packet becoming more nearly spherical as ν e /c increases, and in turn generates more spherical density wells during collapse. The results obtained are compared with previous 3D electrostatic results and 2D electromagnetic results.

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

Science.gov (United States)

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.

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

Energy Technology Data Exchange (ETDEWEB)

Tarek Haddadin; Stephen Andrew Laraway; Arslan Majid; Taylor Sibbett; Daryl Leon Wasden; Brandon F Lo; Lloyd Landon; David Couch; Hussein Moradi; Behrouz Farhang-Boroujeny

2016-04-01

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-cellular 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.

On the theory of wave packets

International Nuclear Information System (INIS)

Naumov, D.V.

2013-01-01

In this paper we discuss some aspects of the theory of wave packets. We consider a popular non-covariant Gaussian model used in various applications and show that it predicts too slow a longitudinal dispersion rate for relativistic particles. We revise this approach by considering a covariant model of Gaussian wave packets, and examine our results by inspecting a wave packet of an arbitrary form. A general formula for the time dependence of the dispersion of a wave packet of an arbitrary form is found. Finally, we give a transparent interpretation of the disappearance of the wave function over time due to the dispersion - a feature often considered undesirable, but which is unavoidable for wave packets. We find, starting with simple examples, proceeding with their generalizations and finally by considering the continuity equation, that the integral over time of both the flux and probability densities is asymptotically proportional to the factor 1/|x| 2 in the rest frame of the wave packet, just as in the case of an ensemble of classical particles

Optimal control of switching time in switched stochastic systems with multi-switching times and different costs

Science.gov (United States)

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.

High Performance Gigabit Ethernet Switches for DAQ Systems

CERN Document Server

Barczyk, Artur

2005-01-01

Commercially available high performance Gigabit Ethernet (GbE) switches are optimized mostly for Internet and standard LAN application traffic. DAQ systems on the other hand usually make use of very specific traffic patterns, with e.g. deterministic arrival times. Industry's accepted loss-less limit of 99.999% may be still unacceptably high for DAQ purposes, as e.g. in the case of the LHCb readout system. In addition, even switches passing this criteria under random traffic can show significantly higher loss rates if subject to our traffic pattern, mainly due to buffer memory limitations. We have evaluated the performance of several switches, ranging from "pizza-box" devices with 24 or 48 ports up to chassis based core switches in a test-bed capable to emulate realistic traffic patterns as expected in the readout system of our experiment. The results obtained in our tests have been used to refine and parametrize our packet level simulation of the complete LHCb readout network. In this paper we report on the...

Effective ANT based Routing Algorithm for Data Replication in MANETs

Directory of Open Access Journals (Sweden)

N.J. Nithya Nandhini

2013-12-01

Full Text Available In mobile ad hoc network, the nodes often move and keep on change its topology. Data packets can be forwarded from one node to another on demand. To increase the data accessibility data are replicated at nodes and made as sharable to other nodes. Assuming that all mobile host cooperative to share their memory and allow forwarding the data packets. But in reality, all nodes do not share the resources for the benefits of others. These nodes may act selfishly to share memory and to forward the data packets. This paper focuses on selfishness of mobile nodes in replica allocation and routing protocol based on Ant colony algorithm to improve the efficiency. The Ant colony algorithm is used to reduce the overhead in the mobile network, so that it is more efficient to access the data than with other routing protocols. This result shows the efficiency of ant based routing algorithm in the replication allocation.

Improved binary dragonfly optimization algorithm and wavelet packet based non-linear features for infant cry classification.

Science.gov (United States)

Hariharan, M; Sindhu, R; Vijean, Vikneswaran; Yazid, Haniza; Nadarajaw, Thiyagar; Yaacob, Sazali; Polat, Kemal

2018-03-01

Infant cry signal carries several levels of information about the reason for crying (hunger, pain, sleepiness and discomfort) or the pathological status (asphyxia, deaf, jaundice, premature condition and autism, etc.) of an infant and therefore suited for early diagnosis. In this work, combination of wavelet packet based features and Improved Binary Dragonfly Optimization based feature selection method was proposed to classify the different types of infant cry signals. Cry signals from 2 different databases were utilized. First database contains 507 cry samples of normal (N), 340 cry samples of asphyxia (A), 879 cry samples of deaf (D), 350 cry samples of hungry (H) and 192 cry samples of pain (P). Second database contains 513 cry samples of jaundice (J), 531 samples of premature (Prem) and 45 samples of normal (N). Wavelet packet transform based energy and non-linear entropies (496 features), Linear Predictive Coding (LPC) based cepstral features (56 features), Mel-frequency Cepstral Coefficients (MFCCs) were extracted (16 features). The combined feature set consists of 568 features. To overcome the curse of dimensionality issue, improved binary dragonfly optimization algorithm (IBDFO) was proposed to select the most salient attributes or features. Finally, Extreme Learning Machine (ELM) kernel classifier was used to classify the different types of infant cry signals using all the features and highly informative features as well. Several experiments of two-class and multi-class classification of cry signals were conducted. In binary or two-class experiments, maximum accuracy of 90.18% for H Vs P, 100% for A Vs N, 100% for D Vs N and 97.61% J Vs Prem was achieved using the features selected (only 204 features out of 568) by IBDFO. For the classification of multiple cry signals (multi-class problem), the selected features could differentiate between three classes (N, A & D) with the accuracy of 100% and seven classes with the accuracy of 97.62%. The experimental

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

Science.gov (United States)

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.

Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit

DEFF Research Database (Denmark)

Nagahara, Masaaki; Quevedo, Daniel; Østergaard, Jan

2012-01-01

We study packetized predictive control, known to be robust against packet dropouts in networked systems. To obtain sparse packets for rate-limited networks, we design control packets via an ℓ0 optimization, which can be eectively solved by orthogonal matching pursuit. Our formulation ensures...

Research on the Diagnosis of Rotor Coupling Fault Based on Wavelet Packet and Local Fisher Discriminant

Directory of Open Access Journals (Sweden)

Guangbin Wang

2014-09-01

Full Text Available this article is for the coupling fault diagnosis of rotor system, and does in-depth analysis of the rotor unbalance and misalignment, and the fault formed by the coupling of these two. Through research, Rotor Coupling was found filled with rich features. In this paper, Wavelet packet de- noising ideas being introduced to the local Fisher discriminant analysis (LFDA, a new method of fault diagnosis based on Wavelet Packet and Local Fisher Discriminant is proposed. The technology of information fusion is applied to the data processing with coupling faults. By comparing and analyzing the algorithms effect of LE, LPP, FDA, LFDA and IOLFA through experiment, it shows that LE and LPP are unable to identify the fault, while FDA, LFDA has better identification, and Wavelet Packet and Local Fisher discriminant has the best effect.

Printed Persian Subword Recognition Using Wavelet Packet Descriptors

Directory of Open Access Journals (Sweden)

Samira Nasrollahi

2013-01-01

Full Text Available In this paper, we present a new approach to offline OCR (optical character recognition for printed Persian subwords using wavelet packet transform. The proposed algorithm is used to extract font invariant and size invariant features from 87804 subwords of 4 fonts and 3 sizes. The feature vectors are compressed using PCA. The obtained feature vectors yield a pictorial dictionary for which an entry is the mean of each group that consists of the same subword with 4 fonts in 3 sizes. The sets of these features are congregated by combining them with the dot features for the recognition of printed Persian subwords. To evaluate the feature extraction results, this algorithm was tested on a set of 2000 subwords in printed Persian text documents. An encouraging recognition rate of 97.9% is got at subword level recognition.

Ising model for packet routing control

International Nuclear Information System (INIS)

Horiguchi, Tsuyoshi; Takahashi, Hideyuki; Hayashi, Keisuke; Yamaguchi, Chiaki

2004-01-01

For packet routing control in computer networks, we propose an Ising model which is defined in order to express competition among a queue length and a distance from a node with a packet to its destination node. By introducing a dynamics for a mean-field value of an Ising spin, we show by computer simulations that effective control of packet routing through priority links is possible

Design and implementation considerations of a MSAT packet data network

Science.gov (United States)

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.

Comparison of Ring-Buffer-Based Packet Capture Solutions

Energy Technology Data Exchange (ETDEWEB)

Barker, Steven Andrew [Sandia National Lab. (SNL-CA), Livermore, CA (United States)

2015-10-01

Traditional packet-capture solutions using commodity hardware incur a large amount of overhead as packets are copied multiple times by the operating system. This overhead slows sensor systems to a point where they are unable to keep up with high bandwidth traffic, resulting in dropped packets. Incomplete packet capture files hinder network monitoring and incident response efforts. While costly commercial hardware exists to capture high bandwidth traffic, several software-based approaches exist to improve packet capture performance using commodity hardware.

Identification method of gas-liquid two-phase flow regime based on image wavelet packet information entropy and genetic neural network

International Nuclear Information System (INIS)

Zhou Yunlong; Chen Fei; Sun Bin

2008-01-01

Based on the characteristic that wavelet packet transform image can be decomposed by different scales, a flow regime identification method based on image wavelet packet information entropy feature and genetic neural network was proposed. Gas-liquid two-phase flow images were captured by digital high speed video systems in horizontal pipe. The information entropy feature from transformation coefficients were extracted using image processing techniques and multi-resolution analysis. The genetic neural network was trained using those eigenvectors, which was reduced by the principal component analysis, as flow regime samples, and the flow regime intelligent identification was realized. The test result showed that image wavelet packet information entropy feature could excellently reflect the difference between seven typical flow regimes, and the genetic neural network with genetic algorithm and BP algorithm merits were with the characteristics of fast convergence for simulation and avoidance of local minimum. The recognition possibility of the network could reach up to about 100%, and a new and effective method was presented for on-line flow regime. (authors)

Multifocal ERG wavelet packet decomposition applied to glaucoma diagnosis

Directory of Open Access Journals (Sweden)

Rodríguez-Ascariz José M

2011-05-01

Full Text Available Abstract Background Glaucoma is the second-leading cause of blindness worldwide and early diagnosis is essential to its treatment. Current clinical methods based on multifocal electroretinography (mfERG essentially involve measurement of amplitudes and latencies and assume standard signal morphology. This paper presents a new method based on wavelet packet analysis of global-flash multifocal electroretinogram signals. Methods This study comprised twenty-five patients diagnosed with OAG and twenty-five control subjects. Their mfERG recordings data were used to develop the algorithm method based on wavelet packet analysis. By reconstructing the third wavelet packet contained in the fourth decomposition level (ADAA4 of the mfERG recording, it is possible to obtain a signal from which to extract a marker in the 60-80 ms time interval. Results The marker found comprises oscillatory potentials with a negative-slope basal line in the case of glaucomatous recordings and a positive-slope basal line in the case of normal signals. Application of the optimal threshold calculated in the validation cases showed that the technique proposed achieved a sensitivity of 0.81 and validation specificity of 0.73. Conclusions This new method based on mfERG analysis may be reliable enough to detect functional deficits that are not apparent using current automated perimetry tests. As new stimulation and analysis protocols develop, mfERG has the potential to become a useful tool in early detection of glaucoma-related functional deficits.

Trade Related Reading Packets for Disabled Readers.

Science.gov (United States)

Davis, Beverly; Woodruff, Nancy S.

Six trade-related reading packets for disabled readers are provided for these trades: assemblers, baking, building maintenance, data entry, interior landscaping, and warehousing. Each packet stresses from 9 to 14 skills. Those skills common to most packets include context clues, fact or opinion, details, following directions, main idea,…

Time evolution of wave packets on nanostructures

International Nuclear Information System (INIS)

Prunele, E de

2005-01-01

Time evolution of wave packets on nanostructures is studied on the basis of a three-dimensional solvable model with singular interactions (de Prunele 1997 J. Phys. A: Math. Gen. 30 7831). In particular, methods and tools are provided to determine time independent upper bounds for the overlap of the normalized time-dependent wave packet with the time independent normalized wave packet concentrated at an arbitrarily chosen vertex of the nanosystem. The set of upper bounds referring to all initial positions of the wave packet and all overlaps are summarized in a matrix. The analytical formulation allows a detailed study for arbitrary geometrical configurations. Time evolution on truncated quasicrystalline systems has been found to be site selective, depending on the position of the initial wave packet

Dynamics of quantum wave packets

International Nuclear Information System (INIS)

Gosnell, T.R.; Taylor, A.J.; Rodriguez, G.; Clement, T.S.

1998-01-01

This is the final report of a three-year, Laboratory Directed Research and Development (LDRD) project at the Los Alamos National Laboratory (LANL). The objective of this project was to develop ultrafast laser techniques for the creation and measurement of quantum vibrational wave packets in gas phase diatomic molecules. Moreover, the authors sought to manipulate the constitution of these wave packets in terms of harmonic-oscillator basis wavefunctions by manipulating the time-dependent amplitude and phase of the incident ultrashort laser pulse. They specifically investigated gaseous diatomic potassium (K 2 ), and discovered variations in the shape of the wave packets as a result of changing the linear chirp in the ultrashort preparation pulse. In particular, they found evidence for wave-packet compression for a specific degree of chirp. Important ancillary results include development of new techniques for denoising and deconvolution of femtosecond time traces and techniques for diagnosing the phase and amplitude of the electric field of femtosecond laser pulses

An effective implementation scheme of just-in-time protocol for optical burst switching networks

Science.gov (United States)

Wu, Guiling; Li, Xinwan; Chen, Jian-Ping; Wang, Hui

2005-02-01

Optical burst switching (OBS) has been emerging as a promising technology that can effectively support the next generation IP-oriented transportation networks. JIT signaling protocol for OBS is relatively simple and easy to be implemented by hardware. This paper presented an effective scheme to implement the JIT protocol, which not only can effectively implement reservation and release of optical channels based on JIT, but also can process the failure of channel reservation and release due to loss of burst control packets. The scheme includes: (1) a BHP (burst head packet) path table is designed and built at each OBS node. It is used to guarantee the corresponding burst control packet, i.e. BHP, BEP (burst end packet) and BEP_ACK (BEP acknowledgement), to be transmitted in the same path. (2) The timed retransmission of BEP and the reversed deletion of the item in BHP path tables triggered by the corresponding BEP_ACK are combined to solve the problems caused by the loss of the signaling messages in channel reservation and release process. (3) Burst head packets and BEP_ACK are transmitted using "best-effort" method. Related signaling messages and their formats for the proposed scheme are also given.

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

Science.gov (United States)

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.

Spreading of a relativistic wave packet

International Nuclear Information System (INIS)

Almeida, C.; Jabs, A.

1983-01-01

A simple general proof that the spreading velocity of a relativistic free wave packet of the Broglie waves is limited is presented. For a wide class of packets it is confirmed that the limit is the velocity of light, and it is shown how this limit is approached when the width Δp of the wave packet in momentum space tends to infinity and the minimum width σ(t=o) in ordinary space tends to zero. (Author) [pt

High Angular Momentum Rydberg Wave Packets

Science.gov (United States)

Wyker, Brendan

2011-12-01

High angular momentum Rydberg wave packets are studied. Application of carefully tailored electric fields to low angular momentum, high- n (n ˜ 300) Rydberg atoms creates coherent superpositions of Stark states with near extreme values of angular momentum, ℓ. Wave packet components orbit the parent nucleus at rates that depend on their energy, leading to periods of localization and delocalization as the components come into and go out of phase with each other. Monitoring survival probability signals in the presence of position dependent probing leads to observation of characteristic oscillations based on the composition of the wave packet. The discrete nature of electron energy levels is observed through the measurement of quantum revivals in the wave packet localization signal. Time-domain spectroscopy of these signals allows determination of both the population and phase of individual superposition components. Precise manipulation of wave packets is achieved through further application of pulsed electric fields. Decoherence effects due to background gas collisions and electrical noise are also detailed. Quantized classical trajectory Monte-Carlo simulations are introduced and agree remarkably well with experimental results.

TCP Packet Trace Analysis. M.S. Thesis

Science.gov (United States)

Shepard, Timothy J.

1991-01-01

Examination of a trace of packets collected from the network is often the only method available for diagnosing protocol performance problems in computer networks. This thesis explores the use of packet traces to diagnose performance problems of the transport protocol TCP. Unfortunately, manual examination of these traces can be so tedious that effective analysis is not possible. The primary contribution of this thesis is a graphical method of displaying the packet trace which greatly reduce, the tediousness of examining a packet trace. The graphical method is demonstrated by the examination of some packet traces of typical TCP connections. The performance of two different implementations of TCP sending data across a particular network path is compared. Traces many thousands of packets long are used to demonstrate how effectively the graphical method simplifies examination of long complicated traces. In the comparison of the two TCP implementations, the burstiness of the TCP transmitter appeared to be related to the achieved throughput. A method of quantifying this burstiness is presented and its possible relevance to understanding the performance of TCP is discussed.

Intelligent Packet Shaper to Avoid Network Congestion for Improved Streaming Video Quality at Clients

DEFF Research Database (Denmark)

Kaul, Manohar; Khosla, Rajiv; Mitsukura, Y

2003-01-01

of this intelligent traffic-shaping algorithm on the underlying network real time packet traffic and the eradication of unwanted abruption in the streaming video qualiy. This paper concluded from the end results of the simulation that neural networks are a very superior means of modeling real-time traffic......This paper proposes a traffic shaping algorithm based on neural networks, which adapts to a network over which streaming video is being transmitted. The purpose of this intelligent shaper is to eradicate all traffic congestion and improve the end-user's video quality. It possesses the capability...

Certain problems concerning wavelets and wavelets packets

Energy Technology Data Exchange (ETDEWEB)

Siddiqi, A H

1995-09-01

Wavelets is the outcome of the synthesis of ideas that have emerged in different branches of science and technology, mainly in the last decade. The concept of wavelet packets, which are superpositions of wavelets, has been introduced a couple of years ago. They form bases which retain many properties of wavelets like orthogonality, smoothness and localization. The Walsh orthornomal system is a special case of wavelet packet. The wavelet packets provide at our disposal a library of orthonormal bases, each of which can be used to analyze a given signal of finite energy. The optimal choice is decided by the entropy criterion. In the present paper we discuss results concerning convergence, coefficients, and approximation of wavelet packets series in general and wavelets series in particular. Wavelet packet techniques for solutions of differential equations are also mentioned. (author). 117 refs.

Certain problems concerning wavelets and wavelets packets

International Nuclear Information System (INIS)

Siddiqi, A.H.

1995-09-01

Wavelets is the outcome of the synthesis of ideas that have emerged in different branches of science and technology, mainly in the last decade. The concept of wavelet packets, which are superpositions of wavelets, has been introduced a couple of years ago. They form bases which retain many properties of wavelets like orthogonality, smoothness and localization. The Walsh orthornomal system is a special case of wavelet packet. The wavelet packets provide at our disposal a library of orthonormal bases, each of which can be used to analyze a given signal of finite energy. The optimal choice is decided by the entropy criterion. In the present paper we discuss results concerning convergence, coefficients, and approximation of wavelet packets series in general and wavelets series in particular. Wavelet packet techniques for solutions of differential equations are also mentioned. (author). 117 refs

Tropical Animal Tour Packet. Metro.

Science.gov (United States)

Metro Washington Park Zoo, Portland, OR. Educational Services Div.

This packet is designed to assist teachers in creating a tropical animals lesson plan that centers around a visit to the zoo. A teacher packet is divided into eight parts: (1) goals and objectives; (2) what to expect at the zoo; (3) student activities (preparatory activities, on-site activities, and follow-up activities); (4) background…

Comparison of new hybrid FEEMD-MLP, FEEMD-ANFIS, Wavelet Packet-MLP and Wavelet Packet-ANFIS for wind speed predictions

International Nuclear Information System (INIS)

Liu, Hui; Tian, Hong-qi; Li, Yan-fei

2015-01-01

Highlights: • Four algorithms [EMD/FEEMD/WD/WPD] are proposed for the wind speed decomposition. • Two new hybrid forecasting algorithms [FEEMD-MLP/ANFIS] are presented. • The contributions of the FEEMD/WPD algorithms are both significant. • The MLP has better forecasting performance than the ANFIS in these cases. • All the proposed hybrid algorithms are suitable for the wind speed predictions. - Abstract: The technology of wind speed prediction is important to guarantee the safety of wind power utilization. Compared to the single algorithms, the hybrid ones always have better performance in the wind speed predictions. In this paper, three most important decomposing algorithms [Wavelet Decomposition – WD/Wavelet Packet Decomposition – WPD/Empirical Mode Decomposition – EMD] and a latest decomposing algorithm [Fast Ensemble Empirical Mode Decomposition – FEEMD] are all adopted to realize the wind speed high-precision predictions with two representative networks [MLP Neural Network/ANFIS Neural Network]. Based on the hybrid forecasting framework, two new wind speed forecasting methods [FEEMD-MLP and FEEMD-ANFIS] are proposed. Additionally, a series of performance comparison is provided, which includes EMD-MLP, FEEMD-MLP, EDM-ANFIS, FEEMD-ANFIS, WD-MLP, WD-ANFIS, WPD-MLP and WPD-ANFIS. The aim of the study is to investigate the decomposing and forecasting performance of the different hybrid models. Two experimental results show that: (1) Due to the inclusion of the decomposing algorithms, the hybrid ANN algorithms have better performance than their corresponding single ANN algorithms; (2) the proposed new FEEMD-MLP hybrid model has the best performance in the three-step predictions while the WPD-MLP hybrid model has the best performance in the one-step predictions; (3) among the decomposing algorithms, the FEEMD and WPD have better performance than the EMD and WD, respectively; (4) in the forecasting neural networks, the MLP has better performance

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

Science.gov (United States)

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.

Vector Network Coding Algorithms

OpenAIRE

Ebrahimi, Javad; Fragouli, Christina

2010-01-01

We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding c in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector coding, our algori...

Random access with adaptive packet aggregation in LTE/LTE-A.

Science.gov (United States)

Zhou, Kaijie; Nikaein, Navid

While random access presents a promising solution for efficient uplink channel access, the preamble collision rate can significantly increase when massive number of devices simultaneously access the channel. To address this issue and improve the reliability of the random access, an adaptive packet aggregation method is proposed. With the proposed method, a device does not trigger a random access for every single packet. Instead, it starts a random access when the number of aggregated packets reaches a given threshold. This method reduces the packet collision rate at the expense of an extra latency, which is used to accumulate multiple packets into a single transmission unit. Therefore, the tradeoff between packet loss rate and channel access latency has to be carefully selected. We use semi-Markov model to derive the packet loss rate and channel access latency as functions of packet aggregation number. Hence, the optimal amount of aggregated packets can be found, which keeps the loss rate below the desired value while minimizing the access latency. We also apply for the idea of packet aggregation for power saving, where a device aggregates as many packets as possible until the latency constraint is reached. Simulations are carried out to evaluate our methods. We find that the packet loss rate and/or power consumption are significantly reduced with the proposed method.

Mobile Ad Hoc Network Energy Cost Algorithm Based on Artificial Bee Colony

Directory of Open Access Journals (Sweden)

Mustafa Tareq

2017-01-01

Full Text Available A mobile ad hoc network (MANET is a collection of mobile nodes that dynamically form a temporary network without using any existing network infrastructure. MANET selects a path with minimal number of intermediate nodes to reach the destination node. As the distance between each node increases, the quantity of transmission power increases. The power level of nodes affects the simplicity with which a route is constituted between a couple of nodes. This study utilizes the swarm intelligence technique through the artificial bee colony (ABC algorithm to optimize the energy consumption in a dynamic source routing (DSR protocol in MANET. The proposed algorithm is called bee DSR (BEEDSR. The ABC algorithm is used to identify the optimal path from the source to the destination to overcome energy problems. The performance of the BEEDSR algorithm is compared with DSR and bee-inspired protocols (BeeIP. The comparison was conducted based on average energy consumption, average throughput, average end-to-end delay, routing overhead, and packet delivery ratio performance metrics, varying the node speed and packet size. The BEEDSR algorithm is superior in performance than other protocols in terms of energy conservation and delay degradation relating to node speed and packet size.

A hybrid EKF and switching PSO algorithm for joint state and parameter estimation of lateral flow immunoassay models.

Science.gov (United States)

Zeng, Nianyin; Wang, Zidong; Li, Yurong; Du, Min; Liu, Xiaohui

2012-01-01

In this paper, a hybrid extended Kalman filter (EKF) and switching particle swarm optimization (SPSO) algorithm is proposed for jointly estimating both the parameters and states of the lateral flow immunoassay model through available short time-series measurement. Our proposed method generalizes the well-known EKF algorithm by imposing physical constraints on the system states. Note that the state constraints are encountered very often in practice that give rise to considerable difficulties in system analysis and design. The main purpose of this paper is to handle the dynamic modeling problem with state constraints by combining the extended Kalman filtering and constrained optimization algorithms via the maximization probability method. More specifically, a recently developed SPSO algorithm is used to cope with the constrained optimization problem by converting it into an unconstrained optimization one through adding a penalty term to the objective function. The proposed algorithm is then employed to simultaneously identify the parameters and states of a lateral flow immunoassay model. It is shown that the proposed algorithm gives much improved performance over the traditional EKF method.

A New Switching-Based Median Filtering Scheme and Algorithm for Removal of High-Density Salt and Pepper Noise in Images

Directory of Open Access Journals (Sweden)

Jayaraj V

2010-01-01

Full Text Available A new switching-based median filtering scheme for restoration of images that are highly corrupted by salt and pepper noise is proposed. An algorithm based on the scheme is developed. The new scheme introduces the concept of substitution of noisy pixels by linear prediction prior to estimation. A novel simplified linear predictor is developed for this purpose. The objective of the scheme and algorithm is the removal of high-density salt and pepper noise in images. The new algorithm shows significantly better image quality with good PSNR, reduced MSE, good edge preservation, and reduced streaking. The good performance is achieved with reduced computational complexity. A comparison of the performance is made with several existing algorithms in terms of visual and quantitative results. The performance of the proposed scheme and algorithm is demonstrated.

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

Science.gov (United States)

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.

Recovery Act: Energy Efficiency of Data Networks through Rate Adaptation (EEDNRA) - Final Technical Report

Energy Technology Data Exchange (ETDEWEB)

Matthew Andrews; Spyridon Antonakopoulos; Steve Fortune; Andrea Francini; Lisa Zhang

2011-07-12

This Concept Definition Study focused on developing a scientific understanding of methods to reduce energy consumption in data networks using rate adaptation. Rate adaptation is a collection of techniques that reduce energy consumption when traffic is light, and only require full energy when traffic is at full provisioned capacity. Rate adaptation is a very promising technique for saving energy: modern data networks are typically operated at average rates well below capacity, but network equipment has not yet been designed to incorporate rate adaptation. The Study concerns packet-switching equipment, routers and switches; such equipment forms the backbone of the modern Internet. The focus of the study is on algorithms and protocols that can be implemented in software or firmware to exploit hardware power-control mechanisms. Hardware power-control mechanisms are widely used in the computer industry, and are beginning to be available for networking equipment as well. Network equipment has different performance requirements than computer equipment because of the very fast rate of packet arrival; hence novel power-control algorithms are required for networking. This study resulted in five published papers, one internal report, and two patent applications, documented below. The specific technical accomplishments are the following: • A model for the power consumption of switching equipment used in service-provider telecommunication networks as a function of operating state, and measured power-consumption values for typical current equipment. • An algorithm for use in a router that adapts packet processing rate and hence power consumption to traffic load while maintaining performance guarantees on delay and throughput. • An algorithm that performs network-wide traffic routing with the objective of minimizing energy consumption, assuming that routers have less-than-ideal rate adaptivity. • An estimate of the potential energy savings in service-provider networks

A novel lost packets recovery scheme based on visual secret sharing

Science.gov (United States)

Lu, Kun; Shan, Hong; Li, Zhi; Niu, Zhao

2017-08-01

In this paper, a novel lost packets recovery scheme which encrypts the effective parts of an original packet into two shadow packets based on (2, 2)-threshold XOR-based visual Secret Sharing (VSS) is proposed. The two shadow packets used as watermarks would be embedded into two normal data packets with digital watermarking embedding technology and then sent from one sensor node to another. Each shadow packet would reveal no information of the original packet, which can improve the security of original packet delivery greatly. The two shadow packets which can be extracted from the received two normal data packets delivered from a sensor node can recover the original packet lossless based on XOR-based VSS. The Performance analysis present that the proposed scheme provides essential services as long as possible in the presence of selective forwarding attack. The proposed scheme would not increase the amount of additional traffic, namely, lower energy consumption, which is suitable for Wireless Sensor Network (WSN).

GENETIC ALGORITHM BASED SOLUTION IN PWM CONVERTER SWITCHING FOR VOLTAGE SOURCE INVERTER FEEDING AN INDUCTION MOTOR DRIVE

Directory of Open Access Journals (Sweden)

V. Jegathesan

2017-11-01

Full Text Available This paper presents an efficient and reliable Genetic Algorithm based solution for Selective Harmonic Elimination (SHE switching pattern. This method eliminates considerable amount of lower order line voltage harmonics in Pulse Width Modulation (PWM inverter. Determination of pulse pattern for the elimination of some lower order harmonics of a PWM inverter necessitates solving a system of nonlinear transcendental equations. Genetic Algorithm is used to solve nonlinear transcendental equations for PWM-SHE. Many methods are available to eliminate the higher order harmonics and it can be easily removed. But the greatest challenge is to eliminate the lower order harmonics and this is successfully achieved using Genetic Algorithm without using Dual transformer. Simulations using MATLABTM and Powersim with experimental results are carried out to validate the solution. The experimental results show that the harmonics up to 13th were totally eliminated.

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

Science.gov (United States)

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.

Study on distributed re-clustering algorithm for moblie wireless sensor networks

Directory of Open Access Journals (Sweden)

XU Chaojie

2016-04-01

Full Text Available In mobile wireless sensor networks,node mobility influences the topology of the hierarchically clustered network,thus affects packet delivery ratio and energy consumption of communications in clusters.To reduce the influence of node mobility,a distributed re-clustering algorithm is proposed in this paper.In this algorithm,basing on the clustered network,nodes estimate their current locations with particle algorithm and predict the most possible locations of next time basing on the mobility model.Each boundary node of a cluster periodically estimates the need for re-clustering and re-cluster itself to the optimal cluster through communicating with the cluster headers when needed.The simulation results indicate that,with small re-clustering periods,the proposed algorithm can be effective to keep appropriate communication distance and outperforms existing schemes on packet delivery ratio and energy consumption.

Enhancing overcurrent relay performance using wavelet packet transform

International Nuclear Information System (INIS)

Adly, A.R.

2012-01-01

The function of a power system relaying is to cause the prompt removal of any element of power system from service when it is subjected to short circuit or it starts to operate in any abnormal manner that might cause damage or otherwise interfere with the effective operation of the rest of the system. Overcurrent protection is one of the most widely used relays in power system which is used for both primary and back-up protective relays, and applied in every protective zone in the system. The application of time overcurrent relays in power system presents serious limitations in terms of sensitivity and selectivity. Digital forms of such relays are being mostly used which have the advantages of data recording and adaptive features. This thesis introduces a technique based on Wavelet Packet Transform (WPT) to detect short circuit faults within wide variation in generating conditions, with very small voltage variation, and High-Impedance Faults (HIFs). Besides, it examines the load current continuously and changes the relay pick up value adaptively. WPT is used to estimate proper value for the RMS fundamental and hence calculate trip time accurately even that when the signals have been contaminated with other harmonics, inter harmonics or subharmonic. Simulation work was conducted using Alternative Transient Program (ATP) package. A radial distribution system and series compensated line are modeled as case studies. The performance of the proposed overcurrent scheme for both lines is extensively tested during different operating conditions including; normal, internal short circuit faults, HIFs and similar situations to HIFs: such as capacitor switching (in), capacitor switching (out), load switching, and no load line switching. This thesis also uses a technique that estimates the location of short circuit faults on a radial distribution system. The technique was tested to evaluate its suitability. The results indicate that the proposed technique works well. It also

Revivals of quantum wave packets in graphene

International Nuclear Information System (INIS)

Krueckl, Viktor; Kramer, Tobias

2009-01-01

We investigate the propagation of wave packets on graphene in a perpendicular magnetic field and the appearance of collapses and revivals in the time evolution of an initially localized wave packet. The wave-packet evolution in graphene differs drastically from the one in an electron gas and shows a rich revival structure similar to the dynamics of highly excited Rydberg states. We present a novel numerical wave-packet propagation scheme in order to solve the effective single-particle Dirac-Hamiltonian of graphene and show how the collapse and revival dynamics is affected by the presence of disorder. Our effective numerical method is of general interest for the solution of the Dirac equation in the presence of potentials and magnetic fields.

Controllability of multi-agent systems with periodically switching topologies and switching leaders

Science.gov (United States)

Tian, Lingling; Zhao, Bin; Wang, Long

2018-05-01

This paper considers controllability of multi-agent systems with periodically switching topologies and switching leaders. The concept of m-periodic controllability is proposed, and a criterion for m-periodic controllability is established. The effect of the duration of subsystems on controllability is analysed by utilising a property of analytic functions. In addition, the influence of switching periods on controllability is investigated, and an algorithm is proposed to search for the fewest periods to ensure controllability. A necessary condition for m-periodic controllability is obtained from the perspective of eigenvectors of the subsystems' Laplacian matrices. For a system with switching leaders, it is proved that switching-leader controllability is equivalent to multiple-leader controllability. Furthermore, both the switching order and the tenure of agents being leaders have no effect on the controllability. Some examples are provided to illustrate the theoretical results.

Software Switching for High Throughput Data Acquisition Networks

CERN Document Server

AUTHOR|(CDS)2089787; Lehmann Miotto, Giovanna

The bursty many-to-one communication pattern, typical for data acquisition systems, is particularly demanding for commodity TCP/IP and Ethernet technologies. The problem arising from this pattern is widely known in the literature as \\emph{incast} and can be observed as TCP throughput collapse. It is a result of overloading the switch buffers, when a specific node in a network requests data from multiple sources. This will become even more demanding for future upgrades of the experiments at the Large Hadron Collider at CERN. It is questionable whether commodity TCP/IP and Ethernet technologies in their current form will be still able to effectively adapt to bursty traffic without losing packets due to the scarcity of buffers in the networking hardware. This thesis provides an analysis of TCP/IP performance in data acquisition networks and presents a novel approach to incast congestion in these networks based on software-based packet forwarding. Our first contribution lies in confirming the strong analogies bet...

Attosecond electron wave packet interferometry

International Nuclear Information System (INIS)

Remetter, T.; Ruchon, T.; Johnsson, P.; Varju, K.; Gustafsson, E.

2006-01-01

Complete test of publication follows. The well controlled generation and characterization of attosecond XUV light pulses provide an unprecedented tool to study electron wave packets (EWPs). Here a train of attosecond pulses is used to create and study the phase of an EWP in momentum space. There is a clear analogy between electronic wave functions and optical fields. In optics, methods like SPIDER or wave front shearing interferometry, allow to measure the spectral or spatial phase of a light wave. These two methods are based on the same principle: an interferogram is produced when recombining two sheared replica of a light pulse, spectrally (SPIDER) or spatially (wave front shearing interferometry). This enables the comparison of two neighbouring different spectral or spatial slices of the original wave packet. In the experiment, a train of attosecond pulses is focused in an Argon atomic gas jet. EWPs are produced from the single XUV photon ionization of Argon atoms. If an IR beam is synchronized to the EWPs, it is possible to introduce a shear in momentum space between two consecutive s wave packets. A Velocity Map Imaging Spectrometer (VMIS) enables us to detect the interference pattern. An analysis of the interferograms will be presented leading to a conclusion about the symmetry of the studied wave packet.

Grooming. Instructor's Packet. Learning Activity Package.

Science.gov (United States)

Stark, Pamela

This instructor's packet accompanies the learning activity package (LAP) on grooming. Contents included in the packet are a time sheet, suggested uses for the LAP, an instruction sheet, final LAP reviews, a final LAP review answer key, suggested activities, an additional resources list, and student completion cards to issue to students as an…

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

Science.gov (United States)

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.

Driver drowsiness classification using fuzzy wavelet-packet-based feature-extraction algorithm.

Science.gov (United States)

Khushaba, Rami N; Kodagoda, Sarath; Lal, Sara; Dissanayake, Gamini

2011-01-01

Driver drowsiness and loss of vigilance are a major cause of road accidents. Monitoring physiological signals while driving provides the possibility of detecting and warning of drowsiness and fatigue. The aim of this paper is to maximize the amount of drowsiness-related information extracted from a set of electroencephalogram (EEG), electrooculogram (EOG), and electrocardiogram (ECG) signals during a simulation driving test. Specifically, we develop an efficient fuzzy mutual-information (MI)- based wavelet packet transform (FMIWPT) feature-extraction method for classifying the driver drowsiness state into one of predefined drowsiness levels. The proposed method estimates the required MI using a novel approach based on fuzzy memberships providing an accurate-information content-estimation measure. The quality of the extracted features was assessed on datasets collected from 31 drivers on a simulation test. The experimental results proved the significance of FMIWPT in extracting features that highly correlate with the different drowsiness levels achieving a classification accuracy of 95%-- 97% on an average across all subjects.

Teager Energy Entropy Ratio of Wavelet Packet Transform and Its Application in Bearing Fault Diagnosis

Directory of Open Access Journals (Sweden)

Shuting Wan

2018-05-01

Full Text Available Kurtogram can adaptively select the resonant frequency band, and then the characteristic fault frequency can be obtained by analyzing the selected band. However, the kurtogram is easily affected by random impulses and noise. In recent years, improvements to kurtogram have been concentrated on two aspects: (a the decomposition method of the frequency band; and (b the selection index of the optimal frequency band. In this article, a new method called Teager Energy Entropy Ratio Gram (TEERgram is proposed. The TEER algorithm takes the wavelet packet transform (WPT as the signal frequency band decomposition method, which can adaptively segment the frequency band and control the noise. At the same time, Teager Energy Entropy Ratio (TEER is proposed as a computing index for wavelet packet subbands. WPT has better decomposition properties than traditional finite impulse response (FIR filtering and Fourier decomposition in the kurtogram algorithm. At the same time, TEER has better performance than the envelope spectrum or even the square envelope spectrum. Therefore, the TEERgram method can accurately identify the resonant frequency band under strong background noise. The effectiveness of the proposed method is verified by simulation and experimental analysis.

Optimum Performances for Non-Linear Finite Elements Model of 8/6 Switched Reluctance Motor Based on Intelligent Routing Algorithms

Directory of Open Access Journals (Sweden)

Chouaib Labiod

2017-01-01

Full Text Available This paper presents torque ripple reduction with speed control of 8/6 Switched Reluctance Motor (SRM by the determination of the optimal parameters of the turn on, turn off angles Theta_(on, Theta_(off, and the supply voltage using Particle Swarm Optimization (PSO algorithm and steady state Genetic Algorithm (ssGA. With SRM model, there is difficulty in the control relapsed into highly non-linear static characteristics. For this, the Finite Elements Method (FEM has been used because it is a powerful tool to get a model closer to reality. The mechanism used in this kind of machine control consists of a speed controller in order to determine current reference which must be produced to get the desired speed, hence, hysteresis controller is used to compare current reference with current measured up to achieve switching signals needed in the inverter. Depending on this control, the intelligent routing algorithms get the fitness equation from torque ripple and speed response so as to give the optimal parameters for better results. Obtained results from the proposed strategy based on metaheuristic methods are compared with the basic case without considering the adjustment of specific parameters. Optimized results found clearly confirmed the ability and the efficiency of the proposed strategy based on metaheuristic methods in improving the performances of the SRM control considering different torque loads.

A novel scalable and low latency hybrid data center network architecture based on flow controlled fast optical switches

NARCIS (Netherlands)

Yan, Fulong; Guelbenzu, Gonzalo; Calabretta, Nicola

2018-01-01

We present a novel hybrid DCN based on flow-controlled fast optical switches. Results show packet loss < 1.4E-5 and latency < 2.4μs for 100,000 servers (0.3 load). Costs and power consumptions are also compared with current technologies.

Node-Dependence-Based Dynamic Incentive Algorithm in Opportunistic Networks

Directory of Open Access Journals (Sweden)

Ruiyun Yu

2014-01-01

Full Text Available Opportunistic networks lack end-to-end paths between source nodes and destination nodes, so the communications are mainly carried out by the “store-carry-forward” strategy. Selfish behaviors of rejecting packet relay requests will severely worsen the network performance. Incentive is an efficient way to reduce selfish behaviors and hence improves the reliability and robustness of the networks. In this paper, we propose the node-dependence-based dynamic gaming incentive (NDI algorithm, which exploits the dynamic repeated gaming to motivate nodes relaying packets for other nodes. The NDI algorithm presents a mechanism of tolerating selfish behaviors of nodes. Reward and punishment methods are also designed based on the node dependence degree. Simulation results show that the NDI algorithm is effective in increasing the delivery ratio and decreasing average latency when there are a lot of selfish nodes in the opportunistic networks.

Enhanced first-in-first-out-based round-robin multicast scheduling algorithm for input-queued switches

DEFF Research Database (Denmark)

Yu, Hao; Ruepp, Sarah Renée; Berger, Michael Stübert

2011-01-01

This study focuses on the multicast scheduling for M × N input-queued switches. An enhanced first-in-first-out -based round-robin multicast scheduling algorithm is proposed with a function of searching deeper into queues to reduce the head-of-line (HOL) blocking problem and thereby the multicast...... out on the decision matrix to reduce the number of transmission for each cell. To reduce the HOL blocking problem, a complement matrix is constructed based on the traffic matrix and the decision matrix, and a process of searching deeper into the queues is carried out to find cells that can be sent...... to the idle outputs. Simulation results show that the proposed function of searching deeper into the queues can alleviate the HOL blocking and as a result reduce the multicast latency significantly. Under both balanced and unbalanced multicast traffic, the proposed algorithm is able to maintain a stable...

German Cultural Packets 13 and 14.

Science.gov (United States)

Atlanta Public Schools, GA.

These German culture packets are designed to accompany A-LM Level II and include a statement of the rationale behind the unit, the objectives of the packet, the activities themselves, and a brief evaluation by the student. The activities involve the use of the basic text, the student workbook, corresponding tapes, and fellow students as partners…

Research on intelligent algorithm of electro - hydraulic servo control system

Science.gov (United States)

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.

A Lossless Switch for Data Acquisition Networks

CERN Document Server

Jereczek, Grzegorz Edmund; The ATLAS collaboration

2015-01-01

The recent trends in software-defined networking (SDN) and network function virtualization (NFV) are boosting the advance of software-based packet processing and forwarding on commodity servers. Although performance has traditionally been the challenge of this approach, this situation changes with modern server platforms. High performance load balancers, proxies, virtual switches and other network functions can be now implemented in software and not limited to specialized commercial hardware, thus reducing cost and increasing the flexibility. In this paper we design a lossless software-based switch for high bandwidth data acquisition (DAQ) networks, using the ATLAS experiment at CERN as a case study. We prove that it can effectively solve the incast pathology arising from the many-to-one communication pattern present in DAQ networks by providing extremely high buffering capabilities. We evaluate this on a commodity server equipped with twelve 10 Gbps Ethernet interfaces providing a total bandwidth of 120 Gbps...

Design and Test of a Signal Packet Router Prototype for the ATLAS NSW sTGC Detector

CERN Document Server

Hu, Xueye; The ATLAS collaboration

2016-01-01

Abstract– The New Small Wheel (NSW) small-strip thin-gap chambers (sTGC) detector will be installed in Large Hadron Collider (LHC) during ATLAS Phase-I upgrade. For sTGC detector, it requires very high-speed electronic triggering of signal events. On detecting a signal peak, sTGC front-end trigger logic will send out serialized track information on twinax fast serial copper wires to the signal packet Router on the periphery of the new small wheel. The signal packet Router boards handle all incoming traffic from the TDS chips (4.8 Gbps), serving as a very fast switching-yard between incoming active TDS signals and a limited number of optoelectronic outputs. There are several design requirements on router: radiation-hard (9kRad), high-speed serial link and low fixed latency in FPGA (field-programmable gate array) data processing. To meet those requirements, a router prototype has been developed for demonstration purpose. The components used in router prototype have been tested in radiation environment to m...

Efficient IP Traffic over Optical Network Based on Wavelength Translation Switching

DEFF Research Database (Denmark)

Jha, Vikas; Kalia, Kartik; Chowdhary, Bhawani Shankar

2016-01-01

With the advent of TCP/IP protocol suite the overall era of communication technologies had been redefined. Now, we can’t ignore the presence of huge amount of IP traffic; data, voice or video increasing day by day creating more pressure on existing communicating media and supporting back bone....... With the humongous popularity of Internet the overall traffic on Internet has the same story. Focusing on transmission of IP traffic in an optical network with signals remaining in their optical nature generated at particular wavelength, proposed is the switching of optically generated IP packets through optical...... cross connects based on translation of wavelength when an IP packet is crossing the optical cross connect. Adding the concepts of layer 3 routing protocols along with the wavelength translation scheme, will help in spanning the overall optical network for a larger area....

Merits and limitations of the mode switching rate stabilization pacing algorithms in the implantable cardioverter defibrillator.

Science.gov (United States)

Dijkman, B; Wellens, H J

2001-09-01

The 7250 Jewel AF Medtronic model of ICD is the first implantable device in which both therapies for atrial arrhythmias and pacing algorithms for atrial arrhythmia prevention are available. Feasibility of that extensive atrial arrhythmia management requires correct and synergic functioning of different algorithms to control arrhythmias. The ability of the new pacing algorithms to stabilize the atrial rate following termination of treated atrial arrhythmias was evaluated in the marker channel registration of 600 spontaneously occurring episodes in 15 patients with the Jewel AF. All patients (55+/-15 years) had structural heart disease and documented atrial and ventricular arrhythmias. Dual chamber rate stabilization pacing was present in 245 (41 %) of episodes following arrhythmia termination and was a part of the mode switching operation during which pacing was provided in the dynamic DDI mode. This algorithm could function as the atrial rate stabilization pacing only when there was a slow spontaneous atrial rhythm or in presence of atrial premature beats conducted to the ventricles with a normal AV time. In case of atrial premature beats with delayed or absent conduction to the ventricles and in case of ventricular premature beats, the algorithm stabilized the ventricular rate. The rate stabilization pacing in DDI mode during sinus rhythm following atrial arrhythmia termination was often extended in time due to the device-based definition of arrhythmia termination. This was also the case in patients, in whom the DDD mode with true atrial rate stabilization algorithm was programmed. The rate stabilization algorithms in the Jewel AF applied after atrial arrhythmia termination provide pacing that is not based on the timing of atrial events. Only under certain circumstances the algorithm can function as atrial rate stabilization pacing. Adjustments in availability and functioning of the rate stabilization algorithms might be of benefit for the clinical performance of

High-speed packet filtering utilizing stream processors

Science.gov (United States)

Hummel, Richard J.; Fulp, Errin W.

2009-04-01

Parallel firewalls offer a scalable architecture for the next generation of high-speed networks. While these parallel systems can be implemented using multiple firewalls, the latest generation of stream processors can provide similar benefits with a significantly reduced latency due to locality. This paper describes how the Cell Broadband Engine (CBE), a popular stream processor, can be used as a high-speed packet filter. Results show the CBE can potentially process packets arriving at a rate of 1 Gbps with a latency less than 82 μ-seconds. Performance depends on how well the packet filtering process is translated to the unique stream processor architecture. For example the method used for transmitting data and control messages among the pseudo-independent processor cores has a significant impact on performance. Experimental results will also show the current limitations of a CBE operating system when used to process packets. Possible solutions to these issues will be discussed.

Microwave Ionization of an Atomic Electron Wave Packet

International Nuclear Information System (INIS)

Noel, Michael W.; Ko, Lung; Gallagher, T. F.

2001-01-01

A short microwave pulse is used to ionize a lithium Rydberg wave packet launched from the core at a well-defined phase of the field. We observe a strong dependence on the relative phase between the motion of the wave packet and the oscillations of the field. This phase dependent ionization is also studied as a function of the relative frequency. Our experimental observations are in good qualitative agreement with a one-dimensional classical model of wave packet ionization

Oral Hygiene. Instructor's Packet. Learning Activity Package.

Science.gov (United States)

Hime, Kirsten

This instructor's packet accompanies the learning activity package (LAP) on oral hygiene. Contents included in the packet are a time sheet, suggested uses for the LAP, an instruction sheet, final LAP reviews, a final LAP review answer key, suggested activities, additional resources (student handouts), student performance checklists for both…

Disk Operating System--DOS. Teacher Packet. Learning Activity Packets.

Science.gov (United States)

Oklahoma State Dept. of Vocational and Technical Education, Stillwater. Curriculum and Instructional Materials Center.

The Learning Activity Packets (LAPs) contained in this manual are designed to assist the beginning user in understanding DOS (Disk Operating System). LAPs will not work with any version below DOS Version 3.0 and do not address the enhanced features of versions 4.0 or higher. These elementary activities cover only the DOS commands necessary to…

41 CFR 101-39.306 - Operator's packet.

Science.gov (United States)

2010-07-01

...-INTERAGENCY FLEET MANAGEMENT SYSTEMS 39.3-Use and Care of GSA Interagency Fleet Management System Vehicles § 101-39.306 Operator's packet. The GSA Interagency Fleet Management System (IFMS) will provide each... 41 Public Contracts and Property Management 2 2010-07-01 2010-07-01 true Operator's packet. 101-39...

A time-frequency analysis of wave packet fractional revivals

International Nuclear Information System (INIS)

Ghosh, Suranjana; Banerji, J

2007-01-01

We show that the time-frequency analysis of the autocorrelation function is, in many ways, a more appropriate tool to resolve fractional revivals of a wave packet than the usual time-domain analysis. This advantage is crucial in reconstructing the initial state of the wave packet when its coherent structure is short-lived and decays before it is fully revived. Our calculations are based on the model example of fractional revivals in a Rydberg wave packet of circular states. We end by providing an analytical investigation which fully agrees with our numerical observations on the utility of time-frequency analysis in the study of wave packet fractional revivals

Wave-packet revivals for quantum systems with nondegenerate energies

International Nuclear Information System (INIS)

Bluhm, R.; Tudose, B.

1996-01-01

The revival structure of wave packets is examined for quantum systems having energies that depend on two nondegenerate quantum numbers. For such systems, the evolution of the wave packet is controlled by two classical periods and three revival times. These wave packets exhibit quantum beats in the initial motion as well as new types of long-term revivals. The issue of whether fractional revivals can form is addressed. We present an analytical proof showing that at certain times equal to rational fractions of the revival times the wave packet can reform as a sum of subsidiary waves and that both conventional and new types of fractional revivals can occur. (orig.)

Dispersionless wave packets in Dirac materials

International Nuclear Information System (INIS)

Jakubský, Vít; Tušek, Matěj

2017-01-01

We show that a wide class of quantum systems with translational invariance can host dispersionless, soliton-like, wave packets. We focus on the setting where the effective, two-dimensional Hamiltonian acquires the form of the Dirac operator. The proposed framework for construction of the dispersionless wave packets is illustrated on silicene-like systems with topologically nontrivial effective mass. Our analytical predictions are accompanied by a numerical analysis and possible experimental realizations are discussed.

Dance Theatre of Harlem--Theater Activity Packet.

Science.gov (United States)

New York City Board of Education, Brooklyn, NY. Div. of Curriculum and Instruction.

Intended to complement the New York City communication arts curriculum, this packet introduces young students, guided by the classroom teacher, to a dress rehearsal performance of the Dance Theatre of Harlem ballet company. The packet is one of a series in the "Early Stages" program, a joint effort of the Mayor's Office of Film, Theater…

Random linear network coding for streams with unequally sized packets

DEFF Research Database (Denmark)

Taghouti, Maroua; Roetter, Daniel Enrique Lucani; Pedersen, Morten Videbæk

2016-01-01

State of the art Random Linear Network Coding (RLNC) schemes assume that data streams generate packets with equal sizes. This is an assumption that results in the highest efficiency gains for RLNC. A typical solution for managing unequal packet sizes is to zero-pad the smallest packets. However, ...

Coulomb Final State Interactions for Gaussian Wave Packets

CERN Document Server

Wiedemann, Urs Achim; Heinz, Ulrich W

1999-01-01

Two-particle like-sign and unlike-sign correlations including Coulomb final state interactions are calculated for Gaussian wave packets emitted from a Gaussian source. We show that the width of the wave packets can be fully absorbed into the spatial and momentum space widths of an effective emission function for plane wave states, and that Coulomb final state interaction effects are sensitive only to the latter, but not to the wave packet width itself. Results from analytical and numerical calculations are compared with recently published work by other authors.

Aeroacoustic directivity via wave-packet analysis of mean or base flows

Science.gov (United States)

Edstrand, Adam; Schmid, Peter; Cattafesta, Louis

2017-11-01

Noise pollution is an ever-increasing problem in society, and knowledge of the directivity patterns of the sound radiation is required for prediction and control. Directivity is frequently determined through costly numerical simulations of the flow field combined with an acoustic analogy. We introduce a new computationally efficient method of finding directivity for a given mean or base flow field using wave-packet analysis (Trefethen, PRSA 2005). Wave-packet analysis approximates the eigenvalue spectrum with spectral accuracy by modeling the eigenfunctions as wave packets. With the wave packets determined, we then follow the method of Obrist (JFM, 2009), which uses Lighthill's acoustic analogy to determine the far-field sound radiation and directivity of wave-packet modes. We apply this method to a canonical jet flow (Gudmundsson and Colonius, JFM 2011) and determine the directivity of potentially unstable wave packets. Furthermore, we generalize the method to consider a three-dimensional flow field of a trailing vortex wake. In summary, we approximate the disturbances as wave packets and extract the directivity from the wave-packet approximation in a fraction of the time of standard aeroacoustic solvers. ONR Grant N00014-15-1-2403.

Electron Rydberg wave packets in one-dimensional atoms

Indian Academy of Sciences (India)

produced by the application of a single impulsive kick was explicitly demonstrated. The undulation of ..... In this context, let us divide the wave packet .... wave packet with special attention to the time evolution of its components associ- ated with ...

A multi-function IEC 61850 packet generator based on FPGA

International Nuclear Information System (INIS)

Wei, Wei; Li, Hong-bin; Cheng, Han-miao

2016-01-01

An IEC 61850 packet generator is used to produce IEC 61850-9-2 packets by simulating the merging unit and testing the IEC 61850 digital device. While the existing IEC packet generator can produce ideal digital without any noise, it does not take into account the fact that the merging unit output signal packets will be inevitably superimposed with noise. Since the International Electrical Commission standard of the electronic current transformer specifies the minimum output signal-to-noise ratio of the merging unit to be 30 dB, and the signal superimposed with noise will influence the operation performance of the digital device, it is necessary to design a multi-function IEC 61850-9-2 packet generator for a digital device test. Therefore, in this paper, a multi-function IEC 61850 packet generator has been developed, which not only can output various IEC 61850-9-2 packets, but also can add white Gaussian noise to the signal for digital device testing. By testing three digital electricity meters from different manufacturers, we showed that the error of the digital electricity meter is significantly larger when the signal packet is superimposed with noise. Also when the signal-to-noise ration is 30 dB, the error of one of the meters exceeds the allowed range of the accuracy class. This indicates that the noise testing and the noise setting function of the system has an important role in the testing of a digital device. (paper)

Balanced truncation for linear switched systems

DEFF Research Database (Denmark)

Petreczky, Mihaly; Wisniewski, Rafal; Leth, John-Josef

2013-01-01

In this paper, we present a theoretical analysis of the model reduction algorithm for linear switched systems from Shaker and Wisniewski (2011, 2009) and . This algorithm is a reminiscence of the balanced truncation method for linear parameter varying systems (Wood et al., 1996) [3]. Specifically...

Fair packet scheduling in Wireless Mesh Networks

KAUST Repository

Nawab, Faisal

2014-02-01

In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically determine the throughput. Based on the developed model, we propose a distributed MAC protocol called Timestamp-ordered MAC (TMAC), aiming to alleviate the unfairness problem in WMNs. TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed with the transmission only if it receives a sufficient number of grant control messages from these neighbors. A grant message indicates that the associated data packet has the lowest timestamp of all the packets pending transmission at the local transmit queue. We demonstrate that a loose ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11, and thus can be easily integrated in existing 802.11-based WMNs. Our simulation results show that TMAC achieves excellent resource allocation fairness while maintaining over 90% of maximum link capacity across a large number of topologies.

An Adaptive Power Efficient Packet Scheduling Algorithm for Wimax Networks

OpenAIRE

R Murali Prasad; P. Satish Kumar

2010-01-01

Admission control schemes and scheduling algorithms are designed to offer QoS services in 802.16/802.16e networks and a number of studies have investigated these issues. But the channel condition and priority of traffic classes are very rarely considered in the existing scheduling algorithms. Although a number of energy saving mechanisms have been proposed for the IEEE 802.16e, to minimize the power consumption of IEEE 802.16e mobile stations with multiple real-time connections has not yet be...

Label-controlled optical packet routing technologies and applications

DEFF Research Database (Denmark)

Koonen, A.M.J.; Yan, N.; Vegas Olmos, Juan José

2007-01-01

An overview is given of various optical packet labeling techniques. The architecture and technologies are discussed for optical packet routing nodes using orthogonal labeling with optoelectronic label processing, and for nodes using time-serial labeling with all-optical time-serial label processing...

Scalable optical packet switch architecture for low latency and high load computer communication networks

NARCIS (Netherlands)

Calabretta, N.; Di Lucente, S.; Nazarathy, Y.; Raz, O.; Dorren, H.J.S.

2011-01-01

High performance computer and data-centers require PetaFlop/s processing speed and Petabyte storage capacity with thousands of low-latency short link interconnections between computers nodes. Switch matrices that operate transparently in the optical domain are a potential way to efficiently

Multiwavelet packets and frame packets of L2( d)

Indian Academy of Sciences (India)

Springer Verlag Heidelberg #4 2048 1996 Dec 15 10:16:45

For a nice exposition of wavelet packets of L2( ) with dilation 2, see [11]. ..... p∈ d hr lm(ξ)cjp. {. ∑ q∈ d. ˆϕm(ξ + 2qπ) ˆϕj (ξ + 2qπ). } ·e−i〈k,Bξ〉 e i〈p, ξ〉 dξ ...... [14] Rudin W, Fourier Analysis on Groups (New York: John Wiley and Sons) (1962).

Compressed Domain Packet Loss Concealment of Sinusoidally Coded Speech

DEFF Research Database (Denmark)

Rødbro, Christoffer A.; Christensen, Mads Græsbøll; Andersen, Søren Vang

2003-01-01

We consider the problem of packet loss concealment for voice over IP (VoIP). The speech signal is compressed at the transmitter using a sinusoidal coding scheme working at 8 kbit/s. At the receiver, packet loss concealment is carried out working directly on the quantized sinusoidal parameters......, based on time-scaling of the packets surrounding the missing ones. Subjective listening tests show promising results indicating the potential of sinusoidal speech coding for VoIP....

Controlled Quantum Packets

Science.gov (United States)

DeMartino, Salvatore; DeSiena, Silvio

1996-01-01

We look at time evolution of a physical system from the point of view of dynamical control theory. Normally we solve motion equation with a given external potential and we obtain time evolution. Standard examples are the trajectories in classical mechanics or the wave functions in Quantum Mechanics. In the control theory, we have the configurational variables of a physical system, we choose a velocity field and with a suited strategy we force the physical system to have a well defined evolution. The evolution of the system is the 'premium' that the controller receives if he has adopted the right strategy. The strategy is given by well suited laboratory devices. The control mechanisms are in many cases non linear; it is necessary, namely, a feedback mechanism to retain in time the selected evolution. Our aim is to introduce a scheme to obtain Quantum wave packets by control theory. The program is to choose the characteristics of a packet, that is, the equation of evolution for its centre and a controlled dispersion, and to give a building scheme from some initial state (for example a solution of stationary Schroedinger equation). It seems natural in this view to use stochastic approach to Quantum Mechanics, that is, Stochastic Mechanics [S.M.]. It is a quantization scheme different from ordinary ones only formally. This approach introduces in quantum theory the whole mathematical apparatus of stochastic control theory. Stochastic Mechanics, in our view, is more intuitive when we want to study all the classical-like problems. We apply our scheme to build two classes of quantum packets both derived generalizing some properties of coherent states.

Impact of packet losses in scalable 3D holoscopic video coding

Science.gov (United States)

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.

The Texas Medication Algorithm Project (TMAP) schizophrenia algorithms.

Science.gov (United States)

Miller, A L; Chiles, J A; Chiles, J K; Crismon, M L; Rush, A J; Shon, S P

1999-10-01

In the Texas Medication Algorithm Project (TMAP), detailed guidelines for medication management of schizophrenia and related disorders, bipolar disorders, and major depressive disorders have been developed and implemented. This article describes the algorithms developed for medication treatment of schizophrenia and related disorders. The guidelines recommend a sequence of medications and discuss dosing, duration, and switch-over tactics. They also specify response criteria at each stage of the algorithm for both positive and negative symptoms. The rationale and evidence for each aspect of the algorithms are presented.

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

Science.gov (United States)

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.

Wave packet construction in three-dimensional quantum billiards

Indian Academy of Sciences (India)

We examine the dynamical evolution of wave packets in a cubical billiard where three quantum numbers (, , ) determine its energy spectrum and consequently its dynamical behaviour. We have constructed the wave packet in the cubical billiard and have observed its time evolution for various closed orbits.

The HSBQ Algorithm with Triple-play Services for Broadband Hybrid Satellite Constellation Communication System

Directory of Open Access Journals (Sweden)

Anupon Boriboon

2016-07-01

Full Text Available The HSBQ algorithm is the one of active queue management algorithms, which orders to avoid high packet loss rates and control stable stream queue. That is the problem of calculation of the drop probability for both queue length stability and bandwidth fairness. This paper proposes the HSBQ, which drop the packets before the queues overflow at the gateways, so that the end nodes can respond to the congestion before queue overflow. This algorithm uses the change of the average queue length to adjust the amount by which the mark (or drop probability is changed. Moreover it adjusts the queue weight, which is used to estimate the average queue length, based on the rate. The results show that HSBQ algorithm could maintain control stable stream queue better than group of congestion metric without flow information algorithm as the rate of hybrid satellite network changing dramatically, as well as the presented empiric evidences demonstrate that the use of HSBQ algorithm offers a better quality of service than the traditionally queue control mechanisms used in hybrid satellite network.

Limiting Energy Consumption by Decreasing Packets Retransmissions in 5G Network

Directory of Open Access Journals (Sweden)

Łukasz Apiecionek

2017-01-01

Full Text Available This article presents the potential of using Multipath Transmission Control Protocol for limiting the energy consumption in 5G network. The number of errors occurring during packet transmissions and in effect the number of retransmissions affect the consumption of energy by the devices in the network. The paper analyzes the potential energy savings from implementing an algorithm for detecting problems and predicting the future retransmissions. Although this is the main object of the paper, it must be emphasized that the proposed method also allows increasing the speed of transmission and improving the security of the data and it is easy to implement in 5G networks.

Quantum wave-packet revivals in circular billiards

International Nuclear Information System (INIS)

Robinett, R.W.; Heppelmann, S.

2002-01-01

We examine the long-term time dependence of Gaussian wave packets in a circular infinite well (billiard) system and find that there are approximate revivals. For the special case of purely m=0 states (central wave packets with no momentum) the revival time is T rev (m=0) =8μR 2 /(ℎ/2π)π, where μ is the mass of the particle, and the revivals are almost exact. For all other wave packets, we find that T rev (m≠0) =(π 2 /2)T rev (m=0) ≅5T rev (m=0) and the nature of the revivals becomes increasingly approximate as the average angular momentum or number of m≠0 states is increased. The dependence of the revival structure on the initial position, energy, and angular momentum of the wave packet and the connection to the energy spectrum is discussed in detail. The results are also compared to two other highly symmetrical two-dimensional infinite well geometries with exact revivals, namely, the square and equilateral triangle billiards. We also show explicitly how the classical periodicity for closed orbits in a circular billiard arises from the energy eigenvalue spectrum, using a WKB analysis

Exact wave packet decoherence dynamics in a discrete spectrum environment

International Nuclear Information System (INIS)

Tu, Matisse W Y; Zhang Weimin

2008-01-01

We find an exact analytical solution of the reduced density matrix from the Feynman-Vernon influence functional theory for a wave packet in an environment containing a few discrete modes. We obtain two intrinsic energy scales relating to the time scales of the system and the environment. The different relationship between these two scales alters the overall form of the solution of the system. We also introduce a decoherence measure for a single wave packet which is defined as the ratio of Schroedinger uncertainty over the delocalization extension of the wave packet and characterizes the time-evolution behaviour of the off-diagonal reduced density matrix element. We utilize the exact solution and the decoherence measure to study the wave packet decoherence dynamics. We further demonstrate how the dynamical diffusion of the wave packet leads to non-Markovian decoherence in such a microscopic environment.

Synchronization in a Random Length Ring Network for SDN-Controlled Optical TDM Switching

DEFF Research Database (Denmark)

Kamchevska, Valerija; Cristofori, Valentina; Da Ros, Francesco

2016-01-01

. In addition, we propose a novel synchronization algorithm that enables automatic synchronization of software defined networking controlled all-optical TDM switching nodes connected in a ring network. Besides providing synchronization, the algorithm also can facilitate dynamic slot size change and failure......In this paper we focus on optical time division multiplexed (TDM) switching and its main distinguishing characteristics compared with other optical subwavelength switching technologies. We review and discuss in detail the synchronization requirements that allow for proper switching operation...... detection. We experimentally validate the algorithm behavior and achieve correct operation for three different ring lengths. Moreover, we experimentally demonstrate data plane connectivity in a ring network composed of three nodes and show successful wavelength division multiplexing space division...

3-5 modulation and switching devices for optical systems applications

Science.gov (United States)

Singh, Jasprit; Bhattacharya, Pallab

1995-04-01

The thrust for this three year program has been to develop novel devices and systems applications for multiple quantum well based devices. We have investigated architectures based upon the quantum confined Stark effect (QCSE), a means by which excitonic resonances in a quantum well are electric field tuned to shift the peaked absorption spectrum of the material. The devices based upon this concept have been used, in the past, to realize switching structures employing the characteristic negative differential resistance available in PIN-MQW diodes under illumination. We have focuses, primarily on three schemes based upon the QCSE, to extend the utility of quantum well based devices. Firstly, we have developed, tested and optimized a novel tunable optical filter for wavelength selective applications. Secondly, we have demonstrated an MQW based scheme for optical pattern recognition which we have applied towards header recognition in a packet switching network environment. Thirdly, we have extended previous MQW based switching schemes to implement an optical read only memory (ROM) which can store two bits of information on a single sight, read by two different probe wavelengths of light.

Physical Watermarking for Securing Cyber-Physical Systems via Packet Drop Injections

Energy Technology Data Exchange (ETDEWEB)

Ozel, Omur [Carnegie Mellon Univ., Pittsburgh, PA (United States); Weekrakkody, Sean [Carnegie Mellon Univ., Pittsburgh, PA (United States); Sinopoli, Bruno [Carnegie Mellon Univ., Pittsburgh, PA (United States)

2017-10-23

Physical watermarking is a well known solution for detecting integrity attacks on Cyber-Physical Systems (CPSs) such as the smart grid. Here, a random control input is injected into the system in order to authenticate physical dynamics and sensors which may have been corrupted by adversaries. Packet drops may naturally occur in a CPS due to network imperfections. To our knowledge, previous work has not considered the role of packet drops in detecting integrity attacks. In this paper, we investigate the merit of injecting Bernoulli packet drops into the control inputs sent to actuators as a new physical watermarking scheme. With the classical linear quadratic objective function and an independent and identically distributed packet drop injection sequence, we study the effect of packet drops on meeting security and control objectives. Our results indicate that the packet drops could act as a potential physical watermark for attack detection in CPSs.

Performance Analysis and Optimization for Cognitive Radio Networks with Classified Secondary Users and Impatient Packets

Directory of Open Access Journals (Sweden)

Yuan Zhao

2017-01-01

Full Text Available A cognitive radio network with classified Secondary Users (SUs is considered. There are two types of SU packets, namely, SU1 packets and SU2 packets, in the system. The SU1 packets have higher priority than the SU2 packets. Considering the diversity of the SU packets and the real-time need of the interrupted SU packets, a novel spectrum allocation strategy with classified SUs and impatient packets is proposed. Based on the number of PU packets, SU1 packets, and SU2 packets in the system, by modeling the queue dynamics of the networks users as a three-dimensional discrete-time Markov chain, the transition probability matrix of the Markov chain is given. Then with the steady-state analysis, some important performance measures of the SU2 packets are derived to show the system performance with numerical results. Specially, in order to optimize the system actions of the SU2 packets, the individually optimal strategy and the socially optimal strategy for the SU2 packets are demonstrated. Finally, a pricing mechanism is provided to oblige the SU2 packets to follow the socially optimal strategy.

MODELLING AND VERIFICATION OF KITSAT PACKET COMMUNICATION PROTOCOLS

Directory of Open Access Journals (Sweden)

Young-Ro Lee

1996-06-01

Full Text Available In this paper, in order to verify KITSAT 1/2 packet communication protocols, we model the AX.25 protocol and PACSAT protocol by using an extended Petri net and then verify the correctness, boundedness, liveness and deadlock freeness of packet protocols by utilizing reachability trees.

Do Free Quantum-Mechanical Wave Packets Always Spread?

Science.gov (United States)

Klein, James R.

1980-01-01

The spreading or shrinking of free three-dimensional quantum-mechanical wave packets is addressed. A seeming paradox concerning the time evolution operator and nonspreading wave packets is discussed, and the necessity of taking into account the appropriate mathematical structure of quantum mechanics is emphasized. Teaching implications are given.…

Adaptive Active Noise Suppression Using Multiple Model Switching Strategy

Directory of Open Access Journals (Sweden)

Quanzhen Huang

2017-01-01

Full Text Available Active noise suppression for applications where the system response varies with time is a difficult problem. The computation burden for the existing control algorithms with online identification is heavy and easy to cause control system instability. A new active noise control algorithm is proposed in this paper by employing multiple model switching strategy for secondary path varying. The computation is significantly reduced. Firstly, a noise control system modeling method is proposed for duct-like applications. Then a multiple model adaptive control algorithm is proposed with a new multiple model switching strategy based on filter-u least mean square (FULMS algorithm. Finally, the proposed algorithm was implemented on Texas Instruments digital signal processor (DSP TMS320F28335 and real time experiments were done to test the proposed algorithm and FULMS algorithm with online identification. Experimental verification tests show that the proposed algorithm is effective with good noise suppression performance.

FAST TCP over optical burst switched networks: Modeling and stability analysis

KAUST Repository

Shihada, Basem

2013-04-01

FAST TCP is important for promoting data-intensive applications since it can cleverly react to both packet loss and delay for detecting network congestion. This paper provides a continuous time model and extensive stability analysis of FAST TCP congestion-control mechanism in bufferless Optical Burst Switched Networks (OBS). The paper first shows that random burst contentions are essential to stabilize the network, but cause throughput degradation in FAST TCP flows when a burst with all the packets from a single round is dropped. Second, it shows that FAST TCP is vulnerable to burst delay and fails to detect network congestion due to the little variation of round-trip time, thus unstable. Finally it shows that introducing extra delays by implementing burst retransmission stabilizes FAST TCP over OBS. The paper proves that FAST TCP is not stable over barebone OBS. However, it is locally, exponentially, and asymptotically stable over OBS with burst retransmission.

Transfer of a wave packet in double-well potential

Science.gov (United States)

Yang, Hai-Feng; Hu, Yao-Hua; Tan, Yong-Gang

2018-04-01

Energy potentials with double-well structures are typical in atoms and molecules systems. A manipulation scheme using Half Cycles Pulses (HCPs) is proposed to transfer a Gaussian wave packet between the two wells. On the basis of quantum mechanical simulations, the time evolution and the energy distribution of the wave packet are evaluated. The effect of time parameters, amplitude, and number of HCPs on spatial and energy distribution of the final state and transfer efficiency are investigated. After a carefully tailored HCPs sequence is applied to the initial wave packet localized in one well, the final state is a wave packet localized in the other well and populated at the lower energy levels with narrower distribution. The present scheme could be used to control molecular reactions and to prepare atoms with large dipole moments.

Online Optimal Switching Frequency Selection for Grid-Connected Voltage Source Inverters

Directory of Open Access Journals (Sweden)

Saher Albatran

2017-12-01

Full Text Available Enhancing the performance of the voltage source inverters (VSIs without changing the hardware structure has recently acquired an increased amount of interest. In this study, an optimization algorithm, enhancing the quality of the output power and the efficiency of three-phase grid connected VSIs is proposed. Towards that end, the proposed algorithm varies the switching frequency (fsw to maintain the best balance between switching losses of the insulated-gate-bipolar-transistor (IGBT power module as well as the output power quality under all loading conditions, including the ambient temperature effect. Since there is a contradiction with these two measures in relation to the switching frequency, the theory of multi-objective optimization is employed. The proposed algorithm is executed on the platform of Altera® DE2-115 field-programmable-gate-array (FPGA in which the optimal value of the switching frequency is determined online without the need for heavy offline calculations and/or lookup tables. With adopting the proposed algorithm, there is an improvement in the VSI efficiency without degrading the output power quality. Therefore, the proposed algorithm enhances the lifetime of the IGBT power module because of reduced variations in the module’s junction temperature. An experimental prototype is built, and experimental tests are conducted for the verification of the viability of the proposed algorithm.

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

Science.gov (United States)

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.

Four wind speed multi-step forecasting models using extreme learning machines and signal decomposing algorithms

International Nuclear Information System (INIS)

Liu, Hui; Tian, Hong-qi; Li, Yan-fei

2015-01-01

Highlights: • A hybrid architecture is proposed for the wind speed forecasting. • Four algorithms are used for the wind speed multi-scale decomposition. • The extreme learning machines are employed for the wind speed forecasting. • All the proposed hybrid models can generate the accurate results. - Abstract: Realization of accurate wind speed forecasting is important to guarantee the safety of wind power utilization. In this paper, a new hybrid forecasting architecture is proposed to realize the wind speed accurate forecasting. In this architecture, four different hybrid models are presented by combining four signal decomposing algorithms (e.g., Wavelet Decomposition/Wavelet Packet Decomposition/Empirical Mode Decomposition/Fast Ensemble Empirical Mode Decomposition) and Extreme Learning Machines. The originality of the study is to investigate the promoted percentages of the Extreme Learning Machines by those mainstream signal decomposing algorithms in the multiple step wind speed forecasting. The results of two forecasting experiments indicate that: (1) the method of Extreme Learning Machines is suitable for the wind speed forecasting; (2) by utilizing the decomposing algorithms, all the proposed hybrid algorithms have better performance than the single Extreme Learning Machines; (3) in the comparisons of the decomposing algorithms in the proposed hybrid architecture, the Fast Ensemble Empirical Mode Decomposition has the best performance in the three-step forecasting results while the Wavelet Packet Decomposition has the best performance in the one and two step forecasting results. At the same time, the Wavelet Packet Decomposition and the Fast Ensemble Empirical Mode Decomposition are better than the Wavelet Decomposition and the Empirical Mode Decomposition in all the step predictions, respectively; and (4) the proposed algorithms are effective in the wind speed accurate predictions

Angular momentum transport with twisted exciton wave packets

Science.gov (United States)

Zang, Xiaoning; Lusk, Mark T.

2017-10-01

A chain of cofacial molecules with CN or CN h symmetry supports excitonic states with a screwlike structure. These can be quantified with the combination of an axial wave number and an azimuthal winding number. Combinations of these states can be used to construct excitonic wave packets that spiral down the chain with well-determined linear and angular momenta. These twisted exciton wave packets can be created and annihilated using laser pulses, and their angular momentum can be optically modified during transit. This allows for the creation of optoexcitonic circuits in which information, encoded in the angular momentum of light, is converted into excitonic wave packets that can be manipulated, transported, and then reemitted. A tight-binding paradigm is used to demonstrate the key ideas. The approach is then extended to quantify the evolution of twisted exciton wave packets in a many-body, multilevel time-domain density functional theory setting. In both settings, numerical methods are developed that allow the site-to-site transfer of angular momentum to be quantified.

Priority-based methods for reducing the impact of packet loss on HEVC encoded video streams

Science.gov (United States)

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

Intrusion Detection Algorithm for Mitigating Sinkhole Attack on LEACH Protocol in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Ranjeeth Kumar Sundararajan

2015-01-01

Full Text Available In wireless sensor network (WSN, the sensors are deployed and placed uniformly to transmit the sensed data to a centralized station periodically. So, the major threat of the WSN network layer is sinkhole attack and it is still being a challenging issue on the sensor networks, where the malicious node attracts the packets from the other normal sensor nodes and drops the packets. Thus, this paper proposes an Intrusion Detection System (IDS mechanism to detect the intruder in the network which uses Low Energy Adaptive Clustering Hierarchy (LEACH protocol for its routing operation. In the proposed algorithm, the detection metrics, such as number of packets transmitted and received, are used to compute the intrusion ratio (IR by the IDS agent. The computed numeric or nonnumeric value represents the normal or malicious activity. As and when the sinkhole attack is captured, the IDS agent alerts the network to stop the data transmission. Thus, it can be a resilient to the vulnerable attack of sinkhole. Above all, the simulation result is shown for the proposed algorithm which is proven to be efficient compared with the existing work, namely, MS-LEACH, in terms of minimum computational complexity and low energy consumption. Moreover, the algorithm was numerically analyzed using TETCOS NETSIM.

Tunnel ionization of H2 in a low-frequency laser field: A wave-packet approach

International Nuclear Information System (INIS)

Nguyen-Dang, T.; Chateauneuf, F.; Manoli, S.; Atabek, O.; Keller, A.

1997-01-01

The dynamics of multielectron dissociative ionization (MEDI) of H 2 in an intense IR laser pulse are investigated using a wave-packet propagation scheme. The electron tunneling processes corresponding to the successive ionizations of H 2 are expressed in terms of field-free Born-Oppenheimer (BO) potential energy surfaces (PES) by transforming the tunnel shape resonance picture into a Feshbach resonance problem. This transformation is achieved by defining a new, time-dependent electronic basis in which the bound electrons are still described by field-free BO electronic states while the ionized ones are described by Airy functions. In the adiabatic, quasistatic approximation, these functions describe free electrons under the influence of the instantaneous electric field of the laser and such an ionized electron can have a negative total energy. As a consequence, when dressed by the continuous ejected electron energy, the BO PES of an ionic channel can be brought into resonance with states of the parent species. This construction gives a picture in which wave packets are to be propagated on a continuum of coupled electronic manifolds. A reduction of the wave-packet propagation scheme to an effective five-channel problem has been obtained for the description of the first dissociative ionization process in H 2 by using Fano's formalism [U. Fano, Phys. Rev. 124, 1866 (1961)] to analytically diagonalize the infinite, continuous interaction potential matrix and by using the properties of Fano's solutions. With this algorithm, the effect that continuous ionization of H 2 has on the dissociation dynamics of the H 2 + ion has been investigated. In comparison with results that would be obtained if the first ionization of H 2 was impulsive, the wave-packet dynamics of the H 2 + ion prepared continuously by tunnel ionization are markedly nonadiabatic. (Abstract Truncated)

E-model MOS Estimate Improvement through Jitter Buffer Packet Loss Modelling

Directory of Open Access Journals (Sweden)

Adrian Kovac

2011-01-01

Full Text Available Proposed article analyses dependence of MOS as a voice call quality (QoS measure estimated through ITU-T E-model under real network conditions with jitter. In this paper, a method of jitter effect is proposed. Jitter as voice packet time uncertainty appears as increased packet loss caused by jitter memory buffer under- or overflow. Jitter buffer behaviour at receiver’s side is modelled as Pareto/D/1/K system with Pareto-distributed packet interarrival times and its performance is experimentally evaluated by using statistic tools. Jitter buffer stochastic model is then incorporated into E-model in an additive manner accounting for network jitter effects via excess packet loss complementing measured network packet loss. Proposed modification of E-model input parameter adds two degrees of freedom in modelling: network jitter and jitter buffer size.

Observation of moving wave packets reveals their quantum state

International Nuclear Information System (INIS)

Leonhardt, U.; Raymer, M.G.

1996-01-01

We show how to infer the quantum state of a wave packet from position probability distributions measured during the packet close-quote s motion in an arbitrary potential. We assume a nonrelativistic one-dimensional or radial wave packet. Temporal Fourier transformation and spatial sampling with respect to a newly found set of functions project the density-matrix elements out of the probability distributions. The sampling functions are derivatives of products of regular and irregular wave functions. We note that the ability to infer quantum states in this way depends on the structure of the Schroedinger equation. copyright 1996 The American Physical Society

The Evolution and Revival Structure of Localized Quantum Wave Packets

OpenAIRE

Bluhm, Robert; Kostelecky, Alan; Porter, James

1995-01-01

Localized quantum wave packets can be produced in a variety of physical systems and are the subject of much current research in atomic, molecular, chemical, and condensed-matter physics. They are particularly well suited for studying the classical limit of a quantum-mechanical system. The motion of a localized quantum wave packet initially follows the corresponding classical motion. However, in most cases the quantum wave packet spreads and undergoes a series of collapses and revivals. We pre...

Non-fragile switched H∞ control for morphing aircraft with asynchronous switching

Directory of Open Access Journals (Sweden)

Haoyu CHENG

2017-06-01

Full Text Available This paper deals with the problem of non-fragile linear parameter-varying (LPV H∞ control for morphing aircraft with asynchronous switching. The switched LPV model of morphing aircraft is established by Jacobian linearization approach according to the nonlinear model. The data missing is taken into account in the link from sensors to controllers and the link from controllers to actuators, which satisfies Bernoulli distribution. The non-fragile switched LPV controllers are constructed with consideration of the uncertainties of controllers and asynchronous switching phenomenon. The parameter-dependent Lyapunov functional method and mode-dependent average dwell time (MDADT method are combined to guarantee the stability and prescribed performance of the system. The sufficient conditions on the solvability of the problem are derived in the form of linear matrix inequalities (LMI. In order to achieve higher efficiency of the designing process, an algorithm is applied to divide the whole set into subsets automatically. Simulation results are provided to verify the effectiveness and superiority of the method in the paper.

Systematic Sampling and Cluster Sampling of Packet Delays

OpenAIRE

Lindh, Thomas

2006-01-01

Based on experiences of a traffic flow performance meter this papersuggests and evaluates cluster sampling and systematic sampling as methods toestimate average packet delays. Systematic sampling facilitates for exampletime analysis, frequency analysis and jitter measurements. Cluster samplingwith repeated trains of periodically spaced sampling units separated by randomstarting periods, and systematic sampling are evaluated with respect to accuracyand precision. Packet delay traces have been ...

Long-term evolution and revival structure of Rydberg wave packets

International Nuclear Information System (INIS)

Bluhm, R.

1995-01-01

It is known that, after formation, a Rydberg wave packet undergoes a series of collapses and revivals within a time period called the revival time, t rev , at the end of which it is close to its original shape. We study the behavior of Rydberg wave packets on time scales much greater than t rev . We show that after a few revival cycles the wave packet ceases to reform at multiples of the revival time. Instead, a new series of collapses and revivals commences, culminating after a time period t sr >>t rev with the formation of a wave packet that more closely resembles the initial packet than does the full revival at time t rev . Furthermore, at times that are rational fractions of t sr , the square of the autocorrelation function exhibits large peaks with periodicities that can be expressed as fractions of the revival time t rev . These periodicities indicate a new type of fractional revival occurring for times much greater than t rev . A theoretical explanation of these effects is outlined. ((orig.))

Phase Structure of Strong-Field Tunneling Wave Packets from Molecules.

Science.gov (United States)

Liu, Ming-Ming; Li, Min; Wu, Chengyin; Gong, Qihuang; Staudte, André; Liu, Yunquan

2016-04-22

We study the phase structure of the tunneling wave packets from strong-field ionization of molecules and present a molecular quantum-trajectory Monte Carlo model to describe the laser-driven dynamics of photoelectron momentum distributions of molecules. Using our model, we reproduce and explain the alignment-dependent molecular frame photoelectron spectra of strong-field tunneling ionization of N_{2} reported by M. Meckel et al. [Nat. Phys. 10, 594 (2014)]. In addition to modeling the low-energy photoelectron angular distributions quantitatively, we extract the phase structure of strong-field molecular tunneling wave packets, shedding light on its physical origin. The initial phase of the tunneling wave packets at the tunnel exit depends on both the initial transverse momentum distribution and the molecular internuclear distance. We further show that the ionizing molecular orbital has a critical effect on the initial phase of the tunneling wave packets. The phase structure of the photoelectron wave packet is a key ingredient for modeling strong-field molecular photoelectron holography, high-harmonic generation, and molecular orbital imaging.

IMPACT OF BUFFER SIZE ON PQRS AND D-PQRS SCHEDULING ALGORITHMS

OpenAIRE

N. Narayanan Prasanth; Kannan Balasubramanian; R. Chithra Devi

2016-01-01

Most of the internet applications required high speed internet connectivity. Crosspoint Buffered Switches are widely used switching architectures and designing a scheduling algorithm is a major challenge. PQRS and D-PQRS are the two most successful schedulers used in Crosspoint Buffered Switches under unicast traffic. In this paper, we analysed the performance of PQRS and DPQRS algorithms by varying the crosspoint buffer size. Simulation result shows the delay performance of the switch increa...

Numerical simulation of the nonlinear dynamics of packets of spiral density waves

International Nuclear Information System (INIS)

Korchagin, V.I.

1987-01-01

In a numerical experiment, the behavior of nonlinear packets of spiral density waves in a gas disk has been investigated for different initial wave amplitudes. If the amplitude of the density perturbations is small (<5%), the wave packet is drawn toward the center or toward the periphery of the disk in accordance with the linear theory. The behavior of linear packets of waves with wavelength comparable to the disk radius (R/sub d//lambda = 4) exhibits good agreement with the conclusions of the linear theory of tightly wound spiral waves. The dynamics of wave packets with initial density amplitudes 16, 30, 50% demonstrates the nonlinear nature of the behavior. THe behavior is governed by whether or not the nonlinear effects of higher than third order in the wave amplitude play a part. If the wave packet dynamics is determined by the cubic nonlinearity, the results of the numerical experiment are in qualitative and quantitative agreement with the nonlinear theory of short waves, although the characteristic scale of the packet and the wavelength are of the order of the disk radius. In the cases when the nonlinear effects of higher orders in the amplitude play an important part, the behavior of a packet does not differ qualitatively from the behavior predicted by the theory of cubic nonlinearity, but the nonlinear spreading of the packet takes place more rapidly

Standard services for the capture, processing, and distribution of packetized telemetry data

Science.gov (United States)

Stallings, William H.

1989-01-01

Standard functional services for the capture, processing, and distribution of packetized data are discussed with particular reference to the future implementation of packet processing systems, such as those for the Space Station Freedom. The major functions are listed under the following major categories: input processing, packet processing, and output processing. A functional block diagram of a packet data processing facility is presented, showing the distribution of the various processing functions as well as the primary data flow through the facility.

Analysis Of Packets Delay In Wireless Data Networks

Directory of Open Access Journals (Sweden)

Krivchenkov Aleksandr

2015-12-01

Full Text Available The networks with wireless links for automation control applications traffic transmission when packets have small size and application payload is predictable are under consideration. Analytical model for packets delay on their propagation path through the network is proposed. Estimations for network architectures based on WiFi and Bluetooth wireless technologies are made. The specifications for physical layer 802.11 a/b/g/n and 802.15.1 are under consideration. Analytical and experimental results for delivered network bandwidth for different network architecture, traffic structure and wireless technologies were compared to validate that basic mechanisms are correctly taken into account in the model. It is shown that basic effects are taken into account and further accuracy “improvement” of the model will give not more than 5%. As a result that is important for automation control applications we have reliably received the lowest possible level for packets delay in one wireless link. For 802.11 it is of order of 0.2 ms, for 802.15.1 it is 1.25 ms and is true when application packet can be transferred by one data frame.

Mesoscopic states in graphene in magnetic field: collapse and revival of wave packets

International Nuclear Information System (INIS)

Demikhovskij, V.Ya.; Telezhnikov, A.V.; Frolova, E.V.; Kravets, N.A.

2013-01-01

The effects of wave packet collapse and revival in monolayer and bilayer graphene at an external perpendicular magnetic field are described. The evolution of electron wave packets, which are a superposition of the states with quantum numbers n around that of some Landau level n 0 was studied. The probability densities as well as average velocities of the packet center were calculated analytically and then visualized. The initial wave packet consisting only of positive energy decomposed into several subpackets at the moments t = (m/n)T R , where T R is the revival time and m, n are the mutually prime integers. Besides, it is shown that the behavior of a wave packet containing the states of both energy bands (with E n > 0 and E n < 0) is more complicated. Such packet splits into two parts, which rotate with a cyclotron frequency in the opposite directions, and then experience collapse and revival. The structure of multipole electromagnetic radiation of these packets is analyzed.

Multiwavelet packet entropy and its application in transmission line fault recognition and classification.

Science.gov (United States)

Liu, Zhigang; Han, Zhiwei; Zhang, Yang; Zhang, Qiaoge

2014-11-01

Multiwavelets possess better properties than traditional wavelets. Multiwavelet packet transformation has more high-frequency information. Spectral entropy can be applied as an analysis index to the complexity or uncertainty of a signal. This paper tries to define four multiwavelet packet entropies to extract the features of different transmission line faults, and uses a radial basis function (RBF) neural network to recognize and classify 10 fault types of power transmission lines. First, the preprocessing and postprocessing problems of multiwavelets are presented. Shannon entropy and Tsallis entropy are introduced, and their difference is discussed. Second, multiwavelet packet energy entropy, time entropy, Shannon singular entropy, and Tsallis singular entropy are defined as the feature extraction methods of transmission line fault signals. Third, the plan of transmission line fault recognition using multiwavelet packet entropies and an RBF neural network is proposed. Finally, the experimental results show that the plan with the four multiwavelet packet energy entropies defined in this paper achieves better performance in fault recognition. The performance with SA4 (symmetric antisymmetric) multiwavelet packet Tsallis singular entropy is the best among the combinations of different multiwavelet packets and the four multiwavelet packet entropies.

Further Results on Extended Delivery Time for Secondary Packet Transmission

KAUST Repository

Usman, Muneer

2017-07-10

Cognitive radio transceiver can opportunistically access the underutilized spectrum resource of primary systems for new wireless services. With interweave cognitive implementation, secondary transmission may be interrupted by primary transmission. To facilitate the packet delay analysis of such secondary transmission, we study the extended delivery time of secondary packet transmission. In particular, we derive the exact distribution function of extended delivery time of a fixed-size secondary packet with non-work-preserving strategy, where interrupted packets must be repeated. We also analyze the effect of imperfect periodic sensing, i.e., the secondary user periodically senses the spectrum for availability, with a chance of missing an available channel on a certain sensing attempt. These results complement previous work on work-preserving strategy with perfect sensing. Selected numerical and simulation results are presented for verifying the mathematical formulation.

Extended SVM algorithms for multilevel trans-Z-source inverter

Directory of Open Access Journals (Sweden)

Aida Baghbany Oskouei

2016-03-01

Full Text Available This paper suggests extended algorithms for multilevel trans-Z-source inverter. These algorithms are based on space vector modulation (SVM, which works with high switching frequency and does not generate the mean value of the desired load voltage in every switching interval. In this topology the output voltage is not limited to dc voltage source similar to traditional cascaded multilevel inverter and can be increased with trans-Z-network shoot-through state control. Besides, it is more reliable against short circuit, and due to several number of dc sources in each phase of this topology, it is possible to use it in hybrid renewable energy. Proposed SVM algorithms include the following: Combined modulation algorithm (SVPWM and shoot-through implementation in dwell times of voltage vectors algorithm. These algorithms are compared from viewpoint of simplicity, accuracy, number of switching, and THD. Simulation and experimental results are presented to demonstrate the expected representations.

Congestion control and routing over satellite networks

Science.gov (United States)

Cao, Jinhua

Satellite networks and transmissions find their application in fields of computer communications, telephone communications, television broadcasting, transportation, space situational awareness systems and so on. This thesis mainly focuses on two networking issues affecting satellite networking: network congestion control and network routing optimization. Congestion, which leads to long queueing delays, packet losses or both, is a networking problem that has drawn the attention of many researchers. The goal of congestion control mechanisms is to ensure high bandwidth utilization while avoiding network congestion by regulating the rate at which traffic sources inject packets into a network. In this thesis, we propose a stable congestion controller using data-driven, safe switching control theory to improve the dynamic performance of satellite Transmission Control Protocol/Active Queue Management (TCP/AQM) networks. First, the stable region of the Proportional-Integral (PI) parameters for a nominal model is explored. Then, a PI controller, whose parameters are adaptively tuned by switching among members of a given candidate set, using observed plant data, is presented and compared with some classical AQM policy examples, such as Random Early Detection (RED) and fixed PI control. A new cost detectable switching law with an interval cost function switching algorithm, which improves the performance and also saves the computational cost, is developed and compared with a law commonly used in the switching control literature. Finite-gain stability of the system is proved. A fuzzy logic PI controller is incorporated as a special candidate to achieve good performance at all nominal points with the available set of candidate controllers. Simulations are presented to validate the theory. An effocient routing algorithm plays a key role in optimizing network resources. In this thesis, we briefly analyze Low Earth Orbit (LEO) satellite networks, review the Cross Entropy (CE

Digital transceiver implementation for wavelet packet modulation

Science.gov (United States)

Lindsey, Alan R.; Dill, Jeffrey C.

1998-03-01

Current transceiver designs for wavelet-based communication systems are typically reliant on analog waveform synthesis, however, digital processing is an important part of the eventual success of these techniques. In this paper, a transceiver implementation is introduced for the recently introduced wavelet packet modulation scheme which moves the analog processing as far as possible toward the antenna. The transceiver is based on the discrete wavelet packet transform which incorporates level and node parameters for generalized computation of wavelet packets. In this transform no particular structure is imposed on the filter bank save dyadic branching, and a maximum level which is specified a priori and dependent mainly on speed and/or cost considerations. The transmitter/receiver structure takes a binary sequence as input and, based on the desired time- frequency partitioning, processes the signal through demultiplexing, synthesis, analysis, multiplexing and data determination completely in the digital domain - with exception of conversion in and out of the analog domain for transmission.

Airy Wave Packets Accelerating in Space-Time

Science.gov (United States)

Kondakci, H. Esat; Abouraddy, Ayman F.

2018-04-01

Although diffractive spreading is an unavoidable feature of all wave phenomena, certain waveforms can attain propagation invariance. A lesser-explored strategy for achieving optical self-similar propagation exploits the modification of the spatiotemporal field structure when observed in reference frames moving at relativistic speeds. For such an observer, it is predicted that the associated Lorentz boost can bring to a halt the axial dynamics of a wave packet of an arbitrary profile. This phenomenon is particularly striking in the case of a self-accelerating beam—such as an Airy beam—whose peak normally undergoes a transverse displacement upon free propagation. Here we synthesize an acceleration-free Airy wave packet that travels in a straight line by deforming its spatiotemporal spectrum to reproduce the impact of a Lorentz boost. The roles of the axial spatial coordinate and time are swapped, leading to "time diffraction" manifested in self-acceleration observed in the propagating Airy wave-packet frame.

Denoising GPS-Based Structure Monitoring Data Using Hybrid EMD and Wavelet Packet

Directory of Open Access Journals (Sweden)

Lu Ke

2017-01-01

Full Text Available High-frequency components are often discarded for data denoising when applying pure wavelet multiscale or empirical mode decomposition (EMD based approaches. Instead, they may raise the problem of energy leakage in vibration signals. Hybrid EMD and wavelet packet (EMD-WP is proposed to denoise Global Positioning System- (GPS- based structure monitoring data. First, field observables are decomposed into a collection of intrinsic mode functions (IMFs with different characteristics. Second, high-frequency IMFs are denoised using the wavelet packet; then the monitoring data are reconstructed using the denoised IMFs together with the remaining low-frequency IMFs. Our algorithm is demonstrated on a synthetic displacement response of a 3-story frame excited by El Centro earthquake along with a set of Gaussian random white noises on different levels added. We find that the hybrid method can effectively weaken the multipath effect with low frequency and can potentially extract vibration feature. However, false modals may still exist by the rest of the noise contained in the high-frequency IMFs and when the frequency of the noise is located in the same band as that of effective vibration. Finally, real GPS observables are implemented to evaluate the efficiency of EMD-WP method in mitigating low-frequency multipath.

A Pipelined IP Address Lookup Module for 100 Gbps Line Rates and beyond

Science.gov (United States)

Teuchert, Domenic; Hauger, Simon

New Internet services and technologies call for higher packet switching capacities in the core network. Thus, a performance bottleneck arises at the backbone routers, as forwarding of Internet Protocol (IP) packets requires to search the most specific entry in a forwarding table that contains up to several hundred thousand address prefixes. The Tree Bitmap algorithm provides a well-balanced solution in respect of storage needs as well as of search and update complexity. In this paper, we present a pipelined lookup module based on this algorithm, which allows for an easy adaption to diverse protocol and hardware constraints. We determined the pipelining degree required to achieve the throughput for a 100 Gbps router line card by analyzing a representative sub-unit for various configured sizes. The module supports IPv4 and IPv6 configurations providing this throughput, as we determined the performance of our design to achieve a processing rate of 178 million packets per second.

Optimal control of switched systems arising in fermentation processes

CERN Document Server

Liu, Chongyang

2014-01-01

The book presents, in a systematic manner, the optimal controls under different mathematical models in fermentation processes. Variant mathematical models – i.e., those for multistage systems; switched autonomous systems; time-dependent and state-dependent switched systems; multistage time-delay systems and switched time-delay systems – for fed-batch fermentation processes are proposed and the theories and algorithms of their optimal control problems are studied and discussed. By putting forward novel methods and innovative tools, the book provides a state-of-the-art and comprehensive systematic treatment of optimal control problems arising in fermentation processes. It not only develops nonlinear dynamical system, optimal control theory and optimization algorithms, but can also help to increase productivity and provide valuable reference material on commercial fermentation processes.

An improved packet structure

KAUST Repository

Bader, Ahmed

2014-01-01

A multihop network transmits a packet including a RACH area and a hop number. The RACH area includes a list of subcarriers. A source node in the network dynamically determines the size of the RACH area. A node in the network performs an open-loop transmit power control.

An improved packet structure

KAUST Repository

Bader, Ahmed

2014-05-22

A multihop network transmits a packet including a RACH area and a hop number. The RACH area includes a list of subcarriers. A source node in the network dynamically determines the size of the RACH area. A node in the network performs an open-loop transmit power control.

Quantum chaos induced by nonadiabatic coupling in wave-packet dynamics

International Nuclear Information System (INIS)

Higuchi, Hisashi; Takatsuka, Kazuo

2002-01-01

The effect of nonadiabatic coupling due to breakdown of the Born-Oppenheimer approximation on chaos is investigated. A couple of measures (indicators) that detect the extent of chaos in wave-packet dynamics on coupled potential functions are devised. Using them, we show that chaos is indeed induced by a nonadiabatic coupling in individual time-dependent wave-packet dynamics. This chaos is genuinely of quantum nature, since it arises from bifurcation and merging of a wave packet at the quasicrossing region of two coupled potential functions

Packet Header Compression for the Internet of Things

Directory of Open Access Journals (Sweden)

Pekka KOSKELA

2016-01-01

Full Text Available Due to the extensive growth of Internet of Things (IoT, the number of wireless devices connected to the Internet is forecasted to grow to 26 billion units installed in 2020. This will challenge both the energy efficiency of wireless battery powered devices and the bandwidth of wireless networks. One solution for both challenges could be to utilize packet header compression. This paper reviews different packet compression, and especially packet header compression, methods and studies the performance of Robust Header Compression (ROHC in low speed radio networks such as XBEE, and in high speed radio networks such as LTE and WLAN. In all networks, the compressing and decompressing processing causes extra delay and power consumption, but in low speed networks, energy can still be saved due to the shorter transmission time.

Strongly nonlinear evolution of low-frequency wave packets in a dispersive plasma

Science.gov (United States)

Vasquez, Bernard J.

1993-01-01

The evolution of strongly nonlinear, strongly modulated wave packets is investigated in a dispersive plasma using a hybrid numerical code. These wave packets have amplitudes exceeding the strength of the external magnetic field, along which they propagate. Alfven (left helicity) wave packets show strong steepening for p Schrodinger (DNLS) equation.

Low-Rate DDoS Attack Detection Using Expectation of Packet Size

Directory of Open Access Journals (Sweden)

Lu Zhou

2017-01-01

Full Text Available Low-rate Distributed Denial-of-Service (low-rate DDoS attacks are a new challenge to cyberspace, as the attackers send a large amount of attack packets similar to normal traffic, to throttle legitimate flows. In this paper, we propose a measurement—expectation of packet size—that is based on the distribution difference of the packet size to distinguish two typical low-rate DDoS attacks, the constant attack and the pulsing attack, from legitimate traffic. The experimental results, obtained using a series of real datasets with different times and different tolerance factors, are presented to demonstrate the effectiveness of the proposed measurement. In addition, extensive experiments are performed to show that the proposed measurement can detect the low-rate DDoS attacks not only in the short and long terms but also for low packet rates and high packet rates. Furthermore, the false-negative rates and the adjudication distance can be adjusted based on the detection sensitivity requirements.

Advanced optical components for next-generation photonic networks

Science.gov (United States)

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

Comparison of a noncausal with a causal relativistic wave-packet evolution

International Nuclear Information System (INIS)

Castro, A.N. de; Jabs, A.

1991-01-01

In order to study causality violation in more detail we contrast the Klein-Gordon wave packet of Rosenstein und Usher with the Dirac wave packet of Bakke and Wergeland. Both packets are initially localized with exponentially bounded tails but just outside the condition of the general Hegerfeldt theorem for causality violation. It turns out that the wave packet of Bakke and Wergeland exhibits all the features investigated by Rosenstein and Usher, except that it never violates relativistic causality. Thus none of those features, in particular the back- and forerunners emerging from the light cone, can be held responsible for causality violation, and the Ruijsenaars integral is not necessarily a measure of the amount of causality violation. (orig.)

Magnetic Helicity Conservation and Inverse Energy Cascade in Electron Magnetohydrodynamic Wave Packets

International Nuclear Information System (INIS)

Cho, Jungyeon

2011-01-01

Electron magnetohydrodynamics (EMHD) provides a fluidlike description of small-scale magnetized plasmas. An EMHD wave propagates along magnetic field lines. The direction of propagation can be either parallel or antiparallel to the magnetic field lines. We numerically study propagation of three-dimensional (3D) EMHD wave packets moving in one direction. We obtain two major results. (1) Unlike its magnetohydrodynamic (MHD) counterpart, an EMHD wave packet is dispersive. Because of this, EMHD wave packets traveling in one direction create opposite-traveling wave packets via self-interaction and cascade energy to smaller scales. (2) EMHD wave packets traveling in one direction clearly exhibit inverse energy cascade. We find that the latter is due to conservation of magnetic helicity. We compare inverse energy cascade in 3D EMHD turbulence and two-dimensional (2D) hydrodynamic turbulence.

Magnetic helicity conservation and inverse energy cascade in electron magnetohydrodynamic wave packets.

Science.gov (United States)

Cho, Jungyeon

2011-05-13

Electron magnetohydrodynamics (EMHD) provides a fluidlike description of small-scale magnetized plasmas. An EMHD wave propagates along magnetic field lines. The direction of propagation can be either parallel or antiparallel to the magnetic field lines. We numerically study propagation of three-dimensional (3D) EMHD wave packets moving in one direction. We obtain two major results. (1) Unlike its magnetohydrodynamic (MHD) counterpart, an EMHD wave packet is dispersive. Because of this, EMHD wave packets traveling in one direction create opposite-traveling wave packets via self-interaction and cascade energy to smaller scales. (2) EMHD wave packets traveling in one direction clearly exhibit inverse energy cascade. We find that the latter is due to conservation of magnetic helicity. We compare inverse energy cascade in 3D EMHD turbulence and two-dimensional (2D) hydrodynamic turbulence.

Energy efficient SDN commodity switch based practical flow forwarding method

KAUST Repository

AlGhadhban, Amer

2016-07-04

Recent SDN researches suffer from over-accumulation of unhealthy flow-load. Instead, we leverage the SDN controller network view to encode the end-to-end path information into the packet address. Our solution EncPath significantly reduces the flow-table size and the number of control messages. Consequently, the power consumption of network switches is in orders of magnitude less than other evaluated solutions. It also provides flow management flexibility and scalability. We compare EncPath with single and multipath routing solutions and single path solution. Also, we operated them in proactive and reactive modes. We find that EncPath flow entries in core switches in a multihomed fat-tree with 144 hosts is approximately 1000 times smaller than Equal-Cost MultiPath (ECMP) and random routing. Additionally, the number of control messages to setup the network is reduced by a factor of 200×. This, consequently, affords data-plane and control-plane devices space to process other tasks. © 2016 IEEE.

Channel Bonding in Linux Ethernet Environment using Regular Switching Hub

Directory of Open Access Journals (Sweden)

Chih-wen Hsueh

2004-06-01

Full Text Available Bandwidth plays an important role for quality of service in most network systems. There are many technologies developed to increase host bandwidth in a LAN environment. Most of them need special hardware support, such as switching hub that supports IEEE Link Aggregation standard. In this paper, we propose a Linux solution to increase the bandwidth between hosts with multiple network adapters connected to a regular switching hub. The approach is implemented as two Linux kernel modules in a LAN environment without modification to the hardware and operating systems on host machines. Packets are dispatched to bonding network adapters for transmission. The proposed approach is backward compatible, flexible and transparent to users and only one IP address is needed for multiple bonding network adapters. Evaluation experiments in TCP and UDP transmission are shown with bandwidth gain proportionally to the number of network adapters. It is suitable for large-scale LAN systems with high bandwidth requirement, such as clustering systems.

Green partial packet recovery in wireless sensor networks

KAUST Repository

Daghistani, Anas

2015-08-18

Partial packet recovery is well known for increasing network throughput and reducing frame retransmissions. However, partial packet recovery methods in the literature are not energy-aware and hence they are not suitable for the battery powered wireless sensor motes. We propose Green-Frag, a novel adaptive partial packet recovery mechanism that is energy friendly. It can help prolonging the battery life of wireless sensor motes that are usually resource constrained. It dynamically partitions the frame into smaller blocks to avoid dropping the whole frame due to a single bit error. Also, Green-Frag is able to tolerate high interference and save energy by varying the transmit power based on channel quality and interference pattern. We experimentally evaluate the energy efficiency as well as goodput and delay of Green-Frag using our TelosB sensor mote testbed. We find that Green-Frag reduces energy consumption by 33% on average compared to the state of the art partial packet recovery scheme in the literature in the presence of Wi-Fi interference. In the worst case, this reduction in energy consumption comes at the cost of 10% reduction in goodput. Finally, Green-Frag reduces the latency by 22% on average compared to other static frame fragmentation schemes.

Election '88: Teacher Packet.

Science.gov (United States)

North Carolina State Dept. of Public Instruction, Raleigh. Div. of Social Studies Education.

This materials packet contains information on teaching about the electoral process and the elections of 1988, and on participation in a mock election for students whose schools would take part in the 1988 North Carolina Mock Election. Suggestions for teachers' preparations are given, including a classroom skit and a mock candidates' election…

A Scalable Architecture for VoIP Conferencing

Directory of Open Access Journals (Sweden)

R Venkatesha Prasad

2003-10-01

Full Text Available Real-Time services are traditionally supported on circuit switched network. However, there is a need to port these services on packet switched network. Architecture for audio conferencing application over the Internet in the light of ITU-T H.323 recommendations is considered. In a conference, considering packets only from a set of selected clients can reduce speech quality degradation because mixing packets from all clients can lead to lack of speech clarity. A distributed algorithm and architecture for selecting clients for mixing is suggested here based on a new quantifier of the voice activity called "Loudness Number" (LN. The proposed system distributes the computation load and reduces the load on client terminals. The highlights of this architecture are scalability, bandwidth saving and speech quality enhancement. Client selection for playing out tries to mimic a physical conference where the most vocal participants attract more attention. The contributions of the paper are expected to aid H.323 recommendations implementations for Multipoint Processors (MP. A working prototype based on the proposed architecture is already functional.

Packet throughput performance of multiservice, multirate OCDMA in elastic networks

DEFF Research Database (Denmark)

Raddo, Thiago R.; Sanches, Anderson L.; Tafur Monroy, Idelfonso

2016-01-01

the multiple-access interference (MAI) as binomially distributed. The packet throughput expression, by its turn, is derived considering a Poisson distribution for the composite packet arrivals. Numerical results show that the multicode technique is a good candidate for future multiservice, multirate OCDMA...

Nonlinear-Based MEMS Sensors and Active Switches for Gas Detection

KAUST Repository

Bouchaala, Adam M.; 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.

Nonlinear-Based MEMS Sensors and Active Switches for Gas Detection

KAUST Repository

Bouchaala, Adam M.

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.

Science.gov (United States)

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.

Algorithms for energy efficiency in wireless sensor networks

Energy Technology Data Exchange (ETDEWEB)

Busse, M

2007-01-21

The recent advances in microsensor and semiconductor technology have opened a new field within computer science: the networking of small-sized sensors which are capable of sensing, processing, and communicating. Such wireless sensor networks offer new applications in the areas of habitat and environment monitoring, disaster control and operation, military and intelligence control, object tracking, video surveillance, traffic control, as well as in health care and home automation. It is likely that the deployed sensors will be battery-powered, which will limit the energy capacity significantly. Thus, energy efficiency becomes one of the main challenges that need to be taken into account, and the design of energy-efficient algorithms is a major contribution of this thesis. As the wireless communication in the network is one of the main energy consumers, we first consider in detail the characteristics of wireless communication. By using the embedded sensor board (ESB) platform recently developed by the Free University of Berlin, we analyze the means of forward error correction and propose an appropriate resync mechanism, which improves the communication between two ESB nodes substantially. Afterwards, we focus on the forwarding of data packets through the network. We present the algorithms energy-efficient forwarding (EEF), lifetime-efficient forwarding (LEF), and energy-efficient aggregation forwarding (EEAF). While EEF is designed to maximize the number of data bytes delivered per energy unit, LEF additionally takes into account the residual energy of forwarding nodes. In so doing, LEF further prolongs the lifetime of the network. Energy savings due to data aggregation and in-network processing are exploited by EEAF. Besides single-link forwarding, in which data packets are sent to only one forwarding node, we also study the impact of multi-link forwarding, which exploits the broadcast characteristics of the wireless medium by sending packets to several (potential

Algorithms for energy efficiency in wireless sensor networks

Energy Technology Data Exchange (ETDEWEB)

Busse, M.

2007-01-21

The recent advances in microsensor and semiconductor technology have opened a new field within computer science: the networking of small-sized sensors which are capable of sensing, processing, and communicating. Such wireless sensor networks offer new applications in the areas of habitat and environment monitoring, disaster control and operation, military and intelligence control, object tracking, video surveillance, traffic control, as well as in health care and home automation. It is likely that the deployed sensors will be battery-powered, which will limit the energy capacity significantly. Thus, energy efficiency becomes one of the main challenges that need to be taken into account, and the design of energy-efficient algorithms is a major contribution of this thesis. As the wireless communication in the network is one of the main energy consumers, we first consider in detail the characteristics of wireless communication. By using the embedded sensor board (ESB) platform recently developed by the Free University of Berlin, we analyze the means of forward error correction and propose an appropriate resync mechanism, which improves the communication between two ESB nodes substantially. Afterwards, we focus on the forwarding of data packets through the network. We present the algorithms energy-efficient forwarding (EEF), lifetime-efficient forwarding (LEF), and energy-efficient aggregation forwarding (EEAF). While EEF is designed to maximize the number of data bytes delivered per energy unit, LEF additionally takes into account the residual energy of forwarding nodes. In so doing, LEF further prolongs the lifetime of the network. Energy savings due to data aggregation and in-network processing are exploited by EEAF. Besides single-link forwarding, in which data packets are sent to only one forwarding node, we also study the impact of multi-link forwarding, which exploits the broadcast characteristics of the wireless medium by sending packets to several (potential

Trajectory description of the quantum–classical transition for wave packet interference

Energy Technology Data Exchange (ETDEWEB)

Chou, Chia-Chun, E-mail: ccchou@mx.nthu.edu.tw

2016-08-15

The quantum–classical transition for wave packet interference is investigated using a hydrodynamic description. A nonlinear quantum–classical transition equation is obtained by introducing a degree of quantumness ranging from zero to one into the classical time-dependent Schrödinger equation. This equation provides a continuous description for the transition process of physical systems from purely quantum to purely classical regimes. In this study, the transition trajectory formalism is developed to provide a hydrodynamic description for the quantum–classical transition. The flow momentum of transition trajectories is defined by the gradient of the action function in the transition wave function and these trajectories follow the main features of the evolving probability density. Then, the transition trajectory formalism is employed to analyze the quantum–classical transition of wave packet interference. For the collision-like wave packet interference where the propagation velocity is faster than the spreading speed of the wave packet, the interference process remains collision-like for all the degree of quantumness. However, the interference features demonstrated by transition trajectories gradually disappear when the degree of quantumness approaches zero. For the diffraction-like wave packet interference, the interference process changes continuously from a diffraction-like to collision-like case when the degree of quantumness gradually decreases. This study provides an insightful trajectory interpretation for the quantum–classical transition of wave packet interference.

New hybrid frequency reuse method for packet loss minimization in LTE network.

Science.gov (United States)

Ali, Nora A; El-Dakroury, Mohamed A; El-Soudani, Magdi; ElSayed, Hany M; Daoud, Ramez M; Amer, Hassanein H

2015-11-01

This paper investigates the problem of inter-cell interference (ICI) in Long Term Evolution (LTE) mobile systems, which is one of the main problems that causes loss of packets between the base station and the mobile station. Recently, different frequency reuse methods, such as soft and fractional frequency reuse, have been introduced in order to mitigate this type of interference. In this paper, minimizing the packet loss between the base station and the mobile station is the main concern. Soft Frequency Reuse (SFR), which is the most popular frequency reuse method, is examined and the amount of packet loss is measured. In order to reduce packet loss, a new hybrid frequency reuse method is implemented. In this method, each cell occupies the same bandwidth of the SFR, but the total system bandwidth is greater than in SFR. This will provide the new method with a lot of new sub-carriers from the neighboring cells to reduce the ICI which represents a big problem in many applications and causes a lot of packets loss. It is found that the new hybrid frequency reuse method has noticeable improvement in the amount of packet loss compared to SFR method in the different frequency bands. Traffic congestion management in Intelligent Transportation system (ITS) is one of the important applications that is affected by the packet loss due to the large amount of traffic that is exchanged between the base station and the mobile node. Therefore, it is used as a studied application for the proposed frequency reuse method and the improvement in the amount of packet loss reached 49.4% in some frequency bands using the new hybrid frequency reuse method.

Optimization of photovoltaic energy production through an efficient switching matrix

Directory of Open Access Journals (Sweden)

Pietro Romano

2013-09-01

Full Text Available This work presents a preliminary study on the implementation of a new system for power output maximization of photovoltaic generators under non-homogeneous conditions. The study evaluates the performance of an efficient switching matrix and the relevant automatic reconfiguration control algorithms. The switching matrix is installed between the PV generator and the inverter, allowing a large number of possible module configurations. PV generator, switching matrix and the intelligent controller have been simulated in Simulink. The proposed reconfiguration system improved the energy extracted by the PV generator under non-uniform solar irradiation conditions. Short calculation times of the proposed control algorithms allow its use in real time applications even where a higher number of PV modules is required.

Personal Skills. Facilitator's Skill Packets 1-7. Social Skills Training.

Science.gov (United States)

Model Classrooms, Bellevue, WA.

This document contains the following seven facilitators' skill packets on personal skills: (1) personal hygiene; (2) personal appearance; (3) locker hygiene; (4) dorm cleanliness; (5) punctuality and attendance; (6) responding to supervision; and (7) teamwork. Each packet contains the following sections: definition of personal skills; objective;…

Packetized Predictive Control for Rate-Limited Networks via Sparse Representation

DEFF Research Database (Denmark)

Nagahara, Masaaki; Quevedo, Daniel; Østergaard, Jan

2012-01-01

controller and the plant input. To achieve robustness with respect to dropouts, the controller transmits data packets containing plant input predictions, which minimize a finite horizon cost function. In our formulation, we design sparse packets for rate-limited networks, by adopting an an ℓ0 optimization...

Wave packet formulation of the boomerang model for resonant electron--molecule scattering

International Nuclear Information System (INIS)

McCurdy, C.W.; Turner, J.L.

1983-01-01

A time-dependent formulation of the boomerang model for resonant electron--molecule scattering is presented in terms of a wave packet propagating on the complex potential surface of the metastable anion. The results of calculations using efficient semiclassical techniques for propagating the wave packet are found to be in excellent agreement with full quantum-mechanical calculations of vibrational excitation cross sections in e - --N 2 scattering. The application of the wave packet formulation as a computational and conceptual approach to the problem of resonant collisions with polyatomic molecules is discussed in the light of recent wave packet calculations on polyatomic photodissociation and Raman spectra

SIMULASI JARINGAN KOMPUTER MENGGUNAKAN CISCO PACKET TRACER

Directory of Open Access Journals (Sweden)

M Mufadhol

2012-01-01

Full Text Available Perkembangan jaringan komputer saat ini begitu pesat, monitoring jaringan komputer akan menjadi suatu hal yang sulit dan rumit. Koneksi jaringan komputer merupakan suatu hal yang mendasar dalam suatu jaringan, karena bila koneksi itu bermasalah maka semua jenis aplikasi yang dijalankan melalui jaringan komputer tidak dapat digunakan. Cisco packet tracer dapat digunakan untuk simulasi yang mencerminkan arsitektur dan juga model dari jaringan komputer pada sistem jaringan yang digunakan. Dengan menggunakan aplikasi cisco packet tracer, simulasi mengenai jaringan dapat dimanfaatkan menjadi informasi tentang keadaan koneksi komputer dalam suatu jaringan.

Controlling the spreading of wave packets of a dissociating molecule

DEFF Research Database (Denmark)

Tiwari, Ashwani Kumar; Møller, Klaus Braagaard; Henriksen, Niels Engholm

2007-01-01

A first-order perturbation theoretic approach within the electric-dipole approximation is used to study the time evolution of wave packets created by linearly chirped laser pulses on a repulsive potential of Br-2. Our calculations show that negatively chirped pulses focus the wave packet in the F...

Research on distributed QOS routing algorithm based on TCP/IP

Science.gov (United States)

Liu, Xiaoyue; Chen, Yongqiang

2011-10-01

At present, network environment follow protocol standard of IPV4 is intended to do the best effort of network to provide network applied service for users, however, not caring about service quality.Thus the packet loss rate is high, it cannot reach an ideal applied results. This article through the establishment of mathematical model, put forward a new distributed multi QOS routing algorithm, given the realization process of this distributed QOS routing algorithm, and simulation was carried out by simulation software. The results show the proposed algorithm can improve the utilization rate of network resources and the service quality of network application.

Power Balance AODV Routing Algorithm of WSN in Precision Agriculture Environment Monitoring

Directory of Open Access Journals (Sweden)

Xiaoqin Qin

2013-11-01

Full Text Available As one of important technologies of IOT (Internet of Things, WSN (Wireless Sensor Networks has been widely used in precision agriculture environment monitoring. WSN is a kind of energy-constrained network, but power balance is not taken into account in traditional routing protocols. A novel routing algorithm, named Power Balance Ad hoc On-Demand Distance Vector (PB-AODV, is proposed on cross-layer design. In the route discovery process of PB-AODV, routing path is established by the Received Signal Strength Indication (RSSI value. The optimal transmitting power, which is computed according to RSSI value, power threshold and node’s surplus energy, is encapsulated into Route Reply Packet. Hence, the sender node can adjust its transmission power to save energy according to the Route Reply Packet. Simulation results show that the proposed algorithm is effective for load balancing, and increases the WSN’s lifetime 14.3% consequently.

Nonlinear-Based MEMS Sensors and Active Switches for Gas Detection

Directory of Open Access Journals (Sweden)

Adam Bouchaala

2016-05-01

Full Text Available 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

Science.gov (United States)

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

Non-intrusive Packet-Layer Model for Monitoring Video Quality of IPTV Services

Science.gov (United States)

Yamagishi, Kazuhisa; Hayashi, Takanori

Developing a non-intrusive packet-layer model is required to passively monitor the quality of experience (QoE) during service. We propose a packet-layer model that can be used to estimate the video quality of IPTV using quality parameters derived from transmitted packet headers. The computational load of the model is lighter than that of the model that takes video signals and/or video-related bitstream information such as motion vectors as input. This model is applicable even if the transmitted bitstream information is encrypted because it uses transmitted packet headers rather than bitstream information. For developing the model, we conducted three extensive subjective quality assessments for different encoders and decoders (codecs), and video content. Then, we modeled the subjective video quality assessment characteristics based on objective features affected by coding and packet loss. Finally, we verified the model's validity by applying our model to unknown data sets different from training data sets used above.

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

Hangyu Fan

2018-01-01

Full Text Available 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.

Efficient Radio Resource Allocation in a GSM and GPRS Cellular Network

Directory of Open Access Journals (Sweden)

David Vannucci

2004-10-01

Full Text Available This paper investigates the effect of various radio resource allocation strategies in a GSM/GPRS cellular network. The most efficient resource allocation is analysed as a function of the proportion of circuit switched voice and packet switched data load. The Grade of Service and average packet delay is investigated as a function of the load, packet size and call duration. Additionally, the feasibility of using voice over Internet Protocol as opposed to circuit switched voice is investigated as a means to increase subscriber capacity per base station. The work is motivated firstly by the complexity of having both circuit switched and packet switched connectivity on GSM/GPRS mobile cellular system and secondly that an exclusively packet based access on GSM/GPRS has the potential to increase the efficiency of resource utilisation by suitably varying the channel allocation to exploit the characteristics of voice and data traffic.

Foreign Material in the Gastrointestinal Tract: Cocaine Packets

Directory of Open Access Journals (Sweden)

Nurten Turkel Kucukmetin

2014-01-01

Full Text Available Smuggling drugs by swallowing or inserting into a body cavity is not only a serious and growing international crime, but can also lead to lethal medical complications. The most common cause of death in ‘body packers', people transporting drugs by ingesting a packet into the gastrointestinal tract, is acute drug toxicity from a ruptured packet. However, more than 30 years after the initial report of body packing, there is still no definitive treatment protocol for the management of this patient group. The treatment strategy is determined according to the particular condition of the patient and the clinical experience of the treatment center. Surgical intervention is also less common now, due to both the use of improved packaging materials among smugglers and a shift towards a more conservative medical approach. Herein, we report a case of toxicity from ingested packets of cocaine that leaked and, despite surgery, resulted in exitus of the patient.

Runge-Lenz wave packet in multichannel Stark photoionization

International Nuclear Information System (INIS)

Texier, F.

2005-01-01

In a previous slow photoionization experiment, modulations of ionization rings were manifested for Xe in a constant electric field. The present quantum calculation reveals that the modulation is an effect of the multichannel core scattering and of tunneling waves through the Coulomb-Stark potential barrier: the barrier reduces the number of oscillations that is observed relatively to the number of oscillations of the short range wave functions, and the nonhydrogenic core phase shifts modify the position of the ionization rings. We find a hidden difference, in the ionization process, for two close values of the energy depending on the resonance with the barrier. The ionization intensity is interpreted as a Runge-Lenz wave packet; thus, we can relate the quantum modulation to the classical Coulomb-Stark trajectories. The Runge-Lenz wave packet differs from a usual temporal wave packet because its components are eigenstates of the Runge-Lenz vector z projection and its evolution is not temporal but spatial

Uncertainty Margin of Void Packet Determination for Ultrasonic Test in NPP

International Nuclear Information System (INIS)

Lee, Seungchan; Sung, Jejung; Lee, Jongchan; Kim, Jonguk

2014-01-01

In this study, the uncertainty of the void packet determination is estimated and the conservatism is reviewed by comparing with realistic uncertainty of Heckle's uncertainty. The methodology of ISO GUM is fully applied to calculate uncertainty, combined uncertainty and effective degree of freedom. Here some results are achieved as below: Combined uncertainty(UT) : 4.98%, Combined uncertainty(Heckle) : 1.44%, Degree of freedom: 5 ∼ 15, Effective degree of freedom(UT): 24.11, Effective degree of freedom(Heckle): 28.54, K value of t-distribution(UT): 2.042, K value of t-distribution(Heckle): 2.04, The uncertainty of this study using UT is enough in the case of achieving conservatism when the void packet determination of the safety related system is determined. As result of this study, UT uncertainty is more conservative than the Heckle's realistic uncertainty. From these results, it is shown that UT method has the great safety margin in determining the void packet. In comparing UT uncertainty with realistic uncertainty, this study (UT) has the conservatism of more than 3.4 times. UT method is good method to determine the void packet of ECCS pipe and to achieve the safety margin. In a safety related system, a void packet determination is issued by US NRC through the Generic Letter 2008-01. In case of the safety function, ECCS, CSS, and RHR systems are affected by the void packet. The related study has been being carried out by KHNP since 2012. In this study, the void packet determination using a ultra sonic test method has been carried out in some sites. This paper shows the uncertainty of the method using the ultra sonic test. The key parameters are introduced and estimated. Specially, the measurement conservatism for NPP is introduced to show the uncertainty margin

Uncertainty Margin of Void Packet Determination for Ultrasonic Test in NPP

Energy Technology Data Exchange (ETDEWEB)

Lee, Seungchan; Sung, Jejung [Korea Hydro Nuclear Power Electricity Co., Daejeon (Korea, Republic of); Lee, Jongchan; Kim, Jonguk [FNC Technology Co., LTD., Yongin (Korea, Republic of)

2014-05-15

In this study, the uncertainty of the void packet determination is estimated and the conservatism is reviewed by comparing with realistic uncertainty of Heckle's uncertainty. The methodology of ISO GUM is fully applied to calculate uncertainty, combined uncertainty and effective degree of freedom. Here some results are achieved as below: Combined uncertainty(UT) : 4.98%, Combined uncertainty(Heckle) : 1.44%, Degree of freedom: 5 ∼ 15, Effective degree of freedom(UT): 24.11, Effective degree of freedom(Heckle): 28.54, K value of t-distribution(UT): 2.042, K value of t-distribution(Heckle): 2.04, The uncertainty of this study using UT is enough in the case of achieving conservatism when the void packet determination of the safety related system is determined. As result of this study, UT uncertainty is more conservative than the Heckle's realistic uncertainty. From these results, it is shown that UT method has the great safety margin in determining the void packet. In comparing UT uncertainty with realistic uncertainty, this study (UT) has the conservatism of more than 3.4 times. UT method is good method to determine the void packet of ECCS pipe and to achieve the safety margin. In a safety related system, a void packet determination is issued by US NRC through the Generic Letter 2008-01. In case of the safety function, ECCS, CSS, and RHR systems are affected by the void packet. The related study has been being carried out by KHNP since 2012. In this study, the void packet determination using a ultra sonic test method has been carried out in some sites. This paper shows the uncertainty of the method using the ultra sonic test. The key parameters are introduced and estimated. Specially, the measurement conservatism for NPP is introduced to show the uncertainty margin.

Continuity-Aware Scheduling Algorithm for Scalable Video Streaming

Directory of Open Access Journals (Sweden)

Atinat Palawan

2016-05-01

Full Text Available The consumer demand for retrieving and delivering visual content through consumer electronic devices has increased rapidly in recent years. The quality of video in packet networks is susceptible to certain traffic characteristics: average bandwidth availability, loss, delay and delay variation (jitter. This paper presents a scheduling algorithm that modifies the stream of scalable video to combat jitter. The algorithm provides unequal look-ahead by safeguarding the base layer (without the need for overhead of the scalable video. The results of the experiments show that our scheduling algorithm reduces the number of frames with a violated deadline and significantly improves the continuity of the video stream without compromising the average Y Peek Signal-to-Noise Ratio (PSNR.

Detection of ingested cocaine-filled packets-Diagnostic value of unenhanced CT

International Nuclear Information System (INIS)

Schmidt, Sabine; Hugli, Olivier; Rizzo, Elena; Lepori, Domenico; Gudinchet, F.; Yersin, Bertrand; Schnyder, Pierre; Meuwly, Jean-Yves

2008-01-01

Purpose: Emergency departments are facing nowadays an increasing number of illegal drug-related health problems, associated with medicolegal and/or social consequences. Body stuffers are street cocaine dealers, who either store wrapped packets of drugs in their rectum or hastily swallow them, prompted by fear of police's arrest. These packets can be life threatening in case of leakage. We evaluate the diagnostic value of unenhanced multidetector CT (MDCT) for detection of cocaine-filled packets (CFP) ingested by body stuffers in a phantom model. Materials and methods: Our phantom simulated normal bowel contents in which a varying number of true and false CFP were randomly mixed. Both only differ in radiological density. During 18 different reading sessions, four radiologists independently evaluated the presence and number of true and false CFP. Interobserver agreement, sensitivity, specificity, positive and negative predictive value were calculated. Results: Interobserver agreement for detection of any packets, for visualization of true, and false CFP was good (κ = 0.63, 0.74 and 0.58, respectively). Sensitivity, specificity, positive and negative predictive value for detection of any packets was 95.6%, 100%, 100% and 62.5%, respectively; for visualization of the true CFP 86.5%, 100%, 100% and 77.6%, respectively; and for the false packets 98.1%, 65%, 88.6% and 87.5%, respectively. Conclusion: Unenhanced MDCT without bowel preparation is a fast, reliable and easily reproducible imaging modality for the immediate detection of ingested CFP, thus facilitating medicolegal management of body stuffers

SECURE SERVICE DISCOVERY BASED ON PROBE PACKET MECHANISM FOR MANETS

Directory of Open Access Journals (Sweden)

S. Pariselvam

2015-03-01

Full Text Available In MANETs, Service discovery process is always considered to be crucial since they do not possess a centralized infrastructure for communication. Moreover, different services available through the network necessitate varying categories. Hence, a need arises for devising a secure probe based service discovery mechanism to reduce the complexity in providing the services to the network users. In this paper, we propose a Secure Service Discovery Based on Probe Packet Mechanism (SSDPPM for identifying the DoS attack in MANETs, which depicts a new approach for estimating the level of trust present in each and every routing path of a mobile ad hoc network by using probe packets. Probing based service discovery mechanisms mainly identifies a mobile node’s genuineness using a test packet called probe that travels the entire network for the sake of computing the degree of trust maintained between the mobile nodes and it’s attributed impact towards the network performance. The performance of SSDPPM is investigated through a wide range of network related parameters like packet delivery, throughput, Control overhead and total overhead using the version ns-2.26 network simulator. This mechanism SSDPPM, improves the performance of the network in an average by 23% and 19% in terms of packet delivery ratio and throughput than the existing service discovery mechanisms available in the literature.

A Digital Hysteresis Current Control for Half-Bridge Inverters with Constrained Switching Frequency

Directory of Open Access Journals (Sweden)

Triet Nguyen-Van

2017-10-01

Full Text Available This paper proposes a new robustly adaptive hysteresis current digital control algorithm for half-bridge inverters, which plays an important role in electric power, and in various applications in electronic systems. The proposed control algorithm is assumed to be implemented on a high-speed Field Programmable Gate Array (FPGA circuit, using measured data with high sampling frequency. The hysteresis current band is computed in each switching modulation period based on both the current error and the negative half switching period during the previous modulation period, in addition to the conventionally used voltages measured at computation instants. The proposed control algorithm is derived by solving the optimization problem—where the switching frequency is always constrained at below the desired constant frequency—which is not guaranteed by the conventional method. The optimization problem also keeps the output current stable around the reference, and minimizes power loss. Simulation results show good performances of the proposed algorithm compared with the conventional one.

Coherent wave packet dynamics in a double-well potential in cavity

Science.gov (United States)

Zheng, Li; Li, Gang; Ding, Ming-Song; Wang, Yong-Liang; Zhang, Yun-Cui

2018-02-01

We investigate the coherent wave packet dynamics of a two-level atom trapped in a symmetric double-well potential in a near-resonance cavity. Prepared on one side of the double-well potential, the atom wave packet oscillates between the left and right wells, while recoil induced by the emitted photon from the atom entangles the atomic internal and external degrees of freedom. The collapse and revival of the tunneling occurs. Adjusting the width of the wave packets, one can modify the tunneling frequency and suppress the tunneling.

Turbulent Spot Pressure Fluctuation Wave Packet Model

Energy Technology Data Exchange (ETDEWEB)

Dechant, Lawrence J. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2017-05-01

Wave packet analysis provides a connection between linear small disturbance theory and subsequent nonlinear turbulent spot flow behavior. The traditional association between linear stability analysis and nonlinear wave form is developed via the method of stationary phase whereby asymptotic (simplified) mean flow solutions are used to estimate dispersion behavior and stationary phase approximation are used to invert the associated Fourier transform. The resulting process typically requires nonlinear algebraic equations inversions that can be best performed numerically, which partially mitigates the value of the approximation as compared to a more complete, e.g. DNS or linear/nonlinear adjoint methods. To obtain a simpler, closed-form analytical result, the complete packet solution is modeled via approximate amplitude (linear convected kinematic wave initial value problem) and local sinusoidal (wave equation) expressions. Significantly, the initial value for the kinematic wave transport expression follows from a separable variable coefficient approximation to the linearized pressure fluctuation Poisson expression. The resulting amplitude solution, while approximate in nature, nonetheless, appears to mimic many of the global features, e.g. transitional flow intermittency and pressure fluctuation magnitude behavior. A low wave number wave packet models also recover meaningful auto-correlation and low frequency spectral behaviors.

ICC Experiment Performance Improvement through Advanced Feedback Controllers for High-Power Low-Cost Switching Power Amplifiers

International Nuclear Information System (INIS)

Nelson, Brian A.

2006-01-01

Limited resources force most smaller fusion energy research experiments to have little or no feedback control of their operational parameters, preventing achievement of their full operational potential. Recent breakthroughs in high-power switching technologies have greatly reduced feedback-controlled power supply costs, primarily those classified as switching power amplifiers. However, inexpensive and flexible controllers for these power supplies have not been developed. A uClinux-based micro-controller (Analog Devices Blackfin BF537) was identified as having the capabilities to form the base of a digital control system for switching power amplifiers. A control algorithm was created, and a Linux character device driver was written to realize the algorithm. The software and algorithm were successfully tested on a switching power amplifier and magnetic field coil using University of Washington (subcontractor) resources

H-Infinity Control Design Considering Packet Loss as a Disturbance for Networked Control Systems

OpenAIRE

OGURA, Takashi; KOBAYASHI, Kentaro; OKADA, Hiraku; KATAYAMA, Masaaki

2017-01-01

This paper studies H∞ control for networked control systems with packet loss. In networked control systems, packet loss is one of major weakness because the control performance deteriorates due to packet loss. H∞ control, which is one of robust control, can design a controller to reduce the influence of disturbances acting on the controlled object. This paper proposes an H∞ control design that considers packet loss as a disturbance. Numerical examples show that the proposed H∞ control design ...

Position-Based Packet Forwarding for Vehicular Ad-Hoc Networks

OpenAIRE

Füßler, Holger

2007-01-01

Mobile Ad-Hoc Networks, or MANETs, are data communication networks between (potentially) mobile computer systems equipped with wireless communication devices and — in their purest form — in complete absence of communication infrastructure. Usage scenarios for these systems include communication during disaster recovery or battlefield communications. One of the great research challenges concerning MANETs is the Packet Forwarding Problem, i.e., the question to which neighbor node a data packet ...

Zeno dynamics in wave-packet diffraction spreading

Energy Technology Data Exchange (ETDEWEB)

Porras, Miguel A. [Departamento de Fisica Aplicada, Universidad Politecnica de Madrid, Rios Rosas 21, ES-28003 Madrid (Spain); Luis, Alfredo; Gonzalo, Isabel [Departamento de Optica, Facultad de Ciencias Fisicas, Universidad Complutense, ES-28040 Madrid (Spain); Sanz, Angel S. [Instituto de Fisica Fundamental-CSIC, Serrano 123, ES-28006 Madrid (Spain)

2011-11-15

We analyze a simple and feasible practical scheme displaying Zeno, anti-Zeno, and inverse-Zeno effects in the observation of wave-packet spreading caused by free evolution. The scheme is valid both in spatial diffraction of classical optical waves and in time diffraction of a quantum wave packet. In the optical realization, diffraction spreading is observed by placing slits between a light source and a light-power detector. We show that the occurrence of Zeno or anti-Zeno effects depends just on the frequency of observations between the source and detector. These effects are seen to be related to the diffraction mode theory in Fabry-Perot resonators.

Estimation of Frame Independent and Enhancement Components for Speech Communication over Packet Networks

DEFF Research Database (Denmark)

Giacobello, Daniele; Murthi, Manohar N.; Christensen, Mads Græsbøll

2010-01-01

In this paper, we describe a new approach to cope with packet loss in speech coders. The idea is to split the information present in each speech packet into two components, one to independently decode the given speech frame and one to enhance it by exploiting interframe dependencies. The scheme...... is based on sparse linear prediction and a redefinition of the analysis-by-synthesis process. We present Mean Opinion Scores for the presented coder with different degrees of packet loss and show that it performs similarly to frame dependent coders for low packet loss probability and similarly to frame...

Improving Packet Processing Performance in the ATLAS FELIX Project

CERN Document Server

AUTHOR|(SzGeCERN)752705; The ATLAS collaboration; Anderson, John Thomas; Borga, Andrea; Boterenbrood, Hendrik; Chen, Hucheng; Chen, Kai; Drake, Gary; Francis, David; Gorini, Benedetto; Lanni, Francesco; Lehmann Miotto, Giovanna; Levinson, Lorne; Narevicius, Julia; Plessl, Christian; Roich, Alexander; Ryu, Soo; Schreuder, Frans Philip; Vandelli, Wainer; Zhang, Jinlong; Vermeulen, Jos

2015-01-01

Experiments in high-energy physics (HEP) and related fields often impose constraints and challenges on data acquisition systems. As a result, these systems are implemented as unique mixtures of custom and commercial-off-the-shelf electronics (COTS), involving and connecting radiation-hard devices, large high-performance networks, and computing farms. FELIX, the Frontend Link Exchange, is a new PC-based general purpose data routing device for the data-acquisition system of the ATLAS experiment at CERN. Performance is a very crucial point for devices like FELIX, which have to be capable of processing tens of gigabyte of data per second. Thus it is important to understand the performance limitations for typical workloads on modern hardware. We present an analysis of a packet processing algorithm that is used in FELIX, and show how the PC system's memory architecture plays a key factor in the overall data throughput achieved by the application. Finally, we present optimizations that increase the processing throug...

Langston Hughes Curriculum Packet: Dig and Be Dug in Return.

Science.gov (United States)

Danielson, Susan

Designed in a flexible format for use by college instructors, high school teachers, and community education workers, this curriculum packet serves as an introduction to the life and works of black poet Langston Hughes. The major component of the packet is a critical essay that explores the thematic highlights of Hughes's career. The remaining…

Manifestations of wave packet revivals in the moments of observables

International Nuclear Information System (INIS)

Sudheesh, C.; Lakshmibala, S.; Balakrishnan, V.

2004-01-01

Using a generic Hamiltonian that models wave packet propagation in a Kerr-like medium, matter wave field dynamics in Bose-Einstein condensation, etc., we show that distinctive signatures of wave packet revivals and fractional revivals are displayed by the time evolution of the expectation values of appropriate observables, enabling selective identification of different fractional revivals

Switched diversity strategies for dual-hop amplify-and-forward relaying systems

KAUST Repository

Gaaloul, Fakhreddine

2012-01-01

This study investigates different receive single-branch switch-based diversity schemes for dual-hop amplify-and-forward relaying networks. Specifically, three receive processing algorithms are adopted, in which the receive branch is selected using the arbitrary selection algorithm, the switching algorithm, or the switching algorithm with post-examining best branch selection. The identification of the receive branch is carried out for two different system models. For the first model, a single-antenna relaying station is used in conjunction with a multiple-antenna transceiver, where the processing is performed independently of the first hop-fading conditions. The second model suggests the use of parallel deployment of single-antenna relays to transfer information from a multiple-antenna transmitter to a single-antenna receiver, where the active relaying station is determined based on the pre-combining end-to-end fading conditions. Performance comparisons for various transmission scenarios on the first hop are presented using new formulations for the statistics of the combined signal-to-noise ratio. Simulation results are also provided to validate the mathematical development and to verify the numerical computations. © 2012 The Institution of Engineering and Technology.

Attosecond Electron Wave Packet Dynamics in Strong Laser Fields

International Nuclear Information System (INIS)

Johnsson, P.; Remetter, T.; Varju, K.; L'Huillier, A.; Lopez-Martens, R.; Valentin, C.; Balcou, Ph.; Kazamias, S.; Mauritsson, J.; Gaarde, M. B.; Schafer, K. J.; Mairesse, Y.; Wabnitz, H.; Salieres, P.

2005-01-01

We use a train of sub-200 attosecond extreme ultraviolet (XUV) pulses with energies just above the ionization threshold in argon to create a train of temporally localized electron wave packets. We study the energy transfer from a strong infrared (IR) laser field to the ionized electrons as a function of the delay between the XUV and IR fields. When the wave packets are born at the zero crossings of the IR field, a significant amount of energy (∼20 eV) is transferred from the field to the electrons. This results in dramatically enhanced above-threshold ionization in conditions where the IR field alone does not induce any significant ionization. Because both the energy and duration of the wave packets can be varied independently of the IR laser, they are valuable tools for studying and controlling strong-field processes

Review of Rateless-Network-Coding-Based Packet Protection in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

A. S. Abdullah

2015-01-01

Full Text Available In recent times, there have been many developments in wireless sensor network (WSN technologies using coding theory. Fast and efficient protection schemes for data transfer over the WSN are some of the issues in coding theory. This paper reviews the issues related to the application of the joint rateless-network coding (RNC within the WSN in the context of packet protection. The RNC is a method in which any node in the network is allowed to encode and decode the transmitted data in order to construct a robust network, improve network throughput, and decrease delays. To the best of our knowledge, there has been no comprehensive discussion about RNC. To begin with, this paper briefly describes the concept of packet protection using network coding and rateless codes. We therefore discuss the applications of RNC for improving the capability of packet protection. Several works related to this issue are discussed. Finally, the paper concludes that the RNC-based packet protection scheme is able to improve the packet reception rate and suggests future studies to enhance the capability of RNC protection.

Packetized Media Streaming with Comprehensive Exploitation of Feedback Information

OpenAIRE

De Vleeschouwer, C.; Frossard, P.

2005-01-01

This paper addresses the problem of streaming packetized media over a lossy packet network, with sender-driven (re)transmission using acknowledgement feedback. The different transmission scenarios associated to a group of interdependent media data units are abstracted in terms of a finite alphabet of policies, for each single data unit. A rate-distortion optimized markovian framework is proposed, which supports the use of comprehensive feedback information. Contrarily to previous works in rat...

On wave-packet dynamics in a decaying quadratic potential

DEFF Research Database (Denmark)

Møller, Klaus Braagaard; Henriksen, Niels Engholm

1997-01-01

We consider the time-dependent Schrodinger equation for a quadratic potential with an exponentially decaying force constant. General analytical solutions are presented and we highlight in particular, the signatures of classical mechanics in the wave packet dynamics.......We consider the time-dependent Schrodinger equation for a quadratic potential with an exponentially decaying force constant. General analytical solutions are presented and we highlight in particular, the signatures of classical mechanics in the wave packet dynamics....

Hidden Markov Model-based Packet Loss Concealment for Voice over IP

DEFF Research Database (Denmark)

Rødbro, Christoffer A.; Murthi, Manohar N.; Andersen, Søren Vang

2006-01-01

As voice over IP proliferates, packet loss concealment (PLC) at the receiver has emerged as an important factor in determining voice quality of service. Through the use of heuristic variations of signal and parameter repetition and overlap-add interpolation to handle packet loss, conventional PLC...

Evolution of a wave packet scattered by a one-dimensional potential

International Nuclear Information System (INIS)

Khachatrian, A Zh; Alexanyan, Al G; Khoetsyan, V A; Alexanyan, N A

2013-01-01

We consider the evolution of a wave packet that is made up of a group of the wave functions describing the stationary scattering process and tunnels through a one-dimensional potential of arbitrary form. As the main characteristics of the time difference of the tunnelling process, use is made of the propagation speed of the wave-packet maximum. We show that the known Hartman formula for the tunnelling time corresponds to the wave packet with a wavenumber-uniform spectral composition in the case, when the phase and transmission coefficient modulus dispersions are taken into account only in the linear approximation. The amplitude of the main peak of the transmitted wave intensity is proven to be independent of the tunnelling time and is determined by the transmission coefficient of the spectral component at the carrier frequency and the spectral width of the wave packet. In the limit of an infinitely wide potential barrier the amplitude of the wave-packet maximum is shown to tend to zero slower than the tunnelling time tends to its asymptotic value, i.e., indeed we deal with the paradox of an infinitely large propagation speed of a wave disturbance through the barrier. (propagation of wave fronts)

Evolution of a wave packet scattered by a one-dimensional potential

Energy Technology Data Exchange (ETDEWEB)

Khachatrian, A Zh; Alexanyan, Al G; Khoetsyan, V A; Alexanyan, N A

2013-06-30

We consider the evolution of a wave packet that is made up of a group of the wave functions describing the stationary scattering process and tunnels through a one-dimensional potential of arbitrary form. As the main characteristics of the time difference of the tunnelling process, use is made of the propagation speed of the wave-packet maximum. We show that the known Hartman formula for the tunnelling time corresponds to the wave packet with a wavenumber-uniform spectral composition in the case, when the phase and transmission coefficient modulus dispersions are taken into account only in the linear approximation. The amplitude of the main peak of the transmitted wave intensity is proven to be independent of the tunnelling time and is determined by the transmission coefficient of the spectral component at the carrier frequency and the spectral width of the wave packet. In the limit of an infinitely wide potential barrier the amplitude of the wave-packet maximum is shown to tend to zero slower than the tunnelling time tends to its asymptotic value, i.e., indeed we deal with the paradox of an infinitely large propagation speed of a wave disturbance through the barrier. (propagation of wave fronts)

Dynamics of electron wave packet in a disordered chain with delayed nonlinear response

International Nuclear Information System (INIS)

Zhu Hongjun; Xiong Shijie

2010-01-01

We investigate the dynamics of one electron wave packet in a linear chain with random on-site energies and a nonadiabatic electron-phonon interaction which is described by a delayed cubic nonlinear term in the time-dependent Schroedinger equation. We show that in the regime where the wave packet is delocalized in the case with only the delayed nonlinearity, the wave packet becomes localized when the disorder is added and the localization is enhanced by increasing the disorder. In the regime where the self-trapping phenomenon occurs in the case with only the delayed nonlinearity, by adding the disorder the general dynamical features of the wave packet do not change if the nonlinearity parameter is small, but the dynamics shows the subdiffusive behavior if the nonlinearity parameter is large. The numerical results demonstrate complicated wave packet dynamics of systems with both the disorder and nonlinearity.

Antisymmetrized molecular dynamics of wave packets with stochastic incorporation of Vlasov equation

International Nuclear Information System (INIS)

Ono, Akira; Horiuchi, Hisashi.

1996-01-01

The first purpose of this report is to present an extended AMD model which can generally describe such minor branching processes by removing the restriction on the one-body distribution function. This is done not by generalizing the wave packets to arbitrary single-particle wave functions but by representing the diffused and/or deformed wave packet as an ensemble of Gaussian wave packets. In other words, stochastic displacements are given to the wave packets in phase space so that the ensemble-average of the time evolution of the one-body distribution function is essentially equivalent to the solution of Vlasov equation which does not have any restriction on the shape of wave packets. This new model is called AMD-V. Although AMD-V is equivalent to Vlasov equation in the instantaneous time evolution of the one-body distribution function for an AMD wave function, AMD-V describes the branching into channels and the fluctuation of the mean field which are caused by the spreading or the splitting of the single-particle wave function. The second purpose of this report is to show the drastic effect of this new stochastic process of wave packet splitting on the dynamics of heavy ion collisions, especially in the fragmentation mechanism. We take the 40 Ca + 40 Ca system at the incident energy 35 MeV/nucleon. It will be shown that the reproduction of data by the AMD-V calculation is surprisingly good. We will see that the effect of the wave packet diffusion is crucially important to remove the spurious binary feature of the AMD calculation and to enable the multi-fragment final state. (J.P.N.)

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

Science.gov (United States)

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.

An asynchronous data-driven event-building scheme based on ATM switching fabrics

International Nuclear Information System (INIS)

Letheren, M.; Christiansen, J.; Mandjavidze, I.; Verhille, H.; De Prycker, M.; Pauwels, B.; Petit, G.; Wright, S.; Lumley, J.

1994-01-01

The very high data rates expected in experiments at the next generation of high luminosity hadron colliders will be handled by pipelined front-end readout electronics and multiple levels (2 or 3) of triggering. A variety of data acquisition architectures have been proposed for use downstream of the first level trigger. Depending on the architecture, the aggregate bandwidths required for event building are expected to be of the order 10--100 Gbit/s. Here, an Asynchronous Transfer Mode (ATM) packet-switching network technology is proposed as the interconnect for building high-performance, scalable data acquisition architectures. This paper introduces the relevant characteristics of ATM and describes components for the construction of an ATM-based event builder: (1) a multi-path, self-routing, scalable ATM switching fabric, (2) an experimental high performance workstation ATM-interface, and (3) a VMEbus ATM-interface. The requirement for traffic shaping in ATM-based event-builders is discussed and an analysis of the performance of several such schemes is presented

Optical frame synchronizer for 10 G Ethernet packets aiming at 1 Tb/s OTDM Ethernet

DEFF Research Database (Denmark)

Hu, Hao; Palushani, Evarist; Laguardia Areal, Janaina

2010-01-01

Synchronization of 10 G Ethernet packets to a local clock was demonstrated using a phase modulator and a SMF as retiming elements. Error free performances for the synchronized packets with different lengths were achieved.......Synchronization of 10 G Ethernet packets to a local clock was demonstrated using a phase modulator and a SMF as retiming elements. Error free performances for the synchronized packets with different lengths were achieved....

Nonspreading Wave Packets for Rydberg Electrons in Rotating Molecules with Electric Dipole Moments

International Nuclear Information System (INIS)

Bialynicki-Birula, I.; Bialynicka-Birula, Z.

1996-01-01

Nonspreading wave packets for Rydberg electrons are predicted in rotating molecules with electric dipole moments. We have named them the Trojan wave packets since their stability is due to the same mechanism that governs the motion of the Trojan asteroids in the Sun-Jupiter system. Unlike all previously predicted Trojan wave packets in atoms, molecular Trojan states do not require external fields for their existence

Square-integrable wave packets from the Volkov solutions

International Nuclear Information System (INIS)

Zakowicz, Stephan

2005-01-01

Rigorous mathematical proofs of some properties of the Volkov solutions are presented, which describe the motion of a relativistic charged Dirac particle in a classical, plane electromagnetic wave. The Volkov solutions are first rewritten in a convenient form, which clearly reveals some of the symmetries of the underlying Dirac equation. Assuming continuity and boundedness of the electromagnetic vector potential, it is shown how one may construct square-integrable wave packets from momentum distributions in the space C 0 ∞ (R 3 ) 4 . If, in addition, the vector potential is C 1 and the derivative is bounded, these wave packets decay in space faster than any polynomial and fulfill the Dirac equation. The mapping which takes momentum distributions into wave packets is shown to be isometric with respect to the L 2 (R 3 ) 4 norm and may therefore be continuously extended to a mapping from L 2 (R 3 ) 4 . For a momentum function in L 1 (R 3 ) 4 intersection L 2 (R 3 ) 4 , an integral representation of this extension is presented

Square-Integrable Wave Packets from the Volkov Solutions

CERN Document Server

Zakowicz, S

2004-01-01

Rigorous mathematical proofs of some properties of the Volkov solutions are presented, which describe the motion of a relativistic charged Dirac particle in a classical, plane electromagnetic wave. The Volkov solutions are first rewritten in a convenient form, which clearly reveals some of the symmetries of the underlying Dirac equation. Assuming continuity and boundedness of the electromagnetic vector potential, it is shown how one may construct square-integrable wave packets from momentum distributions in the space $\\mathcal{C}^{\\infty}_0(\\mathbb{R}^3)^4$. If, in addition, the vector potential is $\\mathcal{C}^1$ and the derivative is bounded, these wave packets decay in space faster than any polynomial and fulfill the Dirac equation. The mapping which takes momentum distributions into wave packets is shown to be isometric with respect to the $L^2(\\mathbb{R}^3)^4$ norm and may therefore be continuously extended to a mapping from $L^2(\\mathbb{R}^3)^4$. For a momen! tum function in $L^1(\\mathbb{R}^3)^4 \\cap L^...

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

Science.gov (United States)

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.

Data Transparent and Polarization Insensitive All-Optical Switch based on Fibers with Enhanced Nonlinearity

Directory of Open Access Journals (Sweden)

M. Komanec

2014-09-01

Full Text Available We have developed a data transparent optical packet switch prototype employing wavelength conversion based on four-wave mixing. The switch is composed of an electro-optical control unit and an all-optical switching segment. To achieve higher switching efficiencies, Ge-doped silica suspended-core and chalcogenide arsenicselenide single-mode fibers were experimentally evaluated and compared to conventional highly-nonlinear fiber. Improved connectorization technology has been developed for Ge-doped suspended-core fiber, where we achieved connection losses of 0.9 dB. For the arsenic-selenide fiber we present a novel solid joint technology, with connection losses of only 0.25 dB, which is the lowest value presented up-to-date. Conversion efficiency of -13.7 dB was obtained for the highly-nonlinear fiber, which is in perfect correlation with previously published results and thus verifies the functionality of the prototype. Conversion efficiency of -16.1 dB was obtained with arsenic-selenide fiber length reduced to five meters within simulations, based on measurement results with a 26 m long component. Employment of such a short arsenic-selenide fiber segment allows significant broadening of the wavelength conversion spectral range due to possible neglection of dispersion.

EYE CONTROLLED SWITCHING USING CIRCULAR HOUGH TRANSFORM

OpenAIRE

Sagar Lakhmani

2014-01-01

The paper presents hands free interface between electrical appliances or devices. This technology is intended to replace conventional switching devices for the use of disabled. It is a new way to interact with the electrical or electronic devices that we use in our daily life. The paper illustrates how the movement of eye cornea and blinking can be used for switching the devices. The basic Circle Detection algorithm is used to determine the position of eye. Eye blinking is used...

Source Authentication for Code Dissemination Supporting Dynamic Packet Size in Wireless Sensor Networks.

Science.gov (United States)

Kim, Daehee; Kim, Dongwan; An, Sunshin

2016-07-09

Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption.

Throughput performance analysis of multirate, multiclass S-ALOHA OFFH-CDMA packet networks

DEFF Research Database (Denmark)

Raddo, Thiago R.; Sanches, Anderson L.; Borges, Ben Hur V

2015-01-01

In this paper, we propose a new throughput expression for multirate, multiclass slotted-ALOHA optical fast frequency hopping code-division multiple-access (OFFH-CDMA) packet networks considering a Poisson distribution for packet composite arrivals. We analyze the packet throughput performance...... of a three-class OFFH-CDMA network, where multirate transmissions are achieved via manipulation of the user's code parameters. It is shown that users transmitting at low rates interfere considerably in the performance of high rate users. Finally, we perform a validation procedure to demonstrate...

Packets of resonant modes in the Fermi–Pasta–Ulam system

International Nuclear Information System (INIS)

Genta, Tommaso; Giorgilli, Antonio; Paleari, Simone; Penati, Tiziano

2012-01-01

We reconsider the phenomenon of localization of energy in low frequency modes in the FPU system, exploiting the resonances in the lower part of the spectrum. Using the resonant normal form of Birkhoff we construct some candidates of approximate first integrals which we put in correspondence to packets of low frequency modes. By numerical calculation we show that the packet associated to the best quasi-integral involves all modes up to a frequency ω ⁎ (ε), where ε is the specific energy. The phenomenon disappears when the specific energy is bigger than a threshold value. The dependence of the relevant quantities on the number N of particles is also investigated. A final section is devoted to a first comparison with the Toda model. -- Highlights: ► We study the role of resonances for energy localization and metastability in the FPU model. ► We construct an approximated first integral associated to the metastable state. ► We propose to identify the metastable state as a packet of resonant modes. ► The packet extend up to a frequency ω ⁎ (ε), which depends only on the specific energy ε.

Packets of resonant modes in the Fermi–Pasta–Ulam system

Energy Technology Data Exchange (ETDEWEB)

Genta, Tommaso, E-mail: tomgenta@gmail.com [Università degli Studi di Milano, Corso di Laurea in Matematica, Via C. Saldini 50, 20133 Milano (Italy); Giorgilli, Antonio, E-mail: antonio.giorgilli@unimi.it [Università degli Studi di Milano, Dipartimento di Matematica, Via C. Saldini 50, 20133 Milano (Italy); Paleari, Simone, E-mail: simone.paleari@unimi.it [Università degli Studi di Milano, Dipartimento di Matematica, Via C. Saldini 50, 20133 Milano (Italy); Penati, Tiziano, E-mail: tiziano.penati@unimi.it [Università degli Studi di Milano, Dipartimento di Matematica, Via C. Saldini 50, 20133 Milano (Italy)

2012-06-04

We reconsider the phenomenon of localization of energy in low frequency modes in the FPU system, exploiting the resonances in the lower part of the spectrum. Using the resonant normal form of Birkhoff we construct some candidates of approximate first integrals which we put in correspondence to packets of low frequency modes. By numerical calculation we show that the packet associated to the best quasi-integral involves all modes up to a frequency ω{sup ⁎}(ε), where ε is the specific energy. The phenomenon disappears when the specific energy is bigger than a threshold value. The dependence of the relevant quantities on the number N of particles is also investigated. A final section is devoted to a first comparison with the Toda model. -- Highlights: ► We study the role of resonances for energy localization and metastability in the FPU model. ► We construct an approximated first integral associated to the metastable state. ► We propose to identify the metastable state as a packet of resonant modes. ► The packet extend up to a frequency ω{sup ⁎}(ε), which depends only on the specific energy ε.

Synchronous Ethernet- Considerations and Implementation of the Packet Network Management Scheme

Science.gov (United States)

Gundale, A. S.; Aradhye, Ashwini

2010-11-01

Packet technologies were designed to work in asynchronous mode, where the oscillators in the equipment are free running. Although this allows the underlying infrastructure to operate, many applications exist that require frequency synchronization. Also, the ability to distribute synchronization from center to edge of network declines as infrastructure evolves toward a packet-based architecture. Synchronous Ethernet (SyncE) is a key development of the evolution of Ethernet into a carrier grade technology suitable for the WAN environment where frequency synchronization is required. The time of the day distribution in synchronized network at the physical layer enables many useful propositions in packet handling policies and other network management aspects.

Sensitivity of the optimal parameter settings for a LTE packet scheduler

NARCIS (Netherlands)

Fernandez-Diaz, I.; Litjens, R.; van den Berg, C.A.; Dimitrova, D.C.; Spaey, K.

Advanced packet scheduling schemes in 3G/3G+ mobile networks provide one or more parameters to optimise the trade-off between QoS and resource efficiency. In this paper we study the sensitivity of the optimal parameter setting for packet scheduling in LTE radio networks with respect to various

An analytical model for perpetual network codes in packet erasure channels

DEFF Research Database (Denmark)

Pahlevani, Peyman; Crisostomo, Sergio; Roetter, Daniel Enrique Lucani

2016-01-01

is highly dependent on a parameter called the width (ωω), which represents the number of consecutive non-zero coding coefficient present in each coded packet after a pivot element. We provide a mathematical analysis based on the width of the coding vector for the number of transmitted packets and validate...

Parametric Packet-Layer Model for Evaluation Audio Quality in Multimedia Streaming Services

Science.gov (United States)

Egi, Noritsugu; Hayashi, Takanori; Takahashi, Akira

We propose a parametric packet-layer model for monitoring audio quality in multimedia streaming services such as Internet protocol television (IPTV). This model estimates audio quality of experience (QoE) on the basis of quality degradation due to coding and packet loss of an audio sequence. The input parameters of this model are audio bit rate, sampling rate, frame length, packet-loss frequency, and average burst length. Audio bit rate, packet-loss frequency, and average burst length are calculated from header information in received IP packets. For sampling rate, frame length, and audio codec type, the values or the names used in monitored services are input into this model directly. We performed a subjective listening test to examine the relationships between these input parameters and perceived audio quality. The codec used in this test was the Advanced Audio Codec-Low Complexity (AAC-LC), which is one of the international standards for audio coding. On the basis of the test results, we developed an audio quality evaluation model. The verification results indicate that audio quality estimated by the proposed model has a high correlation with perceived audio quality.

Dynamical behavior of the wave packets on adiabatic potential surfaces observed by femtosecond luminescence spectroscopy

International Nuclear Information System (INIS)

Suemoto, Tohru; Nakajima, Makoto; Matsuoka, Taira; Yasukawa, Keizo; Koyama, Takeshi

2007-01-01

The wave packet dynamics on adiabatic potential surfaces studied by means of time-resolved luminescence spectroscopy is reviewed and the advantages of this method are discussed. In quasi-one-dimensional bromine-bridged platinum complexes, a movie representing the time evolution of the wave packet motion and shape was constructed. A two-dimensional Lissajous-like motion of the wave packet was suggested in the same material at low temperature. In F-centers in KI, evidence for tunneling of the wave packet between the adjacent adiabatic potential surfaces was found. Selective observation of the wave packet motion on the excited state was demonstrated for F-centers in KBr and compared with the results from pump-and-probe experiments in literature

Burst Format Design for Optimum Joint Estimation of Doppler-Shift and Doppler-Rate in Packet Satellite Communications

Directory of Open Access Journals (Sweden)

Luca Giugno

2007-05-01

Full Text Available This paper considers the problem of optimizing the burst format of packet transmission to perform enhanced-accuracy estimation of Doppler-shift and Doppler-rate of the carrier of the received signal, due to relative motion between the transmitter and the receiver. Two novel burst formats that minimize the Doppler-shift and the Doppler-rate Cramér-Rao bounds (CRBs for the joint estimation of carrier phase/Doppler-shift and of the Doppler-rate are derived, and a data-aided (DA estimation algorithm suitable for each optimal burst format is presented. Performance of the newly derived estimators is evaluated by analysis and by simulation, showing that such algorithms attain their relevant CRBs with very low complexity, so that they can be directly embedded into new-generation digital modems for satellite communications at low SNR.

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

Science.gov (United States)

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.

Efficient incremental relaying for packet transmission over fading channels

KAUST Repository

Fareed, Muhammad Mehboob

2014-07-01

In this paper, we propose a novel relaying scheme for packet transmission over fading channels, which improves the spectral efficiency of cooperative diversity systems by utilizing limited feedback from the destination. Our scheme capitalizes on the fact that relaying is only required when direct transmission suffers deep fading. We calculate the packet error rate for the proposed efficient incremental relaying (EIR) scheme with both amplify and forward and decode and forward relaying. We compare the performance of the EIR scheme with the threshold-based incremental relaying (TIR) scheme. It is shown that the efficiency of the TIR scheme is better for lower values of the threshold. However, the efficiency of the TIR scheme for higher values of threshold is outperformed by the EIR. In addition, three new threshold-based adaptive EIR are devised to further improve the efficiency of the EIR scheme. We calculate the packet error rate and the efficiency of these new schemes to provide the analytical insight. © 2014 IEEE.

Method to optimize optical switch topology for photonic network-on-chip

Science.gov (United States)

Zhou, Ting; Jia, Hao

2018-04-01

In this paper, we propose a method to optimize the optical switch by substituting optical waveguide crossings for optical switching units and an optimizing algorithm to complete the optimization automatically. The functionality of the optical switch remains constant under optimization. With this method, we simplify the topology of optical switch, which means the insertion loss and power consumption of the whole optical switch can be effectively minimized. Simulation result shows that the number of switching units of the optical switch based on Spanke-Benes can be reduced by 16.7%, 20%, 20%, 19% and 17.9% for the scale from 4 × 4 to 8 × 8 respectively. As a proof of concept, the experimental demonstration of an optimized six-port optical switch based on Spanke-Benes structure by means of silicon photonics chip is reported.

Hunger and Development [Issue Packet].

Science.gov (United States)

American Freedom from Hunger Foundation, Washington, DC.

A variety of informational materials is compiled in this issue packet concentrating on hunger and development. They have been assembled to understand the issues associated with the facts of world hunger and to try to invent new forms of action and thought necessary to find the possibilities hidden in the hunger issue. Items include: (1) a fact and…

Event-Triggered Fault Estimation for Stochastic Systems over Multi-Hop Relay Networks with Randomly Occurring Sensor Nonlinearities and Packet Dropouts.

Science.gov (United States)

Li, Yunji; Peng, Li

2018-02-28

Wireless sensors have many new applications where remote estimation is essential. Considering that a remote estimator is located far away from the process and the wireless transmission distance of sensor nodes is limited, sensor nodes always forward data packets to the remote estimator through a series of relays over a multi-hop link. In this paper, we consider a network with sensor nodes and relay nodes where the relay nodes can forward the estimated values to the remote estimator. An event-triggered remote estimator of state and fault with the corresponding data-forwarding scheme is investigated for stochastic systems subject to both randomly occurring nonlinearity and randomly occurring packet dropouts governed by Bernoulli-distributed sequences to achieve a trade-off between estimation accuracy and energy consumption. Recursive Riccati-like matrix equations are established to calculate the estimator gain to minimize an upper bound of the estimator error covariance. Subsequently, a sufficient condition and data-forwarding scheme are presented under which the error covariance is mean-square bounded in the multi-hop links with random packet dropouts. Furthermore, implementation issues of the theoretical results are discussed where a new data-forwarding communication protocol is designed. Finally, the effectiveness of the proposed algorithms and communication protocol are extensively evaluated using an experimental platform that was established for performance evaluation with a sensor and two relay nodes.

Subjective Quality Assessment of H.264/AVC Video Streaming with Packet Losses

Directory of Open Access Journals (Sweden)

Naccari Matteo

2011-01-01

Full Text Available Research in the field of video quality assessment relies on the availability of subjective scores, collected by means of experiments in which groups of people are asked to rate the quality of video sequences. The availability of subjective scores is fundamental to enable validation and comparative benchmarking of the objective algorithms that try to predict human perception of video quality by automatically analyzing the video sequences, in a way to support reproducible and reliable research results. In this paper, a publicly available database of subjective quality scores and corrupted video sequences is described. The scores refer to 156 sequences at CIF and 4CIF spatial resolutions, encoded with H.264/AVC and corrupted by simulating the transmission over an error-prone network. The subjective evaluation has been performed by 40 subjects at the premises of two academic institutions, in standard-compliant controlled environments. In order to support reproducible research in the field of full-reference, reduced-reference, and no-reference video quality assessment algorithms, both the uncompressed files and the H.264/AVC bitstreams, as well as the packet loss patterns, have been made available to the research community.

Performance evaluation of packet video transfer over local area networks

OpenAIRE

Lu, Jie

1993-01-01

This research investigates the implementation and performance of packet video transfer over local area networks. A network architecture is defined for packet video such that most of the processing is performed by the higher layers of the Open Systems Interconnection (OSI) reference model, while the lower layers provide real-time services. Implementation methods are discussed for coding schemes, including data compression, the network interface unit, and the underlying local are...

78 FR 10263 - Proposed Collection; Comment Request for ADA Accommodations Request Packet

Science.gov (United States)

2013-02-13

... DEPARTMENT OF THE TREASURY Internal Revenue Service Proposed Collection; Comment Request for ADA... the ADA Accommodations Packet. DATES: Written comments should be received on or before April 15, 2013...: ADA Accommodations Request Packet. OMB Number: 1545-2027. Abstract: Information is collected so that...

Conditions for Model Matching of Switched Asynchronous Sequential Machines with Output Feedback

OpenAIRE

Jung–Min Yang

2016-01-01

Solvability of the model matching problem for input/output switched asynchronous sequential machines is discussed in this paper. The control objective is to determine the existence condition and design algorithm for a corrective controller that can match the stable-state behavior of the closed-loop system to that of a reference model. Switching operations and correction procedures are incorporated using output feedback so that the controlled switched machine can show the ...

Easements in Texas. Teachers Instructional Packet, TIP No. 5, Spring 1985.

Science.gov (United States)

Texas A and M Univ., College Station. Texas Real Estate Research Center.

Part of a series of classroom aids designed for real estate instructors, this instructional packet was developed to help real estate students understand public and private easements, which most commonly entail the right of a person (or the public) to use the land of another in a certain manner. Following an evaluation form for the packet, a…

A Case Study of IPv6 Network Performance: Packet Delay, Loss, and Reordering

Directory of Open Access Journals (Sweden)

Fuliang Li

2017-01-01

Full Text Available Internet Protocol (IP is used to identify and locate computers on the Internet. Currently, IPv4 still routes most Internet traffic. However, with the exhausting of IPv4 addresses, the transition to IPv6 is imminent, because, as the successor of IPv4, IPv6 can provide a larger available address space. Existing studies have addressed the notion that IPv6-centric next generation networks are widely deployed and applied. In order to gain a deep understanding of IPv6, this paper revisits several critical IPv6 performance metrics. Our extensive measurement shows that packet delay and loss rate of IPv6 are similar to IPv4 when the AS-level paths are roughly the same. Specifically, when the link utilization exceeds a threshold, for example, 0.83 in our study, variation of packet delay presents a similar pattern with the variation of link utilization. If packet delay of a path is large, packet-loss rate of that path is more likely to fluctuate. In addition, we conduct a first-ever analysis of packet reordering in IPv6 world. Few IPv6 probe packets are out-of-order and the reordering rate is 2.3⁎10-6, which is much lower than that of 0.79% in IPv4 world. Our analysis consolidates an experimental basis for operators and researchers of IPv6 networks.

Geometrical aspects in optical wave-packet dynamics.

Science.gov (United States)

Onoda, Masaru; Murakami, Shuichi; Nagaosa, Naoto

2006-12-01

We construct a semiclassical theory for propagation of an optical wave packet in a nonconducting medium with a periodic structure of dielectric permittivity and magnetic permeability, i.e., a nonconducting photonic crystal. We employ a quantum-mechanical formalism in order to clarify its link to those of electronic systems. It involves the geometrical phase, i.e., Berry's phase, in a natural way, and describes an interplay between orbital motion and internal rotation. Based on the above theory, we discuss the geometrical aspects of the optical Hall effect. We also consider a reduction of the theory to a system without periodic structure and apply it to the transverse shift of an optical beam at an interface reflection or refraction. For a generic incident beam with an arbitrary polarization, an identical result for the transverse shift of each reflected or transmitted beam is given by the following different approaches: (i) analytic evaluation of wave-packet dynamics, (ii) total angular momentum (TAM) conservation for individual photons, and (iii) numerical simulation of wave-packet dynamics. It is consistent with a result by classical electrodynamics. This means that the TAM conservation for individual photons is already taken into account in wave optics, i.e., classical electrodynamics. Finally, we show an application of our theory to a two-dimensional photonic crystal, and propose an optimal design for the enhancement of the optical Hall effect in photonic crystals.

Customized lifting multiwavelet packet information entropy for equipment condition identification

International Nuclear Information System (INIS)

Chen, Jinglong; Zi, Yanyang; He, Zhengjia; Chen, Xuefeng; Zuo, Ming J; Yuan, Jing

2013-01-01

Condition identification of mechanical equipment from vibration measurement data is significant to avoid economic loss caused by unscheduled breakdowns and catastrophic accidents. However, this task still faces challenges due to the complexity of equipment and the harsh environment. This paper provides a possibility for equipment condition identification by proposing a method called customized lifting multiwavelet packet information entropy. Benefiting from the properties of multi-resolution analysis and multiple wavelet basis functions, the multiwavelet method has advantages in characterizing non-stationary vibration signals. In order to realize the accurate detection and identification of the condition features, a customized lifting multiwavelet packet is constructed via a multiwavelet lifting scheme. Then the vibration signal from the mechanical equipment is processed by the customized lifting multiwavelet packet transform. The relative energy in each frequency band of the multiwavelet packet transform coefficients that equals a percentage of the whole signal energy is taken as the probability. The normalized information entropy is obtained based on the relative energy to describe the condition of a mechanical system. The proposed method is applied to the condition identification of a rolling mill and a demountable disk–drum aero-engine. The results support the feasibility of the proposed method in equipment condition identification. (paper)

Simulation of the collapse and dissipation of Langmuir wave packets

International Nuclear Information System (INIS)

Newman, D.L.; Winglee, R.M.; Robinson, P.A.; Glanz, J.; Goldman, M.V.

1990-01-01

The collapse of isolated Langmuir wave packets is studied numerically in two dimensions using both particle-in-cell (PIC) simulations and by integrating the Zakharov partial differential equations (PDE's). The initial state consists of a localized Langmuir wave packet in an ion background that either is uniform or has a profile representative of the density wells in which wave packets form during strong plasma turbulence. Collapse thresholds are determined numerically and compared to analytical estimates. A model in which Langmuir damping is significantly stronger than Landau damping is constructed which, when included in the PDE simulations, yields good agreement with the collapse dynamics observed in PIC simulations for wave packets with initial wave energy densities small compared to the thermal level. For more intense initial Langmuir fields, collapse is arrested in PIC simulations at lower field strengths than in PDE simulations. Neither nonlinear saturation of the density perturbation nor fluid electron nonlinearities can account for the difference between simulation methods in this regime. However, at these wave levels inhomogeneous electron heating and coherent jets of transit-time accelerated electrons in phase space are observed, resulting in further enhancement of wave damping and the consequent reduction of fields in the PIC simulations

Synchronization, retiming and OTDM of an asynchronous 10 Gigabit Ethernet NRZ packet using a time lens for Terabit Ethernet

DEFF Research Database (Denmark)

Hu, Hao; Laguardia Areal, Janaina; Mulvad, Hans Christian Hansen

2011-01-01

An asynchronous 10G Ethernet packet is synchronized and retimed to a master clock using a time lens. The NRZ packet is converted into an RZ packet and multiplexed with a serial 1.28 Tb/s signal.......An asynchronous 10G Ethernet packet is synchronized and retimed to a master clock using a time lens. The NRZ packet is converted into an RZ packet and multiplexed with a serial 1.28 Tb/s signal....

An algorithm for constructing Lyapunov functions

Directory of Open Access Journals (Sweden)

Sigurdur Freyr Hafstein

2007-08-01

Full Text Available In this monograph we develop an algorithm for constructing Lyapunov functions for arbitrary switched dynamical systems $dot{mathbf{x}} = mathbf{f}_sigma(t,mathbf{x}$, possessing a uniformly asymptotically stable equilibrium. Let $dot{mathbf{x}}=mathbf{f}_p(t,mathbf{x}$, $pinmathcal{P}$, be the collection of the ODEs, to which the switched system corresponds. The number of the vector fields $mathbf{f}_p$ on the right-hand side of the differential equation is assumed to be finite and we assume that their components $f_{p,i}$ are $mathcal{C}^2$ functions and that we can give some bounds, not necessarily close, on their second-order partial derivatives. The inputs of the algorithm are solely a finite number of the function values of the vector fields $mathbf{f}_p$ and these bounds. The domain of the Lyapunov function constructed by the algorithm is only limited by the size of the equilibrium's region of attraction. Note, that the concept of a Lyapunov function for the arbitrary switched system $dot{mathbf{x}} = mathbf{f}_sigma(t,mathbf{x}$ is equivalent to the concept of a common Lyapunov function for the systems $dot{mathbf{x}}=mathbf{f}_p(t,mathbf{x}$, $pinmathcal{P}$, and that if $mathcal{P}$ contains exactly one element, then the switched system is just a usual ODE $dot{mathbf{x}}=mathbf{f}(t,mathbf{x}$. We give numerous examples of Lyapunov functions constructed by our method at the end of this monograph.

Unsupervised Ensemble Anomaly Detection Using Time-Periodic Packet Sampling

Science.gov (United States)

Uchida, Masato; Nawata, Shuichi; Gu, Yu; Tsuru, Masato; Oie, Yuji

We propose an anomaly detection method for finding patterns in network traffic that do not conform to legitimate (i.e., normal) behavior. The proposed method trains a baseline model describing the normal behavior of network traffic without using manually labeled traffic data. The trained baseline model is used as the basis for comparison with the audit network traffic. This anomaly detection works in an unsupervised manner through the use of time-periodic packet sampling, which is used in a manner that differs from its intended purpose — the lossy nature of packet sampling is used to extract normal packets from the unlabeled original traffic data. Evaluation using actual traffic traces showed that the proposed method has false positive and false negative rates in the detection of anomalies regarding TCP SYN packets comparable to those of a conventional method that uses manually labeled traffic data to train the baseline model. Performance variation due to the probabilistic nature of sampled traffic data is mitigated by using ensemble anomaly detection that collectively exploits multiple baseline models in parallel. Alarm sensitivity is adjusted for the intended use by using maximum- and minimum-based anomaly detection that effectively take advantage of the performance variations among the multiple baseline models. Testing using actual traffic traces showed that the proposed anomaly detection method performs as well as one using manually labeled traffic data and better than one using randomly sampled (unlabeled) traffic data.

On QoS guarantee in MPLS network with software deadline awareness

Science.gov (United States)

Gao, Yu; Jin, Yaohui; Cheng, Hong; Yu, Yingdi; Sun, Weiqiang; Guo, Wei; Hu, Weisheng

2007-11-01

With the increasing number of internet users, more and more real-time services are added into the network, such as IPTV, online-video, Voice over IP, etc. As we know, throughput is a highly important performance criterion for scheduling algorithms of networks. Besides throughput, these growing real-time services are very sensitive to delay variance termed as jitter. Therefore, high performance scheduling algorithm should achieve good performance in terms of throughput, delay, jitter and fairness together. Scheduling algorithm with deadline-awareness employed in packet switching plays a key role in QoS guarantees. Although traditional hard-deadline can provide guarantee on in-node delay-deadline criteria, the end-to-end delay-deadline criteria cannot be guaranteed due to the characteristic of hard-deadline, while the delay-deadline guaranteed throughput is low. Thus, soft-deadline scheduling algorithm has been proposed. In this paper, we investigate and compare the classical hard-deadline and soft-deadline switching algorithm. A new scheme "Bonus System" is proposed in order to realize the idea of soft-deadline switching algorithm. Bonus System based on soft-deadline is compared with classical Early-Deadline First scheme based on hard-deadline, which shows that Bonus System has better performance in End-to-End deadline guarantee.

Compact wireless control network protocol with fast path switching

Directory of Open Access Journals (Sweden)

Yasutaka Kawamoto

2017-08-01

Full Text Available Sensor network protocol stacks require the addition or adjustment of functions based on customer requirements. Sensor network protocols that require low delay and low packet error rate (PER, such as wireless control networks, often adopt time division multiple access (TDMA. However, it is difficult to add or adjust functions in protocol stacks that use TDMA methods. Therefore, to add or adjust functions easily, we propose NES-SOURCE, a compact wireless control network protocol with a fast path-switching function. NES-SOURCE is implemented using carrier sense multiple access/collision avoidance (CSMA/CA rather than TDMA. Wireless control networks that use TDMA prevent communication failure by duplicating the communication path. If CSMA/CA networks use duplicate paths, collisions occur frequently, and communication will fail. NES-SOURCE switches paths quickly when communication fails, which reduces the effect of communication failures. Since NES-SOURCE is implemented using CSMA/CA rather than TDMA, the implementation scale is less than one-half that of existing network stacks. Furthermore, since NES-SOURCE’s code complexity is low, functions can be added or adjusted easily and quickly. Communication failures occur owing to changes in the communication environment and collisions. Experimental results demonstrate that the proposed NES-SOURCE’s path-switching function reduces the amount of communication failures when the communication environment changes owing to human movement and others. Furthermore, we clarify the relationships among the probability of a changing communication environment, the collision occurrence rate, and the PER of NES-SOURCE.

The Optimization of the Data Packet Length in Adaptive Radio Networks

Directory of Open Access Journals (Sweden)

Anatolii P. Voiter

2017-10-01

Full Text Available Background. Development of methods and means of the adaptive management of the radio networks bandwidth with competitive access to the radio channel. Objective. The aim of the paper is to determine the packet length effect on the effective radio networks transmission rate with taking into account the parameters, formats, and procedures of the physical and link levels at using the MAC protocol with a rigid strategy of competitive access to the radio channel. Methods. The goal is achieved by creating and analyzing the mathematical model of the effective transmission rate in radio networks. The model is described by the equation for the effective transmission rate, which is the function of both the probability of the conflict-free transmission of the MAC protocol and the coefficient of the data packet size deviation from the optimal for LLC protocol. Results. It is proved that there is the optimal deviation of the data packet length for each MAC protocol traffic intensity value, which provides the most effective transfer rate. This makes the possibility for adaptive management of the radio bandwidth by applying a pre-calculated deviation of the data packet size in dependence on the traffic intensity. Conclusions. The proposed mathematical model is the tool for calculation of both the radio bandwidth network capacity and the optimal deviation of the data packet length at adaptive management of competitive access to a radio channel with a rigid strategy at conditions of the significant fluctuation in traffic intensity.

Energy and Information Transfer Via Coherent Exciton Wave Packets

Science.gov (United States)

Zang, Xiaoning

Electronic excitons are bound electron-hole states that are generated when light interacts with matter. Such excitations typically entangle with phonons and rapidly decohere; the resulting electronic state dynamics become diffusive as a result. However, if the exciton-phonon coupling can be reduced, it may be possible to construct excitonic wave packets that offer a means of efficiently transmitting information and energy. This thesis is a combined theory/computation investigation to design condensed matter systems which support the requisite coherent transport. Under the idealizing assumption that exciton-phonon entanglement could be completely suppressed, the majority of this thesis focuses on the creation and manipulation of exciton wave packets in quasi-one-dimensional systems. While each site could be a silicon quantum dot, the actual implementation focused on organic molecular assemblies for the sake of computational simplicity, ease of experimental implementation, potential for coherent transport, and promise because of reduced structural uncertainty. A laser design was derived to create exciton wave packets with tunable shape and speed. Quantum interference was then exploited to manipulate these packets to block, pass, and even dissociate excitons based on their energies. These developments allow exciton packets to be considered within the arena of quantum information science. The concept of controllable excitonic wave packets was subsequently extended to consider molecular designs that allow photons with orbital angular momentum to be absorbed to create excitons with a quasi-angular momentum of their own. It was shown that a well-defined measure of topological charge is conserved in such light-matter interactions. Significantly, it was also discovered that such molecules allow photon angular momenta to be combined and later emitted. This amounts to a new way of up/down converting photonic angular momentum without relying on nonlinear optical materials. The

Squeezing a wave packet with an angular-dependent mass

Energy Technology Data Exchange (ETDEWEB)

Schmidt, Alexandre G M [Departamento de Ciencias Exatas, Universidade Federal Fluminense, Av. dos Trabalhadores 420, Volta Redonda RJ, CEP 27255-125 (Brazil)], E-mail: agmschmidt@gmail.com, E-mail: agmschmidt@pq.cnpq.br

2009-06-19

We present a new effect of position-dependent mass (PDM) systems: the possibility of creating squeezed wave packets at the partial revival times. We solve exactly the PDM Schroedinger equation for the two-dimensional quantum rotor with two effective masses {mu}({theta}), both free and interacting with a uniform electric field, and present their energy eigenvalues and eigenfunctions in terms of Mathieu functions. For the first one, in order to squeeze the wave packet it is necessary to apply an electric field; for the second one such an effect can be achieved without the field.

Squeezing a wave packet with an angular-dependent mass

International Nuclear Information System (INIS)

Schmidt, Alexandre G M

2009-01-01

We present a new effect of position-dependent mass (PDM) systems: the possibility of creating squeezed wave packets at the partial revival times. We solve exactly the PDM Schroedinger equation for the two-dimensional quantum rotor with two effective masses μ(θ), both free and interacting with a uniform electric field, and present their energy eigenvalues and eigenfunctions in terms of Mathieu functions. For the first one, in order to squeeze the wave packet it is necessary to apply an electric field; for the second one such an effect can be achieved without the field

Solid Waste Activity Packet for Teachers.

Science.gov (United States)

Illinois Univ., Urbana. Cooperative Extension Service.

This solid waste activity packet introduces students to the solid waste problem in Illinois. Topics explore consumer practices in the market place, packaging, individual and community garbage generation, and disposal practices. The activities provide an integrated approach to incorporating solid waste management issues into subject areas. The…

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

Directory of Open Access Journals (Sweden)

Mohammed A Al-Shargabi

Full Text Available 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.

Interception and modification of network authentication packets with the purpose of allowing alternative authentication modes

Science.gov (United States)

Kent, Alexander Dale [Los Alamos, NM

2008-09-02

Methods and systems in a data/computer network for authenticating identifying data transmitted from a client to a server through use of a gateway interface system which are communicately coupled to each other are disclosed. An authentication packet transmitted from a client to a server of the data network is intercepted by the interface, wherein the authentication packet is encrypted with a one-time password for transmission from the client to the server. The one-time password associated with the authentication packet can be verified utilizing a one-time password token system. The authentication packet can then be modified for acceptance by the server, wherein the response packet generated by the server is thereafter intercepted, verified and modified for transmission back to the client in a similar but reverse process.

Implementation of Bin Packing Model for Reed Switch Production Planning

Energy Technology Data Exchange (ETDEWEB)

Parra, Rainier Romero [Polytechnic University of Baja California, Calle de la Claridad S/N, Col Plutarco Elias Calles, Mexicali, B. C., 21376 (Mexico); Burtseva, Larysa [Engineering Institute, Autonomous University of Baja California, Calle de la Normal S/N, Col. Insurgentes Este, Mexicali, BC, 21280 (Mexico)

2010-06-17

This paper presents a form to resolve a real problem of efficient material election in reed switch manufacturing. The carrying out of the consumer demands depends on the stochastic results of the classification process where each lot of switches is distributed into bins according to an electric measure value. Various glass types are employed for the switch manufacturing. The effect caused by the glass type variation on the switch classification results was investigated. Based on real data statistic analysis, the problem is reduced to the lot number minimizing taking into consideration the glass type, and interpreted as a bin packing problem generalization. On difference to the classic bin packing problem, in the considered case, an item represents a set of pieces; a container is divided into a number of bins (sub-containers); the bin capacity is variable; there are the assignment restrictions between bins and sets of pieces; the items are allowed to be fragmented into bins and containers. The problem has a high complexity. A heuristic offline algorithm is proposed to find the quantity, types and packing sequence of containers, the item fragments associated with containers and bins. The bin capacities do not affect the algorithm.

Implementation of Bin Packing Model for Reed Switch Production Planning

International Nuclear Information System (INIS)

Parra, Rainier Romero; Burtseva, Larysa

2010-01-01

This paper presents a form to resolve a real problem of efficient material election in reed switch manufacturing. The carrying out of the consumer demands depends on the stochastic results of the classification process where each lot of switches is distributed into bins according to an electric measure value. Various glass types are employed for the switch manufacturing. The effect caused by the glass type variation on the switch classification results was investigated. Based on real data statistic analysis, the problem is reduced to the lot number minimizing taking into consideration the glass type, and interpreted as a bin packing problem generalization. On difference to the classic bin packing problem, in the considered case, an item represents a set of pieces; a container is divided into a number of bins (sub-containers); the bin capacity is variable; there are the assignment restrictions between bins and sets of pieces; the items are allowed to be fragmented into bins and containers. The problem has a high complexity. A heuristic offline algorithm is proposed to find the quantity, types and packing sequence of containers, the item fragments associated with containers and bins. The bin capacities do not affect the algorithm.

Source Authentication for Code Dissemination Supporting Dynamic Packet Size in Wireless Sensor Networks †

Science.gov (United States)

Kim, Daehee; Kim, Dongwan; An, Sunshin

2016-01-01

Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption. PMID:27409616

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

Directory of Open Access Journals (Sweden)

Waqas Rehan

2016-09-01

Full Text Available 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

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

Science.gov (United States)

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

Surfing Peer-to-Peer IPTV: Distributed Channel Switching

Science.gov (United States)

Kermarrec, A.-M.; Le Merrer, E.; Liu, Y.; Simon, G.

It is now common for IPTV systems attracting millions of users to be based on a peer-to-peer (P2P) architecture. In such systems, each channel is typically associated with one P2P overlay network connecting the users. This significantly enhances the user experience by relieving the source from dealing with all connections. Yet, the joining process resulting in a peer to be integrated in channel overlay usually requires a significant amount of time. As a consequence, switching from one channel to another is far to be as fast as in IPTV solutions provided by telco operators. In this paper, we tackle the issue of efficient channel switching in P2P IPTV system. This is to the best of our knowledge the first study on this topic. First, we conducted and analyzed a set of measurements of one of the most popular P2P systems (PPlive). These measurements reveal that the set of contacts that a joining peer receives from the central server are of the utmost importance in the start-up process. On those neigbors, depends the speed to acquire the first video frames to play. We then formulate the switching problem, and propose a simple distributed algorithm, as an illustration of the concept, which aims at leveraging the presence of peers in the network to fasten the switch process. The principle is that each peer maintains as neighbors peers involved in other channels, providing peers with good contacts upon channel switching. Finally, simulations show that our approach leads to substantial improvements on the channel switching time. As our algorithmic solution does not have any prerequisite on the overlays, it appears to be an appealing add-on for existing P2P IPTV systems.

Biological Diversity. Global Issues Education Packet.

Science.gov (United States)

Holm, Amy E.

Biological diversity, also commonly called genetic diversity, refers to the variety of organisms on Earth. Scientists are concerned that many species will become extinct because of extensive development in the tropical regions. This packet is designed to increase student's awareness about direct and indirect causes of extinction, endangered…

Survival of the Fittest: An Active Queue Management Technique for Noisy Packet Flows

Directory of Open Access Journals (Sweden)

Shirish S. Karande

2007-01-01

Full Text Available We present a novel active queue management (AQM technique to demonstrate the efficacy of practically harnessing the predictive utility of SSR indications for improved video communication. We consider a network within which corrupted packets are relayed over multiple hops, but a certain percentage of packets needs to be dropped at an intermediate node due to congestion. We propose an AQM technique, survival of the fittest (SOTF, to be employed at the relay node, within which we use packet state information, available from SSR indications and checksums, to drop packets with the highest corruption levels. On the basis of actual 802.11b measurements we show that such a side information (SI aware processing within the network can provide significant performance benefits over an SI-unaware scheme, random queue management (RQM, which is forced to randomly discard packets. With trace-based simulations, we show the utility of the proposed AQM technique in improving the error recovery performance of cross-layer FEC schemes. Finally, with the help of H.264-based video simulations these improvements are shown to translate into a significant improvement in video quality.

Generation of attosecond electron packets via conical surface plasmon electron acceleration

Science.gov (United States)

Greig, S. R.; Elezzabi, A. Y.

2016-01-01

We present a method for the generation of high kinetic energy attosecond electron packets via magnetostatic and aperture filtering of conical surface plasmon (SP) accelerated electrons. The conical SP waves are excited by coupling an ultrafast radially polarized laser beam to a conical silica lens coated with an Ag film. Electromagnetic and particle tracking models are employed to characterize the ultrafast electron packets. PMID:26764129

Event-triggered control systems under packet losses

NARCIS (Netherlands)

Dolk, V.S.; Heemels, W.P.M.H.

2017-01-01

Networked control systems (NCSs) offer many benefits in terms of increased flexibility and maintainability but might also suffer from inevitable imperfections such as packet dropouts and limited communications resources. In this paper, (static and dynamic) event-triggered control (ETC) strategies

Satcom access in the Evolved Packet Core

NARCIS (Netherlands)

Cano Soveri, M.D.; Norp, A.H.J.; Popova, M.P.

2011-01-01

Satellite communications (Satcom) networks are increasingly integrating with terrestrial communications networks, namely Next Generation Networks (NGN). In the area of NGN the Evolved Packet Core (EPC) is a new network architecture that can support multiple access technologies. When Satcom is

Satcom access in the evolved packet core

NARCIS (Netherlands)

Cano, M.D.; Norp, A.H.J.; Popova, M.P.

2012-01-01

Satellite communications (Satcom) networks are increasingly integrating with terrestrial communications networks, namely Next Generation Networks (NGN). In the area of NGN the Evolved Packet Core (EPC) is a new network architecture that can support multiple access technologies. When Satcom is

Resonance-assisted decay of nondispersive wave packets

OpenAIRE

Wimberger, S.; Schlagheck, P.; Eltschka, C.; Buchleitner, A.

2006-01-01

We present a quantitative semiclassical theory for the decay of nondispersive electronic wave packets in driven, ionizing Rydberg systems. Statistically robust quantities are extracted combining resonance assisted tunneling with subsequent transport across chaotic phase space and a final ionization step.

Optimization of multicast optical networks with genetic algorithm

Science.gov (United States)

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.

MODEL OF FUNCTIONING OF TELECOMMUNICATION EQUIPMENT FOR SOFTWARE-CONFIGURATED NETWORKS

Directory of Open Access Journals (Sweden)

Konstantin E. Samouylov

2018-03-01

Full Text Available A mathematical model of the functioning of the switch of a software defined networks is constructed in the form of a queuing network consisting of two queuing systems: the first simulates an input data buffer and a device for reading information from the header of the packet; the second is a table for addressing the switch of a software defined networks. The receipt of data in software defined networks has a probabilistic character in their deterministic processing in communication channels and switching nodes. Therefore, this mathematical model of the functioning of the switch of a software defined networks was built on the basis of queuing systems and networks. The stream of requests flowing into the network was divided into two Poisson streams of various types of applications, the first of which corresponded to the packets that came to the control port of the switch (from the controller, and the second flow to the remaining packets arriving on the switch. The flow corresponding to the packets arriving at the switch from the controller has a relative priority over the flow from the remaining arriving packets As a result, formulas were obtained for calculating the performance indicators of this telecommunications equipment such as average waiting queues for priority and non-priority applications, the probability of loss of applications for each phase of the switch. Based on the received quality of service indicators for this telecommunications equipment, it is possible to assess the stability of switches in software defined networks for various information impacts.

Host based internet protocol (IP) packet analysis to enhance network security

International Nuclear Information System (INIS)

Ahmad, T.; Ahmad, S.Z.; Yasin, M.M.

2007-01-01

Data communication in a computer network environment is facing serious security threats from numerous sources such as viruses, worms, Zombies etc. These threats can be broadly characterized as internal or external security threats. Internal threats are mainly attributed to sneaker-nets, utility modems and unauthorized users, which can be minimized by skillful network administration, password management and optimum usage policy definition. The external threats need more serious attention as these attacks are mostly coming from public networks such as Internet. Frequency and complexity of such attacks is much higher as compared to internal attacks. This paper presents a host based network layer screening of external and internal IP packets for logging, analyzing and real-time detection of possible IP spoofing and Denial of Service attacks. This work can also be used in tuning security rules definition for gateway firewalls. Software has been developed which intercepts IP traffic and analyses it with respect to integrity and origin of I P packet. The received IP packets are parsed and analyzed for possible signs of intrusion. The results show that by watching and categorizing composition of various transport protocol such as TCP, UDP, ICMP and others along with verifying the origin of received IP packet can help in devising real-time firewall rule and blocking possible external attack. This is highly desirable for fighting against zero day attacks and can result in a better Mean Time between Failures (MTBF) to increase the survivability of computer network. Used in a right context, packet screening and filtering can be a useful tool for provision of reliable and stable network services. (author)

Deterministic bound for avionics switched networks according to networking features using network calculus

Directory of Open Access Journals (Sweden)

Feng HE

2017-12-01

Full Text Available The state of the art avionics system adopts switched networks for airborne communications. A major concern in the design of the networks is the end-to-end guarantee ability. Analytic methods have been developed to compute the worst-case delays according to the detailed configurations of flows and networks within avionics context, such as network calculus and trajectory approach. It still lacks a relevant method to make a rapid performance estimation according to some typically switched networking features, such as networking scale, bandwidth utilization and average flow rate. The goal of this paper is to establish a deterministic upper bound analysis method by using these networking features instead of the complete network configurations. Two deterministic upper bounds are proposed from network calculus perspective: one is for a basic estimation, and another just shows the benefits from grouping strategy. Besides, a mathematic expression for grouping ability is established based on the concept of network connecting degree, which illustrates the possibly minimal grouping benefit. For a fully connected network with 4 switches and 12 end systems, the grouping ability coming from grouping strategy is 15–20%, which just coincides with the statistical data (18–22% from the actual grouping advantage. Compared with the complete network calculus analysis method for individual flows, the effectiveness of the two deterministic upper bounds is no less than 38% even with remarkably varied packet lengths. Finally, the paper illustrates the design process for an industrial Avionics Full DupleX switched Ethernet (AFDX networking case according to the two deterministic upper bounds and shows that a better control for network connecting, when designing a switched network, can improve the worst-case delays dramatically. Keywords: Deterministic bound, Grouping ability, Network calculus, Networking features, Switched networks

Packet Payload Monitoring for Internet Worm Content Detection Using Deterministic Finite Automaton with Delayed Dictionary Compression

Directory of Open Access Journals (Sweden)

Divya Selvaraj

2014-01-01

Full Text Available Packet content scanning is one of the crucial threats to network security and network monitoring applications. In monitoring applications, payload of packets in a network is matched against the set of patterns in order to detect attacks like worms, viruses, and protocol definitions. During network transfer, incoming and outgoing packets are monitored in depth to inspect the packet payload. In this paper, the regular expressions that are basically string patterns are analyzed for packet payloads in detecting worms. Then the grouping scheme for regular expression matching is rewritten using Deterministic Finite Automaton (DFA. DFA achieves better processing speed during regular expression matching. DFA requires more memory space for each state. In order to reduce memory utilization, decompression technique is used. Delayed Dictionary Compression (DDC is applied for achieving better speeds in the communication links. DDC achieves decoding latency during compression of payload packets in the network. Experimental results show that the proposed approach provides better time consumption and memory utilization during detection of Internet worm attacks.

Application of the wavelet packet transform to vibration signals for surface roughness monitoring in CNC turning operations

Science.gov (United States)

García Plaza, E.; Núñez López, P. J.

2018-01-01

The wavelet packet transform method decomposes a time signal into several independent time-frequency signals called packets. This enables the temporary location of transient events occurring during the monitoring of the cutting processes, which is advantageous in monitoring condition and fault diagnosis. This paper proposes the monitoring of surface roughness using a single low cost sensor that is easily implemented in numerical control machine tools in order to make on-line decisions on workpiece surface finish quality. Packet feature extraction in vibration signals was applied to correlate the sensor signals to measured surface roughness. For the successful application of the WPT method, mother wavelets, packet decomposition level, and appropriate packet selection methods should be considered, but are poorly understood aspects in the literature. In this novel contribution, forty mother wavelets, optimal decomposition level, and packet reduction methods were analysed, as well as identifying the effective frequency range providing the best packet feature extraction for monitoring surface finish. The results show that mother wavelet biorthogonal 4.4 in decomposition level L3 with the fusion of the orthogonal vibration components (ax + ay + az) were the best option in the vibration signal and surface roughness correlation. The best packets were found in the medium-high frequency DDA (6250-9375 Hz) and high frequency ADA (9375-12500 Hz) ranges, and the feed acceleration component ay was the primary source of information. The packet reduction methods forfeited packets with relevant features to the signal, leading to poor results for the prediction of surface roughness. WPT is a robust vibration signal processing method for the monitoring of surface roughness using a single sensor without other information sources, satisfactory results were obtained in comparison to other processing methods with a low computational cost.

PcapDB: Search Optimized Packet Capture, Version 0.1.0.0

Energy Technology Data Exchange (ETDEWEB)

2016-11-04

PcapDB is a packet capture system designed to optimize the captured data for fast search in the typical (network incident response) use case. The technology involved in this software has been submitted via the IDEAS system and has been filed as a provisional patent. It includes the following primary components: capture: The capture component utilizes existing capture libraries to retrieve packets from network interfaces. Once retrieved the packets are passed to additional threads for sorting into flows and indexing. The sorted flows and indexes are passed to other threads so that they can be written to disk. These components are written in the C programming language. search: The search components provide a means to find relevant flows and the associated packets. A search query is parsed and represented as a search tree. Various search commands, written in C, are then used resolve this tree into a set of search results. The tree generation and search execution management components are written in python. interface: The PcapDB web interface is written in Python on the Django framework. It provides a series of pages, API's, and asynchronous tasks that allow the user to manage the capture system, perform searches, and retrieve results. Web page components are written in HTML,CSS and Javascript.

Packet models revisited: tandem and priority systems

NARCIS (Netherlands)

M.R.H. Mandjes (Michel)

2004-01-01

textabstractWe examine two extensions of traditional single-node packet-scale queueing models: tandem networks and (strict) priority systems. Two generic input processes are considered: periodic and Poisson arrivals. For the two-node tandem, an exact expression is derived for the joint distribution

Impact of Packet Sampling on Link Dimensioning

NARCIS (Netherlands)

Schmidt, R.D.O.; Sadre, R.; Sperotto, A.; Berg, H. van den; Pras, A.

2015-01-01

Link dimensioning is used by network operators to properly provision the capacity of their network links. Proposed methods for link dimensioning often require statistics, such as traffic variance, that need to be calculated from packet-level measurements. In practice, due to increasing traffic

Impact of packet sampling on link dimensioning

NARCIS (Netherlands)

de Oliveira Schmidt, R.; Stadler, R.; Sadre, R.; Sperotto, Anna; van den Berg, Hans Leo; Pras, Aiko

Link dimensioning is used by network operators to properly provision the capacity of their network links. Proposed methods for link dimensioning often require statistics, such as traffic variance, that need to be calculated from packet-level measurements. In practice, due to increasing traffic

Switch and examine transmit diversity for spectrum sharing systems

KAUST Repository

Abdallah, Mohamed M.; Alouini, Mohamed-Slim; Qaraqe, Khalid A.

2011-01-01

In this paper, we develop a switch and examine transmit diversity algorithm for spectrum sharing cognitive networks. We consider a cognitive network composed of a primary link that employs constant rate and constant power transmission scheme

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

Science.gov (United States)

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.

Content-Adaptive Packetization and Streaming of Wavelet Video over IP Networks

Directory of Open Access Journals (Sweden)

Chien-Peng Ho

2007-03-01

Full Text Available This paper presents a framework of content-adaptive packetization scheme for streaming of 3D wavelet-based video content over lossy IP networks. The tradeoff between rate and distortion is controlled by jointly adapting scalable source coding rate and level of forward error correction (FEC protection. A content dependent packetization mechanism with data-interleaving and Reed-Solomon protection for wavelet-based video codecs is proposed to provide unequal error protection. This paper also tries to answer an important question for scalable video streaming systems: given extra bandwidth, should one increase the level of channel protection for the most important packets, or transmit more scalable source data? Experimental results show that the proposed framework achieves good balance between quality of the received video and level of error protection under bandwidth-varying lossy IP networks.

Opportunistic Nonorthogonal Packet Scheduling in Fixed Broadband Wireless Access Networks

Directory of Open Access Journals (Sweden)

Ahmed Mohamed H

2006-01-01

Full Text Available In order to mitigate high cochannel interference resulting from dense channel reuse, the interference management issues are often considered as essential part of scheduling schemes in fixed broadband wireless access (FBWA networks. To that end, a series of literature has been published recently, in which a group of base stations forms an interferer group (downlink transmissions from each base station become dominant interference for the users in other in-group base stations, and the scheduling scheme deployed in the group allows only one base station to transmit at a time. As a result of time orthogonality in transmissions, the dominant cochannel interferers are prevented, and hence the packet error rate can be improved. However, prohibiting concurrent transmissions in these orthogonal schemes introduces throughput penalty as well as higher end-to-end packet delay which might not be desirable for real-time services. In this paper, we utilize opportunistic nonorthogonality among the in-group transmissions whenever possible and propose a novel transmission scheduling scheme for FBWA networks. The proposed scheme, in contrast to the proactive interference avoidance techniques, strives for the improvements in delay and throughput efficiency. To facilitate opportunistic nonorthogonal transmissions in the interferer group, estimation of signal-to-interference-plus-noise ratio (SINR is required at the scheduler. We have observed from simulations that the proposed scheme outperforms the reference orthogonal scheme in terms of spectral efficiency, mean packet delay, and packet dropping rate.

Three Packets of Minerals of the Periodic Table of Chemical Elements and Chemical Compounds

OpenAIRE

Labushev, Mikhail M.

2013-01-01

The concepts of alpha- and beta-packets of the periodic table of chemical elements and chemical compounds are defined. The first of the 47 minerals alpha-packets is composed. In it all minerals are arranged in increasing Iav index of proportionality of atomic weights of composing chemical elements, the same way as chemical elements are located in increasing atomic weights in the Periodic table. The packet includes 93 known minerals and two compounds - N2O5 and CO2 - being actually minerals. B...

The Generation Mechanism of Airy—Bessel Wave Packets in Free Space

International Nuclear Information System (INIS)

Ren Zhi-Jun; Ying Chao-Fu; Fan Chang-Jiang; Wu Qiong

2012-01-01

Localized optical Airy—Bessel configuration wave packets were first generated on the basis of a grating-telescope combination [Nat. Photon. 4(2010) 103]. By studying the spatially induced group velocity dispersion effect of ultrashort pulsed Bessel beams during propagation, we find the universal physical foundation of generating Airy—Bessel wave packets (ABWs) in free space. The research results are expected to open up more common channels for generating stable linear localized ABWs

Wave packet fractional revivals in a one-dimensional Rydberg atom

International Nuclear Information System (INIS)

Veilande, Rita; Bersons, Imants

2007-01-01

We investigate many characteristic features of revival and fractional revival phenomena via derived analytic expressions for an autocorrelation function of a one-dimensional Rydberg atom with weighting probabilities modelled by a Gaussian or a Lorentzian distribution. The fractional revival phenomenon in the ionization probabilities of a one-dimensional Rydberg atom irradiated by two short half-cycle pulses is also studied. When many states are involved in the formation of the wave packet, the revival is lower and broader than the initial wave packet and the fractional revivals overlap and disappear with time

Towards Effective Trust-Based Packet Filtering in Collaborative Network Environments

DEFF Research Database (Denmark)

Meng, Weizhi; Li, Wenjuan; Kwok, Lam-For

2017-01-01

compromised by insider attacks. In this paper, we adopt the existing CIDN framework and aim to apply a collaborative trust-based approach to reduce unwanted packets. More specifically, we develop a collaborative trust-based packet filter, which can be deployed in collaborative networks and be robust against...... typical insider attacks (e.g., betrayal attacks). Experimental results in various simulated and practical environments demonstrate that our filter can perform effectively in reducing unwanted traffic and can defend against insider attacks through identifying malicious nodes in a quick manner, as compared...

A packet-based dual-rate PID control strategy for a slow-rate sensing Networked Control System.

Science.gov (United States)

Cuenca, A; Alcaina, J; Salt, J; Casanova, V; Pizá, R

2018-05-01

This paper introduces a packet-based dual-rate control strategy to face time-varying network-induced delays, packet dropouts and packet disorder in a Networked Control System. Slow-rate sensing enables to achieve energy saving and to avoid packet disorder. Fast-rate actuation makes reaching the desired control performance possible. The dual-rate PID controller is split into two parts: a slow-rate PI controller located at the remote side (with no permanent communication to the plant) and a fast-rate PD controller located at the local side. The remote side also includes a prediction stage in order to generate the packet of future, estimated slow-rate control actions. These actions are sent to the local side and converted to fast-rate ones to be used when a packet does not arrive at this side due to the network-induced delay or due to occurring dropouts. The proposed control solution is able to approximately reach the nominal (no-delay, no-dropout) performance despite the existence of time-varying delays and packet dropouts. Control system stability is ensured in terms of probabilistic Linear Matrix Inequalities (LMIs). Via real-time control for a Cartesian robot, results clearly reveal the superiority of the control solution compared to a previous proposal by authors. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Dwell time-based stabilisation of switched delay systems using free-weighting matrices

Science.gov (United States)

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.

Analisis Quality of Service (QoS Jaringan Telekomunikasi High-Speed Downlink Packet Access (HSDPA pada Teknologi 3.5G

Directory of Open Access Journals (Sweden)

Mey Fenny Wati Simanjuntak

2016-01-01

Full Text Available Sejak layanan teknologi 3G pertama kali diperkenalkan, permintaan akan layanan berbasis paket data dari tahun ke tahun mengalami peningkatan yang pesat. Menanggapi hal tersebut, para penyedian jaringan telekomunikasi terus berusaha untuk meningkatkan kemampuan jaringannya. Salah satu solusinya menerapkan teknologi High-Speed Downlink Packet Access yang direkomendasikan oleh 3GPP Release 5. Penelitian ini dikhususkan untuk menganalisis Quality of Service jaringan telekomunikasi High-Speed Downlink Packet Access di Kecamatan Tembalang Kota Semarang. Analisis Quality of Service jaringan telekomunikasi High-Speed Downlink Packet Access pada penelitian ini bertujuan untuk memberikan gambaran kualitas jaringan telekomunikasi High-Speed Downlink Packet Access dari sisi bandwidth, throughput, packet loss dan delay. Metode penelitian yang dibahas dalam penelitian ini yaitu penelitian kualitatif observatif, dimana akan dilakukan pengamatan tentang bagaimana QoS jaringan telekomunikasi High-Speed Downlink Packet Access pada teknologi 3.5G di Kecamatan Tembalang Kota Semarang. Proses pengamatan dalam menganalisis Quality of Service jaringan telekomunikasi High-Speed Downlink Packet Access di Kecamatan Tembalang Kota Semarang berdasarkan 4 parameter diantaranya bandwidth, throughput, packet loss dan delay. Aplikasi yang digunakan yaitu monitoring application Elnus Bandwidth Meter dan Axence NetTools Professional 4.0. Selain itu, Quality of Service jaringan telekomunikasi High- Speed Downlink Packet Access di Kecamatan Tembalang Kota Semarang diamati berdasarkan waktu yaitu harian, mingguan dan bulanan.

Isolated drops from capillary jets by means of Gaussian wave packets

Science.gov (United States)

Garcia, Francisco Javier; Gonzalez, Heliodoro; Castrejon-Pita, Alfonso Arturo; Castrejon-Pita, Jose Rafael; Gomez-Aguilar, Francisco Jose

2017-11-01

The possibility of obtaining isolated drops from a continuous liquid jet through localized velocity perturbations is explored analytically, numerically and experimentally. We show that Gaussian wave packets are appropriate for this goal. A temporal linear analysis predicts the early evolution of these wave packets and provides an estimate of the breakup length of the jet. Non-linear numerical simulations allow us both to corroborate these results and to obtain the shape of the surface of the jet prior to breakup. Finally, we show experimental evidence that stimulating with a Gaussian wave packet can lead to the formation of an isolated drop without disturbing the rest of the jet. The authors acknowledge support from the Spanish Government under Contract No. FIS2014-25161, the Junta de Andalucia under Contract No. P11-FQM-7919, the EPSRC-UK via the Grant EP/P024173/1, and the Royal Society.

EXTENDING THE DEEP PACKET INSPECTION MODEL TO THE GCC/MENA REGION

Directory of Open Access Journals (Sweden)

Alfred H. Miller

2013-12-01

Full Text Available This study seeks to explore extending the technology acceptance model (DPAM from a 2011 quantitative study—Modeling Intention to Use Deep Packet Inspection Technology in the United Arab Emirates, to the cyber security practitioner community of the Gulf Cooperation Council (GCC and greater Middle East North Africa (MENA Region. Analysis of regression between independent variable model factors of computer self efficacy, attitude toward ICT, perceived usefulness of ecommerce, intention to use ecommerce, societal trust and Internet filtration toward the dependent variable intention to use deep packet inspection, to determine parsimony, using confirmatory factor analysis (CFA, multinomial regression to assess correlation of independent and dependent variables, and assessment of the cross-suitability of DPAM across the MENA/GCC states through a MANOVA assessment. A qualitative component of the instrument enables collection of data about specific hardware and software deployed for deep packet inspection and cyber security systems.

Analysis of the Cause of High External Q Modes in the JLab High Gradient Prototype Cryomodule Renascence

International Nuclear Information System (INIS)

Li, Z.; Akcelik, V.; Xiao, L.; Lee, L.; Ng, C.; Ko, K.; Wang, Haipeng; Marhauser, Frank; Sekutowicz, Jacek; Reece, Charles; Rimmer, Robert

2009-01-01

Operating on a frequency band occupying several nonoverlapping channels, IEEE 802.11 is now widely used in wireless mesh networks (WMNs). Many multichannel MAC protocols are proposed to improve the spatial reuse in the network under the assumption that the transmissions on nonoverlapping channels do not interfere with each other. Some joint routing and channel assignment algorithms are also designed to increase the network throughput based on the premise that we can switch between different channels freely. Although simulations show that great improvements on network throughput can be observed in both cases, two fundamental questions remain: (1) Can we really use multiple nonoverlapping channels freely in WMNs? (2) If we can, what will be the cost when we switch channels dynamically and frequently? In this paper, by conducting extensive experiments on our testbed, we attempt to answer these questions. We find that in spite of interference between both overlapping and nonoverlapping channels, we can still use multiple channels in mesh networks under certain conditions but with care. We also show that the channel switching cost is actually very significant in WMNs. We recommend not to switch the channels too frequently when designing the channel assignment algorithms, and those channel assignment algorithms selecting one channel for each packet are not really beneficial.