Person:
YAZICI, Volkan

Profile Picture

Email Address

Birth Date

WoSScopus

Name

Job Title

First Name

Volkan

Last Name

YAZICI
OrgUnit Logo
Organizational Unit

Filters

2011 - 20144
Reset filters

Settings

Publication Search Results

Now showing 1 - 4 of 4
  • Placeholder
    Conference paperPublicationMetadata only
    Dağıtık bir openflow kontrol birimi mimarisi
    (IEEE, 2012) Yazıcı, Volkan; Sunay, Mehmet Oğuz; Ercan, Ali Özer; Electrical & Electronics Engineering; Computer Science; ERCAN, Ali Özer; SUNAY, Mehmet Oğuz; YAZICI, Volkan
    Considering the modern internet traffic rates, the network architecture is of particular importance as the running services itself. On the other hand, due to the increasing complexity and black-box structure of the available networking hardware (switches, routers, etc.), the necessary network innovation imposed by the running services becomes infeasible in practice. The software-defined networking notion introduced to solve this problem and one of its emerging and powerful implementations, the OpenFlow protocol, advocate the idea of providing the control and data paths in separate planes. A network operating system running on this control plane, is anticipated to provide necessary measures for scalability and reliability in order to stand against the gigantic traffic pumped by the network. In this paper, we propose a distributed OpenFlow network operating system built with necessary scalability and reliability qualifications without requiring any changes to the existing OpenFlow protocol and networking equipment.
  • Placeholder
    ArticlePublicationMetadata only
    Constrained min-cut replication for k-way hypergraph partitioning
    (Informs, 2014) Yazıcı, Volkan; Aykanat, C.; Computer Science; YAZICI, Volkan
    Replication is a widely-used technique in information retrieval and database systems for providing fault tolerance and reducing parallelization and processing costs. Combinatorial models based on hypergraph partitioning are proposed for various problems arising in information retrieval and database systems. We consider the possibility of using vertex replication to improve the quality of hypergraph partitioning. In this study, we focus on the constrained min-cut replication (CMCR) problem, where we are initially given a maximum replication capacity and a K-way hypergraph partition with an initial imbalance ratio. The objective in the CMCR problem is finding the optimal vertex replication sets for each part of the given partition such that the initial cut size of the partition is minimized, where the initial imbalance is either preserved or reduced under the given replication capacity constraint. In this study, we present a complexity analysis of the CMCR problem and propose a model based on a unique blend of coarsening and integer linear programming (ILP) schemes. This coarsening algorithm is derived from a novel utilization of the Dulmage-Mendelsohn decomposition. Experiments show that the ILP formulation coupled with the Dulmage-Mendelsohn decomposition-based coarsening provides high quality results in practical execution times for reducing the cut size of a given K-way hypergraph partition.
  • Placeholder
    Conference paperPublicationMetadata only
    Bağlanırlık aracılığı için kütüphane desteği
    (IEEE, 2011) Yazıcı, Volkan; Parsa, A.; Burghardt, F. L.; Rabaey, J. M.; Wolisz, A.; Ercan, Ali Özer; Electrical & Electronics Engineering; Computer Science; ERCAN, Ali Özer; YAZICI, Volkan
    The growth of wireless communications has brought about the problem of interference. The realization of future wireless applications that require high data rate and service quality greatly depends on the alleviation of the interference problem. To this end, collaborative resource allocation between different wireless technologies has become an important technique. We have been designing a software architecture that we call “connectivity brokerage”, that will enable this collaboration. In this paper we explain the connectivity brokerage software architecture, and two parts of it; namely WAPI and distributed repository (CBDR) software libraries.
  • Placeholder
    ArticlePublicationMetadata only
    A new control plane for 5G network architecture with a case study on unified handoff, mobility, and routing management
    (IEEE, 2014-11) Yazıcı, Volkan; Kozat, U.; Sunay, Mehmet Oğuz; Computer Science; SUNAY, Mehmet Oğuz; YAZICI, Volkan
    The tremendous growth in wireless Internet use is showing no signs of slowing down. Existing cellular networks are starting to be insufficient in meeting this demand, in part due to their inflexible and expensive equipment as well as complex and non-agile control plane. Software-defined networking is emerging as a natural solution for next generation cellular networks as it enables further network function virtualization opportunities and network programmability. In this article, we advocate an all-SDN network architecture with hierarchical network control capabilities to allow for different grades of performance and complexity in offering core network services and provide service differentiation for 5G systems. As a showcase of this architecture, we introduce a unified approach to mobility, handoff, and routing management and offer connectivity management as a service (CMaaS). CMaaS is offered to application developers and over-the-top service providers to provide a range of options in protecting their flows against subscriber mobility at different price levels.