?
How to represent IPv6 forwarding tables on IPv4 or MPLS dataplanes
P. 521–526.
The Internet routing ecosystem is facing substantial scalability challenges on the data plane. Various “clean slate” architectures for representing forwarding tables (FIBs), such as IPv6, introduce additional constraints on efficient implementations from both lookup time and memory footprint perspectives due to significant classification width. In this work, we propose an abstraction layer able to represent IPv6 FIBs on existing IP and even MPLS infrastructure. Feasibility of the proposed representations is confirmed by an extensive simulation study on real IPv6 forwarding tables, including low-level experimental performance evaluation.
In book
Atlanta: IEEE, 2016.
Cuomo M. T., Genovino C., De Andreis F. et al., British Food Journal 2024 Vol. 126 No. 11 P. 3922–3952
Purpose
The aim of this research is to elucidate the correlation between open innovation, digital strategies and networking in enhancing agricultural enterprises within the new perspective of Agrifood 5.0. As such, it contributes to making businesses more competitive, especially in the Italian agricultural sector, where small and medium-sized enterprises are highly fragmented. Numerous studies have asserted ...
Added: October 2, 2025
Kulya M., Pusev R., Moskvitin D., , in: 2025 International Russian Smart Industry Conference (SmartIndustryCon).: Sochi: IEEE, 2025. P. 83–88.
We claim the method to obtain a reliable queuing one-way delay metric for the wireless computer networking systems. The method requires only a measurement of the timestamp series between packet departure and arrival events. These timestamps are included inside the packets with stream frames. Thus, the method does not need to involve any additional probe ...
Added: May 19, 2025
Blokhin A., Kalev V., Pusev R. et al., , in: 2024 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).: Novosibirsk: IEEE, 2024. P. 25–30.
Congestion control is one of the key mechanisms of communication in QUIC protocol which controls how much data and at which rate can be send to an endpoint at particular moment of time for better use of shared network resources and avoids moving into congestive collapse state. In this work we tackle the problem of ...
Added: December 18, 2024
Zykov S. V., Маличенко С. В., Защита информации. Инсайд 2025 Т. 121 № 1 С. 1–7
The article announces an analogy of using transport equilibrium models in the problems of distributing computer
network flows. The purpose of the study is to test the possibility of using transport models and algorithms to optimize routing in a software-defined network (SDN) and to build an optimal flow distribution method based on these models. To achieve this goal, integer optimization and computer modeling methods were used. ...
Added: December 18, 2024
Rodriges Zalipynis R. A., St. Petersburg: Naukoemkie Technologii, 2024.
Computer Networks are ubiquitous in the modern IT sector. Computer Networks are veins of DBMSs, Web & Mobile Applications, Distributed Systems, and many other software products. A good understanding of the underlying networking principles facilitates building more reliable and efficient software products. This makes this Computer Networks Course Syllabus (Curriculum) highly beneficial for educating future ...
Added: September 14, 2024
Sukhov A., Romanov A., Selin M., Symmetry 2024 Vol. 16 No. 1 Article 127
In this work, the circulant topology as an alternative to 2D mesh in networks-on-chip is considered. A virtual coordinate system for numbering nodes in the circulant topology is proposed, and the principle of greedy promotion is formulated. The rules for constructing the shortest routes between the two nodes based on coordinates are formulated. A technique ...
Added: March 8, 2024
Monakhova E. A., Monakhov O. G., Romanov A., IEEE Transactions on Network Science and Engineering 2023 Vol. 10 No. 1 P. 413–425
The solution of the problem of organizing optimal communications in circulant networks of degree four is considered. For a family of optimal circulant networks with the minimum diameter and average distance for any number of nodes in a graph, we propose an optimal pair routing algorithm of constant complexity based on using the relative addressing ...
Added: November 18, 2022
Tikhonov E., Schneps-Schneppe D., Sneps-Sneppe M., , in: 28th Conference of Open Innovations Association (FRUCT).: [б.и.], 2021. P. 472–481.
The paper explores data delivery delays in next-generation railway communication networks with various configurations of terrestrial and satellite coverage (including mesh and delay-tolerant forwarding). It proposes a rough analytic estimation (with just two parameters: the total number of trains and the average number of their meetings) and computer simulation (based on realistic train schedules). This ...
Added: April 9, 2022
Trubnikova E., Вопросы экономики 2021 № 3 С. 139–151
Academic mobility facilitates interactions of different scientific schools and collectives, influences formation of academic relations and indirectly affects positions of universities in academic rankings. Mobility helps establish networks of professional contacts, and that might have a positive impact on the level of research, allowing efficient academic collaboration, access to results of different studies and collected ...
Added: March 12, 2021
Mordvintseva V., Ancient Civilizations from Scythia to Siberia 2020 Vol. 2 P. 257–265
The author proposes an approach to determine self-identities, boundaries, internal political organization and foreign relations of ancient societies using materials of burials of élites in the lack of representative written sources. ...
Added: December 8, 2020
IEEE, 2019.
proceedings ...
Added: October 30, 2020
Demianiuk V., Nikolenko S. I., Kogan K., , in: IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.: P.: IEEE, 2019. P. 2044–2052.
Performing exact computations can require significant resources. Approximate computing allows to alleviate resource constraints, sacrificing the accuracy of results. In this work, we consider a generalization of the classical packet classification problem. Our major contribution is to introduce various representations for approximate packet classifiers with controlled accuracy and optimization techniques to reduce classifier sizes exploiting ...
Added: March 15, 2020
P.: IEEE, 2019.
Added: March 15, 2020
Sagatov E., Sukhov A., , in: 2019 10th IFIP International Conference on New Technologies, Mobility and Security (NTMS).: NY: IEEE, 2019. P. 1–5.
This paper assesses the communication quality that can be achieved in MANET networks. The structure of the MANET protocols is analysed in detail, and the communication and routing subsystems are highlighted. A proprietary MANET protocol has been developed which is based on neighbourhood routing (NM). The communication subsystem is implemented at the service level using ...
Added: December 5, 2019
Romanov A.Yu., Sidorenko M.V., Lezhnev E.V., , in: 2019 International Russian Automation Conference (RusAutoCon).: IEEE, 2019. P. 1–6.
The paper presents the implementation of a dynamic routing algorithm intended for use in networks-on-chip with a circulant topology with three generatrices of type C(N; s1, s2, s3) for finding the shortest routes between any two network nodes. The algorithm can be implemented as a RTL state machine in routers for NoCs. The proposed algorithm ...
Added: October 23, 2019
Свенцицкий А. Л., Mararitsa L., Петербургский психологический журнал 2017 № 21 С. 79–109
The article discusses personality networking behavior as a mechanism of building the social capital in a social network. The concepts of social and functional roles, social exchange theory, social network analysis (network role discovery) and the phenomenon of social capital are included to explore the problem. Theoretical and empirical studies are brought together to explain ...
Added: October 12, 2019
Afanasov N., Горизонты гуманитарного знания 2019 № 3 С. 32–51
The article attempts to undertake a socio-philosophical study of the
functioning of the internal logic of late globalization. Late globalization is the
primary subject of the examination. The transformation of modernity presupposes
a number of changes in the functioning of globalization processes. Among them
are ‘networkization’ and aestheticization of everyday life.
Addressing this stage of globalization development allows us to
retrospectively ...
Added: September 21, 2019
Khusyainov T., В кн.: Субъект труда и организационная среда: проблемы взаимодействия в условиях глобализации.: Тверь: Тверской государственный университет, 2019. Гл. 5 С. 84–94.
this paper attempts to analyze network interaction in the labor market. The position of the worker comes to the fore, his place in various types of network structures and the problems he may encounter in his work are revealed. Under new conditions, an employee becomes an actor in the global labor market, gets the opportunity ...
Added: July 15, 2019
NY: ACM, 2018.
This year's edition of the WebSci conference (WebSci'18) celebrates the ten year anniversary of the unique conference series where a multitude of disciplines converge in a creative and critical dialogue with the aim of understanding the Web and its impacts.
The WebSci conference brings together researchers from multiple disciplines, like computer science, sociology, economics, information science, ...
Added: June 1, 2018
Davydow A., Chuprikov P., Nikolenko S. I. et al., , in: Proceedings of the 36th IEEE Conference on Computer Communications (INFOCOM 2017).: Atlanta: IEEE, 2017. P. 1–9.
Modern datacenters are increasingly required to deal with latency-sensitive applications. A major question here is how to represent latency in desired objectives. Incorporation of multiple traffic characteristics (e.g., packet values and required processing requirements) significantly increases the complexity of buffer management policies. In this work, we consider weighted throughput optimization (total transmitted value) in the ...
Added: March 14, 2018
Nikolenko S. I., Kogan K., Fernandez-Anta A., , in: Proceedings of the 36th IEEE Conference on Computer Communications (INFOCOM 2017).: Atlanta: IEEE, 2017. P. 1–9.
We introduce structural transformations that allow simplifying a given network while preserving its original “bandwidth” and “routing” capabilities, transparently to specific allocations. We minimize a certain objective such as the aggregate capacity of network links, number of nodes, or number of links, in such a way that all the bandwidth that could be routed in ...
Added: March 14, 2018
Atlanta: IEEE, 2017.
Added: March 14, 2018
Kogan K., Nikolenko S. I., Eugster P. et al., IEEE Transactions on Networking 2017 Vol. 25 No. 6 P. 3309–3322
The Internet routing ecosystem is facing substantial scalability challenges due to continuous, significant growth of the state represented in the data plane. Distributed switch architectures introduce additional constraints on efficiency of implementations from both lookup time and memory footprint perspectives. In this paper we explore efficient forwarding information base (FIB) representations in common distributed switch ...
Added: March 14, 2018