Abstract: Various example embodiments for supporting multicast are presented herein. Various example embodiments for supporting stateless multicast may be configured to support stateless multicasting of packets based on encoding of multicast path information within the packets. Various example embodiments for supporting stateless multicasting of packets based on encoding of multicast path information within the packets may be configured to use a recursive scheme of encoding the multicast path information within the packets such that the header that arrives at each node of the multicast path informs the node of the outgoing links over which the packet is to be sent and the headers to be sent on the outgoing links (e.g., each node of the multicast tree is able to recognize each of its outgoing links from the received header and send the appropriate subtree encoding down each of its outgoing links).

Abstract: A method for automatically creating an equipment inventory from a plurality of images of a site. The method includes receiving, by a processor, the plurality of images of the site, labeling, by the processor, equipment present in each image of the plurality of images of the site, creating, by the processor, an overlap curve for neighboring images of the plurality of images of the site, determining, by the processor, a useful image of each side of the site based on the overlap curve, the useful image including a subset of the plurality of images, creating, by the processor, an overlay of equipment in the useful image of each side of the site, counting, by the processor, equipment present in the overlay of each side of the site, and generating, by the processor, the equipment inventory by adding a number of equipment counted in the overlay of each side of the site.

Abstract: System, method, and software for recommending documents to users. A recommendation system identifies recent documents and historical information indicating consumption by users of past documents. The system generates a historical reading matrix based on the historical information, and generates a vector matrix for the recent documents and the past documents. The system generates an estimated reading matrix based on the historical reading matrix and the vector matrix, with the estimated reading matrix having first entries that represent actual reading scores for the past documents. The system calculates estimated reading scores for the recent documents based on the vector matrix, and populates second entries of the estimated reading matrix corresponding to the recent documents with the estimated reading scores. The system performs a factorization on the estimated reading matrix to generate a refined reading matrix, and generates recommendations of the recent documents based on the refined reading matrix.

Abstract: In general, a capability for forwarding packets based on path encoding is presented. The capability for forwarding a packet based on path encoding may be configured to enable forwarding of a packet along a network path by determining a path encoding label for the network path, associating the path encoding label for the network path with the packet, and forwarding the packet along the network path based on the path encoding label associated with the packet. The network path for a packet may include an ordered sequence of node output interfaces of an ordered sequence of nodes. The path encoding label for the network path includes an ordered sequence of node interface labels corresponding to the ordered sequence of node output interfaces of the nodes of the network path. The nodes of the network path forward the packet along the network path based on the path encoding label.

Abstract: The present disclosure generally discloses multicast communication support capabilities configured to support multicast communications of a multicast group using a multicast tree. The multicast communication support capabilities may include a unicast branching based multicast capability. The unicast branching based multicast capability may be configured to support determination and establishment of, as well as communication via, a multicast tree that is composed of unicast branches. The unicast branching based multicast capability may be configured to preserve the multicast information of multicast transmissions transported via the multicast tree even though the multicast transmissions are transported via unicast branches of the multicast tree.

Abstract: A capability for sparsifying a representation of pairwise cost information is presented herein. The capability for sparsifying a representation of pairwise cost information may be used to sparsify a representation of pairwise cost information for a set of nodes. The sparsification of a representation of pairwise cost information for a set of nodes may provide thereby a sparsified representation of the pairwise cost information for the set of nodes. The sparsification of the representation of pairwise cost information for the set of nodes may be based on clustering of the nodes of the set of nodes into clusters. The sparsification of the representation of pairwise cost information for the set of nodes may be based on calculation of intra-cluster costs and inter-cluster costs, where the intra-cluster costs and inter-cluster costs are calculated based on the pairwise cost information of the representation of the pairwise cost information for the set of nodes.

Abstract: A capability for providing policy enforcement in a topology abstraction system is presented. The capability for providing policy enforcement in a topology abstraction system may support use of topology abstraction policies to control abstraction of topology information of a topology (e.g., a network topology of a communication network or any other suitable type of topology). The capability for providing policy enforcement in a topology abstraction system providing an abstract representation of a topology may support use of topology abstraction policies to control selection (or acceptance) of topology elements for inclusion within the abstract representation of a topology and filtering (or rejection) of topology elements from being included within the abstract representation of a topology.

Abstract: A system and method for workflow analysis includes an evaluation module executing on a processor that receives execution logs including records of workflow paths traversed. The evaluation module correlates at least one workflow step with a target metric and generates an importance score for the at least one workflow step based on the correlation with the target metric.

Abstract: A capability for sparsifying a representation of pairwise cost information is presented herein. The capability for sparsifying a representation of pairwise cost information may be used to sparsify a representation of pairwise cost information for a set of nodes. The sparsification of a representation of pairwise cost information for a set of nodes may provide thereby a sparsified representation of the pairwise cost information for the set of nodes. The sparsification of the representation of pairwise cost information for the set of nodes may be based on clustering of the nodes of the set of nodes into clusters. The sparsification of the representation of pairwise cost information for the set of nodes may be based on calculation of intra-cluster costs and inter-cluster costs, where the intra-cluster costs and inter-cluster costs are calculated based on the pairwise cost information of the representation of the pairwise cost information for the set of nodes.

Abstract: A capability for providing policy enforcement in a topology abstraction system is presented. The capability for providing policy enforcement in a topology abstraction system may support use of topology abstraction policies to control abstraction of topology information of a topology (e.g., a network topology of a communication network or any other suitable type of topology). The capability for providing policy enforcement in a topology abstraction system providing an abstract representation of a topology may support use of topology abstraction policies to control selection (or acceptance) of topology elements for inclusion within the abstract representation of a topology and filtering (or rejection) of topology elements from being included within the abstract representation of a topology.

Abstract: In general, a capability for forwarding packets based on path encoding is presented. The capability for forwarding a packet based on path encoding may be configured to enable forwarding of a packet along a network path by determining a path encoding label for the network path, associating the path encoding label for the network path with the packet, and forwarding the packet along the network path based on the path encoding label associated with the packet. The network path for a packet may include an ordered sequence of node output interfaces of an ordered sequence of nodes. The path encoding label for the network path includes an ordered sequence of node interface labels corresponding to the ordered sequence of node output interfaces of the nodes of the network path. The nodes of the network path forward the packet along the network path based on the path encoding label.

Abstract: In one example embodiment, a method of determining a hierarchical community decomposition of a plurality of nodes includes determining one or more subsets of the plurality of nodes at at least one level of the hierarchical community decomposition, the determined one or more subsets being non-detachable and non-linkable. The method further includes forming the at least one level of the hierarchical community decomposition based on the determined one or more subsets.

Abstract: The method includes determining a timestamp corresponding to a received data packet associated with the virtual machine and releasing the data packet from a buffer based on the timestamp and a time another data packet is released from the buffer.

Abstract: The method includes determining a timestamp corresponding to a received data packet associated with the virtual machine and releasing the data packet from a buffer based on the timestamp and a time another data packet is released from the buffer.

Abstract: An optical communications network architecture and associated method which employs time and wavelength-interleaving for homing between nodes/satellites and hubs and for grooming, while employing wavelength-division-multiplexed wavelength circuits between hubs without requiring cross-connects or routers therebetween.

Abstract: An optical communications network architecture and associated method which employs time and wavelength-interleaving for homing between nodes/satellites and hubs and for grooming, while employing wavelength-division-multiplexed wavelength circuits between hubs without requiring cross-connects or routers therebetween.

Abstract: A method and apparatus for scheduling the transmission of data packets over a multihop wireless backhaul network in which delay guarantees through the network may be advantageously ensured. Illustratively, a novel packet scheduling scheme is provided which is advantageously based on an existing scheduling policy for wireline networks and for which a delay guarantee (based on the delay characteristics of the existing scheduling policy) can be advantageously ensured. In one embodiment, an even-odd link activation framework is defined for a given multihop wireless backhaul network, and an associated scheduling policy based on an arbitrary existing scheduling policy for wireline networks is derived and adopted. In such a case, the derived scheduling policy, when applied to the given multihop wireless backhaul network, advantageously ensures a worst-case delay guarantee of approximately twice that of the existing scheduling policy for wireline networks.

Abstract: The present invention provides a wide-sense, non-blocking WDM cross-connect that utilizes a relatively small number of wavelength interchangers. The cross-connect of the present invention comprises first, second and third fabrics and one or more wavelength interchangers that interconnect the first and second fabrics. Demands that require a change in wavelength are routed through the first fabric, through one or more of the wavelength interchangers, and through the second fabric. Demands that do not require a change in wavelength are only routed through the third fabric. A routing algorithm is utilized to ensure that any sequence of connection requests and withdrawals can be routed without disturbing any currently routed requests.

Abstract: A method and apparatus for grooming traffic demands according to mileage based tariffs. An Integer Linear Program (ILP) that captures the traffic grooming problem is defined, and such a linear program can in principle be solved by conventional linear program application systems which are fully familiar to those of ordinary skill in the art. However, the time required to solve such an ILP is fairly large, even for the moderately sized networks we are interested in. That is, there are many possible routes to consider, and hence many integer variables in the ILP. Therefore, further in accordance with the principles of the present invention, the ILP is advantageously run on the Delaunay Triangulation of the network rather than on the completely connected network graph.

Abstract: A system and method are disclosed for time-domain wavelength interleaved networking that reduce the need for complex time-slot scheduling and reduce the routing complexity. Substantially all communications in the time-domain wavelength interleaved network pass through a hub node. In addition, interior nodes in the time-domain wavelength interleaved network will forward substantially all communications received from the hub node that are destined for another node on all branches outward from the hub node. The central hub node can impose a timing reference. Thus, the transmission and reception of a message can be synchronized such that a message sent in a time-slot k by a node Ni will be received by a node Nj in the time-slot k. Further, the hub node can recover from a link failure by shifting transmission times of all nodes that are separated from the hub node by the failed link.