scispace - formally typeset
Search or ask a question
Institution

Ciena

CompanyHanover, Maryland, United States
About: Ciena is a company organization based out in Hanover, Maryland, United States. It is known for research contribution in the topics: Signal & Node (networking). The organization has 1259 authors who have published 1557 publications receiving 25989 citations.


Papers
More filters
Patent
Bo Ping Xie1
16 Jun 2000
TL;DR: In this paper, a heat pipe heat sink for efficient heat transfer heat away from a semiconductor pump laser is presented, and the condenser portion can be easily manufactured using an extrusion process.
Abstract: A heat sink module consistent with the present invention includes a heat pipe for efficient heat transfer heat away from a semiconductor pump laser. The heat pipe heat sink occupies less space than a conventional heat sink, and the condenser portion of the heat pipe heat sink can be easily manufactured using an extrusion process.

87 citations

Patent
27 Jul 2000
TL;DR: In this paper, a distributed method and system of controlling a communications network having a plurality of spans of interconnected network elements some of which include a network element processor distributes network topology information to respective span databases; stores original fault objects in the respective span database; advertises fault objects to other network element processors in a local span when the original fault affects network elements other than the network element in which the fault occurred.
Abstract: A distributed method and system of controlling a communications network having a plurality of spans of interconnected network elements some of which include a network element processor distributes network topology information to respective span databases; stores original fault objects in the respective span databases; advertises fault objects to other network element processors in a local span when the original fault affects network elements other than a network element in which the fault occurred; advertises alarm objects to other network element processors that are respectively associated with a circuit affected by the original faults; stores the advertised fault and alarm objects in the respective span databases; and performs distributed processing of the advertised fault and alarm objects with the other network element processors and the respective span databases. Aggregation of other faults and alarms that may be occurring on the communications network due to other faults other than the received fault aids in determining causality of the fault. Causality may be determined by correlating other faults and alarms with the received fault. If not a root cause of another fault or alarm, the received fault is sympathetic to another fault or alarm. Sympathetic faults are suppressed while root cause faults are promoted to an alarm and reported to affected network elements. The number of alarms viewed by a network manager as well as the reporting of alarms and underlying faults are reduced by performing such distributed alarm correlation and fault reporting suppression.

85 citations

Journal ArticleDOI
TL;DR: In this article, a new coding scheme is proposed in which several data streams having fractional multiplexing gains are sent by transmitters and interfering streams are aligned at receivers, which is proved to be optimal for three communication channels, namely the Gaussian Interference Channel (GIC), the uplink channel in cellular systems, and the $X$ channel.
Abstract: In this paper, the available spatial Degrees-Of-Freedoms (DOF) in single antenna systems is exploited. A new coding scheme is proposed in which several data streams having fractional multiplexing gains are sent by transmitters and interfering streams are aligned at receivers. Viewed as a field over rational numbers, a received signal has infinite fractional DOFs, allowing simultaneous interference alignment of any finite number of signals at any finite number of receivers. The coding scheme is backed up by a recent result in the field of Diophantine approximation, which states that the convergence part of the Khintchine-Groshev theorem holds for points on non-degenerate manifolds. The proposed coding scheme is proved to be optimal for three communication channels, namely the Gaussian Interference Channel (GIC), the uplink channel in cellular systems, and the $X$ channel. It is proved that the total DOF of the $K$-user GIC is $\frac{K}{2}$ almost surely, i.e. each user enjoys half of its maximum DOF. Having $K$ cells and $M$ users within each cell in a cellular system, the total DOF of the uplink channel is proved to be $\frac{KM}{M+1}$. Finally, the total DOF of the $X$ channel with $K$ transmitters and $M$ receivers is shown to be $\frac{KM}{K+M-1}$.

83 citations

Patent
19 Dec 2000
TL;DR: In this paper, a synchronous packet-switched network fabric with a standard SONET OC-192 line rate of 9.953280 Gbaud is used for high speed Ethernet data streams having a data rate of 10 Gb/s.
Abstract: An Ethernet mapping enables high speed Ethernet data streams having a data rate of 10 Gb/s to be transported across a synchronous packet switched network fabric having a standard SONET OC-192 line rate of 9.953280 Gbaud. The 10 Gb/s Ethernet data stream is compressed by removing interframe gaps between successive MAC frames to produce a compressed data stream, which is then mapped to a synchronous container. The synchronous container is then launched across the synchronous packet switched network fabric at a standard SONET OC-192 line rate of 9.953280 Gbaud. The synchronous container is preferably provided as a stripped STS-192c frame having only A1 and A2 octets of the Transport Overhead (TOH). The compressed data stream is mapped directly to the synchronous container, starting at the first octet following the A1 and A2 octets, without first being inserted into a conventional STS-192c SPE, so that most of the space normally used for TOH and Path overhead (POH) within a conventional STS-192c frame is freed-up for carrying the compressed data stream. At a receiving interface, the compressed data stream is extracted from received synchronous containers and decompressed, by insertion of interframe gaps between successive MAC frames, to generate a recovered 10 Gb/s Ethernet data stream. The starting bit of each successive MAC frame can be identified by examination of the length field of the immediately previous MAC frame.

81 citations

Patent
20 Aug 2007
TL;DR: In this article, the authors proposed a point-to-point data link between intelligent network elements located in the feeder/distribution network to provide reliable, secure, bi-directional broadband access.
Abstract: Hybrid fiber/coax networks employ the existing cable plant used for cable TV and transmit data signals in a frequency bandwidth above that which is used for cable TV. As this cable plant was deployed in a tree and branch topology, data transmissions may be susceptible to noise, variable transmission loss and frequency dispersion, particularly in the upstream direction. Further, due to the tree and branch topology, homes at the far end of the network experience much greater loss than do the homes that are near to the headend/ONU. The present system, which uses point-to-point data links between intelligent network elements located in the feeder/distribution network to provide reliable, secure, bi-directional broadband access. Digital signals, or messages, are terminated at the intelligent network elements, switched and regenerated for transmission across additional upstream or downstream data links as needed to connect a home to a headend or router. Messages indicative of an end user routing ID (RID) are identified and the information extracted for user with successive messages. In this manner, the data links are made over relatively short runs of coax cable, which can provide greater bandwidth than the typical end-to-end feeder/distribution connection between a home and the headend or optical network unit.

81 citations


Authors

Showing all 1261 results

NameH-indexPapersCitations
Hsiang-Tsung Kung6535925458
Amir K. Khandani483949590
Kim B. Roberts412035605
Weidong Zhou403145885
Seb J. Savory382407292
Zuyuan He384985643
Chandra Sekhar Bontu371444147
Leo Strawczynski33753795
Maurice O'Sullivan281262615
John C. Cartledge272452686
Qunbi Zhuge241802006
Yun Wang23771803
David Côté22402254
Petar Djukic22601734
Andrzej Borowiec21531717
Network Information
Related Institutions (5)
Nippon Telegraph and Telephone
22.3K papers, 430.4K citations

87% related

Alcatel-Lucent
53.3K papers, 1.4M citations

85% related

Fujitsu
75K papers, 827.5K citations

82% related

Bell Labs
59.8K papers, 3.1M citations

81% related

Ericsson
35.3K papers, 584.5K citations

81% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20222
202150
202098
201977
201864
201757