J
János Farkas
Researcher at Ericsson
Publications - 78
Citations - 1257
János Farkas is an academic researcher from Ericsson. The author has contributed to research in topics: Ethernet & Network topology. The author has an hindex of 19, co-authored 73 publications receiving 1159 citations.
Papers
More filters
Patent
Technique for establishing a forwarding path in a network system
TL;DR: In this article, a technique for determining an interconnect node for establishment of a forwarding path for transmitting service based data within a network system comprising a first network and a second network is provided.
Patent
Node and method for computing forwarding trees to distribute traffic in a network
TL;DR: In this article, a node and a method for computing forwarding trees to distribute traffic in a network is described, where each node is configured to perform multiple rounds of forwarding tree computations to redistribute traffic load on one or more of the network links to the other nodes.
ReportDOI
Deterministic Networking Architecture
TL;DR: This document provides the overall architecture for Deterministic Networking (DetNet), which provides a capability to carry specified unicast or multicast data flows for real-time applications with extremely low data loss rates and bounded latency within a network domain.
Patent
Method and device for audience monitoring on multicast capable networks
TL;DR: In this paper, the authors proposed a cheap solution for audience monitoring in multicast capable networks e.g. Ethernet, IP or UMTS, where the measurement is done in the operator's network; therefore, there is no need to contact the end user.
Journal ArticleDOI
Shortest path bridging: Efficient control of larger ethernet networks
David Allan,Peter Ashwood-Smith,Nigel Bragg,János Farkas,Don Fedyk,M Ouellete,M Seaman,P Unbehagen +7 more
TL;DR: IEEE 802.1aq shortest path bridging (SPB) provides enhanced control for Ethernet networks in metro, RAN backhaul, or data center environments and minimizes latency by forwarding frames on the shortest path.