• DocumentCode
    597153
  • Title

    Finding efficient VLAN topology for better broadcast containment

  • Author

    Hameed, Abdul ; Mian, Adnan Noor

  • Author_Institution
    Dept. of Comput. Sci., Nat. Univ. of Comput. & Emerging Sci., Lahore, Pakistan
  • fYear
    2012
  • fDate
    21-23 Nov. 2012
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    Ever since its inception VLAN (Virtual Local Area Network) technology remains a viable tool for logical segmentation and broadcast containment in switched or bridged networks. For better broadcast containment, Network administrators put those devices together in same VLAN which are expected to exchange more traffic together. Decisions which are not based on traffic statistics may result in inefficient VLAN structure that results in worse network performance. In this research work, the proposed method uses a simple algorithmic approach for creating an efficient VLAN structure for the network. It finds VLAN membership for each node by analyzing current traffic flows of the network. The result is an efficient VLAN topology that could do better broadcast containment hence enhancing overall network performance. The simulation results shows that the proposed approach outperform other heuristics for the same problem.
  • Keywords
    broadcast communication; local area networks; virtual private networks; VLAN membership; VLAN structure; VLAN topology; algorithmic approach; bridged networks; broadcast containment; efficient VLAN topology; logical segmentation; network administrators; traffic statistics; virtual local area network technology; Equations; Heuristic algorithms; Local area networks; Mathematical model; Network topology; Partitioning algorithms; Topology; VLAN topology; VLANs; automatic VLAN creation; traffic analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network of the Future (NOF), 2012 Third International Conference on the
  • Conference_Location
    Gammarth
  • Print_ISBN
    978-1-4673-5263-5
  • Electronic_ISBN
    978-1-4673-5264-2
  • Type

    conf

  • DOI
    10.1109/NOF.2012.6464001
  • Filename
    6464001