scispace - formally typeset
Search or ask a question
Institution

Orange S.A.

CompanyParis, France
About: Orange S.A. is a company organization based out in Paris, France. It is known for research contribution in the topics: Terminal (electronics) & Signal. The organization has 6735 authors who have published 9190 publications receiving 156440 citations. The organization is also known as: Orange SA & France Télécom.


Papers
More filters
Journal ArticleDOI
TL;DR: The contraction mapping principle is used to demonstrate the existence and uniqueness of a solution to the integral equation and provide asymptotical analysis as well as tight bounds for the expected response time conditioned on the service time.
Abstract: We analyze a Processor-Sharing queue with Batch arrivals. Our analysis is based on the integral equation derived by Kleinrock, Muntz and Rodemich. Using the contraction mapping principle, we demonstrate the existence and uniqueness of a solution to the integral equation. Then we provide asymptotical analysis as well as tight bounds for the expected response time conditioned on the service time. In particular, the asymptotics for large service times depends only on the first moment of the service time distribution and on the first two moments of the batch size distribution. That is, similarly to the Processor-Sharing queue with single arrivals, in the Processor-Sharing queue with batch arrivals the expected conditional response time is finite even when the service time distribution has infinite second moment. Finally, we show how the present results can be applied to the Multi-Level Processor-Sharing scheduling.

35 citations

Journal ArticleDOI
TL;DR: This work free ourselves from positioning techniques and anchor nodes altogether, and introduces and analytically proves the correctness of the concept of virtual coordinates, which are chosen randomly when a node is switched on, and are updated each time the node relays a packet.

35 citations

Journal ArticleDOI
TL;DR: The blocking probability of the RT traffic having an adaptive Grade of Service (GoS) as well as the expected delay of the BE traffic for an uplink multicell WCDMA system are computed and the Erlang capacity for former and the delay capacity for the latter is computed.
Abstract: Traditional definitions of capacity of CDMA networks are either related to the number of calls they can handle (pole capacity) or to the arrival rate that guarantees that the rejection rate (or outage) is below a given fraction (Erlang capacity). We extend the latter definition to other quality of service (QoS). We consider best-effort (BE) traffic sharing the network resources with real-time (RT) applications. As is often the case in CDMA systems, we assume that the BE traffic access is done using a time-shared channel (such as the HDR or the HSDPA). BE applications can adapt their instantaneous transmission rate to the available one and thus need not be subject to admission control or outages. Their meaningful QoS is the average delay (i.e. the sojourn time). The delay aware capacity is then defined as the arrival rate of BE calls that the system can handle such that their expected delay is bounded by a given constant. We compute in this paper both the blocking probability of the RT traffic having an adaptive Grade of Service (GoS) as well as the expected delay of the BE traffic for an uplink multicell WCDMA system. This yields the Erlang capacity for former and the delay capacity for the latter.

35 citations

Proceedings ArticleDOI
23 Sep 2008
TL;DR: An approach for performing automated data flow in Web service composition by exploiting semantic matchmaking between Web service parameters to enable their connection and interaction and adapting XML database solutions, specifically XML Schema mapping, to perform syntactic data transformation and integration of exchanged messages.
Abstract: Automation of Web service composition is one of the most interesting challenges facing the Service Oriented Computing today. From this challenge, many issues such as control flow, data flow, verification, execution monitoring, or recovery actions (e.g., compensation) follows. In this paper we focus on automated data flow in Web service composition. The semantic Web, as an evolving extension of the current Web, seems a key initiative to overcome the latter issue. However, even if some approaches focus on discovering potential semantic connections between Web services, few or none of these tackle implementations issues related to XML messages management at syntactic level. In this direction we present an approach for performing automated data flow in Web service composition by i) exploiting semantic matchmaking between Web service parameters (i.e., outputs and inputs) to enable their connection and interaction, and ii) adapting XML database solutions, specifically XML Schema mapping, to perform syntactic data transformation and integration of exchanged messages. Our system is implemented and interacting with Web services dedicated on a Telecom scenario. The preliminary evaluation results showed not only high efficiency and effectiveness of the proposed approach but also complementarity of the semantic matchmaking and syntactic mapping to achieving data flow in Web service composition.

35 citations

Patent
26 Mar 2007
TL;DR: In this paper, a contact allocation method for a subscriber smart card (300) in a mobile terminal (100) fitted with said card, the mobile terminal including at least first and second electronic modules (130, 140) suitable for communicating with the subscriber, using respective first-and second communications protocols.
Abstract: A contact allocation method for a subscriber smart card (300) in a mobile terminal (100) fitted with said card, the mobile terminal including at least first and second electronic modules (130, 140) suitable for communicating with the subscriber smart card (300) using respective first and second communications protocols. To enable the way in which the contacts of the subscriber smart card (300) are allocated to be managed dynamically, the card is connected to the first and to the second electronic modules (130, 140) in alternation by selectively connecting at least one contact (C4) of said card to the first or to the second electronic module (130, 140).

35 citations


Authors

Showing all 6762 results

NameH-indexPapersCitations
Patrick O. Brown183755200985
Martin Vetterli10576157825
Samy Bengio9539056904
Aristide Lemaître7571222029
Ifor D. W. Samuel7460523151
Mischa Dohler6835519614
Isabelle Sagnes6775318178
Jean-Jacques Quisquater6533518234
David Pointcheval6429819538
Emmanuel Dupoux6326714315
David Gesbert6345624569
Yonghui Li6269715441
Sergei K. Turitsyn6172214063
Joseph Zyss6143417888
Jean-Michel Gérard5842114896
Network Information
Related Institutions (5)
Alcatel-Lucent
53.3K papers, 1.4M citations

92% related

Fujitsu
75K papers, 827.5K citations

90% related

Bell Labs
59.8K papers, 3.1M citations

89% related

NEC
57.6K papers, 835.9K citations

89% related

Hewlett-Packard
59.8K papers, 1.4M citations

88% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20238
20225
20215
20205
201915
201814