Method of servicing different-priority packets in multi-service networks |
|
IPC classes for russian patent Method of servicing different-priority packets in multi-service networks (RU 2495536):
  
 Multi-carrier operation in data transmission systems / 2493666
Procedures for adding carriers and carrier acquisition are simplified through common carrier timing, signalling by the network to the user equipment (UE) of timing offsets and scrambling code selection, and other measures. Channel reuse is employed to minimise changes in asymmetric systems with different numbers of uplink and downlink carriers. The channel quality indicator (CQI) field is divided into multiple subfields to enable transmission of multiple CQIs and ACK/NACK indicators on one uplink carrier. Joint and separate scheduling schemes are shown for concurrent scheduling of a data stream transmission to UE via multiple downlink carriers.
 Method and system for subscription service implementation in ims network / 2493665
Method comprises steps of: establishing IP channels between a session border controller (SBC) and an IP multimedia subsystem (IMS) terminal, as well as between the SBC and a resource list server (RLS) after receiving a status subscribe request message from the IMS terminal; and sending, by the RLS, subscribed status information and an acknowledgment message to the IMS terminal through the IP channels after the RLS finds the subscribed status information for the IMS terminal.
 Base station, mobile station, communication system, transmission method and reordering method / 2491741
Mobile station includes a receiving means for receiving a first packet data convergence protocol (PDCP) protocol data unit (PDU) from a source base station; a receiving means for receiving a second PDCP PDU from a target base station, in which the second PDCP PDU is created using a sequence number and a PDCP service data unit (SDU), that are transferred from the source base station to the target base station; a storage means for storing PDCP SDU corresponding to the first PDCP PDU and the PDCP SDU corresponding to the second PDCP PDU; and a reordering means for performing order delivery of the stored PDCP SDU based on the sequence numbers.
 Method and system to provide call transfer service for subscriber of access gateway control function / 2491740
Method is described to provide a call transfer service for a subscriber of the access gateway control function, in which after the AGCF subscriber effects access to a subsystem-emulator of a switched public telephone network/digital network with services integration (PES), provide the AGCF subscriber with a call transfer service by application of the mode of strong/weak communication between AGCF and an applications server (AS) and by means of application of the mode of the main control/through control of AS between AS and subscribers that do not use AGCF. Also the system is described to provide a call transfer service for a subscriber of the access gateway control function, which includes a call transfer unit configured to provide a call transfer service for a AGCF subscriber by application of a mode of strong/weak communication between AGCF and the applications server (AS) and the mode of the main control/through control of AS between AS and subscribers not using AGCF. The method and system according to the invention make it possible to provide a call transfer service for an AGCF subscriber.
 Method for transferring packet data in wireless network and base station controller / 2490810
Technical key points of the present invention are as follows: before the base station controller receives a message sent by the serving GPRS support node (SGSN) to request the confirmation of a cell update of a mobile station (MS), the packet data of the first cell, initially meant to be sent to the MS, are transferred to a temporary block flow (TBF) between the MS and a second cell, and then sent to the base station (BTS) of the second cell via the TBF and then sent to the MS by the base station of the second cell.
 Base station, mobile station, communication system and reordering method / 2486685
Data are sent from a handover source base station to a mobile station notifying that transference of packets has been executed during execution of handover sequence if the handover source base station transfers to the target handover base station packets which were not sent to the mobile station, from packets received from a host station, and the target handover base station sends packets to the mobile station. The mobile station reorders the received packets if transference of packets has been executed.
 Method and system for controlling electronic mail message collection / 2485706
Electronic mail message collecting system has an internal interface and an external interface for managing message collection, as well as a collection module through which given source mail boxes are periodically checked and if there are messages present, the messages are forwarded to a common recipient box. The mail collection function is available for both authorised and unauthorised, as well as unregistered mail system users.
 Method and system to identify network protocols based on description of client-server interaction / 2485705
Method of network protocols identification on the basis of a description of client-server interaction contains a description of available protocols of client-server interaction, collection of data on a bidirectional network interaction between the client and the server, simultaneous identification of packets related to multiple sessions of bidirectional interaction between the client and the server by identified protocols, analysis of parameters and the sequence of interaction of client-server components, identification of network protocols, according to which the client-server interaction is carried out.
 Four-port backup device for coupling of circular networks of communication network / 2485704
Four-port backup device (FPBD), comprises two switchboards (2) of data packets, every of which is connected to the other switchboard (2) and with two ports (3 and 4), designed for connection into the first and second circular communications networks, and a clock synchronisation unit (5). To the unit (5) the outlets of two receivers (6) and (7) are connected, as well as inlets of two transmitters (8) and (9), designed for the first circular network, outlets of two receivers (10 and 11), inlets of two transmitters (12 and 13), designed for the second circular network, and the outlet of the receiver (14) of the external synchronisation signal. The unit (5) is made as capable of generation of a clock signal synchronised with output signals of receivers with introduction of a fixed delay of an output signal for each receiver, issue of a generated signal to inlets of transmitters, and as capable of translation of output signals of receivers to inlets of transmitters designed for the identical network. The device is equipped with a configuration interface (15) as capable of setting the receivers and transmitters of the synchronising signal, delay values of output signals of receivers and permit or prohibition of transmission of output signals of receivers to inlets of transmitters.
 Three-port backup device for ring communication network / 2484593
Three-port backup device (1) has a data packet switch (2) connected to a port (3) for connecting to an intelligent electronic device, and with two ports (4) for connecting to a ring communication network, and a clock synchronisation unit (5). The unit (5) is connected to outputs of receivers (6), (7) and inputs of transmitters (8) and (9) for connecting to the ring communication network, the output of a receiver (10) for external synchronisation and the input of a transmitter (11) for connecting to an intelligent electronic device. The unit (5) is configured to generate a clock signal which is synchronised by output signals of receivers with introduction of a fixed delay of the output signal for the receiver, transmitting the generated signal to inputs of transmitters, and transmitting signals between receivers and transmitters. The three-port backup device is provided with a configuration interface (12) capable of assigning receivers and transmitters a synchronisation signal, delay values of output signals of receivers and allowing or prohibiting transmission of signals between receivers and transmitters.
 Telecommunication multi-functional multiplexer / 2269154
Multiplexer has system block, wherein four-channeled telegraph one-polar and two-polar modules are positioned, as well as four-channeled standard-joint C2 module, bi-impulse one-channeled and two-channeled modules, one-channeled telephone module, m modules of four-channeled asynchronous adapter, group control electronic board, and also block for adjustment and control, and combination board.
 Method for data acquisition on network topology / 2281612
Message requesting data acquisition on network topology that incorporates field limiting number of operations for message transfer from local station to adjacent ones is sent and following steps are repeated: request message receiving station returns response message and network topology data acquisition device finds out if number of message transfer operations has reached certain threshold value and terminates process if it is so, otherwise it sends request message to all adjacent stations.
 Method for serial addressing by leading device of following devices in networks with bus topology with one leading device of network and several following devices / 2284087
Method for serial addressing by leading device of following devices in networks with bus topology with one network leading device and several following devices includes receipt by following devices of flush impulse, of information about address from leading device, comparison of received information about address by each following device with its own address and switching of one following device to data transfer mode if information received about address matches its own address. As information about address, received by following device, number of addressing impulses is used, and during transfer of one following device to data exchange mode other following devices are maintained in active mode.
 Method for finding solutions concerning possibility of connection between network elements / 2285348
In accordance to method, each network element contains input ports and output ports, while each provides a set of connection points. Connection possibility tables contains data about possible internal connections between connection points of any input port and any output port of any network elements, controlled by network control system. Method allows each time during selection of certain network element for use in a route with its input port and its output port to receive solution at network control device level concerning connection capabilities for certain network element.
Method for complex protection of information / 2292122
Method for complex information protection is realized in following order: prior to transfer into communication channel or prior to recording into memory, state of used communication channel or information storage environment is analyzed, from M possible codes parameters of optimal (n,k) code for current status of channel or information storage end are determined, information subject to protection is split on q-nary symbols l bits long (q=2l) for each q-nary system gamma combinations l bits long are formed independently from information source, for each set of k informational q-nary symbols (n-k) excessive q-nary symbols are formed in accordance to rules of source binary (n,k) code, each q-nary symbol is subjected to encrypting stochastic transformation with participation of gamma, after receipt from communication channel or after reading from memory for each q-nary symbol combination of gamma with length l is generated, synchronously with transferring side, reverse stochastic decrypting transformation is performed for each q-nary symbol with participation of gamma, by means of checking expressions of source binary code localized are correctly read from memory or received q-nary symbols, untrustworthily localized symbols are deleted, integrity of message is restored by correcting non-localized and erased q-nary symbols of each block, expressing their values through values of trustworthily localized or already corrected q-nary symbols, if trustworthy restoration of integrity of code block is impossible it is deleted, number of deleted blocks is counted, optimality is determined within observation interval of used code with correction of errors for current state of channel, if code optimum criterion exceeds given minimal and maximal limits, code is replaced with optimal code synchronously at transferring and receiving parts of channel in accordance to maximum transfer speed criterion.
 Method and device for transmitting service messages in wireless communication system / 2300846
One of methods involves identification of service option number corresponding to set of broadcast transmission parameters. As an alternative, message identifies bit block corresponding to broadcast transmission parameters. Message can be transferred over service information transmission channel. Message for system supporting broadcast service identifies protocol stack for processing broadcast service and also identifies protocol stack for processing broadcast content.
 Information client-server system and method for providing graphical user interface / 2313824
In accordance to the invention, expandable, usable with various client-server informational systems, system of dynamically created program objects is used, wherein program objects are divided onto a fixed number of categories, which are matched with predetermined program interfaces, where creation of request to server and processing of response from server represent predetermined chains of program object method calls.
 System for controlling passage of documental information / 2314648
System for controlling passage of documental information contains station for managing system for controlling information passage with operative-dispatching equipment, data transmission lines and phone communication connecting lines, station for controlling passage of documental information based on duty workplace for controlling passage of documental information and workplaces of two dispatchers, where each one of aforementioned workplaces is equipped with personal computer, containing system block, monitor, standard keyboard, "mouse" type graphical manipulator, printer and interface expander, block of adapters, block for connecting and distributing communication lines, client and connecting lines of service communications, service communications equipment, consisting of line commutation block and three control panels, one for each of aforementioned workplaces for controlling passage of documental information and of first and second dispatchers, n client stations for transferring documental information, each one of which contains group equipment block, four telegrapher panels and four end talking panels, data transmission lines and client phone communication lines, connected in a certain way.
 Multi-layered content delivery network and method for multi-layered content delivery / 2321956
In accordance to the invention the network contains a content release layer, content delivery layer with at least one level of delivery sub-layer and a layer of boundary servicing, where the service release layer contains at least one node of Internet service provider (ICP), and is connected to first level delivery sub-layer in the content delivery layer, each delivery sub-layer contains at least one delivery unit, and the delivery sub-layer of the lowest level is connected to boundary service layer, the boundary service layer contains at least one boundary service area, and content, which is subject to release in a content release layer, is distributed through delivery node of first level delivery sub-layer, which is connected to content release layer, and further downwards level after level until the boundary service layer is reached.
 Method to prevent from frequent interaction operations of network selection in wireless local area network / 2324293
Each time when it is necessary to output information on available mobile telecommunication networks, it is required to determine if output of information on available mobile telecommunication networks is allowed on the basis of the number of information transmissions performed within certain period of time. If the transmission is allowed, information on available mobile telecommunication networks is transmitted and number of performed transmissions is registered; otherwise information transmission is stopped. When value of the period for decision making is changed, the record of transmission number is updated. If after stop of information transmission a request is received for information output, this request is left without answer or the information is transmitted after delay.
|
FIELD: information technology. SUBSTANCE: packet servicing maximum waiting time codes (Tser.i) are used, during generation of which the type of service (j) to which the packet belongs and the time spent by the packet in the queue are taken into account. The maximum waiting time codes are determined using the formula: Tser.i=ηj(min(tdel.j,tdel.i)-tij), where i=1,2,…,N is the corresponding priority number of the i-th packet; N is the total number of packets; j=1,2,…K is the number of service of the multi-service network; K is the total number of services of the multi-service network; ηi is the weight coefficient for the j-th service; tdel.i is the allowable dwell time of the i-th packet in the computing system; tdel.j is the delay time requirement for the packet of the j-th service in the multi-service network; tij is the time spent by the packet in the queue. EFFECT: high probability of timely servicing of low-priority packets, reduced packet loss due to the exceeding of time-out, fewer cases of retransmission. 4 dwg
The present invention relates to the field of multi-service networks, in particular to a method of providing service data packets in the buffer queue, with one switching node. Known methods analogous to the organization of service packages (VG olifer, N.A. olifer Computer network. Principles, technologies and protocols: the Textbook for high schools. 3rd ed. - SPb.: Peter, 2009. - 958 S.: ill.; RF patent №2335085 "Way of organizing and managing the transfer of the data packet and the device for its realization", 27.09.2008,; RF patent №2179737 "Method of service differently prioritised customer computer system and the device for its realization", 20.02.2002 g)providing for the division of the graph into a small number of classes by assigning each class a numeric indication of priority. The division into classes (classification) can be done in various ways. Known methods analogs do not take into account the valid time of the packet in the queue, resulting in a high probability of loss of low-priority packets as a result of their untimely service. The closest to the technical nature of the claimed method and selected as a prototype is the method implemented in the device for service requests (RF patent No. 2140666 "Method of service for the questions of the users of the computing system and device for its realization", 27.10.1999,), namely, that form codes a maximum wait time of service request (To), where i=1, 2, ..., N the corresponding priority number of the i-th subscriber, and N is the total number of subscribers, and memorize them. The code generation is performed by the rule: To=tDEP-tSAP, where tDEP- allowable time request the i-th subscriber computing system, after which the request expires, or the subscriber has certain losses; tSAP- a certain amount of time defined cost of service. Time tDEPfor each request is known and determined by the normative documents. Amount of time tSAPis determined based on the statistical evaluation of the characteristics of the given computing system. Then form the pings and organize from the pings of all second order in accordance with priorities subscribers. Requests from the queue of the second order, which reached a maximum wait time, transfer to the queue of the first order at the position corresponding to the numbers of their priorities. Consistently serve the requests from the queue of the first order in accordance with the increase in numbers of priorities, and in the absence of requests in the queue of the first order, serve Zap the wasps from the queue of the second order. Prototype method takes into account the maximum time spent by the requests in the queue of the second order, and the priority of the requests when transferring them to the queue of the first order, which ensures a high probability of timely service. However, the prototype method has the following disadvantages. 1. Provides low probability of timely maintenance of low-priority requests due to the fact that the time spent by packets in the queue is determined by considering the statistical properties of the system tSAPand not in fact. This time can be significant, which will reduce the quality of service service requests real-time (on-line). 2. Does not take into account the impact on service quality differently prioritised requests time delays and losses. There are services (e.g., data transfer)for which the packet loss has a more significant impact on the quality of service, with delays packages this service is not so demanding (although there is a certain threshold). Other services (voice) to a greater extent demanding to delay the arrival of the package than to his loss. This disadvantage is inherent in the method prototype, because they do not take into account the specific types of data transmitted and the services provided. Growth requirements Abona is tov to the list and the quality of information and communication services requires flexible service system. Depending on the interests of a specific user (group)serviced by the node switching preferences in the process of using the services of a multiservice network may vary, and accordingly may vary and the ratio of different types of graphics (voice, video, data etc). In this connection it is expedient to have a flexible system of Queuing able to adequately meet the needs of consumers and efficient use of the available resource. The objective of the invention is to develop a method of service differently prioritised packets in multiservice networks, improve service quality differently prioritised packets by increasing the ratio of service. The ratio of service packages is the ratio of the intensity of the packets to the intensity of service packages. In the method of service differently prioritised packets in multiservice networks increased maintenance factor packets occur due to: - increased likelihood of timely servicing of lower priority packets; - reduce packet loss due to exceeding the timeout. Furthermore, the method of service differently prioritised packets in multiservice networks: - increases the efficiency of the communication channel by reducing the case is in re-transmission; - improves service quality by taking into account the requirements differently prioritised packet delay and loss. The objective of the invention is solved by a method of servicing differently prioritised packets in multiservice networks, namely, that form codes a maximum wait time (KMWO) service packs (Toand memorize them. Consistently serve packages. When generating codes a maximum wait time is additionally taken into account the type of service (j)to which the package belongs. Upon receipt of the package, start the timer, taking into account the time spent by the request in the queue. KMWO determined by the formula: To=ηj(min(t.j,tDEP)-tij), where i=1, 2, ..., N the corresponding priority number of the i-th packet; N is the total number of packets; j=1, 2, ..., K - number of service multiservice network; K - total number of services multiservice network; ηj- weighting factor for the j-th service, which takes into account the effect of losses on the quality of service packet of the j-th service, which is determined in advance and remember. The weighting factor may be determined by various methods. 1. According to the formula: ηj=Kj/100, where Kj- the probability of packet loss of the j-th service in percentage (as defined in the regulatory documents); 2. Using expert the second assessment (survey) in accordance with recommendation ITU-T E.432; 3. Statistical methods. tDEP- valid time of the i-th packet in a computing system, after which the package expires or the subscriber shall bear the losses; t.j- the demands on the time delay of the packet of the j-th service in multiservice networks, established regulations; tij- the time spent by the packet in the queue, for each packet is determined by the timer running at the time of receipt. Requests are serviced in sequence ascending CMVO. A new set of essential features allows you to achieve the technical result due to the fact that in accordance with the individual characteristics of the package (valid residence time in the system or the lifetime of the package) and the type of graph (service multiservice network) is a service queue of packets, a sample of which is based on time of arrival of the package. The analysis of the level of technology has allowed to establish that the analogues, characterized by a set of characteristics is identical for all features of the declared method of service differently prioritised packets in multiservice networks, no. Therefore, the claimed invention meets the condition of patentability "novelty". Search results known address is s in this and related areas of technology with the purpose of revealing of signs, match the distinctive features of the prototype of the features of the declared object, showed that they do not follow explicitly from the prior art. The prior art also revealed no known effect provided the essential features of the claimed invention transformations on the achievement of the technical result. Therefore, the claimed invention meets the condition of patentability "inventive step". "Industrial applicability" method due to the presence of elemental basis, on the basis of which can be performed by devices that implement this method to achieve specified in the invention destination. The stated objects of the invention are illustrated by the drawings, in which: figure 1 shows the algorithm differently prioritised maintenance packages in multiservice networks corresponding to the claimed method; figure 2 - dependence of the coefficient of service traffic; figure 3 - the order of Queuing packets by the method of the prototype (graphical explanations for example); figure 4 - the order of Queuing packets of the claimed method (graphical explanation of the example). The implementation of the inventive method consists in the following (figure 1). Determine the type of graph (service) j, priority i, and the arrival time of each request (packet) Postup is found on the input of the system maintenance. In accordance with the weight coefficient of tools ηjcalculate code maximum wait time: To=ηj(min(tDEP,tDEP)-tij), and the minuend is the smallest of the quantities defined standards or came in a package (t.jand tDEPrespectively). In accordance with KMWO form of all packages. In accordance with the generated turn provide resources for the maintenance of packages. The claimed method of service differently prioritised packets in multiservice networks provides a high probability of servicing lower priority packets by taking into account the maximum waiting time service packets in the queue, reducing the time spent in the queue, packet delay sensitive, reduce packet loss due to exceeding the timeout; the efficiency of the communication channel by reducing cases of repeated transmission; improvement of service quality by taking into account the demands differently prioritised packet delay and loss. The validity of theoretical assumptions were tested using the model Queuing systems multi-service networks under the following conditions: - the number of packets N=1010; - the number of possible services J=6; the service speed V=72817 packets/sec; - weight to the rates of the services η 1=0.5, and η2=0,65, η3=0,73, η4=0,85, η5=0,87, η6=0,9; - allowable time queries of the first and second services in 30% of cases (tDEP): tDEP=120 MS, tDEP=70 MS, in other cases, the minimum count parameter t.j, the time delay of service in multiservice networks (t.j): tDEP=250 MS, tDEP=200 MS, tDEP=50 MS, tDEP=140 MS, tDEP=390 MS, tDEP=570 MS; - time on maintenance costs (tSAP): tSAP=tSAP=tSAP=10 MS, tSAP=7 MS, tSAP=tSAP=25 MS; - the length of the buffer queue - 876; - life time tW=4 C. When the simulation is fair to assume that the priorities of subscribers in the method prototype is the priorities of the packets of the appropriate types of service. The simulation results are presented in figure 2, which shows the dependence of the maintenance of traffic for the method of the prototype and of the claimed method. The presence of inflection due to the limitation of speed of service (V - const.). From these data suggest that after optimization rules queueing of packets serviced multiservice network probabilities differently prioritised maintenance packages (curves 1 and 2), and including low-priority packets (curves 3 and 4) increased the Specified result is achieved for all the considered situations, that indicates the possibility of achieving the stated technical result. The difference in the functioning of the prototype and the inventive method it is expedient to provide for example the formation of the queue represented by figure 3, figure 4. As the source data used in modeling conditions listed above. For clarity, will limit the length of the buffer 6 packages, in this regard, the speed of service will assume V=100 packets/s Let the service system receives a stream of packets in the following order: the first package of service expiring life (1P), the second expiring life (2P), third, second, first expiring life, the first, fourth, second expiring life, fourth. Situation 1: the formation of a queue, the method of the prototype (figure 3). Calculate KMWO received packets. The first order will be divided into hierarchical queue of the second order, which consists of three queues with the same priority. First ranking in the subqueues second order minimum CMVO. Taking into account KMWO and ranking by priority packets are serviced, as shown in figure 3, the packet with the lowest priority will be lost due to exceeding the delay time of the life time package (each cycle in figure 3 is marked by the arrow on the conditions of example extending t is 10 MS). Moreover, the prototype method does not take into account the maximum processing time of the packet, so in this case is not actually 4 types of priority, and six. Situation 2: the formation of a queue claimed process (figure 4). Calculate KMWO taking into account the weights and the maximum time a packet in the system. After calculating KMWO and ranking by priority packets are serviced, as shown in figure 4, the packet with the lowest priority will be serviced out of the priority queue, because its KMWO will be less. In this case, the conditional and priority is determined weighting factors. The examples illustrate the effect of the application of the method of service differently prioritised packets in multiservice networks. How differently prioritised maintenance packages in multiservice networks, namely, that form codes a maximum wait time (KMWO) service packs (Toand remember, consistently serve packets, characterized in that when forming KMWO take into account the type of service (j), to which the packet belongs, upon receipt of each packet start the timer, taking into account the time spent by the packet in the queue, KMWO determined by the formula
|