An improved virtual memory scheme designed for multi-processor environments that uses processor registers and a small amount of dedicated logic to eliminate the overhead that is associated with the use of page tables. The virtual addressing provides a contiguous virtual address space where the actual real memory is distributed across multiple memories. Locally, within an individual memory, the virtual space may be composed of discontinuous real segments or chunks within the memory, allowing bad blocks of memory to be bypassed without alteration of the virtual addresses. The delays and additional bus traffic associated with translating from virtual to real addresses are substantially reduced or eliminated.

A network device may detect a reduced switching fabric bandwidth due to switching fabric degradation of a switching fabric. The network device may allocate the reduced switching fabric bandwidth to one or more interfaces of a packet processor. The network device may determine a first maximum reservable bandwidth for an interface of the one or more interfaces. The network device may identify a reserved bandwidth for the interface. The network device may determine an unreserved bandwidth for the interface based on the first maximum reservable bandwidth and the reserved bandwidth. The network device may advertise the unreserved bandwidth, for the interface, to a neighbor network device that communicates with the network device via the interface. The network device may provide an instruction, to the neighbor network device, for the neighbor network device to update a second maximum reservable bandwidth associated with the neighbor network device.

Aspects of the disclosure are directed to a telecommunications network architecture. In accordance with one aspect, a scalable telecommunications network architecture includes at least one infrastructure switching node; at least one user switching node for receiving a session request, wherein the session request includes at least one user attribute; and at least one controller coupled to the at least one user switching node, the at least one controller for examining the session request a) to allocate at least one bandwidth or at least one data rate for the at least one user switching node based on a resource allocation policy and b) to allocate a quantity of switch elements in the at least one infrastructure switching node based on an interconnection policy. In one example, the at least one controller establishes a communications session for a user terminal based on the session request.

Methods to achieve bounded router buffer sizes and Quality of Service guarantees for traffic flows in a packet-switched network are described. The network can be an Internet Protocol (IP) network, a Differentiated Services network, an MPLS network, wireless mesh network or an optical network. The routers can use input queueing, possibly in combination with crosspoint queueing and/or output queueing. Routers may schedule QoS-enabled traffic flows to ensure a bounded normalized service lead/lag. Each QoS-enabled traffic flow will buffer O(K) packets per router, where K is an integer bound on the normalized service lead/lag. Three flow-scheduling methods are analysed. Non-work-conserving flow-scheduling methods can guarantee a bound on the normalized service lead/lag, while work-conserving flow-scheduling methods typically cannot guarantee the same small bound. The amount of buffering required in a router can be reduced significantly, the network links can operate near peak capacity, and strict QoS guarantees can be achieved.

An approach is provided in which an information handling system establishes a resource reservation protocol (RSVP) session corresponding to a flow between a first entity and a second entity operating within a computer environment that implements a network virtualization overlay protocol. Once the RSVP session is established, the information handling system encapsulates data packets of the flow based on the network virtualization overlay protocol and, in turn, sends the encapsulated data packet over the computer network with a quality of service (QoS) assurance level that is based on the established RSVP session.

A method for processing data packets in a communication network includes establishing a path for a flow of the data packets through the communication network. At a node along the path having a plurality of aggregated ports, a port is selected from among the plurality to serve as part of the path. A label is chosen responsively to the selected port. The label is attached to the data packets in the flow at a point on the path upstream from the node. Upon receiving the data packets at the node, the data packets are switched through the selected port responsively to the label.

An apparatus and method is disclosed for segment routing (SR) over label distribution protocol (LDP). In one embodiment, the method includes a node receiving a packet with an attached segment ID. In response, the node may attach a label to the packet. Thereafter, the node may forward the packet with the attached label and segment ID to another node via a label switched path (LSP).

A method and an apparatus for processing a low-latency service flow, where the method includes that a first forwarding device obtains a low latency identifier corresponding to a first service flow, and obtains a second data packet based on the first data packet and the low latency identifier after determining that a received first data packet belongs to the first service flow, where the second data packet includes the first data packet and the low latency identifier, the low latency identifier instructing a forwarding device that receives the first service flow to forward the first service flow in a low-latency forwarding mode, and the low-latency forwarding mode is a mode in which fast forwarding of the first service flow is implemented under dynamic control, and the first forwarding device sends the second data packet to a second forwarding device in the low-latency forwarding mode.

A router that requests a reservation for an egress port prior to dequeuing a received packet. A reservation is granted only if there is space on the egress port for at least a maximum size packet. An ingress processor requests allocation of a packet buffer. An allocator grants the packet buffer, but if there are fewer than a threshold number of buffers available, the ingress processor will not accept the grant unless the received packet is to be routed to a port inside the device comprising the router. This conserves the packet buffer(s) for packets destined for locations within the device. After a reservation is obtained and a packet buffer has been accepted, the ingress processor begins dequeuing a received packet from an ingress port queue to the buffer, and provides an identifier of the buffer to an egress processor. The identifier is enqueued by the egress processor. After the identifier is dequeued, the egress processor copies the packet from the buffer to an egress queue and releases the buffer. The buffer can be released prior to completion of the data being copied.

Embodiments of the present invention provide an SLA-based resource allocation method and an NFVO. The method includes: receiving, by an NFVO, a network service instantiation request, where the network service instantiation request includes an identifier of an SLA of a network service; determining, by the NFVO based on the identifier of the SLA of the network service, an NFVI SLA parameter required for instantiating the network service; further obtaining, from a VIM based on the NFVI SLA parameter, a virtual resource meeting a requirement of the NFVI SLA parameter; and instantiating the network service based on the obtained virtual resource. In the method, the NFVO considers the NFVI SLA parameter when applying for the virtual resource, so that the obtained virtual resource meets a user requirement and a qualification hit rate of resource application is improved.