1.36k likes | 1.48k Views
GD-Aggregate: A WAN Virtual Topology Building Tool for Hard Real-Time and Embedded Applications. Qixin Wang*, Xue Liu**, Jennifer Hou*, and Lui Sha* *Dept. of Computer Science, UIUC **School of Computer Science, McGill Univ. Demand. Big Trend: converge computers with the physical world.
E N D
GD-Aggregate: A WAN Virtual Topology Building Tool for Hard Real-Time and Embedded Applications Qixin Wang*, Xue Liu**, Jennifer Hou*, and Lui Sha* *Dept. of Computer Science, UIUC **School of Computer Science, McGill Univ.
Demand • Big Trend: converge computers with the physical world
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI • Virtual Organization
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI • Virtual Organization • Calls for RTE-WAN with following features:
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI • Virtual Organization • Calls for RTE-WAN with following features: • Scalability:
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI • Virtual Organization • Calls for RTE-WAN with following features: • Scalability: • Similar traffic aggregation.
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI • Virtual Organization • Calls for RTE-WAN with following features: • Scalability: • Similar traffic aggregation. • Global/local traffic segregation;
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI • Virtual Organization • Calls for RTE-WAN with following features: • Scalability: • Similar traffic aggregation. • Global/local traffic segregation; • Network hierarchy and modularity
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI • Virtual Organization • Calls for RTE-WAN with following features: • Scalability: • Similar traffic aggregation. • Global/local traffic segregation; • Network hierarchy and modularity, which also assists composability, dependability, debugging etc.
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI • Virtual Organization • Calls for RTE-WAN with following features: • Scalability: • Similar traffic aggregation. • Global/local traffic segregation; • Network hierarchy and modularity; • Configurability:
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI • Virtual Organization • Calls for RTE-WAN with following features: • Scalability: • Similar traffic aggregation. • Global/local traffic segregation; • Network hierarchy and modularity; • Configurability: • Runtime behavior regulation
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI • Virtual Organization • Calls for RTE-WAN with following features: • Scalability: • Similar traffic aggregation. • Global/local traffic segregation; • Network hierarchy and modularity; • Configurability: • Runtime behavior regulation • Flexibility:
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI • Virtual Organization • Calls for RTE-WAN with following features: • Scalability: • Similar traffic aggregation. • Global/local traffic segregation; • Network hierarchy and modularity; • Configurability: • Runtime behavior regulation • Flexibility: • Ease of reconfiguration
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI • Virtual Organization • Calls for RTE-WAN with following features: • Scalability: • Similar traffic aggregation. • Global/local traffic segregation; • Network hierarchy and modularity; • Configurability: • Runtime behavior regulation • Flexibility: • Ease of reconfiguration • Hard Real-Time E2E Delay Guarantee
Demand • Big Trend: converge computers with the physical world • Cyber-Physical Systems • Real-Time and Embedded (RTE) GENI • Virtual Organization • Calls for RTE-WAN with following features: • Scalability: • Similar traffic aggregation. • Global/local traffic segregation; • Network hierarchy and modularity; • Configurability: • Runtime behavior regulation • Flexibility: • Ease of reconfiguration • Hard Real-Time E2E Delay Guarantee
Solution? The Train/Railway Analogy • Similar traffic aggregation: carriage train
Solution? The Train/Railway Analogy • Similar traffic aggregation: carriage train • Global/local traffic segregation: express vs. local train
Solution? The Train/Railway Analogy • Similar traffic aggregation: carriage train • Global/local traffic segregation: express vs. local train • Hierarchical topology: express vs. local train
Solution? The Train/Railway Analogy • Similar traffic aggregation: carriage train • Global/local traffic segregation: express vs. local train • Hierarchical topology: express vs. local train • Configuration: routing, capacity planning
Solution? The Train/Railway Analogy • Similar traffic aggregation: carriage train • Global/local traffic segregation: express vs. local train • Hierarchical topology: express vs. local train • Configuration: routing, capacity planning • Flexibility: change the train planning, not the railway
The Equivalent of Train in Network? • An aggregate (of flows) is like a train A C B Legend Aggregate. Member Flow End Node Intermediate Node
The Equivalent of Train in Network? • An aggregate (of flows) is like a train • Sender End Node: merges member flows into the aggregate A C B Legend Aggregate. Member Flow End Node Intermediate Node
The Equivalent of Train in Network? • An aggregate (of flows) is like a train • Sender End Node: merges member flows into the aggregate • Receiver End Node: disintegrates the aggregate into original flows A C B Legend Aggregate. Member Flow End Node Intermediate Node
The Equivalent of Train in Network? • An aggregate (of flows) is like a train • Sender End Node: merges member flows into the aggregate • Receiver End Node: disintegrates the aggregate into original flows • Intermediate Nodes: only forward the aggregate packets A C B Legend Aggregate. Member Flow End Node Intermediate Node
The Equivalent of Train in Network? • An aggregate (of flows) is like a train A C B Legend Aggregate. Member Flow End Node Intermediate Node
The Equivalent of Train in Network? • An aggregate (of flows) is like a train • Packets of member flows carriages A C B Legend Aggregate. Member Flow End Node Intermediate Node
The Equivalent of Train in Network? • An aggregate (of flows) is like a train • Packets of member flows carriages • Sender End Node: assembles the carriages into a train A C B Legend Aggregate. Member Flow End Node Intermediate Node
The Equivalent of Train in Network? • An aggregate (of flows) is like a train • Packets of member flows carriages • Sender End Node: assembles the carriages into a train • Receiver End Node: dissembles the train into carriages A C B Legend Aggregate. Member Flow End Node Intermediate Node
The Equivalent of Train in Network? • An aggregate (of flows) is like a train • Packets of member flows carriages • Sender End Node: assembles the carriages into a train • Receiver End Node: dissembles the train into carriages • Intermediate Nodes: only forward the train, but cannot add/remove carriages A C B Legend Aggregate. Member Flow End Node Intermediate Node
The Equivalent of Train in Network? • An aggregate (of flows) is like a train • Packets of member flows carriages • Sender End Node: assembles the carriages into a train • Receiver End Node: dissembles the train into carriages • Intermediate Nodes: only forward the train, but cannot add/remove carriages • Forwarding (routing) on the per train basis, not per carriage basis A C B Legend Aggregate. Member Flow End Node Intermediate Node
The Equivalent of Train in Network? • An aggregate (of flows) is like a train • Packets of member flows carriages • Sender End Node: assembles the carriages into a train • Receiver End Node: dissembles the train into carriages • Intermediate Nodes: only forward the train, but cannot add/remove carriages • Forwarding (routing) on the per train basis, not per carriage basis • Local Train: few hops (physical links) A C B Legend Aggregate. Member Flow End Node Intermediate Node
The Equivalent of Train in Network? • An aggregate (of flows) is like a train • Packets of member flows carriages • Sender End Node: assembles the carriages into a train • Receiver End Node: dissembles the train into carriages • Intermediate Nodes: only forward the train, but cannot add/remove carriages • Forwarding (routing) on the per train basis, not per carriage basis • Local Train: few hops • Express Train: many hops A C B Legend Aggregate. Member Flow End Node Intermediate Node
Virtual Link/Topology • Aggregates with the same sender and receiver end nodes collectively embody a virtual link A C B F1 F2 F3 Legend Aggregate. Thickness implies the aggregate’s data throughput Virtual Link End Node Intermediate Node
Virtual Link/Topology • Aggregates with the same sender and receiver end nodes collectively embody a virtual link • Many virtual links altogether build up virtual topology A C B F1 F2 F3 Legend Aggregate. Thickness implies the aggregate’s data throughput Virtual Link End Node Intermediate Node
State-of-the-Art: GR-Aggregate • How to build virtual link with hard real-time E2E delay guarantee?
State-of-the-Art: GR-Aggregate • How to build virtual link with hard real-time E2E delay guarantee? • [SunShin05]: Guaranteed Rate Aggregate (GR-Aggregate)
State-of-the-Art: GR-Aggregate Guaranteed Rate Server (GR-Server) [Goyal97a]: A queueing server S is a GR-Server, as long as there exists a constant rf (called guaranteed rate) for each of its flow f , such that
State-of-the-Art: GR-Aggregate Guaranteed Rate Server (GR-Server) [Goyal97a]: A queueing server S is a GR-Server, as long as there exists a constant rf (called guaranteed rate) for each of its flow f , such that
State-of-the-Art: GR-Aggregate Guaranteed Rate Server (GR-Server) [Goyal97a]: A queueing server S is a GR-Server, as long as there exists a constant rf (called guaranteed rate) for each of its flow f , such that pfj: jth packet of flow f
State-of-the-Art: GR-Aggregate Guaranteed Rate Server (GR-Server) [Goyal97a]: A queueing server S is a GR-Server, as long as there exists a constant rf (called guaranteed rate) for each of its flow f , such that L(p): time when packet p leaves S pfj: jth packet of flow f
State-of-the-Art: GR-Aggregate Guaranteed Rate Server (GR-Server) [Goyal97a]: A queueing server S is a GR-Server, as long as there exists a constant rf (called guaranteed rate) for each of its flow f , such that L(p): time when packet p leaves S A specific function, called GRSFunc pfj: jth packet of flow f
State-of-the-Art: GR-Aggregate Guaranteed Rate Server (GR-Server) [Goyal97a]: A queueing server S is a GR-Server, as long as there exists a constant rf (called guaranteed rate) for each of its flow f , such that L(p): time when packet p leaves S A specific function, called GRSFunc pfj: jth packet of flow f
State-of-the-Art: GR-Aggregate Guaranteed Rate Server (GR-Server) [Goyal97a]: A queueing server S is a GR-Server, as long as there exists a constant rf (called guaranteed rate) for each of its flow f , such that rf: guaranteed rate L(p): time when packet p leaves S A specific function, called GRSFunc pfj: jth packet of flow f
State-of-the-Art: GR-Aggregate Guaranteed Rate Server (GR-Server) [Goyal97a]: A queueing server S is a GR-Server, as long as there exists a constant rf (called guaranteed rate) for each of its flow f , such that rf: guaranteed rate L(p): time when packet p leaves S A specific function, called GRSFunc pfj: jth packet of flow f
State-of-the-Art: GR-Aggregate • [Goyal97a] proves WFQ, WF2Q are GR-Server, with rf = f C, wheref is the weight of flow f(note f ≤ 1), and Cis the server output capacity.
State-of-the-Art: GR-Aggregate • [Goyal97a] proves WFQ, WF2Q are GR-Server, with rf = f C, wheref is the weight of flow f(note f ≤ 1), and Cis the server output capacity. • [SunShin05]: GR-Aggregate based Virtual Link: