Alcatel-Lucent

About: Alcatel-Lucent is a based out in Stuttgart, Germany. It is known for research contribution in the topics: Signal & Network packet. The organization has 37003 authors who have published 53332 publications receiving 1430547 citations. The organization is also known as: Alcatel-Lucent S.A. & Alcatel.

Disk scheduling with quality of service guarantees

Abstract: The paper introduces YFQ, a new disk scheduling algorithm that allows applications to set aside for exclusive use portions of the disk bandwidth. We implemented YFQ as part of the Eclipse/BSD operating system, which is derived from FreeBSD, a version of 4.4 BSD Unix. YFQ's disk bandwidth reservations can guarantee file accesses with high throughput, low delay, and good fairness. Such quality of service (QoS) guarantees to individual applications unfortunately can also hinder global disk scheduling optimizations. We propose and evaluate several disk scheduling enhancements that promote global optimizations and give to YFQ aggregate disk throughput approaching that of FreeBSD's conventional disk scheduler, which does not provide QoS guarantees. We believe that our enhancements may be helpful also in other disk scheduling algorithms.

Method of reducing carbon contamination of a thin dielectric film by using gaseous organic precursors, inert gas, and ozone to react with carbon contaminants

Abstract: A process is provided for the formation of a thin film of gate dielectric or similar material on a silicon semiconductor substrate from an organic precursor by atomic layer epitaxy, wherein the organic precursor is introduced to react with the treated surface to form a bonded monolayer of reactive species. A second reactant is introduced to react with the surface to form the desired dielectric. After each step in the cycle, the reaction chamber is purged with an inert gas to prevent reactions except on the surface. The cycle is repeated tens to hundreds of times to achieve a desired final film thickness. No less frequently than every third cycle, the film undergoes a discrete treatment step wherein ozone is introduced into the chamber to oxidize carbon contaminants therein to form volatile products which are removed from the reaction chamber by purging with the inert gas. In a preferred embodiment where the substrate is silicon or polysilicon, a sub-monolayer of a protection material is formed by boding to silicon sites on the surface before the deposition of dielectric is begun. A preferred dielectric is gate aluminum oxide that is deposited using trimethyl aluminum as a precursor.

Method and apparatus for load sharing on a wide area network

Abstract: Client's ( 106 - 1-106 -N, 107 - 1-107 -M) on local area networks ( 102, 103 ) making requests to hot sites, which are connected on a wide area network ( 100 ) such as the Internet, are redirected through one of a possible plurality of different redirectors ( 101, 103 ) to one of a possible plurality of caching servers (S 1 , S 2 , S 3 ), which each have responsibility for mapping one or more of the hot sites. Each request is probabilistically directed by one of the redirectors to one of the caching servers that map the requested hot site in accordance with weights that are determined for that redirector-hot site pair so as to minimize the average delay that all client requests across the network will encounter in making requests to all the cached hot sites. In order to determine the weights with which each redirector will redirect requests to the hot sites to the caching servers, statistics of access rates to each hot site are dynamically determined by each redirector in the network from the traffic flow and reported to a central management station (CMS) ( 115 ). Network delay is similarly measured by each redirector and reported to the CMS, and server delay is computed using a queuing model of each server. Using these parameters as inputs, a non-linear programming optimization problem is solved as a network flow problem in order to determine the weights for each redirector that will minimize the average delay. As the access rate statistics, as well as the network delay and server delay, dynamically change, the CMS, using the network flow algorithm, recalculates the weights and forwards them back to each redirector. In other embodiments, the redirector-logical item pair for which the redirector probabilistically directs client requests may be other than a hot site identity. For example, the logical items can be groups of clients or groups of documents, and the servers to which requests are forwarded can be web servers or caching servers.

Method and apparatus for selecting an access point in a wireless network

Abstract: A method and apparatus for use in a wireless communications network searches for the best serving access point of a base station as a function of communication link quality and load levels, thereby allowing a subscriber terminal to react to changes in RF conditions and load levels. In one implementation, a wireless modem in a fixed wireless access network initiates an access point searching algorithm in response to a triggering condition, such as initially powering-up the subscriber terminal or degradation of communication link quality or load levels. After detecting beacons for a plurality of neighboring access points, the wireless modem selects the best access point as a function of communication link quality and relative load levels to maintain adequate service quality and to react to changes in load levels. After an initial selection, the wireless modem may continually monitor quality/load conditions to determine whether to select a new access point.

A Spectral Technique for Coloring Random 3-Colorable Graphs

Abstract: Let G3n,p,3 be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes, and then choose every pair of vertices of distinct color classes, randomly and independently, to be edges with probability p. We describe a polynomial-time algorithm that finds a proper 3-coloring of G3n,p,3 with high probability, whenever p $\geq$ c/n, where c is a sufficiently large absolute constant. This settles a problem of Blum and Spencer, who asked if an algorithm can be designed that works almost surely for p $\geq$ polylog(n)/n [J. Algorithms, 19 (1995), pp. 204--234]. The algorithm can be extended to produce optimal k-colorings of random k-colorable graphs in a similar model as well as in various related models. Implementation results show that the algorithm performs very well in practice even for moderate values of c.