scispace - formally typeset
Search or ask a question
Institution

Alcatel-Lucent

Stuttgart, Germany
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.


Papers
More filters
Patent
03 May 1996
TL;DR: In this article, a system to automatically provide to a consumer an electronic rebate by an existing telephone network and system is described, where the consumer dials a designated preassigned telephone number and is prompted to enter the product code and a serial number for purchase verification purposes.
Abstract: A system to automatically provide to a consumer an electronic rebate by an existing telephone network and system. The consumer dials a dedicated preassigned telephone number and is prompted to enter the product code and a serial number for purchase verification purposes. A rebate is provided instantaneously in the form of a credit to the consumer's telephone account. The rebates so provided to consumers are collated on a per manufacturer basis, and the telephone service provider issues statements to the rebating manufacturers to cover the rebates issued as well as its service charge.

267 citations

Patent
10 Nov 1995
TL;DR: In this article, a contention access channel is provided in the STM region, for call control and set-up requests, and at least one contention ATM time slot is always made available for signaling messages related to ATM call control.
Abstract: STM traffic, e.g. voice and video telephony (VT), as well as packet mode (e.g. ATM) traffic, e.g. broadcast digital video, interactive television, and data, are transmitted via a multiple access broadband fiber/coaxial cable network. Customer premises equipment (CPE) at stations, and a bandwidth controller, which may be at a head end or central office, with which all stations communicate, work together to adapt to the changing demands of the traffic mix, and efficiently allocate bandwidth to a variety of bursty and isochronous traffic sources. The bandwidth allocation defines two types of time slots, STM and ATM, and divides each frame into two corresponding STM and ATM regions. The boundary between the regions can be changed dynamically. A contention access signaling channel is provided in the STM region, for call control and set-up requests. Within the STM region, the time slots can be of variable length and be allocated on a per call basis; the length of the time slots is proportional to the bandwidth requirement of STM calls. Within the ATM region, the time slots are of fixed length, each capable of accommodating one ATM cell. Further, the fixed length ATM time slots may be reserved for a particular user for the duration of a call, or may be shared through a contention process. At least one contention ATM time slot is always made available for signaling messages related to ATM call control and set-up requests. The downstream time frame is structured in a similar manner, but includes an additional MAP field to transmit to the stations ATM time slot allocation and status information for time slots in the upstream channel.

267 citations

Proceedings ArticleDOI
26 Mar 2000
TL;DR: This paper investigates both graph theoretic methods and ad hoc heuristics for instrumenting the Internet to obtain distance maps and evaluates the efficacy of the resulting distance maps by comparing the determinations of the closest replica using known topologies against those obtained using the distance maps.
Abstract: The IDMaps project aims to provide a distance map of the Internet from which relative distances between hosts on the Internet can be gauged. Many distributed systems and applications can benefit from such a distance map service, for example, a common method to improve user-perceived performance of the Internet is to place data and server mirrors closer to clients. When a client tries to access a mirrored server, which mirror should it access? With IDMaps, the closest mirror can be determined based on distance estimates between the client and the mirrors. In this paper we investigate both graph theoretic methods and ad hoc heuristics for instrumenting the Internet to obtain distance maps. We evaluate the efficacy of the resulting distance maps by comparing the determinations of the closest replica using known topologies against those obtained using the distance maps.

267 citations

Journal ArticleDOI
TL;DR: The ad hoc network management protocol (ANMP) is fully compatible with simple management protocol, version 3 (SNMPv3) and uses the same protocol data units (PDUs) for data collection and implements sophisticated security mechanisms that can be fine-tuned to meet specific requirements.
Abstract: We present a protocol for managing mobile wireless ad hoc networks. The protocol uses hierarchical clustering of nodes to reduce the number of messages exchanged between the manager and the agents (mobiles). Clustering also enables the network to keep track of mobiles as they roam. The ad hoc network management protocol (ANMP) is fully compatible with simple management protocol, version 3 (SNMPv3) and uses the same protocol data units (PDUs) for data collection. The protocol also implements sophisticated security mechanisms that can be fine-tuned to meet specific requirements. Finally, we have implemented the protocol along with a graphical user interface that allows a manager to change the view or specify management parameters on the fly.

267 citations

Journal ArticleDOI
TL;DR: The design and implementation of an innovative transport level protocol capable of significantly reducing the power usage of the communication device is presented and the tradeoff between reducing power consumption and reducing delay for incoming data is addressed.
Abstract: In mobile computing, power is a limited resource. Like other devices, communication devices need to be properly managed to conserve energy. In this paper, we present the design and implementation of an innovative transport level protocol capable of significantly reducing the power usage of the communication device. The protocol achieves power savings by selectively choosing short periods of time to suspend communications and shut down the communication device. It manages the important task of queuing data for future delivery during periods of communication suspension, and decides when to restart communication. We also address the tradeoff between reducing power consumption and reducing delay for incoming data. We present results from experiments using our implementation of the protocol. These experiments measure the energy consumption for three simulated communication patterns as well as three trace-based communication patterns and compare the effects of different suspension strategies. Our results show up to 83% savings in the energy consumed by the communication. For a high-end laptop, this can translate to 6‐9% savings in the energy consumed by the entire mobile computer. This can represent savings of up to 40% for current hand-held PCs. The resulting delay introduced is small (0.4‐3.1 s depending on the power management level).

266 citations


Authors

Showing all 37011 results

NameH-indexPapersCitations
George M. Whitesides2401739269833
Yoshua Bengio2021033420313
John A. Rogers1771341127390
Zhenan Bao169865106571
Thomas S. Huang1461299101564
Federico Capasso134118976957
Robert S. Brown130124365822
Christos Faloutsos12778977746
Robert J. Cava125104271819
Ramamoorthy Ramesh12264967418
Yann LeCun121369171211
Kamil Ugurbil12053659053
Don Towsley11988356671
Steven P. DenBaars118136660343
Robert E. Tarjan11440067305
Network Information
Related Institutions (5)
Bell Labs
59.8K papers, 3.1M citations

96% related

Eindhoven University of Technology
52.9K papers, 1.5M citations

88% related

Samsung
163.6K papers, 2M citations

87% related

Chalmers University of Technology
53.9K papers, 1.5M citations

87% related

Georgia Institute of Technology
119K papers, 4.6M citations

87% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20231
202212
202130
202050
201983
2018215