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.

Optimal utility based multi-user throughput allocation subject to throughput constraints

Abstract: We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as CDMA2000 3G1xEV-DO downlink scheduling.) We introduce an algorithm which seeks to optimize a concave utility function /spl Sigma//sub i/H/sub i/(R/sub i/) of the user throughputs R/sub i/, subject to certain lower and upper throughput bounds: R/sub i//sup min//spl les/R/sub i//spl les/R/sub i//sup max/. The algorithm, which we call the gradient algorithm with minimum/maximum rate constraints (GMR) uses a token counter mechanism, which modifies an algorithm solving the corresponding unconstrained problem, to produce the algorithm solving the problem with throughput constraints. Two important special cases of the utility functions are /spl Sigma//sub i/log R/sub i/ and /spl Sigma//sub i/R/sub i/, corresponding to the common proportional fairness and throughput maximization objectives. We study the dynamics of user throughputs under GMR algorithm, and show that GMR is asymptotically optimal in the following sense. If, under an appropriate scaling, the throughput vector R(t) converges to a fixed vector R/sup +/ as time t/spl rarr//spl infin/ then R/sup +/ is an optimal solution to the optimization problem described above. We also present simulation results showing the algorithm performance.

Client-side techniques for web server allocation

Abstract: A client request directed to a web site or other service hosted by a distributed pool of servers is processed by a client agent associated with the client. The client agent intercepts the client request and routes it to a particular one of the servers in the pool. The client agent bases its routing decision on address information regarding the individual servers of the pool and performance data regarding processing of previous client requests directed to the service. The address information may be retrieved by the client agent from a response to an initial client request directed to the service. The performance data may include response times for servicing previous client requests directed to the service, and the client agent may route the client request such that an average response time of multiple requests to the service is minimized. It may also make use of a probabilistic routing strategy which ensures that each of the servers in the pool receives at least one client request, such that accurate performance data may be maintained for all of the servers. A pricing manager associated with the server pool may be used to establish discount factors or other pricing information for each of the servers in the pool. This pricing information is communicated to the client agents and used in their routing decisions, so as to ensure that otherwise non-cooperating client agents will route their requests in a manner consistent with a target operating point established by the service provider.

Studies of oxygen-deficient Ba2YCu3O7−δ and superconductivity Bi(Pb)SrCaCuO

Abstract: Ambient temperature measurements of the crystallographic cell parameters for oxygen deficient Ba 2 YCu 3 O 7−δ prepared by gettered annealing indicate the presence of microscopic differences in the oxygen configuration at fixed δ dependent on annealing temperature. The loss of superconductivity with increasing oxygen deficiency is shown to be due to a step-like increase in length of the plane copper-apical oxygen bond, and not to the orthorhombic to tetragonal transition. The crystal structure of the 84K superconductor Bi 2 Sr 2 CaCu 2 O 8+δ is described, as is the stabilization of 110K superconductivity via partial Pb/Bi substitution with long time annealing.

Technique for obtaining information and services over a communication network

Abstract: In a communications arrangement, a computer user accesses a server system to seek customer service over the World Wide Web (WWW). The server system assigns a customer service agent (CSA) to communicate with the user to realize the customer service. In a customer service session, the user and CSA may collaboratively browse hypertext markup language (HTML) documents at different uniform resource locators (URLs) to obtain relevant information. However, in accordance with the invention, the version of each document presented to the user may be different from that presented to the CSA. In particular, the CSA version contains proprietary information which is excluded from the user version.

Short message service notification forwarded between multiple short message service centers

Abstract: A short message service (SMS) network (100) allows more than one short message service center (SMSC) to service an individual subscriber without modification to the existing network elements, including the home location register (HLR) (102) and the mobile switching center (MSC) (103). The HLR of the SMS network sends a SMS notification (SMSNOT) signal (105) to a predetermined one of the plurality of SMSCs in the SMS network when a subscriber becomes available (l08). Each of the plurality of SMSCs in turn delivers short messages to an intended subscriber and then forwards the notification signal (111) to another one of the SMSCs until all of the SMSCs have delivered the respective pending short messages. The next SMSC (101') to which the SMSNOT is forwarded may be fixedly andlor dynamically determined.