2008 - IEEE Fellow For contributions to the design and analysis of computer networks and their protocols
Jörg Liebeherr mostly deals with Computer network, Quality of service, Distributed computing, Scheduling and Network calculus. His work in Computer network is not limited to one particular discipline; it also encompasses Topology. His Quality of service study combines topics from a wide range of disciplines, such as Service quality and Network delay.
His study in Scheduling is interdisciplinary in nature, drawing from both Symmetric multiprocessor system, Multiprocessing and Parallel computing. His Network calculus research incorporates elements of Node, Mathematical optimization, Network service and Telecommunications network. The study incorporates disciplines such as Throughput and Service in addition to Admission control.
Computer network, Distributed computing, Quality of service, Network calculus and Scheduling are his primary areas of study. His Computer network course of study focuses on Throughput and Local area network. His research integrates issues of Network topology, Static routing, Queueing theory and Destination-Sequenced Distance Vector routing, Dynamic Source Routing in his study of Distributed computing.
His Quality of service study combines topics in areas such as Service quality, Provisioning, The Internet and Network service. As part of the same scientific family, he usually focuses on Network calculus, concentrating on Mathematical optimization and intersecting with Traffic model and Node. His research in Scheduling intersects with topics in Optimization problem, Burstiness and FIFO.
Jörg Liebeherr focuses on Network calculus, Computer network, Distributed computing, Mathematical optimization and Communications protocol. His studies in Network calculus integrate themes in fields like Theoretical computer science, Parallel processing, Parallel computing, Computation and Hop. His research in Computer network intersects with topics in Flow and Fading.
The Distributed computing study combines topics in areas such as Policy-based routing and Wireless network. The various areas that Jörg Liebeherr examines in his Wireless network study include Node, Iterative method and Bandwidth, Dynamic bandwidth allocation. His Mathematical optimization research is multidisciplinary, incorporating elements of Link and Affine transformation.
His scientific interests lie mostly in Distributed computing, Network calculus, Edge computing, Load balancing and Microservices. The study incorporates disciplines such as Node, Iterative method and Bandwidth, Dynamic bandwidth allocation in addition to Distributed computing. His Network calculus research incorporates elements of Fork–join queue, Queueing theory and Parallel processing, Parallel computing.
His work in Edge computing incorporates the disciplines of Approximation algorithm, Energy consumption, Virtual machine, Combinatorial auction and Heuristics. In his works, Jörg Liebeherr conducts interdisciplinary research on Virtual machine and Markov process. His Markov process research spans across into fields like Telecommunications link, Power control, Computer security, Commons and Demand patterns.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Exact admission control for networks with a bounded delay service
Jörg Liebeherr;Dallas E. Wrege;Domenico Ferrari.
IEEE ACM Transactions on Networking (1996)
New strategies for assigning real-time tasks to multiprocessor systems
A. Burchard;J. Liebeherr;Yingfeng Oh;S.H. Son.
IEEE Transactions on Computers (1995)
Application-layer multicasting with Delaunay triangulation overlays
J. Liebeherr;M. Nahas;Weisheng Si.
IEEE Journal on Selected Areas in Communications (2002)
Deterministic delay bounds for VBR video in packet-switching networks: fundamental limits and practical trade-offs
Dallas E. Wrege;Edward W. Knightly;Hui Zhang;Jörg Liebeherr.
IEEE ACM Transactions on Networking (1996)
A network calculus with effective bandwidth
Chengzhi Li;Almut Burchard;Jörg Liebeherr.
IEEE ACM Transactions on Networking (2007)
Statistical service assurances for traffic scheduling algorithms
R.R. Boorstyn;A. Burchard;J. Liebeherr;C. Oottamakorn.
IEEE Journal on Selected Areas in Communications (2000)
Fundamental limits and tradeoffs of providing deterministic guarantees to VBR video traffic
Edward W. Knightly;Dallas E. Wrege;Jörg Liebeherr;Hui Zhang.
measurement and modeling of computer systems (1995)
On Retransmission-Based Error Control for Continuous Media Traffic in Packet-Switching Networks
Bert J. Dempsey;Jörg Liebeherr;Alfred C. Weaver.
Computer Networks and Isdn Systems (1994)
A network service curve approach for the stochastic analysis of networks
Florin Ciucu;Almut Burchard;Jörg Liebeherr.
measurement and modeling of computer systems (2005)
Application-layer multicast with Delaunay triangulations
J. Liebeherr;M. Nahas.
global communications conference (2001)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: