Techniques for load balancing communication sessions in a networked computing environment are described herein. The techniques may include establishing a first communication session between a client device and a first computing resource of a networked computing environment. Additionally, the techniques may include storing, in a data store, data indicating that the first communication session is associated with the first computing resource. The techniques may further include receiving, at a second computing resource of the networked computing environment, traffic associated with a second communication session that was sent by the client device, and based at least in part on accessing the data stored in the data store, establishing a traffic redirect such that the traffic and additional traffic associated with the second communication session is sent from the second computing resource to the first computing resource.

The present disclosure provides methods and systems for generating deployment architecture and template. The method can include determining properties of the instantiated resources in the stack; and generating a template corresponding to the instantiated resources based on the properties.

The present disclosure provides methods and systems for generating deployment architecture and template. The method can include determining properties of the instantiated resources in the stack; and generating a template corresponding to the instantiated resources based on the properties.

Methods and devices for creating and operating a combined network and computational slice instance (NCSI) in a Multi-access Edge Computing (MEC) scenario. Communication and computational resources may be reserved by a NCSI controller for the NCSI. The communication resources may include network slices and the computational resources may include MEC computational resources of one or more MEC servers. The reserved resources may be selected based on quality of service (QoS) requirements of UEs that will utilize the NCSI. During operation, reserved resources for the NCSI may be dynamically renegotiated based on an aggregate load of the NCSI, the QoS of data traffic, and/or updated QoS requirements of the UEs.

A request may be identified having one or more constraints for accessing disaggregated resources in a computing environment. One or more resources in a plurality of disaggregated resources may be identified based on the request. Computing server instances may be dynamically orchestrated using the one or more resources in the plurality of disaggregated resources based on the one or more constraints.

Route exchange in a plurality of network controller appliances on a per-tenant basis is disclosed. In one aspect, a method includes receiving, from a network management system and at a first network controller appliance, a designation of at least two tenants to be hosted on the first network controller appliance, the first network controller appliance being one of a plurality of network controller appliances in a SD-WAN; sending, from the first network controller appliance to other network controller appliances of the plurality of network controller appliances, a tenant list query message to obtain a corresponding tenant list of each of the other network controller appliances; and receiving a corresponding response from each of the other network controller appliances indicating the corresponding tenant list of each of the other network controller appliances, the corresponding response being used to update the tenant list on the first network controller appliance.

In general, various aspects of the techniques are described in this disclosure for distributed label assignment for labeled routes. In one example, a method includes obtaining, by a first thread of a plurality of execution threads for at least one routing protocol process executing on processing circuitry of a network device, an allocation of first labels drawn from a label space for a network service; adding, by the first thread, the first labels to a first local label pool for the first thread; generating, by the first thread, after obtaining the allocation of the first labels, a labeled route comprising a route for the network service and a label assigned by the first thread from the first local label pool; and outputting, by the network device, the labeled route.

An apparatus in one embodiment comprises a processing platform that includes a plurality of processing devices each comprising a processor coupled to a memory. The processing platform is configured to implement virtual resources of at least a first cloud-based system. The processing platform further comprises a user-specific cloud infrastructure identification module configured to determine user-specific cloud infrastructure within the first cloud-based system, a virtual representation generator module configured to generate an interactive three-dimensional visualization of the first cloud-based system based on the user-specific cloud infrastructure, and a virtual representation display module configured to output the interactive three-dimensional visualization of the first cloud-based system via at least one type of interface.

“Resource guarantee” refers to a unit of a resource that is guaranteed and therefore designated to a consumer. A multi-phased constraint programming (CP) approach is used to determine assignments of resource guarantees of a set of consumers to a set of hosts in a resource system. Phase I uses CP to segregate non-split consumers from split consumers. Phase II uses CP to assign each cotenant group of non-split consumers to a respective host. Phase III uses CP to assign resource guarantees of the split consumers across the hosts, wherein resource guarantees of a single split consumer may be splits across different hosts. Each phase involves execution of a CP solver based on a different CP data model. A CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

A network allocation vector setting method including: detecting each channel of n channels to determine m occupied busy channels of the n channels and a time duration in which each busy channel is occupied; and setting network allocation vectors of at least m busy channels of the n channels according to l time durations.