Abstract: Aspects of the present disclosure relate to split-scalarization of thread-local objects in optimized object code. A computer-implemented method includes receiving source code including at least one programmed method and at least one reference within the at least one programmed method that accesses at least one field of at least one object; determining that the at least one field of the at least one object is scalarizable over a region of the at least one programmed method; performing scalarization of the at least one field of the at least one object over the region of the at least one programmed method; and outputting optimized object code with the at least one field of the at least one object scalarized over the region of the at least one programmed method and with another field of the at least one object unscalarized in a different region of the at least one programmed.

Abstract: A method is provided in one example embodiment and includes transmitting a message from a network element to a network controller, the message identifying a data store of the network controller and a data model and a transformation document stored in the identified data store; downloading the identified data model and identified transformation document to the network element; applying the downloaded transformation document to the downloaded data model to generate a platform interface file; and programming the platform interface file at the network element. In certain embodiments, the data model is a YANG data model; in other embodiments, the data model is a YIN representation of a YANG data model. The transformation document may comprise eXtensible Stylesheet Language Transformation (“XSLT”) document.

Abstract: A method is provided in one example embodiment and includes transmitting a message from a network element to a network controller, the message identifying a data store of the network controller and a data model and a transformation document stored in the identified data store; downloading the identified data model and identified transformation document to the network element; applying the downloaded transformation document to the downloaded data model to generate a platform interface file; and programming the platform interface file at the network element. In certain embodiments, the data model is a YANG data model; in other embodiments, the data model is a YIN representation of a YANG data model. The transformation document may comprise eXtensible Stylesheet Language Transformation (“XSLT”) document.

Abstract: A technique controls operation of a BRAS device. The technique involves extracting encapsulation information from a communications exchange between a CPE device and an external server device (e.g., a DHCP server). The communications exchange passes through the BRAS device and a DSLAM device. The technique further involves storing the encapsulation information in local memory of the BRAS device, and controlling a flow of a downstream communication passing through the BRAS device and the DSLAM device toward the CPE device based on the encapsulation information stored in the local memory of the BRAS device. Accordingly, the BRAS device is well suited for performing ATM overhead accounting as well as shaping and policing downstream traffic.

Abstract: A method and system for optimizing link aggregation usage during failures is disclosed. The method and system are deployed in a network having a data plane in which data traffic flows between nodes coupled by a link formed by an aggregation of a number of individual connections (e.g., an IMA comprising a plurality of T1 or E1 lines, MPLS transport LSPs, ATM VPCs, etc.) and a control plane for controlling data traffic. The method includes communicating a bandwidth change on the link corresponding to the failure to the control plane. Flapping of the link is deterred. A component of the traffic is released based on a configured policy.

Abstract: A technique involves exchanging DHCP relay agent information with a DHCP server. In particular, the technique involves receiving a DHCP message en route from a DHCP client to the DHCP server. The DHCP message includes (i) a non-option portion having a client identifier identifying the DHCP client and (ii) an option portion having first relay agent information added to the DHCP message by a first relay agent. The technique further involves modifying the option portion of the DHCP message to simultaneously include both the first relay agent information added by the first relay agent and second relay agent information from a second relay agent. The technique further involves sending the DHCP message with the modified option portion to the DHCP server. Accordingly, the DHCP server is capable of receiving relay agent information from multiple relay agents and assigning an address to the DHCP client based on this input.

Abstract: A method for enhanced crankback handling in a multi-peer group network. The method includes receiving a first connection request from a node of a first peer group. Upon detection of a call failure within the second peer group, a crankback is transmitted from the second peer group to the first peer group. The crankback specifies a blocked interface at a first link between the first peer group and the second peer group. The crankback is transmitted from a node of the second peer group. A second connection request is subsequently received from the node of the first peer group. The second connection request uses a second link to the second peer group that avoids the call failure.

Abstract: A system and method to provide node-to-node connectivity in a communications network are disclosed. A virtual connection is established between a source node coupled to a client and a destination node within the connection-oriented network using standards-based signaling. A communication session is then activated between the client and the destination node on the virtual connection.

Abstract: A system and method for providing link, node, and PG policy based routing in PNNI based ATM networks is disclosed. A computer implemented method signals and routes a call in the network. Upon detecting the call's arrival, its service request is accessed. Upon determining that the service request relates to an attribute of a link, a routing path is sought that conforms to the service request, as by accessing information relating to the routing path and comparing the information to the service request. A conforming routing path is selected, and the call is routed via that path. A computer implemented method advertises an attribute of links, nodes, policies, etc. Data relating to the route's attribute can be provided to a node as a GAT IE component of a PNNI signaling setup message for multi-peer group networks, and advertised using PTSEs within a peer group.

Abstract: A system and method for providing link, node, and PG policy based routing in PNNI based ATM networks is disclosed. A computer implemented method signals and routes a call in the network. Upon detecting the call's arrival, its service request is accessed. Upon determining that the service request relates to an attribute of a link, a routing path is sought that conforms to the service request, as by accessing information relating to the routing path and comparing the information to the service request. A conforming routing path is selected, and the call is routed via that path. A computer implemented method advertises an attribute of links, nodes, policies, etc. Data relating to the route's attribute can be provided to a node as a GAT IE component of a PNNI signaling setup message for multi-peer group networks, and advertised using PTSEs within a peer group.

Abstract: A method is described that involves updating an understanding of an ATM PNNI network after the reception of PTSE information. The PTSE information has SIG information that describes bandwidth which has been allocated to specific priority levels of a bandwidth resource. The bandwidth resource is within the ATM PNNI network. Then, determining a path through the network for a requested connection. The path is determined in light of the updated understanding. The requested connection has a priority level, wherein the path may result in one or more connections being dropped in order to allow bandwidth for the requested connection. Each of the dropped connections has a lower priority level than the priority level of the requested connection.

Abstract: An embodiment of the invention provides a method for specifying preferred routes for SPVCs across multi-peer group PNNI networks and AINI links. A preferred route for a network connection through a network having a plurality of nodes, organized hierarchically into a plurality of peer groups, is determined. The preferred route is associated with a preferred route identifier. The preferred route identifier is carried in the PNNI SETUP message and is used to link a preferred route database in the source node with the entry border nodes of remote peer groups for a single SPVC. The entry border node of each peer group establishes a connection over a static route corresponding to the preferred route identifier. For one embodiment the preferred route identifier is carried in a generic application transport information element of the PNNI signaling SETUP message, providing a scalable preferred routing capability for SPVCs across multi-peer group PNNI networks.

Abstract: A system and method are disclosed for dividing a network into clock partitions to limit the overhead created by transmitting clock sources. A clock partition can be implemented through several methods. A first method turns off the clock topology exchange on ports connected to the nodes outside the partition. A second method appends a four-byte partition identifier to network clock distribution protocol (NCDP) messages. A third method uses private network-network interface (PNNI) peer group identification to determine the clock partition group.

Abstract: A first route is associated with a first channel of two or more channels in a first dense wavelength division multiplex (DWDM) link. A second route is associated with a second channel of the two or more channels in the first dense wavelength division multiplex (DWDM) link. A third route is associated with a third channel of two or more channels in a second dense wavelength division multiplex (DWDM) link. The first route, the second route and the third route provide similar connections. The first DWDM link is different from the second DWDM link. The third route is preselected as an alternate diverse route for a connection through the first route.

Abstract: A method for automatically reconfiguring a soft permanent virtual circuit (SPVC) source endpoint in a PNNI ATM network, in response to an address change at a destination endpoint, by encoding the address change information in a SIG field in a PNNI topology state element within a PNNI topology state packet.

Abstract: A technique controls operation of a BRAS device. The technique involves extracting encapsulation information from a communications exchange between a CPE device and an external server device (e.g., a DHCP server). The communications exchange passes through the BRAS device and a DSLAM device. The technique further involves storing the encapsulation information in local memory of the BRAS device, and controlling a flow of a downstream communication passing through the BRAS device and the DSLAM device toward the CPE device based on the encapsulation information stored in the local memory of the BRAS device. Accordingly, the BRAS device is well suited for performing ATM overhead accounting as well as shaping and policing downstream traffic.

Abstract: A method to provide actual network connection routing cost for use in connection grooming is disclosed for one embodiment. A setup message is transmitted from a source network node, through one or more intermediate nodes, to a destination node. A connect message, in acknowledgement of the setup message, is transmitted from the destination node, through the one or more intermediate nodes, to the source node to establish a network connection. The connect message includes an actual routing cost field. For one embodiment, an actual routing cost field is carried in a generic application transport (GAT) information element (IE) of a PNNI CONNECT message. The actual routing cost field is updated at every node as each link is traversed from the destination node to the source node. The accumulated routing cost in the GAT IE represents the actual routing cost of the SPVC, which the source node uses for connection grooming.

Abstract: A technique involves exchanging DHCP relay agent information with a DHCP server. In particular, the technique involves receiving a DHCP message en route from a DHCP client to the DHCP server. The DHCP message includes (i) a non-option portion having a client identifier identifying the DHCP client and (ii) an option portion having first relay agent information added to the DHCP message by a first relay agent. The technique further involves modifying the option portion of the DHCP message to simultaneously include both the first relay agent information added by the first relay agent and second relay agent information from a second relay agent. The technique further involves sending the DHCP message with the modified option portion to the DHCP server. Accordingly, the DHCP server is capable of receiving relay agent information from multiple relay agents and assigning an address to the DHCP client based on this input.

Abstract: Converting a data packet involves receiving a first data packet. The first data packet has a first header expressed according to a first protocol, where the first header has a first source address and a first destination address. A second header corresponding to the first header is generated. The second header is expressed according to an Internet Protocol, and has a second source address and a second destination address. The second source address corresponds to the first source address, and the second destination address corresponds to the first destination address. The first data packet is converted to a second data packet by replacing the first header with the second header. The second data packet comprising the second header is outputted.

Abstract: A way to provide connection-based bandwidth utilization is disclosed. A connection is provided between a plurality of clients in the network environment. The connection is between the plurality of clients by a plurality of nodes through a plurality of trunks. The utilization capacity of the plurality of trunks is automatically adjusted using standards-based signaling.