146:). The capacity during each time frame can be is partially or totally reserved to one or more flows. Consequently, the time cycle provides the basis for a periodic repetition of the reservation that ensures enough transmission resources to be available on each link to forward the packets of each flow, which prevents delays due to resource contention and loss resulting to congestion.
127:
Packets are forwarded from node to node according to predefined schedules, as shown in the figure below, i.e., each node forwards packets of a certain flow during predefined time frames. The time cycles define the periodic re-occurrence of the various predefined schedules. The periodic scheduling
62:
with minimum delay and no packet loss even under full load condition, which is key in supporting the demanding requirements of the new and valuable services that are being deployed, or envisioned to be deployed, on modern networks, such as telephony, videoconferencing, virtual presence, video on
158:
may have different values for different nodes, due to different propagation delays on different links (e.g., Tab, Tbc, and Tcd), and different packet processing and switching times in heterogeneous nodes (e.g., Tbb and Tcc). Moreover, two variants of the basic pipeline forwarding operation are
68:
37:(CPUs) — and manufacturing — specifically in assembly lines of various industries starting from automotive to many others. Pipelining is known to be optimal independent of the specific instantiation. In particular, PF is optimal from various points of view:
163:
the forwarding delay has the same value for all the packets received by node n on input link i and it is the minimum necessary to accommodate the packet propagation, processing, and switching time. When implementing
128:
within each node results in a periodic packet forwarding across the network, which is referred to as pipeline forwarding for the ordered, step-by-step fashion with which packets travel toward their destination.
119:
so that in each UTC second there is a predefined integer number of time cycles. Alternatively, or complementary, the CTR can be obtained through the network by means of synchronization protocols such as
138:
Through a resource reservation procedure transmission capacity is booked for a flow on each link it traverses during the time frame (or time frames) predefined for its forwarding, thus setting up a
44:, which enables accommodating a larger amount of traffic on the network, thus lowering operation cost and being the foundation for accommodating the exponential growth of modern networks.
133:
322:
1st
International Workshop on Green Communications (GreenComm'09) in conjunction with the IEEE International Conference on Communications (IEEE ICC 2009)
72:
154:
As exemplified in the figure above, which depicts the journey of a packet from node A to node D along three pipeline forwarding switches, the
50:, which enables the realization of larger and more powerful networking systems at low cost, thus offering further support to network growth.
91:(CTR) is needed to perform pipeline forwarding. In the context of global networks the CTR can be effectively realized by using
108:
212:
Baldi, M.; Marchetto, G.; Ofek, Y. (2007), "A Scalable
Solution for Engineering Streaming Traffic in the Future Internet",
345:
299:
Li, C.-S.; Ofek, Y.; Yung, M. (1996), "Time-driven priority flow control for real-time heterogeneous internetworking",
184:
180:
96:
104:
143:
139:
132:
34:
33:, which has been widely and successfully used in computing — specifically, in the architecture of all major
264:
221:
76:
176:
172:
320:
192:
29:
269:
226:
249:
282:
195:(TDP) and can be used to create pipeline forwarding parallel network in the future Internet .
188:
20:
274:
231:
24:
339:
286:
300:
257:
SIMULATION: Transactions of the
Society for Modeling and Simulation International
235:
111:
in the near future. For example, the UTC second is divided into fixed duration
250:"Fractional Lambda Switching - Principles of Operation and Performance Issues"
278:
121:
168:, node n may use different forwarding delays for different packets.
171:
Two implementations of the pipeline forwarding were proposed:
100:
92:
56:, which is an immediate consequence of the above two features.
319:
Baldi, M.; Ofek, Y. (2009), "Time for a 'Greener' Internet",
302:
IEEE Int. Conf. on
Computer Communications (INFOCOM 1996)
42:
High efficiency in utilization of network resources
67:Various aspects of the technology are covered by
8:
87:As in other pipelining implementations, a
268:
225:
73:United States Patent and Trademark Office
204:
60:Deterministic and predictable operation
7:
14:
99:) that is globally available via
131:
159:possible. When node n deploys
1:
48:Low implementation complexity
248:Baldi, M.; Ofek, Y. (2004),
236:10.1016/j.comnet.2007.04.019
181:Fractional lambda switching
63:demand, distributed gaming.
362:
214:Computer Networks (COMNET)
97:coordinated universal time
115:, which are grouped into
105:global positioning system
279:10.1177/0037549704046461
166:non-immediate forwarding
140:synchronous virtual pipe
35:central processing units
77:European Patent Office
173:Time-Driven Switching
89:common time reference
27:the basic concept of
193:time-driven priority
187:) in the context of
161:immediate forwarding
83:Operating principles
346:Computer networking
71:issued by both the
17:Pipeline forwarding
150:Forwarding options
220:(14): 4092–4111,
25:computer networks
21:packet forwarding
19:(PF) applies to
353:
330:
329:
327:
316:
310:
309:
307:
296:
290:
289:
272:
254:
245:
239:
238:
229:
209:
189:optical networks
156:forwarding delay
135:
54:High scalability
361:
360:
356:
355:
354:
352:
351:
350:
336:
335:
334:
333:
325:
318:
317:
313:
305:
298:
297:
293:
270:10.1.1.131.6794
263:(10): 527–544,
252:
247:
246:
242:
227:10.1.1.559.3251
211:
210:
206:
201:
152:
85:
69:several patents
12:
11:
5:
359:
357:
349:
348:
338:
337:
332:
331:
311:
291:
240:
203:
202:
200:
197:
151:
148:
84:
81:
65:
64:
57:
51:
45:
13:
10:
9:
6:
4:
3:
2:
358:
347:
344:
343:
341:
324:
323:
315:
312:
304:
303:
295:
292:
288:
284:
280:
276:
271:
266:
262:
258:
251:
244:
241:
237:
233:
228:
223:
219:
215:
208:
205:
198:
196:
194:
190:
186:
182:
178:
174:
169:
167:
162:
157:
149:
147:
145:
141:
136:
134:
129:
125:
123:
118:
114:
110:
106:
102:
98:
94:
90:
82:
80:
78:
74:
70:
61:
58:
55:
52:
49:
46:
43:
40:
39:
38:
36:
32:
31:
26:
22:
18:
321:
314:
301:
294:
260:
256:
243:
217:
213:
207:
170:
165:
160:
155:
153:
137:
130:
126:
116:
112:
88:
86:
66:
59:
53:
47:
41:
28:
16:
15:
179:) - a.k.a.
117:time cycles
113:time frames
199:References
30:pipelining
265:CiteSeerX
222:CiteSeerX
122:IEEE 1588
340:Category
75:and the
287:2276883
191:- and
109:Galileo
328:, IEEE
308:, IEEE
285:
267:
224:
326:(PDF)
306:(PDF)
283:S2CID
253:(PDF)
107:) or
275:doi
232:doi
185:FλS
177:TDS
144:SVP
101:GPS
93:UTC
23:in
342::
281:,
273:,
261:80
259:,
255:,
230:,
218:51
216:,
124:.
79:.
277::
234::
183:(
175:(
142:(
103:(
95:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
