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

Piotr Wydrych

dblp:03/10585 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
1since 2021 · last 2026
—ORCID · none

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

Computer networks · 6 · 3 first-author · 1 since 2021Artificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1

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 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.4
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.4
2015 Locality- and quality-awareness for P2PTV systems based on Scalable Video Coding (SVC)
abstract
In this paper, an innovative and adaptive BitTorrent-based peer-to-peer television (P2PTV) system is proposed and investigated. It is shown how end-users of such systems and Internet Service Providers (ISPs) may benefit from simultaneous usage of both (a) the recently standardized ALTO Protocol, and (b) Scalable Video Coding (SVC). The system description is followed by a thorough evaluation of the results gathered during the simulation experiments.
Piotr Wydrych, Piotr Cholda
ICC1
2014 Enterprise-oriented Cybersecurity Management
abstract
Information technology is widely used in processes vital to enterprises.Therefore, IT systems must meet at least the same level of security as required from the business processes supported by these systems.In this paper, we present a view on cybersecurity management as an enterprise-centered process, and we advocate the use of enterprise architecture in security management.Activities such as risk assessment, selection of security controls, as well as their deployment and monitoring should be carried out as a part of enterprise architecture activity.A set of useful frameworks and tools is presented and discussed.
Tomasz Chmielecki, Piotr Cholda, Piotr Pacyna, Pawel Potrawka, Norbert Rapacz, Rafal Stankiewicz, Piotr Wydrych
FedCSIS7
2012 Will P2P users cooperate with ISPs? A word-of-mouth communication approach
abstract
Researchers who address the problem of application-level traffic optimization often consider only the simplest comparison scenario: (a) the case before the option to cooperate and optimize the service is enabled, and (b) the case in which all clients try to optimize the traffic. In this paper, the situations that a user may not wish to cooperate or that a user does not perceive the optimization possibility to be valuable enough to cooperate are taken into account. An analytical model for estimating the popularity of the cooperate-to-optimize option is derived. A method for calculating the time-dependent value of the predicted popularity is presented. The model is verified by simulation experiments.
Piotr Wydrych, Piotr Cholda
ICC1
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
ICC3
2011 ISP-Supported Traffic Reduction for Application-Level Multicast
abstract
The paper proves that it is possible to optimize application-level multicast operation from the viewpoint of traffic flows. A modification of the FreePastry/Scribe application is proposed to enable cooperation with the IETF ALTO (Application- Layer Traffic Optimization) protocol. Consequently, the overlay topology is constructed taking into account the underlying network topology. The presented results show that costly traffic types can be reduced while the increase of the delay is not harmful.
Piotr Wydrych, Piotr Cholda
ICC1