### Book

## Proceedings of the Fifth International Conference on Communication Systems and Networks (COMSNETS 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 and timely topics from well-known researchers. The conference also features two workshops on emerging topics, a Ph.D. Forum, demos and exhibits sessions, posters, and three panel discussion sessions. COMSNETS also hosts Mobile India 2013, exploring developments and business models for applications, services, and content that can be provided to mobile platforms and over wireless networks. COMSNETS 2013 is technically co-sponsored by the IEEE Communications Society, and is presented in cooperation with ACM SIGCOMM and ACM SIGMOBILE.

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 [1]. 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.

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.

This chapter describes an economic model for independent job flow management in distributed computing environments with non-dedicated resources. The model is based on the concept of fair resource distribution between users and owners of computational nodes by means of economic mechanisms in a virtual organization. Scheduling is performed in cycles in accordance with dynamically updated schedules on local processor nodes. Schedule optimization is performed using dynamic programming methods using the set of criteria in accordance with the economic policy of the virtual organization.

This chapter describes an economic model for independent job flow management in distributed computing environments with non-dedicated resources. The model is based on the concept of fair resource distribution between users and owners of computational nodes by means of economic mechanisms in a virtual organization. Scheduling is performed in cycles in accordance with dynamically updated schedules on local processor nodes. Schedule optimization is performed using dynamic programming methods using the set of criteria in accordance with the economic policy of the virtual organization.

This work presents slot selection algorithms in economic models for independent job batch scheduling in distributed computing with non-dedicated resources. Existing approaches towards resource co-allocation and multiprocessor job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The sought time-slots must match requirements of necessary span, computational resource properties, and cost. Usually such scheduling methods consider only suited variant of time-slot set. This work discloses a scheduling scheme that features multi-variant search. Two algorithms of linear complexity for search of alternative variants are proposed and compared. Having several optional resource configurations for each job makes an opportunity to perform an optimization of execution of the whole batch of jobs and to increase overall efficiency of scheduling.

In this work, we present slot selection algorithms for job batch scheduling in distributed computing with non-dedicated resources. Jobs are parallel applications and these applications are independent. Existing approaches towards resource co-allocation and parallel job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The sought time-slots must match requirements of necessary span, computational resource properties, and cost. Usually such scheduling methods consider only one suited variant of time-slot set. This work discloses a scheduling scheme that features multi-variant search. Two algorithms of linear complexity for search of alternative variants are proposed. Having several optional resource configurations for each job makes an opportunity to perform an optimization of execution of the whole batch of jobs and to increase overall efficiency of scheduling.

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.

We consider certain spaces of functions on the circle, which naturally appear in harmonic analysis, and superposition operators on these spaces. We study the following question: which functions have the property that each their superposition with a homeomorphism of the circle belongs to a given space? We also study the multidimensional case.

We consider the spaces of functions on the m-dimensional torus, whose Fourier transform is p -summable. We obtain estimates for the norms of the exponential functions deformed by a C1 -smooth phase. The results generalize to the multidimensional case the one-dimensional results obtained by the author earlier in “Quantitative estimates in the Beurling—Helson theorem”, Sbornik: Mathematics, 201:12 (2010), 1811 – 1836.

We consider the spaces of function on the circle whose Fourier transform is p-summable. We obtain estimates for the norms of exponential functions deformed by a C1 -smooth phase.