[go: up one dir, main page]

WO2016150511A1 - Dispositif et procédé d'allocation de ressources de communication dans un système employant le découpage de réseau en tranches - Google Patents

Dispositif et procédé d'allocation de ressources de communication dans un système employant le découpage de réseau en tranches Download PDF

Info

Publication number
WO2016150511A1
WO2016150511A1 PCT/EP2015/056519 EP2015056519W WO2016150511A1 WO 2016150511 A1 WO2016150511 A1 WO 2016150511A1 EP 2015056519 W EP2015056519 W EP 2015056519W WO 2016150511 A1 WO2016150511 A1 WO 2016150511A1
Authority
WO
WIPO (PCT)
Prior art keywords
request
communication resources
resources
slice
network
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/EP2015/056519
Other languages
English (en)
Inventor
Amine Mohamed Houyou
Andreas Fischer
Waseem MANDARAWI
Hermann De Meer
Hans-Peter Huth
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Siemens Corp
Original Assignee
Siemens AG
Siemens Corp
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
Application filed by Siemens AG, Siemens Corp filed Critical Siemens AG
Priority to PCT/EP2015/056519 priority Critical patent/WO2016150511A1/fr
Publication of WO2016150511A1 publication Critical patent/WO2016150511A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/02—Selection of wireless resources by user or terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18—Negotiating wireless communication parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/563—Allocation or scheduling criteria for wireless resources based on priority criteria of the wireless resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/18—Processing of user or subscriber data, e.g. subscribed services, user preferences or user profiles; Transfer of user or subscriber data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies

Definitions

  • the invention relates to a device and a method for allocating communication resources of communication network to a plurality of applications.
  • safety-critical, deter ⁇ ministic and real-time applications e.g. the control of a conveyer belt for transporting a work piece, share the same communication network with other non real-time-critical applications .
  • cur ⁇ rent network technology for automation systems rely mostly on over-dimensioning and a detailed engineering and planning of network resources.
  • the invention relates to a device for allocating communica ⁇ tion resources, e.g. bandwidth, available in a real or physi ⁇ cal or substrate communication network to a plurality, i.e. two or more, of applications.
  • Each application has a require- ment for a set of communication resources, e.g. a certain ar ⁇ rangement of minimum/maximum bandwidth.
  • the device comprises, i.e. has an integrated or is connectable to, an interface for receiving at least a first request for a set of communication resources.
  • an interface information for allocating commu- nication resources to the at least one request is generated taking into consideration a rank assigned to the request can be transmitted. This allows assigning resources to an appli ⁇ cation, such that the demands are satisfied, in particular taking into account a certain needed priority associated with the assigned rank.
  • the device further comprises a processing unit which forms part of the device or is connectable to the de ⁇ vice which is arranged such that the request is categorized in at least two ranks.
  • Information for allocating communica ⁇ tion resources to the at least one request is generated tak ⁇ ing into consideration the rank.
  • the physical set-up of the communication network is known to the device. This al ⁇ lows the mapping of the requested set of communication re ⁇ sources or slice on the physical network.
  • the request for a set of communication resources or slice request comprises an overlay link or description of a connection between a source node and destination node, which requires a subset, i.e. all or less, of the required resources.
  • Splitting the request in ⁇ to its details allows for easier implementation on the physi- cal communication network.
  • the generated information specifies at least one physical path for an over- lay link.
  • one or more requests are re ⁇ ceived at the device at the same time or one after the other or/and not correlated to each other.
  • the allocation of re ⁇ sources according to the requests is adapted due to the re- spective ranks of the individual requests. This allows e.g. in the case of simultaneous requests, to embed the request first, which has the highest rank, e.g. is the most important one.
  • an order may be indicated in the generated information.
  • the rank or priority parameter may be determined by considering a type of the ap ⁇ plication or/and a required degree of reliability of the transmission for the application or/and a degree of importance of the application.
  • the type of appli ⁇ cation may be mandatory and the degrees of reliability or/and importance may be optional.
  • the request for the set of network resources specifies a minimum bandwidth or/and a max ⁇ imum bandwidth or/and an average bandwidth or/and a maximum allowed delay or/and a maximum allowed jitter or/and a re ⁇ quired security of the application.
  • the device is formed by a controller. In particular the functions of the controller may be distributed across several entities or localities in the network .
  • the invention further relates to a corresponding method and a computer program.
  • Fig. 1 An overlay network with full mesh connectivity
  • Fig. 2 A publish-subscribe overlay with the logical rendez ⁇ vous points depicting subscription relationships;
  • Fig. 3 An overlay link between two nodes
  • Fig. 4 A flow diagram of implementing slices on a physical or substrate network.
  • the embodiments below refer to of how to associate the right portion of network resources to each slice, and how to opti ⁇ mize the embedding of as many slices as possible while ac ⁇ counting for the finiteness of network resources.
  • Network slices should -as far as possible in regard to the constraints implied e.g. by other applications or the physi ⁇ cal substrate network- consider as many application requirements as possible, while making sure that the most critical application flows are protected, guaranteed and best treated in the network.
  • embodiments are described, which offer an autonomic slice con ⁇ figuration mechanism capable of embedding slices into the network.
  • Each virtual network can be dimensioned in terms of network resources, such as bandwidth, and behavior to best match the requirements of the application.
  • the shared physi ⁇ cal network, where the virtual network or slice is deployed or embedded has to fulfill the requirements of several in ⁇ stances of such virtual networks simultaneously, as a plural- ity, i.e. two or more applications are running.
  • the virtual network deployment or embedding is controlled by a centralized instance or controller that is able to allocate managed physical resources among multiple instances of virtu- al networks.
  • the control ⁇ ler has to define a strategy of allocating resources, network paths among multiple instances of virtual networks. For doing so, the requirements of applications have to be in ⁇ terpreted, which can be then automatically mapped to the real or physical network resources.
  • This mapping or embedding has to calculate the ideal route or path mapping each connection of the application, while fulfilling other requirements and demands described by a slice request.
  • the other optimization goal of the mapping or embedding procedure has to be the ability to fulfill as many slice requests as possible and therefore populate the real network with as many slices as possible while being able to prioritize and differentiate be ⁇ tween slices and their respective resources.
  • Such an admission control is adapted to suit the needs for automation systems allowing many applications to coexist in the same physical network (e.g. factory automation processes, SCADA (supervisory control and data acquisition) and maintenance applications, logistics and enterprise data collectors, etc.) .
  • the expected correct behavior of the whole communica- tion system should be guaranteed by the admission mechanism.
  • the network can reduce the effect of the bursts by classifying traffic and using some scheduling mechanism to prioritize traffic in network nodes.
  • a reservation mechanism combines priorities and special real-time schedulers in order to treat marked traffic according to the class it belongs to.
  • the treatment of the traffic can approach the required behavior as much as possible, despite the varia ⁇ tions imposed by cross traffic which can lead to congestions, jitter, etc.
  • Such effects of packet-based networks are hard to control without some limiting of the cross traffic or mak ⁇ ing sure of having some time-division access control sched- ulers everywhere.
  • Examples of such requirements are related to a single appli ⁇ cation flow, such as reliability, quality of service, securi ⁇ ty, etc.
  • Other examples of requirements can affect the whole network as such and result from the desired system behavior as a whole: Such examples are, protecting all production sys ⁇ tems against failures or interruptions, prohibiting eaves ⁇ dropping and protecting against denial of service, energy ef ⁇ ficient use of network infrastructure, avoiding of over- dimensioning of the network.
  • Networking requirements of an application instance may be described according to the overlay connecting its hosting application end-points.
  • Such an overlay is then seen as a separate net ⁇ work, whose qualities and behavior could be summarized in what is called here a slice request.
  • a slice request defines the kind of overlay network describing the interactions of the application and the qualities and different attributes this network has to fulfill.
  • an over ⁇ lay graph is defined in the slice request, where each link between two overlay nodes is described or, in other words, an overlay link between a source node and a destination node, is defined in the slice request. Not all nodes need to be con ⁇ nected with each other, leading to a variation of overlay graphs which describe the way the application interacts with its end-points.
  • an overlay link is between two end-nodes
  • a physical link is between two physical nodes, including end- nodes and intermediate networking nodes.
  • Mapping an overlay link to a physical network means in particular selecting one or k-paths between the end-nodes.
  • a path is in particular a concatenation of several links and intermediate nodes that all fulfill the overlay link resource demands .
  • serv- ers have a single overlay link to each client, while clients do not require an overlay link to each server.
  • each node N has one overlay link, depicted as a solid line, to each other node part of the slice, which is also called full mesh connectivity.
  • connectivity between a group or subset of the nodes N forming overlay end-points to some imaginary middle points MP is es ⁇ tablished.
  • This kind of topology would apply to applications relying on publish/subscribe interactions, for example, where each end-point is both publisher and subscriber at the same time.
  • the imaginary middle points MP symbolize the subscrip- tion between these end-points, which could be deployed in the network as a message bus or multicast group.
  • an event is published by an node N and sent to a middle point MP, which again distributes it so a set of further nodes, thus acts as a broker.
  • a message bus is understood as a logical component to connect different applications and specializes in transporting mes ⁇ sages between applications.
  • a multicast group is understood as a group where there is a message transfer between a point to a group.
  • an overlay definition just defines a single overlay link be ⁇ tween two end-nodes N, a source node and a destination node.
  • slice classes In terms of resource requirements, the slice request or re ⁇ quest for a separate network with defined qualities and be- havior could be classified as a whole without distinguishing the requirements of each single overlay link.
  • Class #1 'Available Resource Service' (ARS)
  • the ARS slice class offers no guarantees and will use whatev ⁇ er bandwidth is available. It mimics the behaviour of stand ⁇ ard non-QoS Ethernet. In particular this means that the full physical bandwidth may be used as far as it is not allocated for other slices. There are no user definable parameters and no traffic specification is needed. Therefore no space is provided in the relevant request.
  • the slice request includes only a list of slice members.
  • a system administrator may decide to ensure a minimum of 500 Kbps and a maximum of 1 Mbps per ARS slice.
  • Such policies will affect the network resources that can be assigned to other classes on the respective paths .
  • the ARS type of service is limited to the slice participants and spans the underlying substrate network to connect each slice member (end point of this slice) .
  • As one important predefined instance of the ARS slice class is the 'Configuration Slice'. Though having limited network bandwidth, it offers a gradual connectivity to management points within the network, made available through a boot se ⁇ quence. Within this slice, spanning tree protocol could be used to guarantee loop-free communication.
  • Class #2 'Controlled Service' (CS)
  • the CS slice class allows the specification of QoS, reliabil ⁇ ity, and security requirements on the slice or virtual net- work, such as upper and lower bounds for the bandwidth available to a single end point.
  • the upper boundary is checked by a controller or and - if validated - packets are dropped or delayed.
  • the lower bound shall be guaranteed under all circumstances. Both bandwidth specifications are defined as averages over a certain time window which is to be defined; consequently single packets will use physical wire speed.
  • Another user definable parameter is a 'High Importance' flag that, if set, will make this slice highly resilient.
  • Class #3_DELAY 'Minimum Delay Service' (MDS)
  • the MDS slice class allows the mapping of hard real time re- quirements to a slice. It is essentially a Controlled Service plus guaranteed maximum delay and jitter.
  • slice definition attributes and their plicability for the above introduced classes are described These can be extracted from the service descriptions:
  • the over ⁇ lay network consists of links
  • the over ⁇ lay network graph can be
  • width overlay is according to one
  • each over ⁇ lay link has to fulfill a bi ⁇ directional minBW.
  • the slice request could also define minBW per overlay link separately.
  • the minBW is a value origi ⁇ nates from the knowledge of the application traffic re ⁇ quirements.
  • the following ap ⁇ plication characteristics are distinguished :
  • a cyclic controller commu ⁇ nication defines code words per cycle time.
  • the minBW is defined according to the number of periphery devices communicating in cyclic manner with the controller.
  • width slice request does not indi ⁇ per cate any bandwidth upper
  • Non- High reliability lit ⁇ speci ⁇ tle packet loss tolerated at
  • Non-Specified does not ex ⁇ pect any additional measures
  • Imporlist is not limited and can - tance be extended by the user or
  • control system load for example .
  • Bandwidth is the resource which is managed in the slice sys ⁇ tem. All other timeliness or real-time behaviour is all linked to how much bandwidth is allocated to a certain flow and with which guarantee.
  • the bandwidth guarantee has to be ensured along every single portion of the substrate network (i.e. each link and hop) . Otherwise, the link that does not reach the required bandwidth is called a bottleneck and can cause delays.
  • the overlay embedding procedure is a search for shortest path routes that fulfil the same end-to-end band- width demand per overlay link.
  • the slice manager keeps an overview of the topology and the resources and characteristics of the substrate network.
  • the table below summarizes both the required network characteris- tics and the consequence on the search method for substrate routes. The focus on fulfilling the overlay needs in terms of bandwidth and connectivity are addressed first.
  • table 2 below for the slice request attributes the source allocation per node or path and implications on
  • the overlay describes Select substrate routes matrix the type of connectivity that can host the highest required between any two number of overlay links of end-nodes part of the same slice. slice.
  • the traffic ma ⁇ Use multicast communication trix summarizes the when possible.
  • bandwidth demand and di ⁇ Use shortest available rection of this demand paths first.
  • minBW for Traffic Control can be Each substrate interface sending TX used to define a minimum and link can be included in /receiving or maximum bandwidth.
  • the mapping of a slice if RX) Network calculus methods all links supply at least could be used, i.e. the required minimum band ⁇ methods for analyzing a width minBW and all interperformance guarantee in faces have at least minBW the network. available resources. All interfaces are able to han ⁇ dle data streams at a band ⁇ width equal or larger than the minimum bandwidth.
  • maxBW The slice manager asso ⁇ The maximum bandwidth maxBW ciates the maximum band ⁇ is calculated according to width maxBW with polica heuristic:
  • the width allocated BW cannot maximum bandwidth could exceed 90% of the overall be part of a security bandwidth or full capacity policy, e.g., an availa ⁇ Tot BW per interface or per ble resource request link .
  • AVB audio video bridging
  • slice prioritization and admission control is further described:
  • the slice requests or definitions are received by the slice manager.
  • the sequence in which slice requests are dealt with is the reason why prioritization and admission controls are needed. This part of the procedure precedes the constrained routing procedure explained above and applies al ⁇ so to the following cases:
  • the slice manager tries to fulfill as many slice requests as possible.
  • the optimal prioritization strategy has to provide answers to the following questions: In which order should slices be embedded?
  • ClassValue refers to the QoS class of the slice (ARS:1, CS : 10, MDS : 100) .
  • importanceValue refers to the importance of the slice (low: 1, high: 10) .
  • sliceReliability refers to the required reliability level of the slice (Normal :1, High:10, No-Loss : 100 ) .
  • a higher value means a higher priority of the slice.
  • a sorted map or list is used to order the slices. If two slices have the same calculated order, the order is increased by one until a dis ⁇ tinct order is found. E.g. the ClassValue is increased by 1 or depending on the parameters therein.
  • the equal slices are served then according to the order of arrival of the specific request.
  • the range of values in the previous example (1, 10, 100) allows for 9 slices of the same calculated order to be mapped correctly.
  • the rank is used for mapping several slice requests that are received or known simultaneously. Alternatively or additionally, if a slice request arrives later, the rank alone is not decisive but also the application type, importance and reliability are considered in order to remove resources or change an existing slice to service a higher ranked newly arrived slice request.
  • the slice manager should assigned to always try to embed CS and Slice Class MDS slices if the availa ⁇ (MDS, CS, ARS) ble bandwidth allows this.
  • ARS slices can be even re ⁇ moved from the system if not enough bandwidth is available .
  • CS could be reduced to minBW or removed if they are not "important" enough, i.e. the importance parameter is to low .
  • Links can be catego ⁇ wired links or high resil ⁇ rized according to ience wireless links are their reliability lev ⁇ used. In order to avoid el: congestion, the total al ⁇
  • Ethernet high i.e. the time until the
  • Importance Importance has no re ⁇ Very-high: always serve (Very high, quirement on single first; do not remove in high, non- nodes or paths. case of change during op ⁇ specified) eration except in case of failure, inform applica ⁇ tion.
  • the network slice system is capable of configuring real net- working devices and embedding network slices in the network substrate.
  • the network slice manager implements the virtual network embedding procedure which has been detailed above.
  • the latter procedure aims at resolving contention during the whole life-cycle of automation system, thus that an applica- tion configuration may be adapted such that new application flows may be admitted and adaptations and errors can be han ⁇ dled.
  • the same rules allow prioritizing the requested commu ⁇ nication services and guaranteeing a correct deployment of networks.
  • the result is a correctly configured network that corresponds to a correctly configured automation system, e.g. industrial automation system.
  • This configuration effort can now occur autonomously and without manual configuration nor over-dimensioning of the network, e.g. no additional wires for specific applications like safety have to be used.
  • a multi-dimensional optimization problem by structuring optimization goals into different steps and defining inter-dependencies between the different optimization goals can be solved.
  • the used link mapping procedure utilizes the k-shortest paths approach.
  • the procedure first reads the substrate network and slices from input files, then converts them to a network stack or memory available in the network.
  • the slices are sorted using the afore ⁇ mentioned methodology before the mapping is performed.
  • the link mapping procedure runs for each slice.
  • For each link in the slice the procedure finds k shortest paths between the source and destination nodes of this link.
  • the path is a set of substrate links.
  • Each path is then verified for all the demands of the slice link such as bandwidth capacity. The verification ensures that each substrate link in the path can satisfy all the demands of the slice link by checking, for example, if each substrate link has enough residual bandwidth capacity for mapping the slice link.
  • the slice link is mapped on ⁇ to this path. Then the resource capacities in the mapped sub ⁇ strate links are updated. If no suitable path is found, the mapping is considered to be failed. If all slices are suc ⁇ cessfully mapped, the results (mapped substrate links for each slice link) are then written to the output file.
  • Fig. 4 shows a flow diagram of an embodiment of the procedure.
  • a first step 1 information about the physical substrate network and the existing slice requests is gathered.
  • the slices are sorted according to their rank or priority.
  • a mapping of the slices takes place. For that it is investigat- ed in a step 3.1 whether the stack contains more than one slice request. If there is only one slice request, then, in a step 4, information is generated about how the slice is to be mapped on the physical network or/and resources are allocated for that slice.
  • a overlay link mapping takes place in a step 3.2. and a decision is taken in a step 3.2.1. whether there are more overlay links in the slices. If the slice request specifies only one overlay link, then by mapping this overlay link the slice request can be embedded. If there are more overlay links, then in a step 3.2.2 the end-nodes, i.e. the source node and the destination node of the overlay link, are determined. In a step 3.2.3 the demands in regard of communication resources of the overlay link are gathered. Then, in a step 3.2.4 all or a part of the possible physical paths are determined. This is done in in ⁇ creasing order of hops, i.e. connections between physical nodes. Several implementations for that are known, such as Eppstein implementation. For all paths it is checked, whether the demand of the overlay link can be fulfilled, which is done in loop 3.2.5 until the overlay link is mapped or it can be seen, that it is not possible.

Landscapes

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

Abstract

La présente invention concerne un dispositif d'allocation de ressources de communication d'un réseau de communication à une pluralité d'applications, chaque application ayant besoin d'un ensemble de ressources de communication, ledit dispositif comprenant une interface pour recevoir au moins une première demande pour un ensemble de ressources de communication et une interface pour transmettre des informations pour allouer des ressources de communication à au moins l'une des demandes en tenant compte d'au moins un rang dans lequel la demande est classée.
PCT/EP2015/056519 2015-03-26 2015-03-26 Dispositif et procédé d'allocation de ressources de communication dans un système employant le découpage de réseau en tranches Ceased WO2016150511A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2015/056519 WO2016150511A1 (fr) 2015-03-26 2015-03-26 Dispositif et procédé d'allocation de ressources de communication dans un système employant le découpage de réseau en tranches

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2015/056519 WO2016150511A1 (fr) 2015-03-26 2015-03-26 Dispositif et procédé d'allocation de ressources de communication dans un système employant le découpage de réseau en tranches

Publications (1)

Publication Number Publication Date
WO2016150511A1 true WO2016150511A1 (fr) 2016-09-29

Family

ID=53724252

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2015/056519 Ceased WO2016150511A1 (fr) 2015-03-26 2015-03-26 Dispositif et procédé d'allocation de ressources de communication dans un système employant le découpage de réseau en tranches

Country Status (1)

Country Link
WO (1) WO2016150511A1 (fr)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018086060A1 (fr) * 2016-11-11 2018-05-17 广东欧珀移动通信有限公司 Procédé de communication sans fil, dispositif terminal et dispositif de réseau
EP3525396A4 (fr) * 2016-11-03 2019-08-21 Huawei Technologies Co., Ltd. Procédé et dispositif de gestion d'instance de tranche de réseau
CN110214459A (zh) * 2017-03-01 2019-09-06 华为技术有限公司 业务处理的方法和设备
CN110419240A (zh) * 2017-03-24 2019-11-05 华为技术有限公司 切片兼容的切换控制设备和方法
CN110431888A (zh) * 2017-03-17 2019-11-08 高通股份有限公司 对非兼容网络切片进行优先级排序
CN113228538A (zh) * 2018-12-26 2021-08-06 华为技术有限公司 数据传输方法及装置
CN114039937A (zh) * 2021-11-15 2022-02-11 清华大学 网络资源管理方法及相关设备
CN114868363A (zh) * 2019-12-23 2022-08-05 三菱电机株式会社 光通信装置以及资源管理方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2249524A1 (fr) * 2009-05-04 2010-11-10 Alcatel Lucent Procédé de contrôle de l'admission et de l'attribution de ressources à des flux de données sans connaissances préalables dans un réseau virtuel
US20140129714A1 (en) * 2012-11-07 2014-05-08 Dell Products L.P. Application aware network virtualization
US20140173595A1 (en) * 2012-12-17 2014-06-19 International Business Machines Corporation Hybrid virtual machine configuration management
US20140226571A1 (en) * 2013-02-13 2014-08-14 Qualcomm Incorporated Apparatus and method for enhanced application coexistence on an access terminal in a wireless communication system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2249524A1 (fr) * 2009-05-04 2010-11-10 Alcatel Lucent Procédé de contrôle de l'admission et de l'attribution de ressources à des flux de données sans connaissances préalables dans un réseau virtuel
US20140129714A1 (en) * 2012-11-07 2014-05-08 Dell Products L.P. Application aware network virtualization
US20140173595A1 (en) * 2012-12-17 2014-06-19 International Business Machines Corporation Hybrid virtual machine configuration management
US20140226571A1 (en) * 2013-02-13 2014-08-14 Qualcomm Incorporated Apparatus and method for enhanced application coexistence on an access terminal in a wireless communication system

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3525396A4 (fr) * 2016-11-03 2019-08-21 Huawei Technologies Co., Ltd. Procédé et dispositif de gestion d'instance de tranche de réseau
US11140544B2 (en) 2016-11-11 2021-10-05 Guangdong Oppo Mobile Telecommunications Corp., Ltd. Wireless communication method, terminal device, and network device
WO2018086060A1 (fr) * 2016-11-11 2018-05-17 广东欧珀移动通信有限公司 Procédé de communication sans fil, dispositif terminal et dispositif de réseau
CN112804724A (zh) * 2016-11-11 2021-05-14 Oppo广东移动通信有限公司 无线通信的方法、终端设备和网络设备
CN112804724B (zh) * 2016-11-11 2023-06-16 Oppo广东移动通信有限公司 无线通信的方法、终端设备和网络设备
CN110214459A (zh) * 2017-03-01 2019-09-06 华为技术有限公司 业务处理的方法和设备
US11737014B2 (en) 2017-03-01 2023-08-22 Huawei Technologies Co., Ltd. Service processing method and device
CN110431888A (zh) * 2017-03-17 2019-11-08 高通股份有限公司 对非兼容网络切片进行优先级排序
CN110431888B (zh) * 2017-03-17 2021-12-10 高通股份有限公司 对非兼容网络切片进行优先级排序
CN110419240A (zh) * 2017-03-24 2019-11-05 华为技术有限公司 切片兼容的切换控制设备和方法
CN110419240B (zh) * 2017-03-24 2023-09-29 华为技术有限公司 切片兼容的切换控制设备和方法
CN113228538B (zh) * 2018-12-26 2022-10-18 华为技术有限公司 数据传输方法及装置
CN113228538A (zh) * 2018-12-26 2021-08-06 华为技术有限公司 数据传输方法及装置
CN114868363A (zh) * 2019-12-23 2022-08-05 三菱电机株式会社 光通信装置以及资源管理方法
CN114868363B (zh) * 2019-12-23 2024-03-01 三菱电机株式会社 光通信装置以及资源管理方法
CN114039937A (zh) * 2021-11-15 2022-02-11 清华大学 网络资源管理方法及相关设备

Similar Documents

Publication Publication Date Title
WO2016150511A1 (fr) Dispositif et procédé d'allocation de ressources de communication dans un système employant le découpage de réseau en tranches
US7668081B2 (en) Preemptive transmission protection scheme for data services with high resilience demand
US11374830B2 (en) Dynamic slice bandwidth multiplexing based on slice priority
US8879561B2 (en) Dynamic bandwidth queue allocation
US9667570B2 (en) Fabric extra traffic
CN114051715B (zh) 控制设备、交换设备和方法
CN110177054B (zh) 一种端口队列调度方法、装置、网络控制器及存储介质
Kamboj et al. QoS-aware multipath routing in software-defined networks
CN112714023A (zh) 一种tsn带宽预留系统、带宽预留值计算方法及装置
CN104994033A (zh) 一种资源动态管理的SDN网络QoS保障方法
KR20220123686A (ko) 서비스 레벨 조정 방법 및 장치, 디바이스 및 저장 매체
CN1557110A (zh) 在面向包的通信网络中传输信息
US11323387B2 (en) Prioritized communication session establishment in computer networks
CN106533939A (zh) 一种软件定义光接入汇聚网带宽动态调整方法及装置
EP1921808B1 (fr) Méthode de protection de services de données par transmission avec préemption
CN112615798B (zh) 一种基于大象流预约的带宽分配方法和设备
US20190260812A1 (en) Allocating capacity of a network connection to data streams based on type
US10764191B2 (en) Device and method for managing end-to-end connections
US7289525B2 (en) Inverse multiplexing of managed traffic flows over a multi-star network
Kim et al. Providing absolute differentiated services for optical burst switching networks: loss differentiation
JP2002305538A (ja) 通信品質制御方法、サーバ及びネットワークシステム
CN113810314A (zh) 数据调度方法、设备和存储介质
EP3913873A1 (fr) Établissement d'une session de communication priorisée dans des réseaux informatiques
HK1241578A1 (en) Allocating capacity of a network connection to data steams based on type
HK1241578B (en) Allocating capacity of a network connection to data steams based on type

Legal Events

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

Ref document number: 15741838

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15741838

Country of ref document: EP

Kind code of ref document: A1