Towards Efficient Implementation of Packet Classifiers in SDN/OpenFlow
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.
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 the transmission order of the packets is induced by the processing order. However, processing order can have a significant impact on the performance of buffer management policies even if the order of transmission is fixed. For this reason we decouple processing order from transmission order and restrict our transmission order to First-In-First-Out (FIFO) but allow for different orders of packet processing, introducing the class of such policies as Semi-FIFO. In this work, we build a taxonomy of Semi-FIFO policies and provide worst case guarantees for different processing orders. We consider various special cases and properties of Semi-FIFO policies, e.g., greedy, work-conserving, lazy, and push-out policies, and show how these properties affect performance. Further, we conduct a comprehensive simulation study that validates our results.
This paper reports a Foresight exercise, which was carried out to develop a research strategy and a business model for the science park of Ankara University (AU). Science parks have been crucial elements of innovation systems both in developed and developing countries due to their role in bridging the gap between academia and business through knowledge spill-overs and spin-offs. Although there is a widespread consensus about the usefulness of the science park concept, the actual performance of science parks and how well they meet expectations have been controversial. This paper discusses the success factors for science parks. A three dimensional policy framework, which includes ‘complementarity’, ‘networking’ and ‘strategic scalar positioning’ is suggested to be taken into account during the design and operation of science parks. The paper describes the Foresight process and the policies and strategies developed by using the three dimensional policy framework proposed for the newly established science park at Ankara University.
In article value of network cooperation of links logistic systems is stated and the key directions of changes of branch structure taking into account international practice and interbranch specifics are reflected, the main terms are defined, components of cumulative efficiency of cooperation of links logistic systems are allocated and the mathematical model of minimization of costs is presented at interbranch level.
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 objective is to maximize the total number of successfully transmitted packets. In such an environment, it is well known that Shortest-Remaining-Processing-Time (SRPT) first scheduling with push-out is optimal . However, it is hard to implement both priority queueing (PQ) by remaining processing and the push-out mechanism simultaneously in an NP. We explore alternatives for this architecture, addressing the simplicity vs. performance system design tradeoffs. We design a simplified architecture and provide worst-case guarantees for its throughput performance in different settings. We also conduct a comprehensive simulation study that validates our results.
The article describes the features of an enterprise’s business process management that concerns ad-hoc processes. The analysis of the possible implementation problems in ECM system is shown and ways of overcoming.
The purpose of this paper is to extend existing theories of b2b networks over non-proft networks. The paper sheds light on the network organisational forms recently implanted in the academic community. The analytic induction method is used to extend b2b network concepts to a non-profit context. The concepts of b2b networks are critically analysed and applied to explorative case studies of networks in academia. The paradox of open knowledge exchange in these networks is revealed and an attempt is made to elucidate it. B2b network concepts should be modifed before being extended to non-profits. Propositions are suggested to adapt b2b network concepts to explain non-profit networks. Questions to address in further research are developed. The main conclusions are only applicable to speciec types of networks. Only academic networks are reviewed. The case study approach does not allow for generalizing the findings and deriving a set of concepts for non-profit networks, and thus, calls for further research. There may be space for achieving excellence in research by facilitating interpersonal rather than interorganisational research networks. This is important, since by facilitating interpersonal networks one can escape from organisational bureaucracy. The study reports networking between the non-profits, an issue largely neglected by marketing researchers, and contributes to its understanding in the frame of existing b2b network concepts.