?
Towards Efficient Implementation of Packet Classifiers in SDN/OpenFlow
P. 153-154.
In press
Traffic classification is a core problem underlying efficient implementation of network services. In this work we draw from our experience in classifier design for commercial systems to address this problem in SDN and OpenFlow. We identify methods from other fields of computer science and show research directions that can be applied for efficient design of packet classifiers. Proposed abstractions and design patterns can significantly reduce requirements on network elements and enable deployment of functionality that would be infeasible in a traditional way.
In book
NY : ACM Press, 2013
NY : ACM Press, 2013
Added: September 24, 2013
Nikolenko S. I., Kogan K., Retvari G. et al., , in : 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). : Atlanta : IEEE, 2016. 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 ...
Added: October 14, 2016
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
Kogan K., Nikolenko S. I., Lopez-Ortiz A. et al., , in : Proceedings of the Fifth International Conference on Communication Systems and Networks (COMSNETS 2013). : Bangalore : IEEE Computer Society, 2013. P. 1-10.
Modern network processors (NPs) increasingly deal with packets with heterogeneous processing requirements. In this work, we consider the fundamental problem of managing a bounded size buffer at the input queue of an NP. Incoming traffic consists of packets, each packet requiring several rounds of processing before it can be transmitted out of the queue. The ...
Added: September 24, 2013
Kogan K., Lopez-Ortiz A., Nikolenko S. I. et al., , in : Proceedings of the 31st IEEE International Performance Computing and Communications Conference. : Austin : IEEE, 2012. P. 295-304.
Modern network processors (NPs) increasingly deal with packets that require heterogeneous processing. We consider the problem of managing a bounded size input queue buffer where each packet requires several rounds of processing before it can be transmitted out. The goal of admission control policies is to maximize the total number of successfully transmitted packets. Usually ...
Added: February 13, 2013
Хуснуллин Н. Ф., Lazarev A. A., Мусатова Е. Г., , in : EURO-INRORMS Rome 2013. : Rome : Sapienza Università di Roma, 2013. P. 91-91.
A polynomial dynamic programming algorithm was suggested to construct orders delivery schedule for one locomotive in a 3 station circuit. An approach to exact solution was proposed and the steps were represented to gather a freight train and build destination routing in order to minimize the total completion time. A point-to-point and a triangle shapes ...
Added: October 21, 2014
NY : IEEE Computer Society, 2013
Added: September 24, 2013
Kogan K., Nikolenko S. I., Rottenstreich O. et al., IEEE/ACM Transactions on Networking 2016 Vol. 24 No. 2 P. 1251-1264
Efficient packet classification is a core concern for network services. Traditional multi-field classification approaches, in both software and ternary content-addressable memory (TCAMs), entail tradeoffs between (memory) space and (lookup) time. TCAMs cannot efficiently represent range rules, a common class of classification rules confining values of packet fields to given ranges. The exponential space growth of ...
Added: December 3, 2015
Садыков Р. Р., Lazarev A. A., Карпычев А. А., , in : Труды IV Международной конференции "Методы оптимизации и программное обеспечение" (ОПТИМА-2013). : Монтенегро, Петровац : ВЦ РАН, 2013. P. 143-144.
At present time in most countries for freight transportation interaction of several companies is necessary. First company is freight, it has got railway cars and directly executes customer orders for the transportation of good by providing cars. Second company is railway, it provides transportation of the cars under special rules. We consider the freight car ...
Added: October 21, 2014
Belenky A., Dordrecht, L., Heidelberg, NY : Springer, 2012
This is the first book on the U.S. presidential election system to analyze the basic principles underlying the design of the existing system and those at the heart of competing proposals for improving the system. The book discusses how the use of some election rules embedded in the U.S. Constitution and in the Presidential Succession ...
Added: September 25, 2012
Kogan K., Nikolenko S. I., Eugster P. et al., , in : 24th IEEE International Conference on Network Protocols (ICNP 2016). : IEEE, 2016.
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 efficient implementations from both lookup time and memory footprint perspectives. In this work we explore efficient FIB representations in common distributed switch architectures. Our approach introduces substantial ...
Added: October 14, 2016
Bangalore : IEEE Computer Society, 2013
COMSNETS is a premier international conference dedicated to covering all aspects of networking and communications, in both the theoretical and systems aspects. Following the tradition established by the first four COMSNETS conferences, COMSNETS 2013 includes a highly selective technical program, comprising peer-reviewed submitted papers, plenary talks by leaders in the field, and a small set of invited papers on important ...
Added: September 24, 2013
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
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
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
Kogan K., Lopez-Ortiz A., Nikolenko S. I. et al., , in : Design and Analysis of Algorithms: Proceedings of the 1st Mediterranean Conference on Algorithms. : Berlin : Springer, 2012. P. 248-260.
We consider the problem of managing a bounded size First-In-First-Out (FIFO) queue buffer, where each incoming unit-sized packet requires several rounds of processing before it can be transmitted out. Our objective is to maximize the total number of successfully transmitted packets. We consider both push-out (when the policy is permitted to drop already admitted packets) ...
Added: February 13, 2013
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
Nikolenko S. I., Kogan K., Rottenstreich O. et al., , in : Proceedings of the 2014 ACM conference on SIGCOMM. : NY : ACM Press, 2014. P. 15-26.
Efficient packet classification is a core concern for network services. Traditional multi-field classification approaches, in both software and ternary content-addressable memory (TCAMs), entail tradeoffs between (memory) space and (lookup) time. TCAMs cannot efficiently represent range rules, a common class of classification rules confining values of packet fields to given ranges. The exponential space growth of ...
Added: October 10, 2014
Садыков Р. Р., Lazarev A. A., Ширяев В. В. et al., , in : EURO-INRORMS Rome 2013. : Rome : Sapienza Università di Roma, 2013. P. 165-165.
In this problem, we need to 1) chose a profitable set of requests for goods delivery between stations in Russian railroad network, and 2) perform these requests by appropriately routing the set of available railcars. We formulate the problem as a multi-commodity flow problem in a space-time graph, and apply to it the column generation ...
Added: October 21, 2014
Monakhova E. A., Monakhov O. G., Aleksandr Y. Romanov, 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
Saritas O., , in : Participation and Interaction in Foresight: Dialogue, Dissemination and Visions. : Cheltenham : Edward Elgar Publishing, 2013. Ch. 10. P. 201-211.
This paper presents an analysis of the UK Technology Foresight Exercise from the Dialogue, Vision and Dissemination perspectives. Participation and dialogue-based visioning and policy making process was one of the key components of the Foresight exercise, which aimed at involving stakeholders to set priorities in the UK science base and industry. In this way, the ...
Added: July 3, 2013
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
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
Alijon F. Fatullaev, Edward R. Rzaev, Aleksandr Yu. Romanov, , in : 2022 International Russian Automation Conference (RusAutoCon). : IEEE, 2022. P. 419-423.
The article presents a study of clustering of Paley graphs with the arrangement of prime numbers in polar coordinates and a comparison of the resulting groups in terms of their static parameters; the application of fault-tolerant self-organizing routing method for new topologies is also considered. This article is a continuation of a series of articles ...
Added: October 2, 2022