scispace - formally typeset
Search or ask a question
Institution

Telcordia Technologies

About: Telcordia Technologies is a based out in . It is known for research contribution in the topics: Network packet & Node (networking). The organization has 3097 authors who have published 4737 publications receiving 237882 citations.


Papers
More filters
Patent
30 Jan 2012
TL;DR: In this paper, an in-vehicle device within a moving vehicle is used to avoid vehicle collisions using a traffic light control system at a traffic intersection from a traffic management center.
Abstract: Avoiding vehicle collisions using an in-vehicle device is provided. The method comprises receiving a connection request from an in-vehicle device within a moving vehicle when the moving vehicle is within a selected distance from a traffic intersection, establishing connection with the in-vehicle device within a moving vehicle via a serving base station, receiving position information from the in-vehicle device within a moving vehicle corresponding to a position of the moving vehicle, receiving control information for a traffic light at the traffic intersection from a traffic management center and relaying the control information for the traffic light to the in-vehicle device within a moving vehicle. A warning is issued based upon a vehicle speed, a location and a position relative to a traffic intersection. A warning is also issued based upon multiple vehicles speed, relative locations to each other and each position relative to a traffic intersection.

59 citations

Proceedings ArticleDOI
05 Jun 1989
TL;DR: Algorithms of complexity for several natural measures, including the diameter of the set measure, the area, perimeter or diagonal of the smallest enclosing axes-parallel rectangle, and the side length of the largest enclosingAxes-Parallel square are presented.
Abstract: We consider the following problem: given a planar set of points S, a measure m acting on S, and a pair of values m1 and m2, does there exist a bipartition S = S1 U S2 satisfying m(Si) ≤ mi for i = 1,2? We present algorithms of complexity O(n log n) for several natural measures, including the diameter (set measure), the area, perimeter or diagonal of the smallest enclosing axes-parallel rectangle (rectangular measure), and the side length of the smallest enclosing axes-parallel square (square measure). The problem of partitioning S into k subsets, where k ≥ 3, is known to be NP-complete for many of these measures.

59 citations

Patent
25 Oct 1989
TL;DR: In this article, a distributed system of selective flooding for dynamically reconfiguring the internodal path in a manner which will ensure the most economical use of intermediate links is proposed, where a help message transmitted from one of the terminating nodes to each contiguous neighboring node requests use of the uncommitted bandwidth of each respective link.
Abstract: Rapid restoration of a telecommunication path between network nodes after an interrupting network link failure utilizes a distributed system of selective flooding for dynamically reconfiguring the internodal path in a manner which will ensure the most economical use of intermediate links. A help message transmitted from one of the terminating nodes to each contiguous neighboring node requests use of the uncommitted bandwidth of each respective link. This wave of messages is propagated selectively, along paths having maximum available bandwidth and least number of links, through the network by each successive receiving node until the help message reaches the other terminating node of the failed link. An acknowledgement message returned to the initial terminating node via propagation links offering the maximum bandwidth establishes a reconfigured path providing the greatest bandwidth recovery. In the event that such a path does not completely satisfy the original bandwidth requirement, additional paths are established by successive waves of request messages until the balance of the requirement is met.

59 citations

Patent
03 Jun 1993
TL;DR: In this article, a system for detecting arcing faults in DC electrical cable power distribution circuits, typically in telecommunications networks, monitors the power spectrum of distribution lines over a frequency band of about 4 Hz to 5 KHz in which current surges characteristic of arcing line faults have been found.
Abstract: A system for detecting arcing faults in DC electrical cable power distribution circuits, typically in telecommunications networks, monitors the power spectrum of distribution lines over a frequency band of about 4 Hz to 5 KHz in which current surges characteristic of arcing line faults have been found to occur. The system compares power levels in this detection band with a threshold level typical of normal communications traffic and registers an alarm condition when an excess indicative of arcing is detected.

59 citations

Journal ArticleDOI
TL;DR: In this article, the authors examine resale price maintenance by a monopoly manufacturer who sells its product through monopolistically competitive retailers and show that the Telser (1960) argument is invalid when the externality is small and when the retailers provide too much service.

59 citations


Authors

Showing all 3097 results

NameH-indexPapersCitations
Joseph E. Stiglitz1641142152469
Pete Smith1562464138819
Jean-Marie Tarascon136853137673
Ramamoorthy Ramesh12264967418
Martin Vetterli10576157825
Noga Alon10489544575
Amit P. Sheth10175342655
Harold G. Craighead10156940357
Susan T. Dumais10034660206
Andrzej Cichocki9795241471
Robert E. Kraut9729738116
Kishor S. Trivedi9569836816
David R. Clarke9055336039
Axel Scherer9073643939
Michael R. Lyu8969633257
Network Information
Related Institutions (5)
Alcatel-Lucent
53.3K papers, 1.4M citations

88% related

Bell Labs
59.8K papers, 3.1M citations

87% related

IBM
253.9K papers, 7.4M citations

83% related

Hewlett-Packard
59.8K papers, 1.4M citations

82% related

Eindhoven University of Technology
52.9K papers, 1.5M citations

81% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20191
20182
20171
20161
20151
20143