4 resultados para Emission permits auctionsj double auctions.
em Aston University Research Archive
Resumo:
In this work we present extensive comparisons between numerical modelling and experimental measurements of the transmission performance of either CSRZ-ASK or CSRZ-DPSK modulation formats for 40-Gb/s WDM ULH systems on UltraWave (TM) fiber spans with all-Raman amplification. We numerically optimised the amplification and the signal format parameters for both CSRZ-DPSK and CSRZ-ASK formats. Numerical and experimental results show that, in a properly optimized transmission link, the DPSK format permits to double the transmission distance ( for a given BER level) with respect to the ASK format, while keeping a substantial OSNR margin ( on ASK modulation) after the propagation in the fiber line. Our comparison between numerical and experimental results permits to identify what is the most suitable BER estimator in assessing the transmission performance when using the DPSK format. (c) 2007 Optical Society of America.
Resumo:
In this work we present extensive comparisons between numerical modelling and experimental measurements of the transmission performance of either CSRZ-ASK or CSRZ-DPSK modulation formats for 40-Gb/s WDM ULH systems on UltraWave™ fiber spans with all-Raman amplification. We numerically optimised the amplification and the signal format parameters for both CSRZ-DPSK and CSRZ-ASK formats. Numerical and experimental results show that, in a properly optimized transmission link, the DPSK format permits to double the transmission distance (for a given BER level) with respect to the ASK format, while keeping a substantial OSNR margin (on ASK modulation) after the propagation in the fiber line. Our comparison between numerical and experimental results permits to identify what is the most suitable BER estimator in assessing the transmission performance when using the DPSK format. © 2007 Optical Society of America.
Resumo:
Supply chain formation is the process by which a set of producers within a network determine the subset of these producers able to form a chain to supply goods to one or more consumers at the lowest cost. This problem has been tackled in a number of ways, including auctions, negotiations, and argumentation-based approaches. In this paper we show how this problem can be cast as an optimization of a pairwise cost function. Optimizing this class of energy functions is NP-hard but efficient approximations to the global minimum can be obtained using loopy belief propagation (LBP). Here we detail a max-sum LBP-based approach to the supply chain formation problem, involving decentralized message-passing between supply chain participants. Our approach is evaluated against a well-known decentralized double-auction method and an optimal centralized technique, showing several improvements on the auction method: it obtains better solutions for most network instances which allow for competitive equilibrium (Competitive equilibrium in Walsh and Wellman is a set of producer costs which permits a Pareto optimal state in which agents in the allocation receive non-negative surplus and agents not in the allocation would acquire non-positive surplus by participating in the supply chain) while also optimally solving problems where no competitive equilibrium exists, for which the double-auction method frequently produces inefficient solutions. © 2012 Wiley Periodicals, Inc.
Resumo:
With the reformation of spectrum policy and the development of cognitive radio, secondary users will be allowed to access spectrums licensed to primary users. Spectrum auctions can facilitate this secondary spectrum access in a market-driven way. To design an efficient auction framework, we first study the supply and demand pressures and the competitive equilibrium of the secondary spectrum market, considering the spectrum reusability. In well-designed auctions, competition among participants should lead to the competitive equilibrium according to the traditional economic point of view. Then, a discriminatory price spectrum double auction framework is proposed for this market. In this framework, rational participants compete with each other by using bidding prices, and their profits are guaranteed to be non-negative. A near-optimal heuristic algorithm is also proposed to solve the auction clearing problem of the proposed framework efficiently. Experimental results verify the efficiency of the proposed auction clearing algorithm and demonstrate that competition among secondary users and primary users can lead to the competitive equilibrium during auction iterations using the proposed auction framework. Copyright © 2011 John Wiley & Sons, Ltd.