page_title: Bisection bandwidth
section_title: Bisection bandwidth calculations
hierarchical_section_title: Bisection bandwidth / Bisection bandwidth calculations
caption_attribution_description: English: Bisected hypercube
context_page_description: In computer networking, if the network is bisected into two partitions, the bisection bandwidth of a network topology is the bandwidth available between the two partitions. Bisection should be done in such a way that the bandwidth between two partitions is minimum. Bisection bandwidth gives the true bandwidth available in the entire system. Bisection bandwidth accounts for the bottleneck bandwidth of the entire network. Therefore bisection bandwidth represents bandwidth characteristics of the network better than any other metric.
context_section_description: For a linear array with n nodes bisection bandwidth is one link bandwidth. For linear array only one link needs to be broken to bisect the network into two partitions. 
  For ring topology with n nodes two links should be broken to bisect the network, so bisection bandwidth becomes bandwidth of two links. 
  For tree topology with n nodes can be bisected at the root by breaking one link, so bisection bandwidth is one link bandwidth.
  For Mesh topology with n nodes,  links should be broken to bisect the network, so bisection bandwidth is bandwidth of   links.
  For Hyper-cube topology with n nodes, n/2 links should be broken to bisect the network, so bisection bandwidth is bandwidth of n/2 links.
caption: Bisection of hyper-cube network
exif: {"Image Artist": "jagadish kota", "Image ExifOffset": "2136", "Image XPAuthor": "jagadish kota", "Image Padding": "[]", "EXIF DateTimeOriginal": "2016:12:02 19:45:08", "EXIF DateTimeDigitized": "2016:12:02 19:45:08", "EXIF SubSecTimeOriginal": "44", "EXIF SubSecTimeDigitized": "44", "EXIF Padding": "[]"}