## A Topological design model for packet switching networks |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Discussion of Available Algorithms | 9 |

Elaboration of the Generalized Cut Saturation Algorithm | 14 |

Method Modifications and lmplementation | 18 |

2 other sections not shown

### Common terms and phrases

Add-Only ailecost aini ARPANET bigi Branch Exchange calcost calloc capcount)=sf capcount=capcount channel char tcallocO Chou and Sapir Communications Network constraint Cut Saturation Algorithm cutset dcaplist delay Delete-Only Dijkstra's algorithm dist distance Englewood Cliffs Exchange Algorithm float calloc(nelt flow Floyd's algorithm for(u=l;u<=capcount;u++ for(u=l;u<=nuanodes;u++ free((char freedchar GCS algorithm Gerla and Kleinrock graph Graph Theory Heuristic index=0 index=index+l initial topology input int calloc(nelt int calloc(nelt,sizeof(int intermediate nodes iteration kbits/s kl_k2 kn_only kn_ratio_cptr lEEE Leonard Kleinrock line cost link capacity lt end method minimum number Minimum Spanning Tree Network Strategies node nuabsl Output Packet Switching Networks path plink printf printfC\n printfC\nEnter ret=free((char routing scanf sizeof(float sizeof(int spanning tree starting network starting topology subroutine Support routines Switched Communication Networks t(capacity t(near t(nuabs2 t(teaps3 t(topology t(traffic t)calloc(nelt,sizeof(int Tanenbaum tcount teap tedgel teip throughput top_cutset Topological Design Traffic Matrix traffic requirements tweight two-connected unsigned nelt vertex