Search

With the rapid development of broadband wireless technology and the wide demand of multimedia mobile services, various broadband mobile multimedia services are coming into being. However, the limited radio resources do not adequately guarantee the quality of service requirements for these multimedia mobile services. In this paper, the improved chaotic neural network technology is applied to three typical broadband wireless communication systems. Through the theoretical analysis and the simulation, the proposed algorithm can make full use of the chaotic neural power to search the optimal solution, which can achieve the purpose of further optimizing the wireless resources. At the same time, it also make the positive attempt to promote cross-disciplinary integration. [ABSTRACT FROM AUTHOR]

Digital Radio Mondiale (DRM) is the universally, openly standardized digital broadcasting system for all frequencies including LW, MW, and SW as well as VHF bands. Alongside providing high audio quality to listeners, DRM satisfies technological requirements posed by broadcasters, manufacturers and regulatory authorities and thus bears a great potential for the future of global radio. One of the key issues here concerns green broadcasting. Facing the need for high-power transmitters to cover wide areas, there is room for improvement concerning the power efficiency of DRM-transmitters. A major drawback of DRM is its high peak-to-average power ratio (PAPR) due to the applied transmission technology based on Orthogonal Frequency Division Multiplexing (OFDM), which results in non-linearities in the emitted signal, low power efficiency, and high costs of transmitters. To overcome this, numerous schemes have been investigated for reducing PAPR in OFDM systems. In this paper, we review and analyze various technologies to reduce PAPR providing that the technical feasibility and DRM-specific system architecture and edge conditions regarding the system performance in terms of modulation error rate, compliance with frequency mask, and synchronization efficiency are ensured. All evaluations are carried out with I/Q signals which are monitored in real operation to present the actual performance of proposed PAPR techniques. Subsequently, the capability of the best approach is evaluated via measurements on a DRM test platform, where achieved transmit power gain of 10 dB is shown. According to our evaluation results, PAPR reduction schemes based on active constellation extension followed by a filter prove to be promising towards practical realization of power-efficient transmitters. [ABSTRACT FROM AUTHOR]

Ad hoc networks are characterized by limited resources (e.g. energy, bandwidth). Efficient information dissemination while avoiding excessive energy cost can be achieved through the suitable design of a network. To this end we propose an information dissemination scheme which couples epidemic dissemination with adaptive modulation and coding (AMC). The proposed scheme tunes the message forwarding probability and the coding and modulation mode in order to achieve a balance between maximum coverage over the network and minimum energy expenditure. We achieve this based on the evaluation of suitably defined indicators related to the lower network layers and exploiting information on the current status of the wireless medium. Building on established previous AMC-related work, our simulation results indicate that our scheme brings significant improvement over non-adaptive approaches, comparable with other adaptive epidemic dissemination schemes. Our findings are quite promising for adaptive epidemic-based information dissemination schemes with a strong cross-layer component. [ABSTRACT FROM AUTHOR]

In this paper, the spectral regrowth issues of the separated broadband signals' magnitude and phase components have been analyzed using stochastic theory for polar transmitters. The analysis shows that limited bandwidth of the low-pass envelope reconstruction filter in the ΔΣ supply modulator can affect the transmitting signals' fidelity of the polar transmitter, which can be measured by the system specifications of error vector magnitude (EVM) and adjacent channel power ratio (ACPR). The relations between the cut-off frequency of the filter and the specifications of EVM and ACPR have been derived to determine the minimum required filter bandwidth. The relations are verified by simulation examples of wideband WCDMA and WLAN 802.11a signals. In the time-domain, the limited bandwidth of the low-pass filter is verified to be responsible for the quasi-memory effects observed in the input envelope amplitude to output envelope amplitude (AM-AM) relation of the ΔΣ supply modulator. Through numerical examples, the effects of inaccurate pulsewidth caused by non-zero transistor's rise and fall time have been found to be one of the factors causing nonlinear AM-AM relation of supply modulators. The ΔΣ envelope modulator restrained by limited envelope bandwidth and inaccurate pulsewidth can be characterized as a nonlinear system with memory, which is modeled by ARMAX Hammerstein systems in this paper. The validity of this model is verified by a simulation example of a WCDMA supply modulator. [ABSTRACT FROM AUTHOR]

This work is devoted to methods of computing the limit state and the limit flow in a resource network for large values of the resource. To do so, we study resource distribution processes in families of networks with various bandwidth matrices corresponding to the same stochastic matrix. The threshold value of the resource T such that the network operates differently on both sides of this value and the coordinates of the limit state vector for vertices that are not attractors are expressed via parameters of the bandwidth matrix and the limit transitions matrix for the Markov chain corresponding to the stochastic matrix in question. If the network has several potential attractors, the limit amount of resource in them depends on the initial state. [ABSTRACT FROM AUTHOR]

Peer-to-peer storage services are a cost-effective alternative for data backup. A basic question that arises in the design of such systems is: In which peers do we store redundant data? Choosing appropmailriate peers for data backup is important at a microscopic level, from an end-user's perspective to guarantee good performance, e.g., quick access, high availability, etc., as well as at a macroscopic level, e.g., for system optimization, fairness, etc. Existing systems apply different techniques, including random selection, based on a distributed hash table (DHT) or based on the peers' past availability pattern. In this paper, we propose as an alternative, a contextual trust based data placement scheme to select suitable data holders. It is originally designed for and applicable to scenarios where there is inadequate historical information about peers, a common scenario in large-scale systems. Specifically, our scheme estimates trustworthiness of a peer based on stereotypes, formed by aggregating information of interactions with other (similar) peers. Simulation experiments show that our placement scheme outperforms not only random selection but also schemes using historical information, in terms of both achieved data availability as well as bandwidth overheads to sustain the system. [ABSTRACT FROM AUTHOR]

Most applications of Wireless Sensor Networks (WSNs) assume the presence of single-channel Medium Access Control (MAC) protocols. In the usual dense deployment of the sensor networks, single-channel MAC protocols may be deficient because of radio collisions and limited bandwidth. Hence, using multiple channels can significantly improve the performance of WSN. Recent developments in sensor technology, as seen in Crossbow's MICAz Mote, Rockwell's WINS nodes and IEEE 802.15.4 Zigbee, have enabled support for multi-channel communications. Several multi-channel MAC protocols with different objectives have been proposed for WSNs in literature. This paper surveys and classifies the state-of-the-art multi-channel MAC protocols that are proposed for WSNs. It first outlines the sensor network properties that are crucial for designing a MAC protocol. It subsequently reviews the existent challenges to design a good multi-channel MAC protocol for the sensor networks. Then, several multi-channel MAC protocols specifically proposed for the WSNs are inspected in detail and compared with each other. Finally, some open issues in this area are outlined for future research. [ABSTRACT FROM AUTHOR]

This paper presents a tapered ridge-loaded folded waveguide (FWG) slow-wave structure (SWS) for broadband and high power millimeter wave traveling wave tube (TWT). The radio-frequency characteristics including dispersion properties, interaction impedance, S-parameters are analyzed. And based upon these results, the nonlinear large signal performance of the tapered ridge-loaded folded waveguide TWT working in W-band is simulated by 3-D particle-in-cell code. In the same ridge length, the tapered FWG has lower reflection and radio-frequency loss than the normal ridge-loaded FWG. Besides, the tapered ridge-loaded FWG TWT also has higher electron efficiency and larger bandwidth, which is more suitable for millimeter-wave TWT. [ABSTRACT FROM AUTHOR]

This study presents the design and cold testing of a Q-band TE-mode converter. Integrating Marie transducer and the design of Ching-Fang Yu and Tsun-Hsu Chang, we have improved the design of circular TE-mode converter. The working principle of each section are analyzed and discussed. Two identical converters are joined back-to-back to explore the field symmetry and to examine the existence of competing modes. The angle-independent transmissions manifest high mode purity. This converter features high back-to-back converting efficiency, high mode purity, compact converting section , and broad bandwidth (18% at a 1-dB transmission). [ABSTRACT FROM AUTHOR]

The extreme conditions under which multi-hop underwater acoustic sensor networks (UASNs) operate constrain the performance of medium access control (MAC) protocols. The MAC protocol employed significantly impacts the operation of the network supported, and such impacts must be carefully considered when developing protocols for networks constrained by both bandwidth and propagation delay. Time-based coordination, such as TDMA, have limited applicability due to the dynamic nature of the water channel used to propagate the sound signals, as well as the significant effect of relatively small changes in propagation distance on the propagation time. These effects cause inaccurate time synchronization and therefore make time-based access protocols less viable. The large propagation delays also diminish the effectiveness of carrier sense protocols as they do not predict with any certainty the status of the intended recipients at the point when the traffic would arrive. Thus, CSMA protocols do not perform well in UASNs, either. Reservation-based protocols have seldom been successful in commercial products over the past 50 years due to many drawbacks, such as limited scalability, relatively low robustness, etc. In particular, the impact of propagation delays in UASNs and other such constrained networks obfuscate the operation of the reservation protocols and diminish, if not completely negate, the benefit of reservations. The efficacy of the well-known RTS-CTS scheme, as a reservation-based enhancement to the CSMA protocol, is also adversely impacted by long propagation delays. An alternative to these MAC protocols is the much less complex ALOHA protocol, or one of its variants. However, the performance of such protocols within the context of multi-hop networks is not well studied. In this paper we identify the challenges of modeling contention-based MAC protocols and present models for analyzing ALOHA and p-persistent ALOHA variants for a simple string topology. As expected, an application of the model suggests that ALOHA variants are very sensitive to traffic loads. Indeed, when the traffic load is small, utilization becomes insensible to p values. A key finding, though, is the significance of the network size on the protocols' performance, in terms of successful delivery of traffic from outlying nodes, indicating that such protocols are only appropriate for very small networks, as measured by hop count. [ABSTRACT FROM AUTHOR]

Target tracking with wireless sensor networks (WSNs) has been a hot research topic recently. Many works have been done to improve the algorithms for localization and prediction of a moving target with smart sensors. However, the results are frequently difficult to implement because of hardware limitations. In this paper, we propose a practical distributed sensor activation algorithm (DSA) that enables reliable tracking with the simplest binary-detection sensors. In this algorithm, all sensors in the field are activated with a probability to detect targets or sleep to save energy, the schedule of which depends on their neighbor sensors' behaviors. Extensive simulations are also shown to demonstrate the effectiveness of the proposed algorithm. Great improvement in terms of energy-quality tradeoff and excellent robustness of the algorithm are also emphasized in the simulations. [ABSTRACT FROM AUTHOR]

d-hoc wireless sensor networks suffer from problems of congestion, which lead to packet loss and excessive energy consumption. In this paper, we address the issue of congestion in these networks. We propose a new routing protocol for wireless sensor networks namely Ant-based Routing with Congestion Control ( ARCC), which takes into account the congestion of the network at a given instant and proposes to reduce it and then finds the optimum paths between the source and the sink nodes. Simulation results show that ARCC performs better with respect to the throughput, the number of packets lost and the priority performance. [ABSTRACT FROM AUTHOR]

The ability to slow down the propagation of light touches both fundamental aspects of light-matter interactions and practical applications in photonic communication and computation. Optical quantum interference can substantially reduce the speed of light while offering additional dramatic optical effects based on the ability to control electronic quantum states. Recent efforts are increasingly being directed towards harnessing these effects in integrated photonic structures. Here, we report the first demonstration of slow light and electromagnetically induced transparency in a self-contained, planar atomic spectroscopy chip. Using hot rubidium atoms in hollow-core waveguides, we demonstrate 44% optical transparency with a group index of 1,200, or more than sevenfold slower light than in photonic-crystal waveguides. Optical pulse delays of 16 ns with a delay-bandwidth product of 0.8 are observed. This implementation of atomic quantum state control in integrated photonic structures will enable coherent photonics at ultralow power levels. [ABSTRACT FROM AUTHOR]

Increasing the number of cores in a multi-core processor can only be achieved by reducing the resources available in each core, and hence sacrificing the per-core performance. Furthermore, having a large number of homogeneous cores may not be effective for all the applications. For instance, threads with high instruction level parallelism will under-perform considerably in the resource-constrained cores. In this paper, we propose a core architecture that can be adapted to improve a single thread’s performance or to execute multiple threads. In particular, we integrate Reconfigurable Hardware Unit (RHU) in the resource-constrained cores of a many-core processor. The RHU can be reconfigured to execute the frequently encountered instructions from a thread in order to increase the core’s overall execution bandwidth, thus improving its performance. On the other hand, if the core’s resources are sufficient for a thread, then the RHU can be configured to executed instructions from a different thread to increase the thread level parallelism. The RHU has low area overhead, and hence has minimal impact on scalability of the number of cores. To further limit the area overhead of this mechanism, generation of the reconfiguration bits for the RHUs of multiple cores is delegated to a single core. In this paper, we present the results for using the RHU to improve a single thread’s performance. Our experiments show that the proposed architecture improves the per-core performance by an average of about 23% across a wide range of applications. [ABSTRACT FROM AUTHOR]

Efficient spectrum-sharing mechanisms are crucial to alleviate the bandwidth limitation in wireless networks. In this paper, we consider the following question: can free spectrum be shared efficiently? We study this problem in the context of 802.11 or WiFi networks. Each access point (AP) in a WiFi network must be assigned a channel for it to service users. There are only finitely many possible channels that can be assigned. Moreover, neighboring access points must use different channels so as to avoid interference. Currently these channels are assigned by administrators who carefully consider channel conflicts and network loads. Channel conflicts among APs operated by different entities are currently resolved in an ad hoc manner (i.e., not in a coordinated way) or not resolved at all. We view the channel assignment problem as a game, where the players are the service providers and APs are acquired sequentially. We consider the price of anarchy of this game, which is the ratio between the total coverage of the APs in the worst Nash equilibrium of the game and what the total coverage of the APs would be if the channel assignment were done optimally by a central authority. We provide bounds on the price of anarchy depending on assumptions on the underlying network and the type of bargaining allowed between service providers. The key tool in the analysis is the identification of the Nash equilibria with the solutions to a maximal coloring problem in an appropriate graph. We relate the price of anarchy of these games to the approximation factor of local optimization algorithms for the maximum k-colorable subgraph problem. We also study the speed of convergence in these games. [ABSTRACT FROM AUTHOR]

This paper introduces two alternative algorithms for efficient data transfer in the Grid environment. For data transfer from a source node to the destination node, the algorithms can construct multiple dynamic paths by selecting some other nodes as data relays. The bandwidth available in different paths can be aggregated thus to significantly speed up the data transfer process. The proposed algorithms differ from each other in whether the global networking information should be considered. Experimental results indicate that both algorithms can provide efficient data transfer under various circumstances. [ABSTRACT FROM AUTHOR]

Minimizing the number of bandwidth changes of individual stream and enabling the transmission schedule flexible can benefit increasing the number of concurrent multiplexed streams in periodic network without degrading quality of video. However, minimum change bandwidth allocation (MCBA) only provides a fixed transmission schedule for given video and client buffer although it achieves the minimum number of rate changes and the minimum peak rate. So the MCBA schedule cannot be adjusted when multiple streams are multiplexed over a limited bandwidth shared link. In this paper, we propose a relaxing transmission schedule that provides a range of rates for each interval and preserves the minimum number of rate changes without increasing any rate. As a result, the individual schedule can be adjusted by network service to try to satisfy bandwidth constraint when the total required bandwidth of multiplexed streams exceeds the available network capacity. First, we underline that the key of MCBA is to segment video with making each linear trajectory as long as possible. Then we use linear separability and support vector machine under the classification model to compute the longest interval and the required rate, respectively. Due to our proposed decoupled form between segmentation and rate computation, finally, we construct the relaxing schedule bounded by the original MCBA rate and the minimum rate. The simulation using real MPEG4 and H.264 video traces confirms the philosophy and evaluates the relaxing performance of our proposed algorithm. [ABSTRACT FROM AUTHOR]

In highly dynamic and heterogeneous wireless mesh networks (WMN), link quality will seriously affect network performance. Two challenges hinder us from achieving a highly efficient WMN. One is the channel dynamics. As in real network deployment, channel qualities are changing over time, which would seriously affect network bandwidth and reliability. Existing works are limited to the assumption that link quality values are fixed, and optimal scheduling algorithms are working on the fixed values, which would inevitably suffer from the link quality dynamics. Another challenge is the channel diversity. In single channel wireless networks, channel assignment and scheduling are $\mathcal{NP}$ -hard. And in multichannel wireless networks, it could be even harder for higher throughput and efficient scheduling. In this study, we firstly characterize the stochastic behavior on wireless communications in a Markov process, which is based on statistical methodology. Secondly, on exploiting the stochastic behavior on wireless channels, we propose a stochastic programming model in achieving maximized network utilization. Considering the $\mathcal{NP}$ -hardness, we propose a heuristic solution for it. The key idea in the proposed algorithm is a two-stage matching process named “Rematch.” Indeed, our solution to the stochastic network scheduling is a cross-layer approach. Also, we have proved that it is 2-approximate to the optimal result. Moreover, extensive simulations have been done, showing the efficiency of “Rematch” in highly dynamic and distributed wireless mesh networks. [ABSTRACT FROM AUTHOR]

Underwater communication is a very challenging topic. Protocols used in terrestrial sensor networks cannot be directly applied in the underwater world. High-bit error rate and large propagation delay make the design of transport protocols especially awkward. ARQ-based reliable transport schemes are not appropriate in underwater environments due to large propagation delay, low communication bandwidth, and high error probability. Thus, we focus on redundancy-based transport schemes in this paper. We first investigate three schemes that employ redundancy mechanisms at the bit and/or packet level to increase the reliability in a direct link scenario. Then, we show that the broadcast property of the underwater channel allows us to extend those schemes to a case with node cooperative communication. Based on our analysis, an adaptive redundancy transport protocol (ARRTP) for underwater sensor networks is proposed. We suggest an architecture for implementation. For two kinds of topologies, namely, regular and random, we show that ARRTP presents a better transmission success probability and energy efficiency tradeoff for single- and multihop transmissions. We also offer an integrated case study to show that ARRTP is not only supplying reliability but also has some positive effect in guiding the deployment of underwater sensor nodes. [ABSTRACT FROM AUTHOR]

A novel theoretical framework for uplink simulations is proposed. It allows investigations which have to cover a very long (real -) time and which at the same time require a certain level of accuracy in terms of radio resource management, quality of service, and mobility. This is of particular importance for simulations of self-organizing networks. For this purpose, conventional system level simulators are not suitable due to slow simulation speeds far beyond real-time. Simpler, snapshot-based tools are lacking the aforementioned accuracy. The runtime improvements are achieved by deriving abstract theoretical models for the MAC layer behavior. The focus in this work is long term evolution, and the most important uplink effects such as fluctuating interference, power control, power limitation, adaptive transmission bandwidth, and control channel limitations are considered. Limitations of the abstract models will be discussed as well. Exemplary results are given at the end to demonstrate the capability of the derived framework. [ABSTRACT FROM AUTHOR]

In this paper, we present IAC, an interference aware admission control algorithm for use in wireless mesh networks. The core concept of IAC is to use a low overhead dual threshold based approach to share the bandwidth information with its neighbors in the interfering range. As a result, IAC guarantees that the shared wireless bandwidth is not overutilized and the quality of all existing flows are preserved. Moreover, IAC takes into account the intraflow interference effect to estimate the bandwidth consumption of the flow in a multihop path. We have further proposed two approaches of bandwidth allocation, FCFS and MCU, and demonstrated that proper tuning of thresholds can lead to high performance of both schemes. Simulation results illustrate that IAC effectively limits the overutilization of channel resources which in turn results in high throughput, low delay and low packet loss rate for all admitted flows. [ABSTRACT FROM AUTHOR]

Abstract   A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangement of the vertices of a caterpillar with bandwidth at most O(log n/log log n) times the local density of the caterpillar, where the local density is a well known lower bound on the bandwidth. This result is best possible in the sense that there are caterpillars whose bandwidth is larger than their local density by a factor of Ω(log n/log log n). The previous best approximation ratio for the bandwidth of caterpillars was O(log n). We show that any further improvement in the approximation ratio would require using linear arrangements that do not respect the order of the vertices of the backbone. We also show how to obtain a (1+ε) approximation for the bandwidth of caterpillars in time . This result generalizes to trees, planar graphs, and any family of graphs with treewidth . [ABSTRACT FROM AUTHOR]

This paper considers networks operating under α-fair bandwidth sharing. When imposing a peak rate (i.e., an upper bound on the users’ transmission rates, which could be thought of as access rates), the equilibrium point of the fluid limit is explicitly identified, for both the single-node network as well as the linear network. More specifically, a criterion is derived that indicates, for each specific class, whether or not it is essentially transmitting at peak rate. Knowing the equilibrium point of the fluid limit, the steady-state behavior under a diffusion scaling is determined. This allows an explicit characterization of the correlations between the number of flows of the various classes. [ABSTRACT FROM AUTHOR]

We consider bandwidth-sharing networks, and show how the SRPT (Shortest Remaining Processing Time) discipline can be used in order to improve the delay performance of the system. Our main idea is not to use SRPT globally between the traffic classes, which has been shown to induce instability, but rather deploy SRPT only locally within each traffic class. We show that with this approach, the performance of any stable bandwidth allocation policy can be improved. Importantly, our result is valid for any network topology and any flow size distribution. A numerical study is included to illustrate the results. [ABSTRACT FROM AUTHOR]

The caching of frequently accessed data items on the client side is an effective technique to improve performance in a mobile environment. Caching data in a wireless mobile computer can significantly reduce the bandwidth requirement. However, cache content needs to be validated; classical cache invalidation strategies are not suitable for mobile environments due to the disconnection frequency and mobility of the mobile clients. Attractive cache invalidation techniques are based on invalidation reports (IRs). But, IR-based cache invalidation schemes result in considerable consumption of uplink and download bandwidth. In this paper, we address these problems by presenting a new energy-efficient cache invalidation method for the wireless mobile environment. The new cache invalidation scheme is called Adaptive Energy Efficient Cache Invalidation Scheme (AEECIS). The algorithm is adaptive since it changes the data dissemination strategy based on the current conditions. To reduce the bandwidth requirement, the server transmits in one of three modes: slow, fast or super-fast. The mode is selected based on thresholds specified for time and the number of clients requesting updated objects. An efficient implementation of AEECIS is presented and simulations have been carried out to evaluate its caching effectiveness. The results demonstrate that it can substantially improve mobile caching by reducing the communication bandwidth (thus energy consumption) for query processing. Also, the reported results demonstrate that compared to previous IR-based schemes, AEECIS can significantly improve the bandwidth consumption and the number of uplink requests. [ABSTRACT FROM AUTHOR]

The technology advance in network has accelerated the development of multimedia applications over the wired and wireless communication. To alleviate network congestion and to reduce latency and workload on multimedia servers, the concept of multimedia proxy has been proposed to cache popular contents. Caching the data objects can relieve the bandwidth demand on the external network, and reduce the average time to load a remote data object to local side. Since the effectiveness of a proxy server depends largely on cache replacement policy, various approaches are proposed in recent years. In this paper, we discuss the cache replacement policy in a multimedia transcoding proxy. Unlike the cache replacement for conventional web objects, to replace some elements with others in the cache of a transcoding proxy, we should further consider the transcoding relationship among the cached items. To maintain the transcoding relationship and to perform cache replacement, we propose in this paper the RESP framework (standing for REplacement with Shortest Path). The RESP framework contains two primary components, i.e., procedure MASP (standing for Minimum Aggregate Cost with Shortest Path) and algorithm EBR (standing for Exchange-Based Replacement). Procedure MASP maintains the transcoding relationship using a shortest path table, whereas algorithm EBR performs cache replacement according to an exchanging strategy. The experimental results show that the RESP framework can approximate the optimal cache replacement with much lower execution time for processing user queries. [ABSTRACT FROM AUTHOR]

Signal processing at terahertz speeds calls for an enormous leap in bandwidth beyond the current capabilities of electronics, for which practical operation is currently limited to tens of gigahertz. This can be achieved through all-optical schemes making use of the ultrafast response of χ(3) nonlinear waveguides. Towards this objective, we have developed compact planar rib waveguides based on As2S3 glass, providing a virtual ‘lumped’ high nonlinearity in a monolithic platform capable of integrating multiple functions. Here, we apply it to demonstrate, for the first time, a photonic-chip-based, all-optical, radio-frequency spectrum analyser with the performance advantages of distortion-free, broad measurement bandwidth (>2.5 THz) and flexible wavelength operation (that is, colourless). The key to this is the waveguide's high optical nonlinearity and dispersion-shifted design. Using the device, we characterize high-bit-rate (320 Gb s−1) optical signals impaired by various distortions. The demonstrated ultrafast, broadband capability highlights the potential for integrated chip-based signal processing at bit rates approaching and beyond Tb s−1. [ABSTRACT FROM AUTHOR]

As network traffic bandwidth is increasing at an exponential rate, it’s impossible to keep up with the speed of networks by just increasing the speed of processors. Besides, increasingly complex intrusion detection methods only add further to the pressure on network intrusion detection (NIDS) platforms, so the continuous increasing speed and throughput of network poses new challenges to NIDS. To make NIDS usable in Gigabit Ethernet, the ideal policy is using a load balancer to split the traffic data and forward those to different detection sensors, which can analyze the splitting data in parallel. In order to make each slice contains all the evidence necessary to detect a specific attack, the load balancer design must be complicated and it becomes a new bottleneck of NIDS. To simplify the load balancer this paper put forward a distributed neural network learning algorithm (DNNL). Using DNNL a large data set can be split randomly and each slice of data is presented to an independent neural network; these networks can be trained in distribution and each one in parallel. Completeness analysis shows that DNNL’s learning algorithm is equivalent to training by one neural network which uses the technique of regularization. The experiments to check the completeness and efficiency of DNNL are performed on the KDD’99 Data Set which is a standard intrusion detection benchmark. Compared with other approaches on the same benchmark, DNNL achieves a high detection rate and low false alarm rate. [ABSTRACT FROM AUTHOR]

Checkpointing, the process of saving program/application state, usually to a stable storage, has been the most common fault-tolerance methodology for high-performance applications. The rate of checkpointing (how often) is primarily driven by the failure rate of the system. If the checkpointing rate is low, fewer resources are consumed but the chance of high computational loss is increased and vice versa if the checkpointing rate is high. It is important to strike a balance, and an optimum rate of checkpointing is required. In this paper, we analytically model the process of checkpointing in terms of mean-time-between-failure of the system, amount of memory being checkpointed, sustainable I/O bandwidth to the stable storage, and frequency of checkpointing. We identify the optimum frequency of checkpointing to be used on systems with given specifications thereby making way for efficient use of available resources and maximum performance of the system without compromising on the fault-tolerance aspects. Further, we develop discrete-event models simulating the checkpointing process to verify the analytical model for optimum checkpointing. Using the analytical model, we also investigate the optimum rate of checkpointing for systems of varying resource levels ranging from small embedded cluster systems to large supercomputers. [ABSTRACT FROM AUTHOR]

Band-pass (in a 0.5- to 10.0-GHz range) characteristics of a converter based on a coaxial conical line with a cylindrical inner conductor, which excites the TM 01 mode of a circular waveguide, are theoretically and experimentally studied. It is shown that the upper frequency of the operating band of this converter is limited by the resonance excitation of the TM mode in the coaxial conical line. Another version of the converter based on the coaxial conical line with a conical inner conductor, in which the conversion bandwidth of 95% TEM mode power into the TM 01 mode power is increased to 60%, is designed. [ABSTRACT FROM AUTHOR]

Clusters of workstations employ flexible topologies: regular, irregular, and hierarchical topologies have been used in such systems. The flexibility poses challenges for developing efficient collective communication algorithms since the network topology can potentially have a strong impact on the communication performance. In this paper, we consider the all-to-all broadcast operation on clusters with cut-through and store-and-forward switches. We show that near-optimal all-to-all broadcast on a cluster with any topology can be achieved by only using the links in a spanning tree of the topology when the message size is sufficiently large. The result implies that increasing network connectivity beyond the minimum tree connectivity does not improve the performance of the all-to-all broadcast operation when the most efficient topology specific algorithm is used. All-to-all broadcast algorithms that achieve near-optimal performance are developed for clusters with cut-through and clusters with store-and-forward switches. We evaluate the algorithms through experiments and simulations. The empirical results confirm our theoretical finding. [ABSTRACT FROM AUTHOR]

Abstract  Dynamic verification using the checker processor introduces severe degradation in performance unless the checker is as fast as the main processor core. Without widening the checker’s bandwidth, we propose an active verification management (AVM) approach that utilizes a checker hierarchy. Before an instruction is verified at the checker processor, a filter checker marks a correctness non-criticality indicator (CNI) bit to indicate how likely its result is to be unimportant for reliability. AVM uses the CNI information to realize a congestion avoidance policy. Both reactive and proactive congestion avoidance policies are proposed to mitigate the performance degradation caused by the checker’s congestion. Based on a simplified queueing model, we evaluate the proposed AVM analytically. Our experimental results show that AVM has the potential to solve the verification congestion problem when perfect fault coverage is not needed. With no AVM, congestion at the checker badly affects performance, to the tune of 57%, when compared to that of a non-fault-tolerant processor. With good marking by AVM, the performance of a reliable processor approaches 95% of that of a processor with no verification. Although instructions can be skipped on a random basis, such an approach reduces the fault coverage. A filter checker with a marking policy correlated with the correctness non-criticality metric, on the other hand, significantly reduces the soft error rate. Finally, we also present results showing the trade-off between performance and reliability. [ABSTRACT FROM AUTHOR]

Cavity-enhanced direct frequency comb spectroscopy combines broad spectral bandwidth, high spectral resolution, precise frequency calibration, and ultrahigh detection sensitivity, all in one experimental platform based on an optical frequency comb interacting with a high-finesse optical cavity. Precise control of the optical frequency comb allows highly efficient, coherent coupling of individual comb components with corresponding resonant modes of the high-finesse cavity. The long cavity lifetime dramatically enhances the effective interaction between the light field and intracavity matter, increasing the sensitivity for measurement of optical losses by a factor that is on the order of the cavity finesse. The use of low-dispersion mirrors permits almost the entire spectral bandwidth of the frequency comb to be employed for detection, covering a range of ∼ 10% of the actual optical frequency. The light transmitted from the cavity is spectrally resolved to provide a multitude of detection channels with spectral resolutions ranging from several gigahertz to hundreds of kilohertz. In this review we will discuss the principle of cavity-enhanced direct frequency comb spectroscopy and the various implementations of such systems. In particular, we discuss several types of UV, optical, and IR frequency comb sources and optical cavity designs that can be used for specific spectroscopic applications. We present several cavity-comb coupling methods to take advantage of the broad spectral bandwidth and narrow spectral components of a frequency comb. Finally, we present a series of experimental measurements on trace gas detections, human breath analysis, and characterization of cold molecular beams. These results demonstrate clearly that the wide bandwidth and ultrasensitive nature of the femtosecond enhancement cavity enables powerful real-time detection and identification of many molecular species in a massively parallel fashion. [ABSTRACT FROM AUTHOR]

Ultra wideband (UWB) systems are currently an important wireless infrastructure for efficient short-range communications and mobile applications. To improve the system efficiency while guaranteeing the radio link level quality of services, the transmission rate and power of the mobile nodes in UWB based infrastructure networks can be dynamically adjusted by executing an optimization algorithm at the access points (APs). In this paper, we present a cross layer rate and power allocation algorithm based on the multilayer model of time hopping (TH) pulse position modulation (PPM) UWB multimedia networks. We consider the performance of the TCP protocol under the proposed cross layer allocation scheme in various realistic UWB based infrastructure networking scenarios. [ABSTRACT FROM AUTHOR]

We present a Quality of Service (QoS)-supported on-chip communication that increases the shared communication resources for multi-processor systems on chip. Time-critical embedded systems require tight guaranteed services in terms of throughput, latency etc. in order to comply to hard real-time constraints. Typically, guaranteed-service schemes require dedicated/reserved resources (i.e. links) for communication and thus suffer from low resource utilization. So improving the bandwidth utilization by using the unused bandwidth among the other competing transactions in a fair fashion is an important issue. To the best of our knowledge, we are presenting the first approach for on-chip communication that provides a high resource utilization under a transaction-specific, flexible communication scheme. It provides tight time-related guarantees through our bounded arbitration scheme considering the lower and the upper bounds for each type of transactions. We demonstrate its advantages by means of a complete MPEG4 video decoder case study analysis and achieve under certain constraints a bandwidth utilization of up to 100% and 97% on average with a guaranteed 100% bandwidth. Thus, we provide an on-chip communication scheme that provides high bandwidth utilization while providing tight guarantee. [ABSTRACT FROM AUTHOR]

Photonic-crystal fibers are shown to allow efficient spectral transformation of nanosecond laser pulses through parametric four-wave mixing and stimulated Raman scattering. Regimes providing highly efficient transformation of nanosecond laser pulses into white-light broadband radiation (supercontinuum) are identified. A strong parametric coupling between Stokes and anti-Stokes Raman sidebands around the wavelength of zero group-velocity dispersion is shown to increase the bandwidth and to improve the spectral quality of supercontinuum radiation. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel architecture for the admission control module of a Bandwidth Broker entity that aims at achieving a satisfactory balance between maximizing the resource utilization for themanaged network and minimizing the overhead of the module. We also describe, analyze and evaluate mechanisms which aim at solving the additional problems of fairly prioritizing resubmitted requests and efficiently handling requests which do not specify ending times. We use the well known network simulator ns-2, as well as a custom simulation environment in order to study the performance characteristics of the proposed mechanisms and compare them with various alternatives for the admission control module of a Bandwidth Broker. We provide the results of the experimental evaluations and the conclusions they lead us to for the relative importance of the proposed solution and the various alternatives, their advantages and drawbacks, and the environments for which each one is best suited. [ABSTRACT FROM AUTHOR]

This work presents a service-oriented architecture for interdomain service provisioning in optical networks. The architecture introduces a service layer that concentrates all the interactions among domains necessary for service provisioning. A service layer is an alternative to the GMPLS (Generalized Multiprotocol Label Switching) architecture, but without a rigid control plane as found in GMPLS. We start by defining a set of basic services to provide single end-to-end (e2e) interdomain connections. Then, more sophisticated services are created through the composition of these basic services. The interdomain Optical VPN (Virtual Private Network) service is considered in order to illustrate the composition of services. A prototype of the architecture was designed and implemented usingWeb services as themain technology. The architecture was evaluated in terms of speed, scalability, and bandwidth consumption necessary to establish e2e interdomain connections and Optical VPNs. [ABSTRACT FROM AUTHOR]

The performance of an optical wideband wavelength division multiplexed (WDM) communication system is analyzed considering the effects of stimulated Raman scattering, fiber attenuation and chromatic dispersion. Improved models for the Raman gain and the fiber attenuation constant are proposed, which yield better and reliable performance results of the WDM system. Effect of fiber chromatic dispersion is also investigated and it is observed that dispersion can suitably be selected to overcome the limitations imposed by the stimulated Raman scattering phenomenon. [ABSTRACT FROM AUTHOR]

WINNER is an international research project under Framework Program 6 (FP6) of the European Commission. The main objective is the development of the new radio interface for systems beyond 3G. WINNER is part of the Wireless World Initiative (WWI), which is a series of cooperating projects in FP6 to develop future systems including all entities from a system perspective. The project is developing all system functions from layer 1 to 3 including cooperation mechanisms with legacy systems as part of the overall architecture for systems beyond 3G. Based on usage scenarios and propagation investigations, technical requirements are derived. The physical layer and higher layer protocols are designed. A new broadband radio interface requires newly identified frequency spectrum. WINNER is contributing to the international regulatory process in ITU-R towards the preparation of WRC 2007 (World Radiocommunication Conference). This paper provides an overview about the WINNER project and its activities. [ABSTRACT FROM AUTHOR]

As the demand for high bandwidths in microelectronic systems increases, optical interconnect architectures are now being considered that involve schemes commonly used in telecommunications, such as wavelength-division multiplexing (WDM) and wavelength conversion. In such on-chip architectures, the ability to perform wavelength conversion is required. So far wavelength conversion on a silicon chip has only been demonstrated using schemes that are fundamentally all-optical, making their integration on a microelectronic chip challenging. In contrast, we show wavelength conversion obtained by inducing ultrafast electro–optic tuning of a microcavity. It is well known that tuning the parameters of an optical cavity induces filtering of different colours of light. Here we demonstrate that it can also change the colour of light. This is an effect often observed in other disciplines, for example, in acoustics, where the sound generated by a resonating guitar string can be modified by changing the length of the strings (that is, the resonators). Here we show this same tuning effect in optics, enabling compact on-chip electrical wavelength conversion. We demonstrate a change in wavelength of up to 2.5 nm with up to 34% on–off conversion efficiency. [ABSTRACT FROM AUTHOR]

Abstract   With the growth and acceptance of the Internet, there has been increased interest in maintaining anonymity in the network. By using traffic analysis, it is possible to infer who is talking to whom over the Internet. We present a novel approach to hide the senders and the receivers of messages. Routes are chosen and frames traverse these routes. Each frame consists of a token and a node can send a message through a frame only when the corresponding token is free. The advantage of our protocol is that it poses limited bandwidth overhead when there is at least some traffic, while posing minimal bandwidth overhead when there is no traffic at all. [ABSTRACT FROM AUTHOR]

Abstract??A one-sided asymptotically normal test for non-correlation between two stationary time series is proposed based on the spectral coherence function. The test statistic is a properly standardized version of the integrated spectral coherency and has similar asymptotic properties as a previously introduced time domain based test for non-correlation. Unlike its time domain counterpart, the proposed test does not require prewhitening of the time series and, thus, is a truly nonparametric test for non-correlation. In a simulation study, we evaluate the small sample performance of the proposed test in comparison with the time domain test and address the problem of bandwidth selection. Furthermore, we present a modification of the test statistic that allows to test for non-correlation over frequency bands. This version shows higher power of detecting interrelationships restricted to the frequency band of interest. [ABSTRACT FROM AUTHOR]

The efficient use of resources and the lossless transfer of data bursts in future optical networks requires the accurate knowledge of the available bandwidth for each network link. Such information is important in monitoring congestions and can be used by appropriate load balancing and congestion avoidance mechanisms. In this paper we propose a mechanism for monitoring and subsequently managing bandwidth resources, using the Simple Network Management Protocol (SNMP). In the proposed mechanism, link bandwidth availability is not a scalar parameter, but a function of time that records the future utilization of the link. For every output port, each agent-node maintains a simple data structure in the form of a table that records the utilization profile of that outgoing link. With the addition of new objects in the Management Information Base (MIB) of each agent-node and proper synchronization, SNMP can be used to update and retrieve the reservations made on the links in order to obtain an instant picture of the network traffic situation. [ABSTRACT FROM AUTHOR]

In order to increase bandwidth utilization, next generation communication networks could offer a Quality of Service (QoS) to active connections in a statistical sense rather than deterministic sense. For this to be practical the presence of new regulation algorithms at the network edge would be required. These new algorithms would be designed to bound incoming traffic flows with predetermined statistical descriptors. Here, we propose a novel yet simple regulation algorithm which bounds an arrival process with the statistical traffic descriptor known as exponentially bounded burstiness (EBB). We show that by setting the parameters of the algorithm appropriately, the arrival process can be regulated so as to bound the flow with another statistical descriptor—the effective bandwidth. Both of these statistical descriptors have a well-developed network calculus related to bandwidth utilization for a requested statistical QoS metric. Our algorithm allows us to apply with confidence the EBB and effective bandwidth network calculus to traffic flows within the network core. [ABSTRACT FROM AUTHOR]

We propose a two-ring resonator configuration that can provide optical switching with both high extinction ratio (ER) and low switching threshold. The achievable input threshold is n 2IIN ~ 10−5 or smaller, which is one order lower than that of the conventional one-ring configuration, while maintaining an ER of at least 10dB over a 10-GHz (0.1 nm) optical bandwidth. This performance is enabled by using an asymmetric Fano resonance as opposed to the usual symmetric resonance. The low switching threshold and the high ER are related to the sharpness and the asymmetricity of the Fano resonance, respectively. [ABSTRACT FROM AUTHOR]

In the paper, a novel power-splitting scheme based on two dimensional photonic crystal (2D PhC) is proposed. The structure can be divided into three sections, including the input waveguide, coupling region, and output region, and the latter two sections consist of two parallel waveguides placed in proximity. The operation principle of the splitter is that only one of the super-modes splitting from the directional coupler can propagate through coupling region in the frequency range of interest. The radius of air holes next to the guiding region in coupling region is increased to avoid the acute back reflection at the entrance to the input waveguide induced by the modes mismatch between the input waveguide and coupling region. While in output region, the radius of these corresponding air holes is also increased so that the two splitting super-modes have same propagation constants to avoid the coupling between the two output waveguides. Moreover, as the length of coupling region is varied, its influence on the splitting performance is discussed, and it is verified that the relationship between the splitter length and bandwidth has a trade-off. [ABSTRACT FROM AUTHOR]

Current efforts in managing knowledge have concentrated on creating, sharing and storing knowledge while business problems require the combined use of these intellectual resources to enable organizations to provide innovative and customized services. The Intellectual Bandwidth model posits that an organization's potential to create value is determined by its intellectual assets and collaboration capabilities. While this is a potentially powerful assertion, the model does not explain the relationship between knowledge management and collaboration. This paper argues that knowledge management and collaboration have common, mutually interdependent purposes and practices. It demonstrates this interdependence, by mapping collaboration processes to knowledge management activities. Following an analysis of the relationship between knowledge management activities and collaboration, this paper concludes with implications for the use of collaboration technologies for increasing the potential of an organization to create value. [ABSTRACT FROM AUTHOR]

The article outlines how video technology can be utilized to create a formal Quiz Bowl competition among students in different parts of the world. The author stressed that the current better alternative to receive structured interactions with students in other parts of the world, with high quality picture and voice exchanges, is by using compressed video systems connected via broad bandwidth integrated services digital network phone lines. The "Students Around the world exchanging over the phone" video project is presented to further discuss the matter. The participants' perceptions of their experiences using compressed video to meet and interact with students around the world are likewise presented.

Several MAC protocols for ad-hoc networks have been proposed in the literature for topologies with a large number of nodes. In particular, the MAC protocols based on 802.11 cannot guarantee the delays needed by real-time traffic, as they are mainly based on the CSMA/CA random access scheme, which inserts significant random inter-frame delay components, strongly dependent on network load. Other MAC protocols assign dynamically a dedicated channel to each connected node. In this way, it is possible to guarantee a strictly controlled delay for real-time traffic at the expense of a greater bandwidth waste. The goal of this paper is to evaluate the performance of a MAC protocol of this latter family. Our analysis is focused on scenarios with fast moving users, while in the literature most of the proposed MACs, also for mobile ad-hoc networks, are studied in the case of stationary users. Our study shows that the system performance strongly depends on the users' speed and provides an accurate analysis of the performance degradation registered as speed grows. [ABSTRACT FROM AUTHOR]