Future generation wireless multimediacommunications will require efficient Medium AccessControl (MAC) protocols able to guarantee suitable Qualityof Service (QoS) levels for different traffic classes whileachieving a high utilization of radio resources. This paperproposes a new scheduling technique to be adopted at the MAClevel in wireless access systems, named Dynamic Scheduling-Time DivisionDuplexing (DS-TDD), that efficiently managesvideo, voice, Web and background traffics. A theoretical approachis proposed in this paper to evaluate the DS-TDD performance withvoice and Web traffics. Simulation results have permitted tohighlight the following promising characteristics of the DS-TDDscheme: (i) a high capacity of real-time traffics isattained with a QoS insensitive to Web and background trafficloads; (ii) a high throughput can be guaranteed whilepreserving the QoS levels of the different traffic classes;(iii) heavier downlink traffic loads do not modify the QoSof uplink traffics. Finally, extensive comparisons with differentscheduling schemes proposed in the literature have permitted tohighlight the better performanceof DS-TDD. 相似文献
In this paper, by applying a non linear model for the electromagnetic inverse scattering, a technique for the dielectric profiling of a planarly layered medium is investigated and applied to void localization and diagnostics inside a homogeneous lossless slab (one-dimensional geometry). Data are collected under plane wave multifrequency normal incidence. Suitable finite dimensional representations for the unknown functions are introduced and their influence on the model is discussed. The resulting functional equation is solved by the method of weighted residuals and the solution algorithm amounts to minimizing a non quadratic function, where particular attention is devoted to reduce the occurrence of local minima. Finally, the inversion algorithm is validated by applications to both simulated and experimental data. 相似文献
The security of a deterministic quantum scheme for communication, namely the LM05 [1], is studied in presence of a lossy channel
under the assumption of imperfect generation and detection of single photons. It is shown that the scheme allows for a rate
of distillable secure bits higher than that pertaining to BB84 [2]. We report on a first implementation of LM05 with weak
pulses. 相似文献
The publish/subscribe model offers a loosely-coupled communication paradigm where applications interact indirectly and asynchronously. Publishers generate events that are sent to interested applications through a network of brokers. Subscribers express their interest by specifying filters that brokers can use for routing the events. Supporting confidentiality of messages being exchanged is still challenging. First of all, it is desirable that any scheme used for protecting the confidentiality of both the events and filters should not require publishers and subscribers to share secret keys. In fact, such a restriction is against the loose-coupling of the model. Moreover, such a scheme should not restrict the expressiveness of filters and should allow the broker to perform event filtering to route the events to the interested parties. Existing solutions do not fully address these issues. In this paper, we provide a novel scheme that supports (i) confidentiality for events and filters; (ii) allows publishers to express further constraints about who can access their events; (iii) filters that can express very complex constraints on events even if brokers are not able to access any information in clear on both events and filters; (iv) and, finally, it does not require publishers and subscribers to share keys. Furthermore, we show how we applied our scheme to a real-world e-health scenario, developed together with a hospital. We also describe the implementation of our solution in Java and the integration with an existing publish/subscribe system. 相似文献
Digital cameras, new generation phones, commercial TV sets and, in general, all modern devices for image acquisition and visualization can benefit from algorithms for image enhancement suitable to work in real time and preferably with limited power consumption. Among the various methods described in the scientific literature, Retinex-based approaches are able to provide very good performances, but unfortunately they typically require a high computational effort. In this article, we propose a flexible and effective architecture for the real-time enhancement of video frames, suitable to be implemented in a single FPGA device. The video enhancement algorithm is based on a modified version of the Retinex approach. This method, developed to control the dynamic range of poorly illuminated images while preserving the visual details, has been improved by the adoption of a new model to perform illuminance estimation. The video enhancement parameters are controlled in real time through an embedded microprocessor which makes the system able to modify its behavior according to the characteristics of the input images, and using information about the surrounding light conditions. 相似文献
Managing the resources in a large Web serving system requires knowledge of the resource needs for service requests of various types. In order to investigate the properties of Web traffic and its demand, we collected measurements of throughput and CPU utilization and performed some data analyses. First, we present our findings in relation to the time-varying nature of the traffic, the skewness of traffic intensity among the various types of requests, the correlation among traffic streams, and other system-related phenomena. Then, given such nature of web traffic, we devise and implement an on-line method for the dynamic estimation of CPU demand.
Assessing resource needs is commonly performed using techniques such as off-line profiling, application instrumentation, and kernel-based instrumentation. Little attention has been given to the dynamic estimation of dynamic resource needs, relying only on external and high-level measurements such as overall resource utilization and request rates. We consider the problem of dynamically estimating dynamic CPU demands of multiple kinds of requests using CPU utilization and throughput measurements. We formulate the problem as a multivariate linear regression problem and obtain its basic solution. However, as our measurement data analysis indicates, one is faced with issues such as insignificant flows, collinear flows, space and temporal variations, and background noise. In order to deal with such issues, we present several mechanisms such as data aging, flow rejection, flow combining, noise reduction, and smoothing. We implemented these techniques in a Work Profiler component that we delivered as part of a broader system management product. We present experimental results from using this component in scenarios inspired by real-world usage of that product. 相似文献