Abstract: Known network management systems for managing traffic signals in a network store node/link parameter signals and traffic parameter signals and calculate solutions defining intermediate nodes/links situated between sources and destinations for transporting said traffic signals from said sources to said destinations via said intermediate nodes/links and calculate route information per solution. By storing node/link parameter signals and traffic parameter signals for several situations (like several predictions in the future) and calculating solutions for each situation and then selecting a solution per situation, the network management system will manage the network more advantageously, especially when solutions are compared with each other, and when a solution is selected per situation in dependence of comparison results (comprising similarities/differences between solutions of different situations).

Abstract: Various embodiments of the present technology generally relate to systems and methods for packet-based communications. More specifically, some embodiments provide cause a machine (e.g., client device, data center, collaboration service, etc.) to receive data packets from a network. The data packets can include payloads that represent encoded data from a real-time communication between multiple devices and can be copied into multiple jitter buffers. The multiple jitter buffers can include a first jitter buffer having a first size and a second jitter buffer having a second size that is larger than the first size of the first jitter buffer. In some embodiments, the machine can decode the data packets or payloads from the multiple jitter buffers to create at least a first output signal from first jitter buffer and a second output signal from the second jitter buffer.

Abstract: A method for optimizing network design includes identifying a set of terminal-to-terminal shortest paths in a network, wherein a terminal-to-terminal shortest path is a best connection between two terminals, evaluating a terminal betweenness for each non-terminal vertex in the network, wherein the terminal betweenness of a vertex is a fraction of the total number of terminal-to-terminal shortest paths that include said vertex, calculating an average terminal betweenness for each terminal-to-terminal shortest path based on the terminal betweenness of the vertices in the path, iteratively adding the terminal-to-terminal shortest paths to an output graph in order of decreasing average terminal betweenness until all terminals are represented on the output graph, and using the output graph to design or adjust a network. The method may also include displaying the output graph to a user. A computer program product and computer system corresponding to the method are also disclosed.

Abstract: A system and method for measuring and calibrating a time-synchronized network of loudspeaker participants. Each loudspeaker participant has a plurality of microphone arrays. The system and method generates a stimulus signal at each network participant and records precise sensor data including start and end timestamps of the stimulus signal. The sensor data is compiled to estimate locations of loudspeaker participants within the time-synchronized network to establish a global frame of reference for all of the loudspeaker components in the network.

Abstract: Adjusting backhaul and fronthaul communication links of wireless mesh networks are described. In one aspect, characteristics of network data packets transmitted within a wireless mesh network can be identified. Based on those characteristics, fronthaul communication links and/or backhaul communication links can be adjusted.

Abstract: The embodiments herein provide a method and apparatus for scheduling users of a communication system, based on an advantageous pre-scheduling scheme. As a first scheduler process during a current scheduling interval, first users selected for scheduling in the current scheduling interval are regularly scheduled to thereby make radio resource reservations for the first users. As a second scheduler process during the current scheduling interval, second users not among the first users are identified as having scheduling deadlines falling in a subsequent scheduling interval. As a further operation of the second scheduler process, the second users for the subsequent scheduling interval are prescheduled to thereby make radio resource reservations in the subsequent scheduling interval for the second users. The second scheduling may be performed using processing resources that would otherwise be left idle by the first scheduler process during the current scheduling interval.

Abstract: Method of and a compiler for controlling a network based on a logical network model. The compiler determines physical and/or virtual resources, comprising of physical nodes and physical links, against which the logical model can be compiled. The network has known physical nodes, unknown physical nodes and logical nodes. The known physical nodes are “physical nodes” which are existing or still to be setup (virtual) nodes in the network. The known physical nodes are interconnected by physical links in accordance with a physical network layout. The logical network model has logical nodes indicated with a logical node name which refers to at least one known physical node or one unknown physical node in the network. The method uses a depth-mapping relation defining how the logical nodes are mapped to the known physical nodes and the unknown physical nodes.

Abstract: The present invention relates to a method and an apparatus for transmitting and receiving data by using high definition media interface (HDMI). According to the present invention, provided are a method including: receiving a request message for requesting first latency information indicating latency for outputting the data from a receiver, the request message including second latency information indicating the latency of the receiver; acquiring the first latency information based on at least one of the second latency information and third latency information indicating the latency of the sink device; and transmitting a response message including the first latency information as a response to the request message to the receiver, and an apparatus.

Abstract: A method of maintaining data packet forwarding information in a first network node of a wireless mesh communications network having a plurality of network nodes interconnected by wireless communications links is disclosed. The method includes receiving respective activity indicators for neighbour network nodes connected with the first network node by respective wireless communications links, and determining respective link indicators for the outgoing wireless communications links of the first network node, each such link indicator being indicative of a data packet transmission characteristic for the link concerned.

Abstract: The proposed technology relates to path selection in wireless mesh networks. In particular the disclosure relates to methods for selection of one or more transmission paths from an originating node to a target node in a wireless mesh network, wherein there are at least two possible transmission paths between the originating node and the target node. More specifically, the disclosure proposes a method, performed in an originating node in a wireless network comprising several nodes wirelessly connected to each other, for enabling selection of a transmission path from the originating node to a target node, wherein there are at least two possible transmission paths between the originating node and the target node. The method comprises the steps of receiving SI discovery signals from nodes in the at least two possible transmission paths and estimating S2, based on the received discovery signals, radio channels H for transmission from the originating node to the nodes transmitting the discovery signals.

Abstract: A method for managing a buffer by a base station in a wireless communication system is provided. The method includes calculating a transmission delay time that is an average of waiting time of packets transmitted for a predetermined time, identifying whether the calculated transmission delay time is greater than a preset delay time threshold value, and rearranging, if the transmission delay time is greater than the delay time threshold value, a transmission order of the packets in the buffer.

Abstract: A technology for path determination using robust optimization is provided. In accordance with one aspect, a network graph of a network is generated. The network graph comprises nodes corresponding to points in the network, and edges which connect the nodes. Costs for each edge of the network are determined and modeled using reference point, upper bound and lower bound parameters. A user input which includes a source node, destination node, and cost target may be received from a client device. A resultant path connecting the source node and destination node are determined by solving a target-oriented robust optimization problem, which optimizes a cost of the resultant path based on the modeled costs of the edges. The resultant path is displayed on a user interface of the client device.

Abstract: Technologies are provided for organizing network routes using network topology information. A router in a computer network can be configured to group network address prefixes in a routing table based on origin device clusters. The router can be configured to receive a routing protocol message comprising one or more prefixes and associated next hops. The router can identify an origin device cluster based on information contained in the message. The router can create a next hop group and associate it with the origin device cluster. The router can add the prefixes and next hops in the message to the next hop group. When an updated next hop list for a prefix is received at the router, the router can identify an origin device cluster for the prefix, identify a next hop group associated with the origin device cluster, and update the next hop group using the updated next hop list.

Abstract: Aspects of the present disclosure relate to methods and apparatus for assigning channels to networks in a group based on network coverage overlap and network weights. An example method generally includes determining whether channels are available for allocation at each network represented by a node in a network overlap graph, wherein each node in the graph is associated with an assigned channel in a shared spectrum, and for each network in the graph for which channels are available for allocation, identifying channels that are available for allocation to the network, and assigning at least one of the available channels to the network based, at least in part, on a weighting associated with the network.

Abstract: A system, method and non-transitory computer readable storage medium comprising instructions that when read by a processor perform receiving a telephony connection request, determining addressing information regarding the telephony connection request, the addressing information including at least routing information or a phone number, determining traffic information regarding the telephony connection request based on the addressing information, the traffic information including previous telephony connection requests, sending a reply in response to the telephony connection request, wherein: forwarding the telephony connection request to an intended recipient would result in a system response, and the reply differs from the system response.

Abstract: A method evaluates power engineering data using a data request that is transmitted to a coupling device by a first communication link. The coupling device is used to convert the data request from a coupling data format into a further data request that is specific to an energy engineering device in a device-specific data format. The further data request is transmitted to the power engineering device by a second communication link. The power engineering device transmits its power engineering data, requested by the further data request, to the coupling device by the second communication link. The power engineering data are in a data format that is specific to the power engineering device, and the coupling device converts all the power engineering data requested by further data requests into a data response in the coupling data format and uses the first communication link to transmit them to the evaluation device.

Abstract: A route selection system includes a hub controller in communication with multiple network hubs of a first network domain in which each of the hubs are in communication with a corresponding multiple routers of a second network domain. The hub controller is executed to obtain at least one performance measurement associated with a route terminating at the network hub, generate a border gateway protocol (BGP) advertisement with a preference value that is proportional to the received performance measurement, and transmit the generated advertisement to the network hub, the network hub forwarding the advertisement to the router configured in the other network domain. Upon receipt of the advertisements, the second network domain selects one of the routers for processing the route through the second network domain according to the performance measurement included in the advertisement.

Abstract: Techniques for optimizing configuration parameters in a wireless network may iteratively adjust one or more wireless configuration parameters during a first stage of an adjustment period until either a cost increase during a single iteration exceeds an upper cost threshold or (ii) the number of successive iterations exhibiting a per-iteration cost increase between the upper cost threshold and a lower cost threshold exceeds a threshold number of iterations. This may trigger the AP proceed to a second stage of the adjustment period, where the AP may adjust the same wireless configuration parameter in an opposite direction, maintain a value of the wireless parameter, or adjust a different wireless configuration parameter during the second stage. Progression between successive adjustment periods may be at least partially coordinated between APs in a group of APs.

Abstract: A method includes identifying one or more elephant flows operated by a plurality of user equipment (UE) terminals located in a first coverage area, comparing the one or more elephant flows to threshold characteristics, determining whether the coverage area is congested, causing handover of the plurality of UE terminals from the first coverage area when the one or more elephant flows exceed the threshold characteristics and the first coverage area is congested.

Abstract: Methods and systems are presented in this disclosure that enable mobile devices without access to an active network connection (e.g. cellular, satellite or Internet network) to communicate between each other by sending and receiving data packets (e.g. text, location, or image) through a mesh of connected devices. A mobile device receives a request to send a packet having an identifier of a recipient device. Based on the identifier, the mobile device determines whether the recipient device is in a list of mobile devices within a wireless range of the mobile device. Based on the determination, the mobile device includes the packet into an outgoing queue having packets for forwarding. The mobile device establishes one or more connections with one or more mobile devices in the list, and forwards one or more packets from the outgoing queue to the one or more mobile devices using the one or more connections.

Abstract: A processor may detect an occurrence of a network anomaly from a set of network operational data collected for a portion of a communication network within a geographic area, detect an occurrence of a weather event from a set of weather data for the geographic area, and determine an occurrence of a weather-related network impairment when the occurrence of the network anomaly and the occurrence of the weather event are detected within a time period, and when the network anomaly and the weather event match a signature for the weather-related network impairment. The processor may further receive, within a time window associated with the time period, a fault report associated with a customer premises within the geographic area and provide a notification and an instruction set to resolve the weather-related network impairment, where the instruction set is stored in a solution record associated with the signature.

Abstract: Method for obtaining an initial communication route between a node device and a data concentrator device in a network using powerline communications based on a communication protocol including a method for seeking an initial communication route, the method including the following steps: obtaining information representing a risk of overloading of said network; applying the method for seeking an initial communication route in order to determine the initial communication route when the information representing the risk of overloading of the network indicates that the network does not risk being overloaded.

Abstract: Aspects of the present disclosure involve systems, methods, computer program products, and the like, for providing disaster routing of particular communications through a telecommunications network during a network outage. The disaster routing may ensure that communications from a particular source or to a particular destination are connected to the destination even during times when portions of the network may be inoperable. In one particular embodiment, the disaster routing may be performed for emergency communications received at the network and connected to one or more emergency services configured to receive the emergency communication. However, the disaster routing mechanisms and techniques described herein may be applied or available to any type of communication from any source or customer to the telecommunications network.

Abstract: A plurality of SYN packets is sent from a first system, each of the plurality of SYN packets traverses a different path in a first set of paths between the first system and a second system in a multipath data communication network and includes a unique source identifier. From a plurality of SYN-ACK packets, a SYN-ACK packet is selected that is first to arrive at the first system. Each SYN-ACK packet includes a unique source identifier of a selected SYN packet. A path is configured corresponding to the selected SYN packet, as an outbound path from the first system. A path corresponding to the selected SYN-ACK packet is configured as an inbound path to the first system. A session between the first and the second systems is established using the outbound and inbound paths.

Abstract: Identifying transport-level encoded payloads includes identifying transport-level encoded payloads from a recorded script in a display, determining multiple decoding option for at least one of the transport-level encoded payloads where the multiple decoding options includes a recommended chain, and displaying multiple decoding options with at least one of the transport-level encoded payloads.

Abstract: A method of transmitting data from one point to another point using a vehicle, and a system for performing the same may include searching for at least one neighbor vehicle, determining a vehicle which is to transmit the data to the second station, among the searched at least one neighbor vehicle, and transmitting the data to the determined vehicle.

Abstract: In one embodiment a method including obtaining metrics regarding a WiFi network and a RAN having overlapping coverage ranges, based at least partly on the metrics, allocating a first adjusted spectrum allocation to a first network, and a second adjusted spectrum allocation to a second network, the first adjusted spectrum allocation decreased from a first current spectrum allocation, and the second adjusted spectrum allocation increased from a second current spectrum allocation, and causing enforcement of the first adjusted spectrum allocation and the second adjusted spectrum allocation, wherein the obtaining, allocating and causing are performed a plurality of times, and wherein in at least one of the plurality of times the first network is the WiFi network and the second network is the RAN, and in at least one other of the plurality of times the first network is the RAN and the second network is the WiFi network.

Abstract: Techniques to dynamically configure target bitrate for streaming network connections are described.

Abstract: Systems and methods of performing end-to-end QoS control during the access of Wi-Fi-enabled communications devices to remote networks. The systems and methods employ a bandwidth manager, a policy server, a near-end gateway located within a Wi-Fi network, and a far-end gateway located within a service provider network. Throughout the duration of a call placed by a wireless device user using a Wi-Fi-enabled communications device, the bandwidth manager can have access to service profiles stored in a database of the policy server for use in monitoring levels of bandwidth usage, for tunneled and/or local breakout traffic, at least at the near-end gateway to the service provider network and at the far-end gateway to a remote network, and performing end-to-end QoS control by dynamically making adjustments, as needed, to one or more service profiles at least at the near-end gateway and/or at the far-end gateway based on the monitored bandwidth usage levels.

Abstract: Disclosed are a network perception based service policy configuration method and network device, the method comprising: acquiring network perceived information of a first node; establishing an environment information map of the first node according to the network perceived information; acquiring characteristic information of the first node; configuring a service policy for the first node according to the characteristic information of the first node and the environment information map, thus configuring the service policy for the network node according to the network perceived information and the node characteristics.

Abstract: In one aspect, a method includes receiving a data packet at a routing node that includes a processor. The method also includes determining at least one value for the data packet, selecting a routing table from a plurality of routing tables stored at the routing node in response to the at least one value for the packet and forwarding the data packet in response to the routing table selected. Each routing table is associated with a respective one cost function.

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: Application dependency mapping (ADM) can be automated in a network. The network can determine an optimum number of clusters for the network using the minimum description length principle (MDL). The network can capture network and associated data using a sensor network that provides multiple perspectives and generate a graph therefrom. The nodes of the graph can include sources, destinations, and destination ports identified in the captured data, and the edges of the graph can include observed flows from the sources to the destinations at the destination ports. Each clustering can be evaluated according to an MDL score. The optimum number of clusters for the network may correspond to the number of clusters of the clustering associated with the minimum MDL score.

Abstract: Techniques for making placement decisions for the placement of computing resources in a computer network utilize approximations of the network. A simplified representation of the network is used to determine a placement that satisfies a set of connectivity requirements. The simplified representation may be generated, at least in part, probabilistically based on the network.

Abstract: Data network components and frameworks for the control and optimization of network traffic using layered architectures, according to embodiments of the invention, are disclosed. In one embodiment, a data network comprises a switch, a data link, a tracking processor, and a planning processor. The planning processor is configured to generate a reference trajectory by receiving a local system state from the tracking processor, calculating a reference trajectory by solving a planning problem, and sending the reference trajectory to the tracking processor. The tracking processor is configured to track the reference trajectory by determining a set of states of the switch over a time interval, sending a local system state to the planning processor, receiving the reference trajectory from the planning processor, computing a control action by solving a tracking problem based on the reference trajectory, determining an instruction based on the control action, and sending the instruction to the switch.

Abstract: A Path Computation Element (PCE) in a Multi-Protocol Label Switching (MPLS) network receives initial information of all Traffic Engineering (TE) links that is reported by a Label Switching Router (LSR), and stores the initial information into a TE database (TEDB). For the information of each TE link, the PCE determines initial values of pending bandwidth, reserved bandwidth and unreserved bandwidth of each TE-Class in the information of the TE link, and stores the initial values into the TEDB. The PCE receives a Constraint-based Routed Label Switched Path (CRLSP) calculation request from a Path Computation Client (PCC), calculates a Label Switched Path (LSP) according to the information of each TE link stored in the TEDB, and updates pending bandwidth, reserved bandwidth and unreserved bandwidth of TE-Class in the information of TE link corresponding to the LSP, wherein the information of TE link corresponding to the LSP is stored in the TEDB.

Abstract: The invention introduces a method for data synchronization between a sensor hub and an application processor, which contains at least the following steps: generating and adding a plurality of absolute time stamps in a sensor-data stream; and generating and adding a plurality of pieces of sensor data and a plurality of relative time stamps in the sensor-data stream between the moments of generating each two adjacent absolute time stamps, wherein each relative time stamp is associated with one piece of sensor data.

Abstract: According to one aspect, a method includes obtaining a packet at a network endpoint from a client via a first segment. The packet has a segment routing header that includes a list of addresses attached to a chunk entry, and is configured to identify at least a first chunk requested by the client. The method also includes identifying, at the network endpoint, the at least first chunk using the packet, and determining at the network endpoint if the network endpoint has the first chunk. If it is determined that the network endpoint has the first chunk, the first chunk is provided from the network endpoint to the client. Alternatively, if it is determined that the network endpoint does not have the first chunk, the packet is provided to a second segment.

Abstract: Embodiments relate generally to systems and methods for transitioning a system from a tradition network to a Software Defined Network (SDN) enabled network. In some embodiments, the systems and methods may comprise the use of a Path Computation Element (PCE) as a central controller. Smooth transition between traditional network and the new SDN enabled network, especially from a cost impact assessment perspective, may be accomplished using the existing PCE components from the current network to function as the central controller of the SDN network is one choice, which not only achieves the goal of having a centralized controller to provide the functionalities needed for the central controller, but also leverages the existing PCE network components.

Abstract: According to an embodiment, a wireless communication device is one of a plurality of wireless communication devices constituting a wireless communication system. The device includes one or more processors configured to have a network topology construction mode and a time-division wireless communication mode. A first cycle as a communication cycle in the network topology construction mode is shorter than a second cycle as a communication cycle in the time-division wireless communication mode.

Abstract: In some examples, a network device is configured to obtain a set of N paths between a pair of nodes of a network topology model for a network of routers interconnected by a plurality of links in a network topology, where N>2, and configured to, for each label switched path from a plurality of label switched paths to be routed to the network topology: in response to identifying, from the set of N paths, a path for the label switched path that has capacity for a required bandwidth of the label switched path, deduct the required bandwidth of the label switched path from one or more links of the path of the network topology model to modify the network topology model and output data to the network for programming the label switched path in the network on the path; and in response to failing to identify a path for the label switched path from the set of N paths, add the label switched path to a set of failed label switched paths.

Abstract: The present disclosure relates to a pre-5th-generation (5G) or 5G communication system to be provided for supporting higher data rates beyond 4th-generation (4G) communication system such as a long term evolution (LTE). A method for managing congestion in a first node in a wireless communication system is provided. The method includes receiving status information from each of nodes configuring a network with the first node, receiving information about a service requirement criterion from a second node as one of the nodes, acquiring additional path setup information for the second node based on the status information received from each of the nodes and the information about the service requirement criterion received from the second node, and transmitting the acquired additional path setup information to the second node.

Abstract: Techniques are generally described related to a mobile ad-hoc network. One example method for transmitting data from a source node to a destination node in a mobile ad-hoc network may include receiving a route reply packet from a first node by a second node; identifying the route reply packet as an overheard route reply packet by the second node; adding a first routing entry in a routing table of the second node and the first routing entry being associated with the overheard route reply packet by the second node; broadcasting a routing entry added message associated with the first routing entry by the second node; receiving data transmitted from a third node and the data being transmitted by the third node responsive to the routing entry added message by the second node; and sending data received from the third node towards the destination node via an active route established based on the first routing entry in the routing table of the second node by the second node.

Abstract: There is described a method for mapping data representing an instance of a service model for a network onto policy information for controlling one or more Software Defined Network (SDN) switches in the network. The instance of a service model comprises a topology of one or more network functions and at least one virtual network function and a data flow through the topology, and the at least one virtual network function defines a dynamic flow control policy in dependence upon which data flow through the virtual network function to or from one or more of the network functions is selectively controlled. The policy information is provided to one or more SDN control entities for controlling the one or more SDN switches in the network so that data flows through the network in accordance with the service model instance.

Abstract: The disclosed embodiments illustrate methods and systems for maintaining reachability information among one or more communication devices of a communication network. The method includes creating, at a first time instance, a first path-union graph, between a first and a second communication device that become unreachable from each other in the communication network. Thereafter, a reachability tree is created from the first path-union graph. The reachability tree includes a set of communication devices that are at a distance of less than a predefined path distance from the first communication device. Further, at a second time instance, a second path-union graph is created between the first communication device and a third communication device, when the third communication device becomes unreachable from the first communication device. Thereafter, the reachability tree is updated based on the second path-union graph.

Abstract: A batch of input/output (I/O) requests, directed to multiple physical domains of storage area network disk (SAN disk), are prioritized for processing based on the workload (pressure) of the target physical domains, and further based on the workload of multiple input/output (I/O) paths available for transmission of the I/O data to or from the physical domains. Requests directed to a physical domain with low pressure (relative to other physical domains to which some of the I/O requests are directed) are queued up and sent to the physical domain on an I/O path having a low workload (relative to other available I/O paths). Requests directed to a physical domain under relatively high pressure are queued up and sent to the physical domain on an I/O path having a relatively higher workload.

Abstract: One or more techniques and/or systems are provided for automatically forming a wireless sensor network, implementing power management for the wireless sensor network, and/or self-healing within the wireless sensor network. For example, hub devices, configured to forward messages through the wireless sensor network to a gateway device having access to a network, may automatically join and configure into the wireless sensor network by locating and connecting to master devices using signal frequencies representing numbers of hops to the gateway device. A hub device may be configured to transition between a low power sleep state for power conservation and an awakened normal operational state for transmitting timing signals according to a duty cycle, and thus the hub device may be capable of operating from a battery. If a hub device determines that a master device has become inoperable, the hub device may automatically search for a new master device.

Abstract: Techniques are provided for allocating hardware resources for an equal-cost multi-path (ECMP) group based on information about the network architecture. A table in memory may include a plurality of entries. Each entry may include interface set and a number of interfaces. Each interface set may represent a list of interfaces for the network device for a given network connection. The network device may receive a list of interfaces for allocating resource for an EMCP group. The network device may select an entry from the table by identifying an interface set that includes all of the interfaces for the ECMP group. The network device may determine a size of the ECMP group using a number of interfaces for the identified interface set from the entry from the table and allocate hardware resources (e.g., memory) for the ECMP group based on the determined size of the ECMP group.

Abstract: A method and system for implementing a network service computation system uses distributed graph processing at a plurality of network controllers corresponding to a plurality of network domains. Each network controller may manage and maintain a network graph for its respective network domain. Each network controller many communicate with nodes (or vertices) in its respective network domain, while the network controllers may communicate with each other for path discovery and computation purposes.

Abstract: Various methods are provided for providing dynamic and adaptive QoS and QoE management of U-Plane traffic while implementing user and application specific differentiation and maximizing system resource utilization by, for example, providing utilizing a system comprised of a policy server and one or more enforcement points. In one example system, the policy server may be a logical entity configured for storing a plurality of QoS/QoE policies, each of the plurality of policies identifying at least one of a user, service vertical, application, or context, and associated QoE targets. The policy server may be further configured to provide one or more of the plurality of QoS/QoE policies to the one or more enforcement points. In some embodiments, the QoS/QoE policies may be configured to provide QoE targets, for example, at a high abstraction level and/or at an application session level.