PL398761A1 - Routing method in networks with hidden classification of flows - Google Patents

Routing method in networks with hidden classification of flows

Info

Publication number
PL398761A1
PL398761A1 PL398761A PL39876112A PL398761A1 PL 398761 A1 PL398761 A1 PL 398761A1 PL 398761 A PL398761 A PL 398761A PL 39876112 A PL39876112 A PL 39876112A PL 398761 A1 PL398761 A1 PL 398761A1
Authority
PL
Poland
Prior art keywords
routing table
flows
determined
networks
flow
Prior art date
Application number
PL398761A
Other languages
Polish (pl)
Inventor
Jerzy Domzal
Original Assignee
Akademia Górniczo-Hutnicza im. Stanislawa Staszica w Krakowie
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 Akademia Górniczo-Hutnicza im. Stanislawa Staszica w Krakowie filed Critical Akademia Górniczo-Hutnicza im. Stanislawa Staszica w Krakowie
Priority to PL398761A priority Critical patent/PL398761A1/en
Publication of PL398761A1 publication Critical patent/PL398761A1/en

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Sposób rutingu w sieciach ze skryta klasyfikacja przeplywów, w którym zbiór sygnalów stanowiacych pakiet przychodzacy reprezentujacy przeplyw jest obslugiwany w bloku sterowania dostepem (BSD) i w przypadku akceptacji przekazywany przez blok szeregowania (BS) do bloku wysylania (BW). Charakteryzuje sie tym, ze w bloku sterowania dostepem utrzymuje sie liste przeplywów chronionych zawierajaca identyfikatory przeplywów aktywnych oraz powiazane z nimi identyfikatory interfejsów wyjsciowych z rutera, które wyznacza sie, w znany sposób, na podstawie podstawowej tablicy rutingu w sytuacji braku przeciazenia lacza wyjsciowego lub na podstawie tymczasowej tablicy rutingu wyznaczanej w sytuacji przeciazenia lacza wyjsciowego, na które wskazuje podstawowa tablica rutingu. Po kazdorazowej zmianie topologii sieci uaktualnia sie identyfikatory interfejsów wyjsciowych na liscie przeplywów chronionych, a tymczasowa tablice rutingu wyznacza sie z uwzglednieniem jedynie laczy nie znajdujacych sie w stanie przeciazenia.Routing method in networks with hidden classification of flows, in which the set of signals constituting the incoming packet representing the flow is handled in the access control block (BSD) and, in the case of acceptance, passed through the serialization block (BS) to the send block (BW). It is characterized by the fact that the access control block maintains a list of protected flows containing active flow identifiers and associated output interface identifiers from the router, which is determined in a known manner based on the basic routing table in the absence of overloaded output or based on temporary routing table determined in the event of overloaded output link, which is indicated by the basic routing table. Each time the network topology is changed, the output interface identifiers are updated in the protected flow list, and the temporary routing table is determined taking into account only links that are not in an overload condition.

PL398761A 2012-04-06 2012-04-06 Routing method in networks with hidden classification of flows PL398761A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PL398761A PL398761A1 (en) 2012-04-06 2012-04-06 Routing method in networks with hidden classification of flows

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PL398761A PL398761A1 (en) 2012-04-06 2012-04-06 Routing method in networks with hidden classification of flows

Publications (1)

Publication Number Publication Date
PL398761A1 true PL398761A1 (en) 2013-10-14

Family

ID=49304536

Family Applications (1)

Application Number Title Priority Date Filing Date
PL398761A PL398761A1 (en) 2012-04-06 2012-04-06 Routing method in networks with hidden classification of flows

Country Status (1)

Country Link
PL (1) PL398761A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2905932A1 (en) 2013-08-05 2015-08-12 Akademia Gorniczo-Hutnicza im. Stanislawa Staszica w Krakowie Device and Method for multiple path packet routing

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2905932A1 (en) 2013-08-05 2015-08-12 Akademia Gorniczo-Hutnicza im. Stanislawa Staszica w Krakowie Device and Method for multiple path packet routing

Similar Documents

Publication Publication Date Title
GB201209740D0 (en) Content centric and load-balancing aware dynamic data aggregation
WO2012008735A3 (en) Method for setting a routing path in a multi-hop network, and device for same
WO2015048239A3 (en) Co-existence of a distributed routing protocol and centralized path computation for deterministic wireless networks
GB2489376A (en) Network data congestion management system
ATE517481T1 (en) TRAFFIC PROTECTION IN A COMMUNICATIONS NETWORK
TWI367653B (en) Ip flow-based load balancing over a plurality of wireless network links
PH12015502220A1 (en) Packet-level splitting for data transmission via multiple carriers
MY180943A (en) Framework for traffic engineering in software defined networking
WO2014113061A3 (en) Scheduling and traffic management with offload processors
IN2013CH01135A (en)
IN2014DN06766A (en)
JP2015520995A5 (en)
GB2513519A (en) Scalable virtual appliance cloud
WO2012094380A3 (en) Systems and methods for dynamic routing in a multiprocessor network using local congestion sensing
GB2493678A (en) Adaptive wireless sensor network and method of routing data in a wireless sensor network
DE602007008765D1 (en) Method and apparatus for implementing multicast routing
WO2009113106A3 (en) Network communication
WO2017214097A8 (en) Network isolation
CA2909374C (en) Smf-type communication method for a manet network, network node and mobile network which implement this communication method
MX2010004677A (en) Securing network message packets.
DE602007012155D1 (en) INTERFACE SELECTION IN A MOBILE NETWORK
NZ597954A (en) Mesh infrastructure utilizing priority repeaters and multiple transceivers
GB2519443A (en) Methods and systems for transmitting packets through aggregated end-to-end connection
GB2525054A (en) Methods and systems for processing internet protocol packets
GB2529591A (en) Method for link characterization in a digital network