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.

Can visibility graphs Be represented compactly

Abstract: We consider the problem of representing the visibility graph of line segments as a union of cliques and bipartite cliques. Given a graphG, a familyG={G1,G2,...,Gk} is called aclique cover ofG if (i) eachGi is a clique or a bipartite clique, and (ii) the union ofGi isG. The size of the clique coverG is defined as ?i=1kni, whereni is the number of vertices inGi. Our main result is that there are visibility graphs ofn nonintersecting line segments in the plane whose smallest clique cover has size Ω(n2/log2n). An upper bound ofO(n2/logn) on the clique cover follows from a well-known result in extremal graph theory. On the other hand, we show that the visibility graph of a simple polygon always admits a clique cover of sizeO(nlog3n), and that there are simple polygons whose visibility graphs require a clique cover of size Ω(n logn).

Method and system for spectrally compatible remote terminal ADSL deployment

Abstract: An ADSL spectral compatibility system provides for computer (200) having a processor (210) in communication with a memory (220) and input/output (I/O) unit (230). I/O unit (230) is adapted to receive data from a broadband test head (BBTH) (240) and/or a database (250) of network configuration data. The ADSL system and a method are for deploying remote-terminal (RT)-based ADSL in a manner that is compatible with central office (CO)-based ADSL so as to maximize both the upstream and downstream data transmission rates while maintaining compliance with spectrum management guidelines.

Routing of network traffic using discrete traffic measurement data

Abstract: A process is disclosed for routing service requests through a network (100) comprising nodes (101-104) interconnected with links. The network is also arranged so that each node may communicate with each of the other nodes. At preselected time intervals, sets of routes through the network are generated in response to the network configuration and traffic information. Also, at predetermined time intervals, occupancy factors are computed as determined by the network configuration and in response to traffic information. These occupancy factors are proportional to unassociated occupancy factors and allocation factors associated with calls of the various node-pairs; each of these latter factors is derived from a nominal routing scheme in which a call of the corresponding node-pair is treated as lost only if it is blocked on all of its permitted routes. At predetermined intervals, traffic usage data is measured. At regular intervals, the occupancy factors corresponding to the busy-idle status of the links are used to compute occupancy values associated with each of the routes. Occupancy values not exceeding a threshold generate sequential route sets for each interval. Offered traffic is sequentially routed over the sequential route sets.

A dual-hubbed arrangement to provide a protected ring interconnection

Abstract: An arrangement of coupled hybrid rings (301 and 302) is disclosed which can withstand a failed node or a cut ring in either or both of the hybrid rings, as well as an outage of one of the two serving nodes utilized to interconnect the hybrid rings. The pair of serving nodes (330 and 340) are interposed in each of the hybrid rings and serve to transmit signals between the two rings to satisfy the hybrid ring requirement of having equivalent signals propagating in two opposing directions (e.g., 311 and 312) on the unidirectional rings composing an individual hybrid ring.

Real-time comparison of quality of interfaces

Abstract: In some embodiments, a system and method for substantially real-time comparison of quality of interfaces by mobile devices over heterogeneous networks is disclosed The method can be performed using a dynamic and rapid comparison by distributed hosts, using a minimal number of injected network packets, using minimal path quality metrics, which path quality metrics are independent of how a Qol is measured, and in a manner suitable for both wireline and wireless networks