Abstract: A method for path computation in a network includes determining dynamic link weights for links in the network, responsive to a request for a path, for a connection, between a source node and a destination node in the network with a requested bandwidth amount, wherein the dynamic link weights, for each link, are based on a current status of the link and a future status of the link; determining one or more paths for the request based on the dynamic link weights; and selecting a path of the one or more paths to minimize cost in the network. The method can be implemented through a Software Defined Networking (SDN) controller.

Abstract: System and method embodiments are provided for a virtual busy-tone for full-duplex wireless networks. Embodiments provide a mechanism for efficiently eliminating the hidden node problem. In an embodiment, a method in a full-duplex enabled wireless network component for avoiding collisions includes receiving, at the network component, a data transmission from a first station; and transmitting a busy indicator from the network component, the busy indicator including a time duration determined in accordance with an expected time duration of the data transmission to instruct any non-transmitting station to not transmit data during the included time duration.

Abstract: System and method embodiments are provided for pausing data transmission in a full-duplex wireless network. Embodiments eliminate the deadlocks in the full duplex MAC layer and improve the system efficiency. In an embodiment, a method in a wirelessly enabled and full duplex enabled network component for pausing an ongoing data transmission includes beginning a transmission, with the network component, of first data to a first station; determining, with the network component, that transmission of a second data to a second station is required before completion of the transmission of the first data to the first station; transmitting, with the network component, a pause indicator to the first station notifying the first station that transmission of the first data will be paused; transmitting, with the network component, the second data to the second station; and resuming transmitting, with the network component, the first data to the first station.

Abstract: A HARQ frame data structure and methods of transmitting and receiving with HARQ in systems using blind detection. In one embodiment, a method of transmitting over a channel using HARQ includes transmitting a first frame containing data toward a blind detection receiver, and transmitting a second frame containing at least a portion of the data and information about the first frame toward the blind detection receiver.

Abstract: Constraining resource provisioning by domain controllers based on resource requirements projected for remotely-originating inter-domain traffic can improve utilization efficiency and link reliability in multi-domain software defined network (SDN) architectures. A domain controller may be required to reserve a portion of inter-domain link capacity for transporting remotely-originating traffic. This may limit the inter-domain link capacity available for transporting locally-originating traffic in a manner that ensures remotely-originating traffic flows have equitable and/or adequate access to resources of inter-domain links. Alternatively, a domain controller may be required to maintain a minimum throughput rate for remotely-originating traffic, which may cause remotely-originating traffic to be prioritized over locally-originating traffic when necessary to maintain the minimum throughput rate. Provisioning constraints can be generated in a centralized or distributed fashion.

Abstract: A software designed protocol (SDP) network node includes a receiver, and a processor operatively coupled to the receiver. The receiver receives instructions, and receives packets. The processor updates a configuration of the SDP network node in accordance with the received instructions, and processes the received packets.

Abstract: An embodiment method of network zoning for a software defined network (SDN) includes determining a number, K, of zones according to at least one zone quantity parameter. Given K, a plurality of network nodes of the SDN are partitioned into K zones. The K zones are respectively assigned K SDN controllers. The K SDN controllers are configured to make traffic engineering decisions and carry out distributed network optimization for respective assigned network nodes among the plurality of network nodes.

Abstract: System and method embodiments are provided for traffic behavior driven dynamic zoning for distributed traffic engineering (TE) in software defined networking (SDN). In an embodiment, a method in a network component for dynamic zoning for TE in SDN includes receiving at the network component network information from at least one SDN controller from a plurality of SDN controllers in a network; determining with the network component a plurality of TE zones for the network, selecting a local zone TE controller for each of the plurality of TE zones, and selecting a master TE controller according to the network information and a zoning scheme, wherein the local zone TE controller and the master TE controller are selected form one of the SDN controllers; and transmitting with the network component an indication of the local zone TE controllers, zone membership, and the master controllers to at least some of the SDN controllers.

Abstract: Hierarchical Software Defined Network (SDN) architectures can be used to reduce complexity of traffic engineering in large or divers network environments. In hierarchical SDN architectures, a network is sub-divided into multiple regions, and each region is assigned to a different SDN controller. Network status information is collected and consolidated at a regional level, and fed upstream through the SDN control plane until it reaches a root SDN controller. The root-SDN controller computes cost-based parameters, which are distributed to regional SDN controllers for local provisioning. The cost-based parameters can include Lagrangian variables estimations or other parameters that constrain regional traffic engineering optimization in a manner that advances global traffic engineering objectives.

Abstract: An embodiment method includes selecting, by a network infrastructure manager, a first user equipment (UE) as a destination UE and selecting a second UE as a relay UE for the destination UE. The method further includes negotiating installation of a virtual range extender (vREX) UE on the destination UE, and negotiating installation of a vREX forwarding agent (FA) on the relay UE. The vREX FA is configured to act as a FA for the vREX UE.

Abstract: An embodiment user equipment has a list of predictive data that a user may request, and programming to receive prefetched data based on the list of predictive data at a reduced cost, wherein the reduced cost is lower than a network cost of downloading the data, and to store the prefetched data within the UE for future consumption. An embodiment base station has a list of predictive data a UE may request, a high priority queue for data requested by the UE, and a low priority queue with predictive data corresponding to the list of predictive data. The base station further includes programing to send the requested data and to send the predictive data.

Abstract: Methods and devices for reducing traffic over a wireless link through the compression or suppression of high layer packets carrying predictable background data prior to transportation over a wireless link. The methods include intercepting application layer protocol packets carrying the predictable background data. In embodiments where the background data is periodic in nature, the high layer packets may be compressed into low-layer signaling indicators for communication over a low-layer control channel (e.g., an on off keying (OOK) channel). Alternatively, the high layer packets may be suppressed entirely (not transported over the wireless link) when a receiver side daemon is configured to autonomously replicate the periodic background nature according to a projected interval. In other embodiments, compression techniques may be used to reduce overhead attributable to non-periodic background data that is predictable in context.

Abstract: An embodiment method includes receiving service parameters for a service and locating logical network nodes for a service-specific data plane logical topology at respective physical network nodes among a plurality of physical network nodes according to the service parameters, a service-level topology, and a physical infrastructure of the plurality of physical network nodes. The method also includes defining connections among the logical network nodes according to the service parameters, the service-level topology, and the physical infrastructure, and defining respective connections for a plurality of UEs to at least one of the logical network nodes according to the service parameters, the service-level topology, and the physical infrastructure. The method further includes defining respective functionalities for the logical network nodes.

Abstract: A system and method for agile wireless access network is provided. A method embodiment for agile radio access network management includes determining, by a network controller, capabilities and neighborhood relations of radio nodes in the radio access network. The network controller then configures a backhaul network infrastructure for the radio access network in accordance with the capabilities and the neighborhood relations of the radio nodes.

Abstract: System and method embodiments for joint scheduling of buffered video on demand (VoD) and best effort flows within the same band enable improved quality of experience for VoD receiving mobile devices without resource partitioning or sacrificing FSS gains. In an embodiment, a method for scheduling video on demand flows and best effort flows within the same band includes determining with a transmission point (TP) a buffer vacancy for each of the ones of a plurality of mobile devices wirelessly coupled to a transmission point that are receiving VoD flows, calculating, with the TP, buffer vacancy scheduling weights for the plurality of mobile devices using the buffer vacancy, and determining, with the TP, a joint schedule of VoD flows and best effort flows based on the buffer vacancy scheduling weights.

Abstract: Diverse traffic types can be efficiently communicated in a simultaneous manner by dynamically selecting between contention-based and scheduling-based media access control (MAC) communication schemes. Such a mechanism may be particularly beneficial in networks having a contention-based access resources and scheduling based access resources. Contention-based resources and scheduling based resources may occur over a common period, and may be orthogonal in the frequency domain and/or in the code domain. The dynamic selection may be based on a traffic characteristic or a network characteristic, and may be performed on a packet-by-packet basis. The selection criteria may be updated dynamically to adapt to changing network conditions, and may be communicated to the various transmitters via control channels or higher layer signaling.

Abstract: A method embodiment includes receiving, by a first network device, a first transmission comprising an explicit first source identification (ID). The first source ID is added to a list of active source IDs. The first network device receives a second transmission. The second transmission does not include an explicit second source ID. The first network device determines the second source ID by using the list of active source IDs.

Abstract: Embodiments are provided for a framework for networks with software defined protocols (SDP) network nodes. The embodiments include a SDM controller component for managing and controlling a data plane protocol for SDP network nodes. The SDP controller also interacts with a software defined networking (SDN) controller for determining one or more paths in a network including the SDP network nodes. The SDP controller is configured to determining a break-down of data plane process functionality into a plurality of basic process function blocks for a service, traffic flow, or virtual network in accordance with network component capabilities or quality of service/experience requirement. A workflow and status information are also determined for one or more network components along a path allocated, by the SDN controller. The workflow and status information are indicated to the one or more components, which are configured to implement the workflow using the basic process function blocks.

Abstract: A system and method for transmitting data is provided. An embodiment comprises a dynamic determination of ARQ and HARQ protocols in order to achieve a wider range of Quality of Service guarantees. The ARQ and HARQ protocols can be selected base on Quality of Service requirements of packets and the capabilities of the piece of user equipment.

Abstract: System and method embodiments for joint scheduling of buffered video on demand (VoD) and best effort flows within the same band enable improved quality of experience for VoD receiving mobile devices without resource partitioning or sacrificing FSS gains. In an embodiment, a method for scheduling video on demand flows and best effort flows within the same band includes determining with a transmission point (TP) a buffer vacancy for each of the ones of a plurality of mobile devices wirelessly coupled to a transmission point that are receiving VoD flows, calculating, with the TP, buffer vacancy scheduling weights for the plurality of mobile devices using the buffer vacancy, and determining, with the TP, a joint schedule of VoD flows and best effort flows based on the buffer vacancy scheduling weights.