Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zbigniew Dulinski

dblp:429/8277 · DBLP profile ↗
← Back
10ranked-venue papers
7as first author
2since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 9 · 6 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Software-defined and programmable networks · 50% Network optimization and economics · 50%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 100%

Topics — the 1 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks › SDN applications
software-defined WAN
0.412020
Dynamic Traffic Management for SD-WAN Inter-Cloud Communication · IEEE J. Sel. Areas Commun. 2020

Methods — techniques the papers use, named apart from their topics

flow load balancing · 2.0SDN control · 2.0distributed management · 0.9SDN controllers · 0.4SDN controller · 0.4
YearPublicationVenuePosition
2026 Passive latency measurement with nanosecond precision for time-critical applications
Grzegorz Korcyl, Zbigniew Dulinski
Comput. Networks2
2026 SDN-Driven Dynamic Traffic Management for ISPs Serving Inter-Cloud Communication
abstract
This article presents an advanced framework for Dynamic Traffic Management (DTM), significantly extending our prior work on minimizing inter-domain traffic costs. The main extension enables cost optimization among multiple sending and multiple receiving domains. The mechanism works for volume and 95thpercentile tariffs. The main paradigm of DTM operation remains unchanged: DTM reacts dynamically on traffic changes on inter-domain links shifting some part of traffic (manageable traffic) from one link to another. This mechanism is based on flow load-balancing, it is centrally controlled by SDN controllers. It requires cooperation between operators receiving and generating traffic. Communication between domain operators is realized by SDN controllers (inter-domain SDN). DTM has been applied to inter-cloud communication for DCs located in different ISP domains. The experiments conducted in the hardware testbed, involving numerous sending and receiving sites, demonstrate that DTM can save up to 36% of the transfer cost.
Zbigniew Dulinski, Rafal Stankiewicz, Grzegorz Rzym, Piotr Wydrych
IEEE Trans. Netw.1
2020 MPLS-based reduction of flow table entries in SDN switches supporting multipath transmission
Zbigniew Dulinski, Grzegorz Rzym, Piotr Cholda
Comput. Commun.1
2020 Dynamic Traffic Management for SD-WAN Inter-Cloud Communication
abstract
This article introduces the concept, implementation and evaluation of Dynamic Traffic Management (DTM). This management mechanism minimizes traffic transfer costs on interdomain links. It works for volume and 95 h percentile tariffs. DTM reacts dynamically to traffic changes on inter-domain links shifting some part of traffic (manageable traffic) from one link to another. The management mechanism works in a distributed way. It requires cooperation between operators, namely Internet Service Providers (ISPs), receiving and generating traffic. Communication between ISPs is realized by SDN controllers (inter-domain SDN). DTM has been applied to intercloud communication for Data Centers (DCs) located in different ISP domains. Moreover, it is cloud-agnostic, i.e., DTM does not engage Cloud Service Providers (CSPs) into management procedures. Evaluation performed in the testbed shows that DTM is capable of decreasing ISP costs of transit traffic up to 29%.
Zbigniew Dulinski, Rafal Stankiewicz, Grzegorz Rzym, Piotr Wydrych
IEEE J. Sel. Areas Commun.1
2016 A survey on methods to provide interdomain multipath transmissions
Robert Wójcik, Jerzy Domzal, Zbigniew Dulinski, Grzegorz Rzym, Andrzej Kamisinski, Piotr Gawlowicz, Piotr Jurkiewicz, Jacek Rzasa, Rafal Stankiewicz, Krzysztof Wajda
Comput. Networks3
2015 A survey on methods to provide multipath transmission in wired packet networks
Jerzy Domzal, Zbigniew Dulinski, Miroslaw Kantor, Jacek Rzasa, Rafal Stankiewicz, Krzysztof Wajda, Robert Wójcik
Comput. Networks2
2014 A university testbed for large-scale interconnection experiments on distributed applications
Zbigniew Dulinski, Kamil Palkowski, Piotr Cholda
Comput. Networks1
2013 Dynamic traffic management mechanism for active optimization of ISP costs
abstract
This paper proposes a dynamic traffic management mechanism which addresses the problem of cost-optimal distribution of inevitable inter-domain traffic on multiple links, and enables dynamic overlay traffic management and adaptation to constantly changing traffic patterns to meet cost optimization goals. The mechanism allows for the management of traffic generated by overlay applications such as content delivery platforms, online storage systems, or P2P.
Zbigniew Dulinski, Rafal Stankiewicz
CNSM1
2011 Cost-Driven Peer Rating Algorithm
abstract
The paper presents a concept of a rating algorithm aiming at overall peer-to-peer traffic reduction (and locality awareness) and decrease of load on costly links, thus diminishing operator's costs. The rating algorithm is not only performed by a sole Oracle, as is typically proposed, but its operation is also supported by a similar entity located in other domains. Due to this concept, a usually omitted fact that the inter-domain routes are asymmetrical is properly dealt with. Simulations performed on a real topology show the usefulness of the presented approach.
Zbigniew Dulinski, Rafal Stankiewicz, Piotr Wydrych, Miroslaw Kantor, Piotr Cholda
ICC1
2010 Optimal Choice of Peers Based on BGP Information
abstract
The paper presents a concept of the peer-to-peer related traffic optimization. The mechanism is based on the Oracle idea, where a peer is informed on closely located P2P nodes suggesting connection to them. The Oracle gains the relevant information on the basis of BGP databases, where the important extension is related to using a cooperation mechanism between different operators' domains.
Zbigniew Dulinski, Miroslaw Kantor, Wojciech Krzysztofek, Rafal Stankiewicz, Piotr Cholda
ICC1