Characterization of the Burst Stabilization Protocol for the RR/RR CICQ Switch

Input buffered switches with Virtual Output Queueing (VOQ) can be unstable when presented with unbalanced loads. Existing scheduling algorithms, including iSLIP for Input Queued (IQ) switches and Round Robin (RR) for Combined Input and Crossbar Queued (CICQ) switches, exhibit instability for some schedulable loads. We investigate the use of a queue length threshold and bursting mechanism to achieve stability without requiring internal speed-up. An analytical model is developed to prove that the burst stabilization protocol achieves stability and to predict the minimum burst value needed as a function of offered load. The analytical model is shown to have very good agreement with simulation results. These results show the advantage of the RR/RR CICQ switch as a contender for the next generation of high-speed switches.Comment: Presented at the 28th Annual IEEE Conference on Local Computer Networks (LCN), Bonn/Konigswinter, Germany, Oct 20-24, 200

Coalition Formation Game for Cooperative Content Delivery in Network Coding Assisted D2D Communications

Device-to-device (D2D) communications have shown a huge potential in cellular offloading and become a potential technology in 5G and beyond. In D2D networks, the requested contents by user devices (UDs) can be delivered via D2D links, thus offloading the content providers (CPs). In this work, we address the problem of minimizing the delay of delivering content in a decentralized and partially D2D connected network using network coding (NC) and cooperation among the UDs. The proposed optimization framework considers UDs’ acquired and missing contents, their limited coverage zones, NC, and content’s erasure probability. As such, the completion time for delivering all missing contents to all UDs is minimized. The problem is modeled as a coalition game with cooperative-players wherein the payoff function is derived so that increasing individual payoff results in the desired cooperative behavior. Given the intractability of the formulation, the coalition game is relaxed to a coalition formation game (CFG). A distributed coalition formation algorithm relying on merge-and-split rules is developed for solving the relaxed problem at each transmission. The effectiveness of the proposed solution is validated through computer simulation against existing schemes

Coalition Formation Game for Cooperative Content Delivery in Network Coding Assisted D2D Communications

Device-to-device (D2D) communications have shown a huge potential in cellular offloading and become a potential technology in 5G and beyond. In D2D networks, the requested contents by user devices (UDs) can be delivered via D2D links, thus offloading the content providers (CPs). In this work, we address the problem of minimizing the delay of delivering content in a decentralized and partially D2D connected network using network coding (NC) and cooperation among the UDs. The proposed optimization framework considers UDs’ acquired and missing contents, their limited coverage zones, NC, and content’s erasure probability. As such, the completion time for delivering all missing contents to all UDs is minimized. The problem is modeled as a coalition game with cooperative-players wherein the payoff function is derived so that increasing individual payoff results in the desired cooperative behavior. Given the intractability of the formulation, the coalition game is relaxed to a coalition formation game (CFG). A distributed coalition formation algorithm relying on merge-and-split rules is developed for solving the relaxed problem at each transmission. The effectiveness of the proposed solution is validated through computer simulation against existing schemes

Graphical preference representation under a possibilistic framework

La modélisation structurée de préférences, fondée sur les notions d'indépendance préférentielle, a un potentiel énorme pour fournir des approches efficaces pour la représentation et le raisonnement sur les préférences des décideurs dans les applications de la vie réelle. Cette thèse soulève la question de la représentation des préférences par une structure graphique. Nous proposons une nouvelle lecture de réseaux possibilistes, que nous appelons p-pref nets, où les degrés de possibilité représentent des degrés de satisfaction. L'approche utilise des poids de possibilité non instanciés (appelés poids symboliques), pour définir les tables de préférences conditionnelles. Ces tables donnent naissance à des vecteurs de poids symboliques qui codent les préférences qui sont satisfaites et celles qui sont violées dans un contexte donné. Nous nous concentrons ensuite sur les aspects théoriques de la manipulation de ces vecteurs. En effet, la comparaison de ces vecteurs peut s'appuyer sur différentes méthodes: celles induites par la règle de chaînage basée sur le produit ou celle basée sur le minimum que sous-tend le réseau possibiliste, les raffinements du minimum le discrimin, ou leximin, ainsi que l'ordre Pareto, et le Pareto symétrique qui le raffine. Nous prouvons que la comparaison par produit correspond exactement au celle du Pareto symétrique et nous nous concentrons sur les avantages de ce dernier par rapport aux autres méthodes. En outre, nous montrons que l'ordre du produit est consistant avec celui obtenu en comparant des ensembles de préférences satisfaites des tables. L'image est complétée par la proposition des algorithmes d'optimisation et de dominance pour les p-pref nets. Dans ce travail, nous discutons divers outils graphiques pour la représentation des préférences. Nous nous focalisons en particulier sur les CP-nets car ils partagent la même structure graphique que les p-pref nets et sont basés sur la même nature de préférences. Nous prouvons que les ordres induits par les CP-nets ne peuvent pas contredire ceux des p-pref nets et nous avons fixé les contraintes nécessaires pour raffiner les ordres des p-pref nets afin de capturer les contraintes Ceteris Paribus des CP-nets. Cela indique que les CP-nets représentent potentiellement une sous-classe des p-pref nets avec des contraintes. Ensuite, nous fournissons une comparaison approfondie entre les différents modèles graphiques qualitatifs et quantitatifs, et les p-pref nets. Nous en déduisons que ces derniers peuvent être placés à mi- chemin entre les modèles qualitatifs et les modèles quantitatifs puisqu'ils ne nécessitent pas une instanciation complète des poids symboliques alors que des informations supplémentaires sur l'importance des poids peuvent être prises en compte. La dernière partie de ce travail est consacrée à l'extension du modèle proposé pour représenter les préférences de plusieurs agents. Dans un premier temps, nous proposons l'utilisation de réseaux possibilistes où les préférences sont de type tout ou rien et nous définissons le conditionnement dans le cas de distributions booléennes. Nous montrons par ailleurs que ces réseaux multi-agents ont une contrepartie logique utile pour vérifier la cohérence des agents. Nous expliquons les étapes principales pour transformer ces réseaux en format logique. Enfin, nous décrivons une extension pour représenter des préférences nuancées et fournissons des algorithmes pour les requêtes d'optimisation et de dominance.Structured modeling of preference statements, grounded in the notions of preferential independence, has tremendous potential to provide efficient approaches for modeling and reasoning about decision maker preferences in real-life applications. This thesis raises the question of representing preferences through a graphical structure. We propose a new reading of possibilistic networks, that we call p-pref nets, where possibility weights represent satisfaction degrees. The approach uses non-instantiated possibility weights, which we call symbolic weights, to define conditional preference tables. These conditional preference tables give birth to vectors of symbolic weights that reflect the preferences that are satisfied and those that are violated in a considered situation. We then focus on the theoretical aspects of handling of these vectors. Indeed, the comparison of such vectors may rely on different orderings: the ones induced by the product-based, or the minimum based chain rule underlying the possibilistic network, the discrimin, or leximin refinements of the minimum- based ordering, as well as Pareto ordering, and the symmetric Pareto ordering that refines it. We prove that the product-based comparison corresponds exactly to symmetric Pareto and we focus on its assets compared to the other ordering methods. Besides, we show that productbased ordering is consistent with the ordering obtained by comparing sets of satisfied preference tables. The picture is then completed by the proposition of algorithms for handling optimization and dominance queries. In this work we discuss various graphical tools for preference representation. We shed light particularly on CP-nets since they share the same graphical structure as p-pref nets and are based on the same preference statements. We prove that the CP-net orderings cannot contradict those of the p-pref nets and we found suitable additional constraints to refine p-pref net orderings in order to capture Ceteris Paribus constraints of CP-nets. This indicates that CP-nets potentially represent a subclass of p-pref nets with constraints. Finally, we provide an thorough comparison between the different qualitative and quantitative graphical models and p-pref nets. We deduce that the latter can be positioned halfway between qualitative and quantitative models since they do not need a full instantiation of the symbolic weights while additional information about the relative strengths of these weights can be taken into account. The last part of this work is dedicated to extent the proposed model to represent multiple agents preferences. As a first step, we propose the use of possibilistic networks for representing all or nothing multiple agents preferences and define conditioning in the case of Boolean possibilities. These multiple agents networks have a logical counterpart helpful for checking agents consistency. We explain the main steps for transforming multiple agents networks into logical format. Finally, we outline an extension with priority levels of these networks and provide algorithms for handling optimization and dominance queries

Theoretical evaluation of a V/STOL fighter model utilizing the PAN AIR code

The PAN AIR computer code was investigated as a tool for predicting closely coupled aerodynamic and propulsive flowfields of arbitrary configurations. The NASA/Ames V/STOL fighter model, a configuration of complex geometry, was analyzed with the PAN AIR code. A successful solution for this configuration was obtained when the nozzle exit was treated as an impermeable surface and no wakes were included around the nozzle exit. When separated flow was simulated from the end of the nacelle, requiring the use of wake networks emanating from the nozzle exit, a number of problems were encountered. A circular body nacelle model was used to investigate various techniques for simulating the exhaust plume in PAN AIR. Several approaches were tested and eliminated because they could not correctly simulate the interference effects. Only one plume modeling technique gave good results. A PAN AIR computation that used a plume shape and inflow velocities obtained from the Navier-Stokes solution for the plume produced results for the effects of power that compared well with experimental data

Usefulness of goodwill impairment under SFAS No. 142 in reflecting the relative efficiency of firms

Scope and Method of Study: This study examines goodwill impairment under SFAS No. 142 whether it improves financial reporting quality by better reflecting the underlying relative efficiency of a firm. A firm's relative efficiency is measured by using Data Envelopment Analysis (DEA). The analysis is undertaken on three selected industries--durable manufacturers, computers, and services. First, Wilcoxon rank sum tests are used to compare the efficiency of a firm with other firms in the same industry (the cross-sectional analysis) and with similar firms over different periods (the longitudinal analysis). Second, Tobit and logistic regressions are applied to analyze factors affecting the percentage of goodwill impairment and a decision to report goodwill impairment. Finally, a logistic regression and a multivariate discriminant analysis (MDA) are used to assess the predictive ability of relative efficiency in determining potential goodwill impairment.Findings and Conclusions: Results of Wilcoxon rank sum tests strongly support the hypothesis that impairment firms are relatively less efficient than non-impairment firms in the year of goodwill impairment reporting. Tobit and logistic regressions provide evidence that lagged relative efficiency of firms is negatively associated with the percentage of goodwill impairment and a decision to report goodwill impairment, after controlling for managerial reporting incentives. The inferences are robust to the choice of various input/output variables in the DEA model. The results suggest that the relative efficiency is an important determinant of goodwill impairment. Finally, results of logistic regressions used to assess the predictive ability of relative efficiency indicate that measures of relative efficiency can be used to identify the likelihood of goodwill impairment. The MDA models including relative efficiency measures correctly predict more than 50 percent of the actual impairment. These findings provide opportunity for future research to include a measure of firm overall performance in the prediction model. Overall, goodwill impairment under SFAS No. 142 can reflect the decline in relative efficiency of firms, thereby achieving the FASB's objective

Lightweight certificateless and provably-secure signcryptosystem for the internet of things

International audienceIn this paper, we propose an elliptic curve-based signcryption scheme derived from the standardized signature KCDSA (Korean Certificate-based Digital Signature Algorithm) in the context of the Internet of Things. Our solution has several advantages. First, the scheme is provably secure in the random oracle model. Second, it provides the following security properties: outsider/insider confidentiality and unforgeability; non-repudiation and public verifiability, while being efficient in terms of communication and computation costs. Third, the scheme offers the certificateless feature, so certificates are not needed to verify the user's public keys. For illustration, we conducted experimental evaluation based on a sensor Wismote platform and compared the performance of the proposed scheme to concurrent scheme

Performance issues in hybrid fiber radio communication systems due to nonlinear distortion effects in laser transmitters

With the increasing demand for broadband services, it is expected that hybrid fiber radio systems may be employed to provide high capacity access networks for both mobile and fixed users. In these systems, the radio frequency data signals are modulated onto an optical carrier at a mobile switching centre and then sent over fiber to a number of base stations, before being transmitted over air to the users. A possible method of generating the optical radio frequency data signals for distribution over fiber is to directly modulate the electrical signal onto an optical carrier using a laser diode. The major problem with this technique is that nonlinearities in electncal-to-optical conversion may seriously degrade the system performance. In this work we initially examined the distribution of a wideband code division multiple access signal (centered around 6 GHz) through an optically fed microwave system. Our results show that the adjacent channel leakage ratio is degraded from -52 to -32 dBc after passing through the optical system. We then examined the technique of externally injecting light into the directly modulated laser, to extend the bandwidth of the laser diode and hence, increase it’s linear region to beyond the frequency of interest With this technique an improvement of over 10 dB in the adjacent channel leakage ratio of the signal was achieved. We subsequently went on to examine the distribution of a 5-channel radio frequency signal (each channel carrying 10 Mbit/s) through a hybrid fiber system As in the previous work, we examined how external light injection into the directly modulated laser could be used to improve system performance, and our results show an improvement of up to 5 dB. Finally a model was designed using Matlab, which simulated the 5-channel system mentioned above. It used the laser rate equations to mimic the nonlinear effects of the laser diode Good correlation was observed between experimental and simulated results