EP1382148A2 - Verfahren zur sicherung die kommunikationlatenzzeit von mindestens zwischen zwei kommunikationdatenpunkten - Google Patents

Verfahren zur sicherung die kommunikationlatenzzeit von mindestens zwischen zwei kommunikationdatenpunkten

Info

Publication number
EP1382148A2
EP1382148A2 EP02706845A EP02706845A EP1382148A2 EP 1382148 A2 EP1382148 A2 EP 1382148A2 EP 02706845 A EP02706845 A EP 02706845A EP 02706845 A EP02706845 A EP 02706845A EP 1382148 A2 EP1382148 A2 EP 1382148A2
Authority
EP
European Patent Office
Prior art keywords
reservation
remote
java
protocol
layer
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.)
Withdrawn
Application number
EP02706845A
Other languages
English (en)
French (fr)
Inventor
Miguel Thales Intellectual Property DE MIGUEL
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.)
Thales SA
Original Assignee
Thales SA
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 Thales SA filed Critical Thales SA
Publication of EP1382148A2 publication Critical patent/EP1382148A2/de
Withdrawn legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/19Flow control; Congestion control at layers above the network layer
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/72Admission control; Resource allocation using reservation actions during connection setup
    • H04L47/724Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/80Actions related to the user profile or the type of traffic
    • H04L47/803Application aware
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/80Actions related to the user profile or the type of traffic
    • H04L47/805QOS or priority aware
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40Network security protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/329Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the application layer [OSI layer 7]

Definitions

  • the present invention relates to a method for ensuring the latency of communications between at least two data crossing points.
  • the Java language has already been used in real-time systems.
  • Java working groups (“Java Consortium”, “Real-Time for Java Experts Group”) have proposed to extend the specifications and the A.P.I. (Application programming interfaces) of Java. These extensions make it possible to implement programs with the possibility of prediction in Java, by providing possibilities for reserving the calculation time, and other resources such as the time for collecting waste.
  • Java extensions do not take into account the principles of distributed programming inherent in Java, and do not offer solutions to the current lack of possibility of predicting the distributed characteristics of Java, such as R.M.I. ("Remote Method Invocation"), E.J.B. ("Enterprise Java Beans”) and J.N.D.I. ("Java Naming and Directory Interface”).
  • This group along with the SUN Company, has established a new J.S.R. in order to develop the concepts related to this specification.
  • the main objective of this Java request is to extend the specifications of Java Real-Time and Java itself in order to make it possible to predict the processing time of Java programs in node-to-node communication.
  • the subject of the present invention is a method for predicting the processing time of programs, in particular in real time Java language on client-server platforms, executed on several nodes and using the RMI method in the "MW" layer. More generally, the subject of the present invention is a method for ensuring the latency of communications between at least two points (nodes) by reserving the resources of the communication infrastructure in an MW layer.
  • the method for ensuring the latency time of communications between at least two data crossing points according to an object-oriented protocol Java-RMI or CORBA is characterized in that it implements in each crossing point an RSNP resource reservation protocol in the Java-RMI or CORBA layer, intermediate between the operating system and the application layers, by integrating the resource reservation processes and services and the communication processes in the MW layer .
  • extensions of the interface of the MW layer are carried out with the application to give it access to reservation services according to the RSVP protocol.
  • the reservation is associated with the various software elements involved in the communication according to the approach of remote references.
  • the operations associated with the remote references include the operations of determining the bandwidth to be used, the maximum size of the data packets and the maximum size of the buffers required.
  • the RSNP protocol ensures the reservation of resources on the path between two remote Java-RMI or CORBA objects. Each remote reference specifies the time distribution of its invocations, and a specific reservation is made for each remote reference.
  • the method of the invention implements a resource reservation protocol in the M.W. layer, by integrating the resource reservation processes and services and the communication processes in the MW layer.
  • this integration makes compatible the protocols carrying out the communication at the MW layer and the resource reservation protocols.
  • extensions are made to the interface of the MW layer with the application to give it access to reservation services, these extensions make it possible to specify the time requirements when establishing the remote communication, and to ensure a determined response time.
  • FIG. 1 is a diagram of a known resource reservation node
  • FIG. 2 is a simplified diagram of the essential elements implementing the method of the invention.
  • the present invention is described below with reference to the exchange of data between two or more nodes (micro-computers for example) linked together by a network such as the Internet and using a protocol such as Java-RMI, but it it is understood that it is not limited to this single application and to this single protocol, and that it can be implemented in other applications requiring the transmission of data in packets between at least two points (or nodes ), whether according to a Java-RMI protocol, or CORBA.
  • Routine 1 is in bidirectional connection with a process control program 2 and an admission control program 3, as well as with a reservation interface 4 (LPR) ), as described for example in the document by R. Braden and D.
  • a session is produced in the sending node, and the receiving node identifies the "socket” addresses of the session packets (the JP addresses and the port number of the receiver).
  • Interface 4 must be used in conjunction with a “socket” API interface.
  • “Socket” file descriptors, which provide “socket” functions (bound “,” accept “and” connect ") are used to create reservation sessions for interface 4.
  • Routine 1 communicates with the routines of the routers included in the session path, and all these routines together ensure the reservation of the resources indicated by the transmitter and the receiver.
  • the objects of the reservation make it possible to specify the speed of the token bucket, the depth of these clusters, the maximum flow and the maximum dimension of the clusters.
  • the characterization of the data flow describes the desired quality of service.
  • the “guaranteed quality of service” parameter ensures that the data packets will arrive at their destination within the guaranteed time limit and will not be rejected if there were overflows in the queues. This parameter characterizes the maximum bandwidth for end-to-end transmission on the data path.
  • the receiver application provides a filter specification telling intermediary routers to reservation services which transmitters should be part of the reservation process. Thus, the applications of the receiver can relate the corresponding quality of service to the only data coming from the applications of the transmitter.
  • the main logic components involved in a resource reservation process in accordance with the invention have been indicated.
  • the layers of this node are: the application 9, the MW layer 10, and the operating system 11.
  • the application 9 communicates with the layer 10 via a communication API interface 12 and sends it its reservation requests via a reservation API 13.
  • Layer 10 communicates with the communication protocol routine 14 of the operating system 11.
  • an RSVP resource reservation routine 15 of layer 10 communicates with a reservation protocol routine 16 of the operating system 11.
  • the routine 16 of the operating system does not need to be adapted to each new application, and it can therefore be a standard routine.
  • routine 15 is specific to the MW layer 10, but since it is located in the MW layer 10, it is adaptable to each application, since the layer 10 is much easier to modify than the operating system.
  • layer 10 is a Java-RMI layer, but could be of CORBA type.
  • the object of the invention is to implement distributed Java software (or similar) producing remote invocation processes and responses in a limited time which can be predicted.
  • Reservation protocols provide support allowing to limit the transit time during communications. These protocols have two different types of sessions: invocation sessions associated with remote invocation and response sessions associated with responses to remote invocations.
  • each remote reference specifies the temporal distribution of its invocations, and a specific reservation is made for each remote reference.
  • the Java remote references identify the sender of the reservation at the origin of the invocation session, and the server does the same for the response sessions.
  • the remote reference is associated with two reservation sessions. Two different remote references, belonging to the same object or virtual machine can reference the same server and can be associated with remote reservations.
  • client object approach, according to which the client specifies the time distribution of its remote invocations for each server.
  • the client object is then associated with the transmitter of the invocation sessions and with the receiver of the sessions. return.
  • two reservation sessions are associated with each server used. This solution reserves resources for each communication from a client to a server.
  • This approach is that of the Java machine, according to which the virtual machine specifies the time distribution of its remote invocations for each server.
  • the client virtual machine is associated with the transmitter of the invocation sessions and the receiver of the response sessions.
  • We associate to the virtual machine two reservation sessions for each remote server. This solution allows resources to be reserved for each communication between a client machine and a server.
  • “Remote references” because it allows different tasks (“threads”) to establish their own reservation, and thus to be able to encapsulate their own reservation, which avoids the effects of competition that other solutions can produce.
  • a second task can modify the reservation of a first task, which will change the response time.
  • the tasks must approve their reservation time.
  • the reference can be a local variable of the task, and the reservation is fixed within the task.
  • the server and the references negotiate the reservation from a Java-Reservation set which is an extension of the Java-RMI API interface.
  • the RMI invocation method can be implemented with the JDK tool (“Java Development Kit”), in version 1.2 for example.
  • JDK tool Java Development Kit
  • this implementation poses several problems which the invention solves in the manner described below, in the case of the approach of remote references.
  • the JDK 1.2 implementation uses an unlimited number of "sockets" for each reference, while reservations are associated with RSNP sessions which require only one "socket".
  • the invention proposes the following solution, valid in the case of the use of Java-RMI, with the JDK 1.2 tool.
  • the reservation sessions associated with communications between remote references and the server require a single "socket" for all invocations.
  • the JDK 1.2 tool uses (or reuses) a connection for invocation, and a "socket" is associated with each connection.
  • the JDK 1.2 implementation does not allow the same parallel connection to be used for two invocations, otherwise this would produce conditions of competition during the sequences of sending of call data ("marshalling" in English) and the creation of remote calls.
  • the “connection-oriented” approach makes it possible to associate responses with invocations (the returned values are sent using the same connection as for the invocation), which can be the source of another condition of competition if the present solution is not respected.
  • the JRMP protocol (see the article by SUN MICROSYSTEMS: "Java Remote Method Invocation Specification” published in October 1998) provides multiplexing possibilities.
  • JDK 1.2 Another problem with JDK 1.2 is as follows.
  • the "socket" address is encapsulated in the JDK subsystem. This information is however necessary to create reservation sessions. If a new layer (reservation layer) is created, the reference and transport layers must include new functions.
  • the invention proposes to modify the implementation of JDK 1.2 so that the "socket" is associated with the remote reference by using the extensions that were used to build the reservation sessions.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Multi Processors (AREA)
  • Communication Control (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Stored Programmes (AREA)
EP02706845A 2001-02-12 2002-02-12 Verfahren zur sicherung die kommunikationlatenzzeit von mindestens zwischen zwei kommunikationdatenpunkten Withdrawn EP1382148A2 (de)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
FR0102172A FR2820922B1 (fr) 2001-02-12 2001-02-12 Procede pour assurer le temps de latence des communications entre au moins deux points de passage de donnees
FR0102172 2001-02-12
PCT/FR2002/000527 WO2002065680A2 (fr) 2001-02-12 2002-02-12 Procede pour assurer le temps de la latence des communications entre au moins deux points de passage de donnees

Publications (1)

Publication Number Publication Date
EP1382148A2 true EP1382148A2 (de) 2004-01-21

Family

ID=8860135

Family Applications (1)

Application Number Title Priority Date Filing Date
EP02706845A Withdrawn EP1382148A2 (de) 2001-02-12 2002-02-12 Verfahren zur sicherung die kommunikationlatenzzeit von mindestens zwischen zwei kommunikationdatenpunkten

Country Status (4)

Country Link
US (1) US20040068558A1 (de)
EP (1) EP1382148A2 (de)
FR (1) FR2820922B1 (de)
WO (1) WO2002065680A2 (de)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8477610B2 (en) 2010-05-31 2013-07-02 Microsoft Corporation Applying policies to schedule network bandwidth among virtual machines
US9112890B1 (en) 2014-08-20 2015-08-18 E8 Storage Systems Ltd. Distributed storage over shared multi-queued storage device
US9529542B2 (en) 2015-04-14 2016-12-27 E8 Storage Systems Ltd. Lockless distributed redundant storage and NVRAM caching of compressed data in a highly-distributed shared topology with direct memory access capable interconnect
US10496626B2 (en) 2015-06-11 2019-12-03 EB Storage Systems Ltd. Deduplication in a highly-distributed shared topology with direct-memory-access capable interconnect
US9842084B2 (en) 2016-04-05 2017-12-12 E8 Storage Systems Ltd. Write cache and write-hole recovery in distributed raid over shared multi-queue storage devices
US10031872B1 (en) 2017-01-23 2018-07-24 E8 Storage Systems Ltd. Storage in multi-queue storage devices using queue multiplexing and access control
US10685010B2 (en) 2017-09-11 2020-06-16 Amazon Technologies, Inc. Shared volumes in distributed RAID over shared multi-queue storage devices

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6134603A (en) * 1998-03-20 2000-10-17 Sun Microsystems, Inc. Method and system for deterministic hashes to identify remote methods
AU1680699A (en) * 1998-06-17 2000-01-05 Tellabs Research Limited A telecommunication controller messaging system
US7237012B1 (en) * 2000-12-29 2007-06-26 Nortel Networks Limited Method and apparatus for classifying Java remote method invocation transport traffic

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO02065680A2 *

Also Published As

Publication number Publication date
WO2002065680A2 (fr) 2002-08-22
US20040068558A1 (en) 2004-04-08
FR2820922B1 (fr) 2005-02-18
FR2820922A1 (fr) 2002-08-16
WO2002065680A3 (fr) 2003-09-25

Similar Documents

Publication Publication Date Title
Barzilai et al. Design and implementation of an RSVP-based quality of service architecture for an integrated services Internet
CA2679634C (en) A method and system for monitoring messages passed over a network
US10785163B2 (en) Maintaining a queuing policy with multipath traffic
JP2001034576A (ja) メディア処理システム及び方法
WO2013174571A1 (en) Connectivity service orchestrator
Charbonneau et al. Advance reservation frameworks in hybrid IP-WDM networks
WO2002065680A2 (fr) Procede pour assurer le temps de la latence des communications entre au moins deux points de passage de donnees
CN111970149B (zh) 一种基于硬件防火墙qos的共享带宽实现方法
Garces-Erice Building an enterprise service bus for real-time SOA: A messaging middleware stack
CN114363269A (zh) 一种消息传输方法、系统、设备以及介质
Röbert et al. Latency-aware scheduling for real-time application support in edge computing
de Miguel Solutions to make Java-RMI time predictable
US20050135397A1 (en) Buffer replenishing
EP3818442B1 (de) Verwaltung der anwendung einer richtlinie in einer sdn-umgebung eines kommunikationsnetzes
Hossain et al. Quality of Service in Software Defined Networking
JP3787802B2 (ja) ネットワーク・サービスオーダ処理装置及びネットワーク/サービス管理システム
El Abdouni Khayari Class‐based weighted fair queueing: validation and comparison by trace‐driven simulation
WO2023088702A1 (fr) Configuration dynamique de la planification de transmission des flux dans les réseaux déterministes
Subedi Testbed-based Evaluation of QoS Differentiation for Network Slicing in Multi-Application Scenarios
CN118708116A (zh) 一种分布式存储服务器、分布式存储方法及存储介质
EP1018818B1 (de) Architektur eines mit CORBA Anwendungen zusammenarbeitenden Agents
Sabrina et al. Design, analysis and implementation of a novel multiple resource scheduler
FR2665040A1 (fr) Procede et dispositif de pontage entre reseaux locaux.
Li et al. Learning Profile based Resource Management Architecture for Active Network
CN118585310A (zh) 业务数据处理方法、装置、设备及存储介质

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20030730

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

17Q First examination report despatched

Effective date: 20071120

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RTI1 Title (correction)

Free format text: METHOD FOR ENSURE COMMUNICATION WAITING TIMES BETWEEN AT LEAST TWO DATA NODES

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20090616