IP flow identification for IP traffic carried over switched networks

• Published in: Computer networks (Amsterdam, Netherlands : 1999) Vol. 31; no. 5; pp. 493 - 504
• Main Authors: Copeland, John A., Abler, Randal, Bernhardt, Keith L.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 11.03.1999; Elsevier Science; Elsevier Sequoia S.A
• Subjects: Access methods and protocols, osi model; Algorithms; Applied sciences; Asynchronous transfer mode; ATM; Exact sciences and technology; Flows; Internet; Internet Protocol; Networks; Packet switched networks; Studies; Switch virtual circuits; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Flows; ATM; Switch virtual circuits; Internet protocol; Workstation; Computer network; Interconnection; Transmission protocol; Teletraffic; Internet; Web site; Service quality; Data flow; Asynchronous transmission
• ISSN: 1389-1286; 1872-7069
• DOI: 10.1016/S0169-7552(98)00290-6

Today much of the Internet backbone traffic is carried over switched networks. Switching within these backbone networks is done primarily by using permanent virtual circuits to interconnect internal routers. To improve efficiency, schemes have been suggested that involve identifying IP data flows at the edge of the switched network, and then carrying these flows over a virtual connection through the switched network. To interface with the Internet as it is today, there must be a way to identify flows that are long enough to economically warrant setting up a switched connection. Shorter flows would still be routed on a segment by segment basis. In this paper we look at the effectiveness of several flow identification algorithms, and compare them to the effectiveness of an optimum scheme. We recommend a flow definition based on client–server connections (C–S flow) that results in the lowest SVC setup rate and allows QoS to be applied based on the application.