WO2009006553A1 - Procédés et appareil de fourniture et de planification de ressources dans un réseau de communication - Google Patents

Procédés et appareil de fourniture et de planification de ressources dans un réseau de communication Download PDF

Info

Publication number
WO2009006553A1
WO2009006553A1 PCT/US2008/069098 US2008069098W WO2009006553A1 WO 2009006553 A1 WO2009006553 A1 WO 2009006553A1 US 2008069098 W US2008069098 W US 2008069098W WO 2009006553 A1 WO2009006553 A1 WO 2009006553A1
Authority
WO
WIPO (PCT)
Prior art keywords
resource
service
transport
entities
transport networks
Prior art date
Application number
PCT/US2008/069098
Other languages
English (en)
Inventor
An Mei Chen
Qi Xue
Original Assignee
Qualcomm Incorporated
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US11/961,878 external-priority patent/US20090010180A1/en
Application filed by Qualcomm Incorporated filed Critical Qualcomm Incorporated
Priority to JP2010515266A priority Critical patent/JP2010532648A/ja
Priority to CN200880022993A priority patent/CN101690032A/zh
Publication of WO2009006553A1 publication Critical patent/WO2009006553A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/20—Traffic policing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
    • H04L41/5054—Automatic deployment of services triggered by the service manager, e.g. service implementation by automatic configuration of network components

Definitions

  • the present application relates generally to the operation of data networks, and more particularly, to methods and apparatus for resource provisioning and planning in a communication network.
  • the multimedia content may be distributed from the content provider to the content consumer (also known as end user) over different types of transport networks (TNs) that comprise wired and/or wireless networks.
  • TNs transport networks
  • a set of multimedia components (such as video and audio components) are offered as a whole to the end user and are referred to as a 'Service'.
  • the logical entity in a TN that provides transport to the service component is called a 'Flow'.
  • Each Service in the system may have associated Quality of Service (QoS) criteria that should be met to provide a desired quality level at a receiving device.
  • QoS Quality of Service
  • the QoS criteria are described in a service layer agreement between the content provider and the system operator. Configuring such a system to carry Services over different TNs to meet their desired QoS requirements can be very complicated, especially in transport networks where the resource is scarce and over-provisioning is not affordable, as in wireless networks.
  • a provisioning system comprising methods and apparatus, that operates to provide resource provisioning and planning in a communication system.
  • a method for resource planning in a communication network comprises generating one or more resource entities that represent resource requirements of one or more targeted services, respectively, wherein the resource entities are modeled from at least one of transport network dependent information and transport network independent information, and determining whether the one or more resource entities can be supported by one or more transport networks.
  • an apparatus is provided for resource planning in a communication network.
  • the apparatus comprises input logic configured to receive at least one of transport network dependent information and transport network independent information, and processing logic configured to generate one or more resource entities that represent resource requirements of one or more targeted services, respectively, wherein the resource entities are modeled from at least one of the transport network dependent information and the transport network independent information; and wherein said processing logic is configured to determine whether the one or more resource entities can be supported by one or more transport networks.
  • an apparatus for resource planning in a communication network comprises means for generating one or more resource entities that represent resource requirements of one or more targeted services, respectively, wherein the resource entities are modeled from at least one of transport network dependent information and transport network independent information, and means for determining whether the one or more resource entities can be supported by one or more transport networks.
  • a computer program product for resource planning in a communication network.
  • the computer program product comprises a machine- readable medium embodying a first set of codes for causing a computer to generate one or more resource entities that represent resource requirements of one or more targeted services, respectively, wherein the resource entities are modeled from at least one of transport network dependent information and transport network independent information, and a second set of codes for causing the computer to determine whether the one or more resource entities can be supported by one or more transport networks.
  • at least one integrated circuit is provided that is configured for planning in a communication network.
  • the at least one integrated circuit comprises a first module for generating one or more resource entities that represent resource requirements of one or more targeted services, respectively, wherein the resource entities are modeled from at least one of transport network dependent information and transport network independent information, and a second module for determining whether the one or more resource entities can be supported by one or more transport networks.
  • FIG. 1 shows a diagram that illustrates how information in a communication system is divided into three layers in aspects of a provisioning system;
  • FIG. 2 illustrates a workflow diagram for use in aspects of a provisioning system;
  • FIG. 3 shows an exemplary FLO protocol stack for use in aspects of a provisioning system;
  • FIG. 4 shows an exemplary slot allocation for use in aspects of a provisioning system;
  • FIG. 5 shows an exemplary method for resource planning for use in aspects of a provisioning system;
  • FIG. 6 shows a diagram that illustrates a Delivery Window and a Schedule
  • FIG. 7 shows an exemplary method for a file delivery resource scheduling algorithm for use in aspects of a provisioning system
  • FIG. 8 shows exemplary NPR logic for use in aspects of a provisioning system
  • FIG. 9 shows exemplary provisioning logic for use in aspect of a provisioning system.
  • a provisioning system operates to provide resource provisioning and planning in a communication network.
  • the system models a variety of Service content types and uses these models to determine network resources required to provide selected QoS at a receiving device.
  • the system then provides a planning result that indicates whether the desired Service content can be provisioned over a selected TN.
  • the system is especially well suited for use in wireless network environments, but may be used in any type of network environment, including but not limited to, communication networks, public networks, such as the Internet, private networks, such as virtual private networks (VPN), local area networks, wide area networks, long haul networks, or any other type of data network.
  • VPN virtual private networks
  • a 'Resource' entity is defined as a logical entity that describes network resource usage in different TNs that can be offered to an application layer Service.
  • a Resource may include one or multiple Resource Descriptors, where each descriptor describes the network resource usage for an independent media component in the Service.
  • the configuration data in a Resource Descriptor can include two types of information:
  • TN-independent information This set of data describes the QoS to be offered to the application layer Service component regardless of the underlying TNs that carry the content. Such information may include the desired bandwidth, delay, reliability, etc, for the service component.
  • TN-specific information A set of configurations that describe the protocol stack characteristics of a Flow in a TN that carries the Service component. This set of data, herein called 'Flow Profile', describes the network-specific information about how the network resource in a TN is used to carry the Service component such that the QoS requirements are met. This information may include the encoding/modulation schemes and delivery schedules offered by each specific TN.
  • a Resource Descriptor can include one set of TN-independent QoS requirements and multiple sets of the TN-specific data, one for each TN carrying the service component.
  • FIG. 1 shows a diagram 100 that illustrates how information in a communication system is divided into the following three layers in aspects of a provisioning system.
  • Service layer describes the application layer characteristics of the media content, e.g., the genre of the content (movie vs. talk show).
  • Network layer The network layer describes the configuration of the underlying physical transport networks, e.g., network infrastructure hierarchy and network link capacity, etc.
  • Resource layer The resource layer describes the network resource usage in the TNs that can be offered to the multimedia Services. Thus, the resource layer provides an abstraction between the service layer and the network layer.
  • the Resource layer provides an abstraction between the service layer and network layer in the communication system.
  • the Resource layer provides the following features:
  • the underlying network resource usage in different TNs is decoupled from the application layer content characteristics of the Service.
  • a Service can be added to or removed from any TN without impacting the service layer configurations.
  • the provisioning system provides a mechanism to plan the Resources in the TNs before offering the Resources to carry Services.
  • the capacity of the TN is verified to ensure that the configured Resources can be accommodated without network resource overbooking.
  • priorities are given to the Resources for resource allocation during planning.
  • the provisioning system provides feedbacks to a provisioning operator for adjusting the configuration of the Resources offered in the system such that the updated Resources do not exceed the network capacity.
  • a mechanism is provided for generating the delivery schedule for the Resource in the corresponding TNs, such that the QoS requirements of the Services to be carried by the Resource are met.
  • the provisioning system is able to offer the Resources to carry Services. Another aspect provides a mechanism to associate a Service to a Resource.
  • a Service can be associated with any Resource in the system, as long as the Resource can meet the QoS requirement of the Service in the target TNs.
  • a Resource can be offered to carry any Service as long as the resource configuration meets the QoS requirements of the Service. The system is ready to deliver the content of a Service after a Resource is assigned to carry the Service.
  • Another aspect provides a mechanism by which the Resource configuration, delivery schedules (either in a recurring template or absolute time), and its Service association information are delivered to the transport network components in the system. These Resource parameters are used by the transport network components to serve the Service components and to perform run-time admission control and traffic policing for the corresponding Service content.
  • the Resource delivery schedule for a Service may be sent to the end user (i.e., receiving device) in advance.
  • the user will be able to know when and how the Service content is delivered and start receiving the Service accordingly. This may be important in mobile networks where the device has limited power and/or processing capacity.
  • a RAN comprises a Forward Link Only (FLO) network or any other suitable type of network.
  • FLO Forward Link Only
  • MDS Media Distribution System
  • a RAN that is designed to economically multicast multimedia content to mobile devices.
  • An Overhead Service includes multiple data components, each at a constant bit rate.
  • a RT Service can be one of the following types: a. Real-time audio/video Service, which includes one Video component at variable bit rate and one Audio component at constant bit rate. b. Real-time audio slide-show Service, which includes one video component at constant bit rate (for example, one I-frame every 6 seconds) and one audio component at constant bit rate.
  • IP Datacast Service type.
  • An IPDS service includes one data component at constant bit rate
  • Non real-time File Delivery (FD) service type for delivery of files such as media clips.
  • a FD service includes one data component with files of different sizes, which is delivered at an available bit rate in the network.
  • the Resource entity is used in the system to provide a RAN abstraction to the MDS segment.
  • a corresponding Resource entity is modeled from TN dependent and independent information to describe the QoS requirements of the targeted Service and the corresponding RAN delivery schedules and configurations.
  • the Resource entity in the system includes the following parameters:
  • Resource ID - specifies a unique ID for the Resource in the system.
  • Resource type - specifies the type of the Resource.
  • a Resource can be one of the following types: Overhead, RT, IPDS, and FD.
  • Priority - specifies a unique priority of the Resource with regards to other Resources in the system.
  • one or more Resource Descriptors in the Resource are determined to describe the QoS requirements and RAN usage of the Flow that carries the targeted Service component.
  • the following parameters are specified for each Resource Descriptor in the Resource:
  • Resource descriptor ID - specifies a unique ID that identifies the resource descriptor in the system.
  • Flow type - specifies the type of the corresponding flow that the resource descriptor describes. The flow type for each resource descriptor is determined by the resource type.
  • QoS requirements - specifies the application layer QoS requirements of the corresponding Service component carried by the Flow. Note that some of the QoS requirements may only apply to certain types of Flows and may depend on the application layer Service type.
  • the QoS requirements comprise one or more of the following parameters. average data rate - specifies the average data rate for the Service component carried by the Flow.
  • traffic class - specifies the traffic class for the Service component carried by the Flow.
  • peak data rate - specifies the peak data rate for the Service component carried by the Flow.
  • end-to-end latency - specifies the end-to-end latency for the Service component carried by the Flow.
  • maximum burst size specifies the maximum burst size for the Service component carried by the Flow.
  • Quality metric - specifies a quality metric, such as Mean Opinion Score
  • file size specifies the maximum size of a file.
  • file delivery deadline specifies the time at which the RAN must finish the deliver of the file.
  • file delivery start time specifies the time at which the RAN can start the deliver of the file.
  • Network ID - specifies the ID of the network that carries the Resource.
  • Resource state - specifies the state of the Resource in the network (e.g., whether or not the Resource is bound to a Service that is available in the network).
  • Flow profile information specifies the flow profile that describes the RAN protocol layer characteristics of the corresponding Flow that carries the Service component.
  • the flow profile comprises one or more of the following parameters.
  • transmit mode specifies the transmit mode of the Flow.
  • outer code specifies the outer code of the Flow.
  • fragmentation flag specifies the transport layer fragmentation rules for the Flow.
  • checksum flag specifies whether the transport layer check sum is enabled for the Flow.
  • link-layer encryption flag - specifies whether link-layer encryption is enabled for the Flow.
  • IP Header Policy specifies the policy for IP header treatment for the
  • Number of delivery durations - specifies the number of delivery durations in this network for a file. The following parameters are specified for each delivery duration.
  • Delivery window start time specifies the start time of the delivery duration in the network.
  • Delivery window end time specifies the end time of the delivery duration in the network.
  • provisioning is divided into three tasks, namely: network level provision, resource level provision, and service level provision.
  • the network provision manages the RAN network infrastructure and hardware configuration.
  • the service provision provides the content provider with the interface for service oriented content configurations.
  • the resource provision facilitates the delivery of the content over the physical networks by linking the network and service together and providing network abstraction to the MDS segment.
  • Provisioning Subsystem is defined to handle provisioning related functions within the system.
  • the Provisioning Subsystem comprises the following three components.
  • CM Configuration Manager
  • RAN related provisioning including the configuration of RAN network components
  • Provisioning of the flow profile templates For example, each of them captures protocol stack characteristics for a given type of Flow supported by the RAN. Distribution of network provisioning data to other components in the network.
  • the Network Resource Planner determines the allocation of network Resources to the Services offered via the system.
  • the NRP interfaces with the CM to retrieve network related provisioning data required for Resource provisioning.
  • the NRP provides the following Resource provisioning related functions.
  • Provisioning network Resources in the RAN are Provisioning network Resources in the RAN.
  • the Service Provisioning Server is responsible for providing provisioning functions related to system services and the marketplace.
  • the SPS interfaces with the CM to retrieve network and resource related provisioning data required for Service provisioning.
  • the SPS provides the following service provisioning related functions.
  • FIG. 2 illustrates a workflow diagram 200 for use in aspects of a provisioning system.
  • the workflow diagram 200 illustrates the operation of aspects of the provisioning system to provide network provisioning, network resource provisioning, and service provisioning.
  • network resource planning (NRP) logic 202 operates to provide Resource provisioning as described herein.
  • NTP network resource planning
  • Operations associated with the workflow diagram 200 are described as follows. It should be noted that the operations described below may be performed in any suitable order. It should also be noted that although two operator blocks are shown in FIG. 2, the operator functions may be performed by one or more persons.
  • An operator provisions the RAN components that will be available in the system.
  • Network configuration information is distributed to RAN components. This network configuration information is also made available to the NRP for the configuration and planning of network Resources.
  • the operator provisions and plans network Resources at the NRP logic 202.
  • the CM makes network infrastructure configuration and planned network Resources available to the SPS for service provisioning.
  • the operator binds configured Services to planned network Resources.
  • the SPS sends information of Resource to Service bindings to the CM.
  • the CM performs the binding of the Resource and Service by generating the network logical component identifiers (e.g. flow IDs) for the transport of the service content.
  • network logical component identifiers e.g. flow IDs
  • the CM sends the Flow IDs for the Service to the SPS for inclusion into service definition System Information, which will be made available to an end user.
  • the SPS distributes the Service configuration to the MDS components, which will make the scheduling information of the Service available to the end user.
  • the CM distributes the Resource configuration and Resource to Service mapping to the RAN components.
  • the RAN components will use the Resource configuration information to performance run-time flow admission control and traffic policing.
  • any update to the service layer configuration can be made at the SPS without impacting the underlying Resource configuration.
  • the NRP will re-plan the Resources in the network and update the Resources transparent to the service layer configuration.
  • a network resource scheduling procedure is performed by the NRP logic 202 by processing a set of candidate Resources as input and outputting a set of schedulable Resources that can be accommodated together in the system.
  • the candidate resources are resource entities associated with targeted services that have been modeled from TN dependent and independent information.
  • FIG. 3 shows an exemplary method 300 for resource scheduling for use in aspects of a provisioning system.
  • the method 300 is performed by the NRP logic 202.
  • a list of candidate Resources i.e., resource entities
  • the list of candidate Resources are generated based on targeted Services to be transported in the network.
  • the list of candidate Resources is sorted in priority from high to low. For example, a candidate Resources associated with a targeted real time Service is given a higher priority than a candidate Resource associated with a targeted IP data cast service.
  • the targeted Services and their associated candidate Resources may be assigned any desired priority to determine the order in which the candidate Resources are sorted.
  • the method 300 is suitable for use with any set of candidate Resources derived from any suitable service types not limited to the service types described herein. A description of the method 300 is provided below and the following definitions apply.
  • L IN list of candidate Resources provided as input and sorted by their assigned priorities from high to low.
  • N total number of candidate Resources in L IN .
  • the method starts with an empty list of schedulable Resources (LQ U T) and index J set to "1."
  • the list of candidate Resources (L IN ) are processed one by one based on their priorities from high to low. For example, a candidate Resource on top of the input Resources list (LI N ) is added to the schedulable list (L OU T).
  • a determination is made as to whether the Resources in the updated L OUT list can be scheduled together for every network that carries the candidate Resource. If a candidate Resource can not be scheduled, the method proceeds to block 308 where the candidate Resource is removed from the schedulable list (L OUT ).
  • the NRP logic 202 notifies the operator regarding candidate Resources that are not schedulable and provides the reasons for the failures.
  • the method 300 continues at block 312 until all candidate Resources in the list (L IN ) have been tested for inclusion in the schedulable list (L OUT )-
  • L OUT comprises a list of schedulable Resources.
  • the method 300 is performed for candidate resources derived from targeted RT services, IPDS services, and FD services.
  • the method 300 is suitable for use with other candidate resources derived from other types of services.
  • the criteria used for successful scheduling of L O u ⁇ at block 306 may be different for different resource types. A description of the algorithms used for each resource type is provided in the following sections.
  • the method 300 operates to determine the schedulable list of resources L OUT -
  • a scheduling procedure is performed to determine whether the Resources in the L OUT list can be scheduled together for each network.
  • B j the application layer data rate for MLC j.
  • B ⁇ ' the total application layer data rate of resource type Y in network i, where Y can be Overhead (O), RT, IPDS, and FD
  • D ⁇ ' the total physical layer data rate of resource type Y in network i
  • sp j the number of slots per PLP for MLC j.
  • S y ' the physical layer OFDM data symbols per frame used by resource type Y in network i. e ⁇ : the efficiency of slot allocation for resource type Y, which equals the ratio between the number of data slots per frame for resource type Y and the number of slots in S ⁇ ' .
  • FIG. 4 shows an exemplary FLO protocol stack 400 for use in aspects of a provisioning system.
  • the resource definitions describe the QoS requirement (e.g., data rate) at the application layer for each service component.
  • each service component is carried in an individual flow.
  • One or more flows are carried by a Media Logical Channel (MLC) in the FLO RAN. While being transmitted over the FLO air interface, the following FLO protocol stack overhead is added to the flow.
  • MLC Media Logical Channel
  • application layer 402 data traffic B ⁇ belonging to a flow is broken into multiple 121 bytes (968 bits) fragments at the transport layer.
  • a one-byte Framing Header (FH) is added to each fragment to form a 122 byte stream layer block. If necessary, padding is added to the last block to make each block exactly 122 bytes.
  • FH Framing Header
  • a stream layer carries each flow in a stream and multiplexes up to three flows into one MLC.
  • the flows multiplexed in an MLC carry the components of the same service.
  • the stream 0 packet contains the stream layer trailer and an empty field that accommodates MAC capsule trailer.
  • the size of stream 0 data is assumed to be only one MAC packet.
  • MAC Medium Access Control
  • MAC Protocol capsule The content of an MLC in a transmission frame is encapsulated in an entity referred to as MAC Protocol capsule.
  • MAC Protocol capsule is carried in MAC layer packets.
  • the MAC capsule trailer is added to the stream 0 packet in the base component of the steam. If the stream layer packets have an enhanced component, the MAC layer will add a dummy enhanced packet for stream 0. As shown in equation (1) below, / equals 1 for non-layered transmit mode and equals 2 for layered transmit mode.
  • the Reed-Soloman (RS) [16, k, 16-k] encoding is applied to the packets to generate error control blocks, with 16 MAC code packets per code block. Padding packets may be added to MAC data packets such that the total number of MAC data packets is integer multiples of k.
  • physical layer 404 adds a 24 bit header to each
  • the MAC layer packet and forms a Physical Layer Packet (PLP) of 1000 bits.
  • PLP Physical Layer Packet
  • FIG. 5 shows an exemplary slot allocation 500 for use in aspects of a provisioning system.
  • the physical layer packets (PLP) in the FLO RAN are carried in data slots and OFDM data symbols.
  • the OFDM data symbols in a FLO super-frame are divided into four equal portions called frames.
  • the capacity of a network is given as the total number of data symbols per frame.
  • the PLPs of a MLC are scheduled in unit of RS blocks per super-frame and the PLPs in each RS block are distributed evenly in the four frames.
  • the sub-carriers of each OFDM symbol are divided into seven slots.
  • the FLO RAN offers a diverse set of transmit modes for data delivery. To meet the quality of service requirements for different types of media content, different MLCs are delivered over the FLO RAN using different transmit modes.
  • the number of data slots needed to carry one PLP may be different for the different transmit modes. Therefore, for a 6MHz frequency band, the maximum physical layer raw data rate per super-frame varies from 1.68Mb/s to 11.2Mb/s for different transmit modes.
  • the total number of data slots per super-frame for type Y resources in network i can be given as a function of the physical layer data rate per MLC D ⁇ (bits per second) and expressed as follows;
  • MLCs that belong to different resource types are scheduled in non-overlapping symbols.
  • Such an example is illustrated in FIG. 5 where FD resources, IPDS resources and Overhead resource are collectively called "Other than Real Time” (ORT) resources.
  • ORT Real Time
  • the number of data symbols per frame for type Y resources in network i can be given as a function of the total number of slots per super-frame Slot ⁇ ' and expressed as;
  • a turbo decoder at a receiving device limits the number of turbo packets that can be decoded in a single OFDM symbol. This imposes a constraint on the maximum slot height an MLC allocation of a given transmit mode can take.
  • the ORT resources are arranged in the frame based on their maximum slot height such that no two ORT resources have turbo packet conflicts. It is assumed that the slot height used for all MLCs in a resource type is the same.
  • the slot allocation efficiency is provided to the NRP logic 202 as a FLO network specific data.
  • the flows in an Overhead resource are sent at constant data rate to the transport layer.
  • a summary for an Overhead Resource scheduling algorithm is as follows.
  • Input Overhead resource to be scheduled.
  • Output The physical data rate (D' o ) required by the Overhead resource, and the number of OFDM data symbols per frame (SO) required by the Overhead resource.
  • Algorithm Calculate the total physical layer data rate (D' o ) for the Overhead resource based on the application layer data rate and protocol overhead according to equation (1).
  • the RT resources can be divided into RT Audio/Slide resources and RT Audio/Video resources based on their sub-types.
  • a RT Audio/Slide resource comprises an audio flow and a slide flow that are carried by different MLCs.
  • a RT Audio/Video resource comprises an audio flow and a video flow that are carried by different MLCs.
  • the required application layer data rate (B 1 ) is a constant value representing the average data rate of the flow as described in the resource configuration.
  • B 1 is a random variable for a video flow. Based on their data rate characteristics, the video flows are classified into different traffic classes. For each traffic class j, the following QoS requirements apply.
  • RT resource planning is done at the NRP logic 202 based on a target maximum re-encode probability per super- frame, as specified by a REENCODE PROB parameter.
  • B v max can be calculated by the inverse of the normal distribution function.
  • I y can be calculated base on the transmit mode of video flows
  • l ⁇ ⁇ and l s ⁇ can be calculated base on the transmit mode of each audio or slide MLC
  • VIDEO FDS O VHD is the protocol stack overhead for video flows calculated according to video transmit mode and equation (1).
  • the IPDS resource uses the UDP/IP protocol to carry the application layer content on top of the FLO transport layer.
  • Each IPDS resource includes an IPDS flow whose average data rate input to the FLO transport layer ( B ⁇ ) is given in the resource configuration.
  • IPDS resources (Slot I ' PDC ) can be expressed as:
  • n is the total number of IPDS resources in network i
  • D IPDS ⁇ can be calculated for each flowy according to equation (1) and B ⁇
  • l IPDS ⁇ can be calculated based on the transmit mode of the IPDS flows.
  • IPDS resources to be scheduled 1. IPDS resources to be scheduled.
  • the system operates to determine if TN capacity is available for all Overhead, RT and IPDS Resources in L OUT - TO ensure that there is enough capacity in network i to offer all the Overhead, RT and IPDS Resources, the following condition must be met.
  • the FD resource planning occurs in accordance with FIG. 3 and is described below.
  • a message coding scheme is applied to the presentation content.
  • An FD presentation is broken into k data packets of equal size to generate n code packets with the same size.
  • the code packets are broadcasted over the RAN to the clients.
  • a client is able to decode the presentation if at least (1+Epsilon)*k code packets are successfully received by the device.
  • each presentation is delivered repetitively FD_NUM_INSTANCE times.
  • Each presentation repetition instance is encoded and delivered independently and the minimum gap between the delivery start times of any two instances for the same presentation is FD MIN GAP.
  • Delivery Window is the scheduled duration in which a presentation instance is delivered to the device. For each presentation instance, due to the use of message coding scheme, the content delivery can be divided into two steps from the device perspective: content collection and content decoding.
  • FIG. 6 shows a diagram 600 that illustrates a Delivery Window (DW) for use in aspects of a provisioning system that comprises the following components.
  • DW Delivery Window
  • Broadcast Window the duration where the code packets of the presentation instance are broadcasted over the air.
  • Decoding Duration the duration, after the broadcast window end time, for the device to successful decoding of the presentation instance.
  • FIG. 6 shows a diagram 602 that illustrates a Schedule Window for the first instance of a presentation for use in aspects of a provisioning system.
  • the Schedule Window (SW) specifies the interval during which a presentation instance is available for delivery. For any presentation instance, the Delivery Window must be a subset of the Schedule Window.
  • the Schedule Window for a presentation instance is calculated as follows.
  • the Schedule Window start time for the first instance of presentation j is given by T F ; + FD_BETA where T F ⁇ is the fetch time for presentation j, and
  • FD BETA is the duration between the presentation fetch time and fetch deadline. For time earlier than T F ⁇ + FD BET A the presentation instance can not be sent since the presentation content is not available in the system. 2.
  • the Schedule Window start time for the (k+1) instance of presentation j is given by the Delivery Window start time of the k ⁇ instance of presentation j plus FD MIN G AP. For time earlier than that, the presentation instance can not be sent without violating the FD MIN GAP constraint. Therefore, unless the k ⁇ instance of presentation j is scheduled, the (k+1) instance of the presentation does not have a Schedule Window start time and therefore can not be scheduled for delivery yet.
  • the Schedule Window end time for the k ⁇ instance of presentation j is given by ⁇ r 7 -(FD_NUM_INSTANCE-£) *FD_MIN_GAP where T v J is the viewing time of presentation j. For time later than that, the presentation instance can not be sent. Otherwise the last instance of the presentation can not be delivered to the device before the presentation viewing time without violating the FD MIN GAP constraint.
  • FD Resources are intended for carrying delay tolerate non-real-time content.
  • the FD Resources are scheduled in a network with the leftover capacity of the schedulable Overhead Resource, RT resources and IPDS Resources. Therefore, the average available OFDM symbols per frame for FD resources can be given as:
  • FD FDS O VHD is the FLO protocol stack overhead for FD resources. Note that it is assumed the transmit modes of all the FD resources are the same.
  • B F ' D MAX FD AVE RATE. If B F ' D ⁇ MIN FD AVE RATE Scheduling fails.
  • the FD planning algorithm provided by the NRP logic 202 outputs the list of FD resources that can be scheduled in the system. For each presentation in a schedulable FD resource, the NRP logic 202 generates one Delivery Window per presentation instance in each network that carries the FD resource with the following constraints:
  • the Delivery Windows may not overlap with each other.
  • the server may deliver one presentation instance at a time for the following reasons: First, the overall file writing speed at the device decreases as the number of simultaneous file writing processes increases.
  • the client may not support presentation collection and decoding at the same time.
  • the FD presentation scheduling problem becomes the problem of non-preemptive scheduling for N presentations, with FD_NUM_INSTANCE interdependent instances for each presentation.
  • non-preemptive scheduling for dependent tasks is a NP-hard problem.
  • the Schedule Window for the (k+1) instance may only be calculated after the k ⁇ instance is scheduled.
  • each presentation may have only one instance eligible for scheduling at any time. Therefore, the task of planning N presentations with FD_NUM_INSTANCE instances per presentation can be reduced to the recursive sub-tasks of scheduling the currently eligible instance from each of the N presentations, where instances of different presentations are independent.
  • the NRP logic 202 schedules the presentation instances based on a non-preemptive earliest deadline first heuristic.
  • FIG. 7 shows an exemplary method 700 for an FD resource planning algorithm for use in aspects of a provisioning system. For clarity and understanding of the method 700, the following definitions are provided.
  • BWSTj k BW start time for the k ⁇ instance of presentation j
  • PRN SIZEj size of the presentation j
  • Epsilonj epsilon parameter for presentation j
  • DDj Decoding Duration for presentation j T: schedule time
  • the NRP logic 202 maintains a "schedule time" that indicates the time when the Delivery Window of a presentation instance can be scheduled. Based on the
  • NRP decides which presentation instances are "available" for schedule at the current schedule time. As shown in FIG. 7, the NRP logic 202 schedules the available presentation instances of the FD resources based on a non-preemptive earliest Schedule Window end time first heuristic as described below.
  • the NRP logic 202 puts the presentations of all the FD resources in a list L and calculates the Schedule Window for the first instance of each presentation. Initially, NRP logic 202 sets schedule time to 0.
  • the NRP logic 202 advances the schedule time to the earliest
  • the NRP logic 202 finds the available presentation instance
  • the NRP logic 202 sets the Delivery Window start time of the k th instance of presentation j to the schedule time.
  • the NRP logic 202 calculates the Delivery Window end time for the k ⁇ instance of presentation j.
  • the Contact Window start time, Contact Window end time, and Contact Duration are calculated for the presentation instance.
  • the method 700 proceeds to block 712 where the Delivery Window start time is advanced to the latest end time of the overlapped Delivery Windows and the method 700 then proceeds to repeat the operations at block 708.
  • the NRP logic 202 sets the presentation instance to available. [00108] At block 716, a determination is made as to whether the calculated Delivery
  • the NRP logic 202 sets the Schedule Window start time for the
  • the NRP logic 202 makes a determination as to whether there are available presentation instances in the list L. If there are available presentation instances at the current schedule time, NRP logic repeats the operations at block 706.
  • NRP logic proceeds to block 704.
  • the schedule time of the NRP logic 202 and the system time in the resource definition are specified based on a one-week period template for the UTC time zone (GMT), with the start-of-the-week on Sunday 12:00AM as 0 second, and an end- of-the-week on Saturday 11 :59:59PM as 604799 seconds.
  • the NRP logic 202 operates to wrap around the time values at the end of the week using a modulo operation.
  • FIG. 8 shows a diagram of NPR logic 800 for use in aspects of a provisioning system.
  • the NPR logic 800 is suitable for use as the NPR 202 shown in FIG. 2.
  • the NPR logic 800 comprises input logic 802, processing logic 804, and output logic 806 all coupled to a data bus 808.
  • the input logic 802 comprises at least one of a CPU, integrated circuit, processor, gate array, hardware logic, memory elements, and/or a combination of hardware and software.
  • the input logic 802 is configured to receive input from an operator and a configuration manager (CM).
  • CM configuration manager
  • the input from the operator comprises any desired information about targeted services to be distributed over one or more TNs, which may include average data rate and standard deviation associated with selected service components.
  • the input from the CM comprises any desired TN dependent and independent information as described above.
  • the processing logic 804 comprises at least one of a CPU, an integrated circuit, processor, gate array, hardware logic, memory elements, and/or hardware executing software.
  • the processing logic 804 is configured to perform the modeling procedures and algorithms described above to provision and plan for targeted services to be distributed over one or more TNs. Once the provisioning and planning for the distribution of the targeted services is determined, the processing logic 804 operates to generate a service association that assigns the resource entities to carry the targeted services in the transport networks. The processing logic 804 then operates to distribute the resource configurations and the service associations to the TNs and/or one or more receiving devices.
  • the processing logic 804 controls the output logic 806 to output the resource configurations and the service associations.
  • the output logic 806 comprises at least one of a CPU, an integrated circuit, processor, gate array, hardware logic, memory elements, and/or a combination of hardware and software.
  • the output logic 806 is configured to output a network provisioning result.
  • the output logic 806 outputs a provisioning result that indicates whether provisioning was successful.
  • the provisioning system comprises one or more program instructions (“instructions”) or sets of codes (“codes”) embodied on a machine-readable medium, which when executed by a computer or at least one processor or an integrated circuit, for instance, a processor at the processing logic 804, provides the functions described herein.
  • the codes may be loaded into the NRP logic 800 from a machine-readable medium, such as a floppy disk, CDROM, memory card, FLASH memory device, RAM, ROM, or any other type of memory device or machine-readable medium that interfaces to the NRP logic 800.
  • the codes may be downloaded into the NRP logic 800 from an external device or network resource. The codes, when executed by a processor, provide aspects of a provisioning system as described herein.
  • FIG. 9 shows exemplary provisioning logic 900 for use in aspect of a provisioning system.
  • the provisioning logic 900 is implemented by at least one processor or integrated circuit comprising one or more modules configured to provide aspects of a provisioning system as described herein.
  • each module comprises hardware, and/or hardware executing software to provide aspects of the provisioning system.
  • the provisioning logic 900 comprises a first module that comprises means 902 for means for generating one or more resource entities that represent resource requirements of one or more targeted services, respectively, wherein the resource entities are modeled from at least one of transport network dependent information and transport network independent information.
  • the means 902 comprises the processing logic 804.
  • the provisioning logic 900 comprises a second module that comprises means 904 for means for determining whether the one or more resource entities can be supported by one or more transport networks.
  • the means 904 comprises the processing logic 804.
  • DSP digital signal processor
  • ASIC application specific integrated circuit
  • FPGA field programmable gate array
  • a general-purpose processor may be a microprocessor, but, in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine.
  • a processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
  • a software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
  • An exemplary storage medium is coupled to the processor, such that the processor can read information from, and write information to, the storage medium.
  • the storage medium may be integral to the processor.
  • the processor and the storage medium may reside in an ASIC.
  • the ASIC may reside in a user terminal.
  • the processor and the storage medium may reside as discrete components in a user terminal.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne des procédés et un appareil de fourniture et de planification de ressources dans un réseau de communication. Dans un aspect, un procédé consiste à générer des entités de ressources qui représentent des exigences de ressource de services ciblés, les entités de ressources étant modélisées à partir d'informations dépendantes du réseau de transport (TN) et/ou d'informations indépendantes du réseau de transport, et à déterminer si les entités de ressources peuvent être prises en charge par un ou plusieurs réseaux de transport. Un appareil comprend une logique d'entrée pour recevoir des informations dépendantes du réseau de transport et/ou des informations indépendantes du réseau de transport, et une logique de traitement pour générer des entités de ressource qui représentent des exigences de ressources de services ciblés, les entités de ressource étant modélisées à partir d'informations dépendantes du réseau de transport et/ou d'informations indépendantes du réseau de transport, et pour déterminer si les entités de ressources peuvent être prises en charge par un ou plusieurs réseaux de transport.
PCT/US2008/069098 2007-07-03 2008-07-02 Procédés et appareil de fourniture et de planification de ressources dans un réseau de communication WO2009006553A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2010515266A JP2010532648A (ja) 2007-07-03 2008-07-02 通信ネットワークでのリソースプロビジョニングおよびプランニングのための方法および装置
CN200880022993A CN101690032A (zh) 2007-07-03 2008-07-02 用于通信网络中的资源供应和规划的方法和设备

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US94771607P 2007-07-03 2007-07-03
US60/947,716 2007-07-03
US11/961,878 US20090010180A1 (en) 2007-07-03 2007-12-20 Methods and apparatus for resource provisioning and planning in a communication network
US11/961,878 2007-12-20

Publications (1)

Publication Number Publication Date
WO2009006553A1 true WO2009006553A1 (fr) 2009-01-08

Family

ID=40221342

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2008/069098 WO2009006553A1 (fr) 2007-07-03 2008-07-02 Procédés et appareil de fourniture et de planification de ressources dans un réseau de communication

Country Status (1)

Country Link
WO (1) WO2009006553A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102326421A (zh) * 2009-04-29 2012-01-18 上海贝尔股份有限公司 在mbsfn中对mbms服务进行复用的方法、bm-sc和基站

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000033204A1 (fr) * 1998-12-03 2000-06-08 Nortel Networks Corporation Prestation de politiques de services desirees aux abonnes accedant a l'internet
US20030101246A1 (en) * 2001-11-29 2003-05-29 Nokia Corporation System and method for identifying and accessing network services
EP1708525A1 (fr) * 2005-03-31 2006-10-04 Research In Motion Limited Profil d'itinérance pour dispositifs sans fil

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000033204A1 (fr) * 1998-12-03 2000-06-08 Nortel Networks Corporation Prestation de politiques de services desirees aux abonnes accedant a l'internet
US20030101246A1 (en) * 2001-11-29 2003-05-29 Nokia Corporation System and method for identifying and accessing network services
EP1708525A1 (fr) * 2005-03-31 2006-10-04 Research In Motion Limited Profil d'itinérance pour dispositifs sans fil

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102326421A (zh) * 2009-04-29 2012-01-18 上海贝尔股份有限公司 在mbsfn中对mbms服务进行复用的方法、bm-sc和基站
JP2012525733A (ja) * 2009-04-29 2012-10-22 アルカテル−ルーセント Ｍｂｓｆｎ内のｍｂｍｓサービスを多重化する方法、ｂｍ−ｓｃ、および基地局
US8942154B2 (en) 2009-04-29 2015-01-27 Alcatel Lucent Method, BM-SC and base station for multiplexing MBMS services in MBSFN
KR101499492B1 (ko) * 2009-04-29 2015-03-06 알까뗄 루슨트 Ｍｂｓｆｎ에서 ｍｂｍｓ 서비스들을 멀티플렉싱하기 위한 방법, ｂｍ－ｓｃ, 및 기지국

Similar Documents

Publication Publication Date Title
KR101560115B1 (ko) 멀티플렉싱 및 대역폭 제어 기능을 갖는 신뢰가능한 이벤트 브로드캐스터
TWI413388B (zh) 於網路環境中提供計算負載分配之方法及裝置
CN102833685B (zh) 用于数据通信的方法和设备以及数据分发设备
Wu et al. Energy-minimized multipath video transport to mobile devices in heterogeneous wireless networks
US20090010180A1 (en) Methods and apparatus for resource provisioning and planning in a communication network
US20180098132A1 (en) Terrestrial broadcast market exchange network platform and broadcast augmentation channels for hybrid broadcasting in the internet age
US9185004B2 (en) Quality of service for distribution of content to network devices
CN105392068B (zh) 分布式多传输信道网络直播视频并行分发方法及系统
US8694016B2 (en) Methods and apparatus for use of data object popularity measurements for improved quality of service perception in wireless broadcast systems
US11363467B2 (en) Enabling efficient deterministic virtualized broadcast spectrum sharing and usage validation
BRPI0208496B1 (pt) Método e equipamento para transporte de dados em um sistema de comunicação sem fio
CN104782133A (zh) 用于媒体数据递送控制的方法和装置
JP2008546229A (ja) ネットワーク伝送のためコンテンツをパケット化する方法および装置
US20180103453A1 (en) Scheduling of Software Package Transmissions on a Multimedia Broadcast Multicast Service Channel
CN101491009A (zh) 用于在网络环境中提供测量报告的方法和装置
KR20080088704A (ko) 광대역 무선접속 시스템에서 멀티캐스트 및 브로드캐스트서비스를 위한 장치 및 방법
Hefeeda et al. On burst transmission scheduling in mobile TV broadcast networks
Tropea et al. Two step based QoS scheduler for DVB-S2 satellite system
WO2009006553A1 (fr) Procédés et appareil de fourniture et de planification de ressources dans un réseau de communication
US20230057487A1 (en) Data packet format to communicate across different networks
US20090185562A1 (en) Methods and apparatus for an efficient multicast file distribution system
Fraile et al. Evaluation of background push content download services to mobile devices over DVB networks
Yetgi et al. Efficient progressive downloading over multimedia broadcast multicast service
Noh et al. Energy-efficient HTTP Adaptive Streaming System over SDN-enabled Wi-Fi APs
Kang et al. Dynamic packet scheduling for cdma2000 1/spl times/EV-DO broadcast and multicast services

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200880022993.5

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08781305

Country of ref document: EP

Kind code of ref document: A1

DPE2 Request for preliminary examination filed before expiration of 19th month from priority date (pct application filed from 20040101)
DPE2 Request for preliminary examination filed before expiration of 19th month from priority date (pct application filed from 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2361/MUMNP/2009

Country of ref document: IN

WWE Wipo information: entry into national phase

Ref document number: 2010515266

Country of ref document: JP

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 20107002522

Country of ref document: KR

Kind code of ref document: A

122 Ep: pct application non-entry in european phase

Ref document number: 08781305

Country of ref document: EP

Kind code of ref document: A1