Abstract: Various embodiments relate to a method and apparatus for computing a minimum segment labeling of a given path on a segment cover graph, the method including receiving a connection request for a connection between a source node and a destination node, generating a Shortest Path Directed Acyclic Graph (“SPDAG”) from the source node to the destination node by running a shortest path algorithm from the source node, determining an end node, between the source node and the destination node, at which the SPDAG deviates from the given path, determining whether the end node is the end of an Equal Cost Multipath (“ECMP”) and terminating the shortest path algorithm at a predecessor node to the end node if the end node is the end of an ECMP and making the predecessor node to the end node the source node.

Abstract: This disclosure generally discloses a tunnel-level fragmentation and reassembly capability configured to support tunnel-level fragmentation and reassembly of a packet being transported via a tunnel between a tunnel source node and a tunnel destination node. The tunnel-level fragmentation and reassembly capability may be configured to support tunnel-level fragmentation and reassembly of packets in a manner tending to prevent reassembly errors, that could cause malformed packets or packet drops at the tunnel destination nodes, due to multiple parallel tunnel contexts of the tunnel which may correspond to multiple parallel entry points into the tunnel at the tunnel source node. The tunnel-level fragmentation and reassembly capability may be configured to support tunnel-level fragmentation and reassembly of packets within various types of communication networks, for various types of tunnels, or the like.

Abstract: Disclosed is a method of identifying service topologies in a network, including determining a group of network devices having a same traffic identifier and indicating each network device of the group as not processed, selecting a first network device that is indicated as not processed in the group, indicating the selected first network device as partially processed, and associating the first network device with a service container identifier, identifying, for each port of the selected first network device, at least another network device in the group indicated as not processed connected to the first network device or a termination point, wherein the identified another network device is identified as partially processed and associated with the service container identifier, repeating step (c) for each identified another network device until only termination points are reached, wherein the identified another network device becomes the first network device in step (c), and when any network devices in the group of

Abstract: The present disclosure generally discloses improvements in computer performance for supporting a multipath transport throughput capability that is configured to improve throughout of a multipath transport connection of a multipath transport protocol. The multipath transport throughput capability is configured to improve the throughput of the multipath transport connection by improving delivery of acknowledgment packets acknowledging successful delivery of data packets sent from a data transmitting side to a data receiving side.

Abstract: The present disclosure generally discloses a scheduling granularity capability. The scheduling granularity capability is configured to improve scheduling granularity in a wireless communication system supporting transport of application flows via radio bearers. The scheduling granularity capability may be configured to support improved scheduling granularity by controlling scheduling at various levels of granularity, such as at the bearer level (e.g., for scheduling bearers with respect to each other), at the application flow level (e.g., for scheduling the application flow of a bearer when the bearer includes a single application flow, for scheduling application flows of a bearer with respect to each other when the bearer includes multiple application flows, or the like), or the like, as well as various combinations thereof.

Abstract: Radio-frequency devices that include metamaterial structures are provided. Inclusion of resonator sections in a structure enables the utilization of desirable line segment widths without sacrificing performance, and further enables a reduction in the amount of space or area taken up by such devices on a printed circuit board.

Abstract: The present disclosure generally discloses improvements in computer performance in communication networks, which may include improvements in computer performance in supporting discovery of ingress provider edge (PE) devices in a communication network using egress peer engineering (EPE) and software defined networking (SDN). The ingress PE devices of a network may have peering relationships with an egress peer link of an egress peer node of the network. The ingress PE devices may be discovered by identifying a set of traffic flows on an egress peer link of an egress peer node, identifying a set of ingress PE devices that have peering relationships with the egress peer node, determining bandwidth usage information, selecting, from the set of ingress PE devices based on the bandwidth usage information, a set of selected ingress PE devices, and initiating a management action for at least one of the selected ingress PE devices.

Abstract: We disclose a modular fiber-interconnect device that can be used in a ROADM to optically interconnect wavelength-selective switches and optical add/drop blocks thereof. An example module of the modular fiber-interconnect device has seventeen optical ports, each implemented using an MPO connector of the same type. The number of (nominally identical) modules in the modular fiber-interconnect device depends on the degree N of the ROADM and can vary, e.g., from two for N=4 to fourteen or more for N?20. A proper set of duplex optical connections within the ROADM can be created in a relatively straightforward manner, e.g., by running MPO cables of the same type from the wavelength-selective switches and the optical add/drop blocks of the ROADM to appropriate optical ports of the various modules of the modular fiber-interconnect device.

Abstract: The present disclosure generally discloses a scheduling control capability for controlling scheduling of transmissions where adaptive bitrate streaming is used for delivery of content (e.g., video content or other types of content which may be streamed using adaptive bitrate streaming) from source devices to end devices. The scheduling control capability may be configured to control scheduling of transmissions of adaptive bitrate streaming flows based on priority levels assigned to the adaptive bitrate streaming flows. The scheduling control capability may be configured to dynamically control the priority levels assigned to the adaptive bitrate streaming flows.

Abstract: Systems and methods are provided for ranking electronic information based on determined similarities. In one aspect a set of unique features are determined from a collection of electronic objects. A graph is constructed in which electronic object are represented as object nodes and determined features are represented as feature nodes. The object nodes are interconnected by a weighted edge to at least one feature node. Scores for the object nodes and the feature nodes are computed using a determined set of anchor nodes and a determined weighted adjacency matrix. The object nodes and the feature nodes of the graph are ranked and displayed based on the computed scores. In one aspect, the scores and the ranks for the object nodes and the feature nodes are dynamically updated and displayed based on user preferences.

Abstract: An underlying recess is provided for component placement beneath Ball Grid Arrays allowing closer proximity for decoupling capacitors and other components. The underlying recess placement of components assists in minimizing reliability issues concerning surface mount components and provides closer proximity placement of components. The underlying recess placement of components is particularly useful for overcoming the problem of parasitic inductance of more distant component placements known in the art.

Abstract: The present disclosure generally discloses capabilities for supporting new network zones and associated services. The network zones and associated services may include a near-real-time (NRT) zone and associated NRT services, a real-time (RT) zone and associated RT services, or the like. The resilient network zones and associated resilient and non-resilient services may be configured to provide bounded latency guarantees for reliably supporting various types of applications (e.g., mobile fronthaul, cloud computing, Internet-of-Things (IoT), or the like). The network zones and associated services may be provided using a distance-constrained fiber and wavelength switching fabric design comprised of various network devices and using associated controllers, which may be configured to support service provisioning functions, service testing functions, wavelength switching functions, and so forth.

Abstract: The present disclosure discloses infrastructure resource states which may be configured for use in managing both infrastructure resources (IRs) and virtualized infrastructure resources (VIRs). The new resources states may include a Network Unequipped (NU) state, a Network Equipped (NE) state, a Network Ready (NR) state, a Service Ready (SR) state, an Out-of-Service (OOS) state, and an In-Service (IS) state. The infrastructure resource states may be configured to enable resource transfers in a programmable virtual infrastructure having one or more tenants (e.g., Owners, BUs, Partners, Customers, or the like) at one or more hierarchical layers.

Abstract: The present disclosure generally discloses a network infrastructure virtualization mechanism configured to support virtualization of the network infrastructure (NI) of a communication network to provide thereby a virtualized infrastructure (VI) for the communication network. The network infrastructure virtualization mechanism may be configured to support virtualization of infrastructure resources (IRs) of the network infrastructure to provide virtualized infrastructure resources (VIRs) of the network infrastructure. The IRs of the communication network may include network resources (NRs) which may be virtualized to provide virtualized network resources (VNRs) and service resources (SRs) which may be virtualized to provide virtualized service resources (VSRs).

Abstract: This disclosure generally discloses a bidirectional constrained path search mechanism. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, such that the bidirectional paths share a common set of resources. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, by determining a forward path that satisfies a set of forward path constraints associated with the forward path and determining a reverse path that satisfies a set of reverse path constraints associated with the reverse path. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes in a single path search iteration, such as via a traversal of a weighted directed graph, thereby improving performance.

Abstract: An apparatus, e.g. a radio-frequency (RF) coupler, includes first and second microstrip lines. First and second coupling fingers extend from the first microstrip line into the space, and a third coupling finger extends from the second microstrip line into the space about centered between the first and second coupling fingers. Fourth and fifth coupling fingers extend from the first microstrip line into the space, and a sixth coupling finger extends from the second microstrip line into the space about centered between the fourth and fifth coupling fingers. The second and fourth coupling fingers are adjacent each other with a distance between them along the first transmission line exceeding a distance between the first and second coupling fingers along the first transmission line by at least a factor of about two.

Abstract: A method and system are provided for synchronizing local clocks more quickly in a telecommunication network using IEEE 1588. A network element that receives timing signals from one or more possible parent clocks considers a measure of the reliability of the timing signals contained in Announce messages from the parent clock or clocks. The clock uses this reliability information in selecting one of the possible parent clock or clocks to use as the actual parent clock. Once the selection is made, the clock adjusts the filtering characteristics applied to timing signals received from the selected parent clock. The adjustments reflect how confident the parent clock is as to how stable the timing information, it provides has become. If the indication of reliability contained in Announce messages received from the parent clock indicates that the timing information is not very reliable, then a high filter bandwidth is used in filtering the timing signals.

Abstract: A method for using OpenFlow protocol to configure an OpenFlow-enabled switch is disclosed. In the embodiment, the method involves decoding an OpenFlow flow entry from a flow mod message, the flow entry including two or more actions, searching a Service Access Point (SAP) match table for an outgoing interface having attributes that match the two or more actions, and updating a flow table on the OpenFlow-enabled switch to include the decoded flow entry when an outgoing interface having attributes that match the two or more actions is found.

Abstract: A method for inserting an OpenFlow flow entry into a flow table is disclosed. In the embodiment, the method involves receiving a flow mod message at an OpenFlow-enabled switch, the flow mod message including a cookie field, decoding an OpenFlow flow entry from the flow mod message, identifying a flow table from the cookie field, and inserting the decoded flow entry into the flow table.

Abstract: A method for inserting an OpenFlow flow entry into a flow table is disclosed. In the embodiment, the method involves receiving a flow mod message at an OpenFlow-enabled switch, the flow mod message including a cookie field, decoding an OpenFlow flow entry from the flow mod message, identifying a flow table from the cookie field, and inserting the decoded flow entry into the flow table.