610 results about "Differentiated services" patented technology

A method called the evolvable interference management (EIM) method is disclosed in this patent for avoiding interference and collision and increasing network throughput and energy efficiency in wireless networks. EIM employs sensitive CSMA/CA, patching approaches, interference engineering, differentiated multichannel, detached dialogues, and/or spread spectrum techniques to solve the interference and QoS problems. EIM-based protocols can considerably increase network throughput and QoS differentiation capability as compared to IEEE 802.11e in multihop networking environments. Due to the improvements achievable by EIM, the techniques and mechanisms presented in this application may be applied to obtain an extension to IEEE 802.11 to better support differentiated service and power control in ad hoc networks and multihop wireless LANs. New protocols may also be designed based on EIM.

The system of the present invention guarantees quality of service with respect to packets transmitted/received between an external network capable of providing differentiated services and a home network. The system includes a packet classifier, a marker, a priority class queue, a scheduler and a token bucket. The packet classifier classifies the packets according to addresses and traffic types. The marker allocates information on priorities to packets transmitted from the home network to the external network. The priority class queue has a plurality of queues classified according to the priorities. The scheduler services packets stored in the priority class queue according to the priorities. The token bucket drops packets, bandwidths of which are above a preset maximum bandwidth, when the packets are generated.

At least one substitute path is provided in place of a plurality of existing paths of a network to reallocate traffic carried by the plurality of existing paths. The total bandwidth needed to carry the traffic of the plurality of existing paths is determined. A proposed route is generated from the available links in the network. A portion of the bandwidth of a proposed route may be allocated to the needed bandwidth when the bandwidth of a proposed route is greater than or equal to the needed bandwidth. When the bandwidth of the proposed route is less than the needed bandwidth, at least one further route is generated, and the needed bandwidth is divided among the proposed route and the at least one further route such that a minimum number of further routes are generated.

The invention relates to a method for routing Internet traffic. The method generally includes the steps of receiving a packet from multimedia network, allocating a message block header for the packet, wherein the header is used to hold behavior aggregate values for internal router mapping, and queuing and routing the packet to a differentiated services network domain in a manner that ensures a specific QoS.

A method of monitoring telecommunications network traffic comprising the steps of: receiving a packet stream comprising packets each identified as belonging to one of at least three classes; calculating a difference between the numbers of packets received identified as belonging to a first and a second of said classes; and deriving a measure of traffic load on the network responsive to said difference. The invention also relates to a method for admission control based on the above method of monitoring and a method for overcoming admission control avoidance. It also relates to apparatus embodying these methods.

A resource allocation device includes a database of user and service information, a resource allocation management unit for determining whether a service request agrees with a service level agreement and whether it accepts a resource allocation request, a service level agreement unit for negotiating the service level agreement with the user, sending the received service request to the resource allocation management unit, acquiring the result of the resource allocation request, and transmitting the result of the resource allocation request to the user, a routing information management unit for obtaining a network configuring information, storing the network configuring information in the database, discovering the path to provide the service and storing the discovered path in the database to be reused and a policy control management unit for deciding a policy according to whether the service request and the resource allocation request are accepted.

In a method and apparatus for signaling a voice over Internet protocol (VoIP) call based on a class of service in a VoIP service system, a database which includes VoIP signaling information differentiated by the class of VoIP service is built, and the database is retrieved by a service class assignment condition to produce a call setup message. The call setup message includes information related to the service class. Accordingly, it is possible to perform dynamic VoIP signaling by setting a differentiated service class based on each user or a primary factor of each class of the VoIP service.

The application proposes a network slice capability opening method, device and system. The method includes the following steps: a network slice service request sent by a third-party service server is received; network slice information of a current network is obtained according to the network slice service request; and according to the network slice information of the current network and a service requirement of the network slice service request, a network slice service is provided to the third-party service server, a capability opening service of the network slice service of a future network can be provided, and the third party obtains related information of network slices through capability opening, and selects or requests creation of different network slices to provide differentiated services for third-party services.

An improved method is described for providing Differentiated Services (Diffserv) traffic to a node in a network that implements a security method that discards duplicate packets received at the node. The method includes the step of identifying at least two service levels to be provided to received traffic and assigning separate sequential sequence numbers and different anti-replay bitmasks to each of the service levels. The anti-replay bitmask indicates the sequence numbers of packets that have been previously received at the node that should be compared against a received packet to determine whether a duplicate packet has been received. Such an arrangement reduces the possibility that traffic having lower priority is dropped as a security measure.

An architecture, design, and realization for providing Quality of Service (QoS) to Internet Protocol (IP) networks based on a three-class differentiated service scheme where the service provider uses a resource management system and a schedule optimizer to enable the optimal use of bandwidth and buffer resources at each node or router along the various links between the ingress and egress points in a network. The resource reservation system checks to determine if sufficient bandwidth resources are available along the path requested by the customer for a particular class. The schedule optimizer ensures that sufficient buffer resource allocations and parameter settings are made to optimally reach the predetermined QoS criteria for each of the three classes. The system also contains a mechanism supporting resource reservations providing additional resources along alternative paths if the selected path links fail in the network.

Differentiated service classes on a label switch path are managed by comparing at least one packet field value included in a packet of data to mapping field values of a mapping that correlates the mapping field values with queues. The packet is stored into one of the queues based on the comparing. A first subset of the queues is scheduled using a first queue scheduling algorithm and a second subset of the queues is scheduled using a second queue scheduling algorithm. The packet is transmitted onto the label switch path in accordance with a predefined scheduling order of the first subset of the queues and the second subset of the queues.

A method for scheduling cell transmissions through a switch with rate and delay guarantees and with low jitter is proposed. The method applies to a classic input-buffered N×N crossbar switch without speedup. The time axis is divided into frames each containing F time-slots. An N×N traffic rate matrix specifies a quantized guaranteed traffic rate from each input port to each output port. The traffic rate matrix is transformed into a permutation with NF elements which is decomposed into F permutations of N elements using a recursive and fair decomposition method. Each permutation is used to configure the crossbar switch for one time-slot within a frame of size F time-slots, and all F permutations result in a Frame Schedule. In the frame schedule, the expected Inter-Departure Time (IDT) between cells in a flow equals the Ideal IDT and the delay jitter is bounded and small. For fixed frame size F, an individual flow can often be scheduled in O(logN) steps, while a complete reconfiguration requires O(NlogN) steps when implemented in a serial processor. An RSVP or Differentiated Services-like algorithm can be used to reserve bandwidth and buffer space in an IP-router, an ATM switch or MPLS switch during a connection setup phase, and the proposed method can be used to schedule traffic in each router or switch. Best-effort traffic can be scheduled using any existing dynamic scheduling algorithm to fill the remaining unused switch capacity within each Frame. The scheduling algorithm also supports multicast traffic.

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.

A system and method that enables session-based and non-session-based application services to be controlled and managed within the IMS/NGN architecture. The IMS/NGN architecture includes a service layer and a transport layer. IMS service control functions are implemented within the service layer, and RACF and transport functions are implemented within the transport layer. The transport functions include access and core network functions, which have corresponding QoS resources. The access or core network function includes an application service control function (ASCF), which includes a PD-FE and a functional element for inspecting packet data flows, and identifying and classifying application services associated with the flows. The ASCF is employed to signal the IMS service control functions on behalf of non-session-based application services, and to reserve and allocate the QoS resources needed to support packet data flows associated with the non-session-based services. As a result, service providers can provide users or subscribers of such non-session-based services with guaranteed or differentiated QoS and/or differentiated service plans, thereby allowing charges to be calculated for the non-session-based services and service plans that are commensurate with the value of the respective service or plan.

A practical economic and technical model for building commercial-grade electronic file delivery services that provide the same scale, predictability, and differentiated service levels as physical courier services traditionally used to move electronic data on physical media. Systems and methods for providing such services using a charge-back scheme based on congestion pricing are described.

A highly scalable system and method for supporting (mim,max) based Service Level Agreements (SLA) on outbound bandwidth usage for a plurality of customers whose applications (e.g.,Web sites) are hosted by a server farm that consists of a very large number of servers. The system employs a feedback system that enforces the outbound link bandwidth SLAs by regulating the inbound traffic to a server or server farm. Inbound traffic is admitted to servers using a rate denoted as Rt(i,j), which is the amount of the i^th customer's j^th type of traffic that can be admitted within a service cycle time to servers which support the i^th customer. A centralized device computes Rt(i,j) based on the history of admitted inbound traffic to servers, the history of generated outbound traffic from servers, and the SLAs of various customers. The Rt(i,j) value is then relayed to one or more inbound traffic limiters that regulate the inbound traffic using the rates Rt(i,j) in a given service cycle time. The process of computing and deploying Rt(i,j) values is repeated periodically. In this manner, the system provides a method by which differentiated services can be provided to various types of traffic, the generation of output from a server or a server farm is avoided if that output cannot be delivered to end users, and revenue can be maximized when allocating bandwidth beyond the minimums.

An apparatus and method for transmitting multimedia data between wireless and wired networks. The method includes receiving frames of a first communication protocol type from a first network and converting the received frames into frames of a second communication protocol type, determining the transmission priority order of the frames that are converted into the second communication protocol type, based on packet information of the received frames, and transmitting the frames to a second network based on the determined transmission priority order. In the method, a transmission priority order is determined based on a differentiated services field codepoint (DSCP) value in a type of service (ToS) of an IP packet when converting frames of a first protocol type, which is the IEEE 802.3 protocol, into those of a second protocol type, which is IEEE 802.11 protocol, thereby securing the QoS of the transmission.

A method, performed by a fixed wireless router device, may include receiving a packet from a Long Term Evolution network, where the packet is associated with a particular Long Term Evolution Quality of Service class and mapping the particular Long Term Evolution Quality of Service class to a particular Differentiated Services Core Point Quality of Service class. The method may further include assigning a Differentiated Services Core Point Quality of Service class to the packet based on the particular Differentiated Services Core Point Quality of Service class and forwarding the packet to particular device associated with a customer premises network serviced by the fixed wireless router device, based on a priority associated with the assigned Differentiated Services Core Point Quality of Service class.