Pascal, Wow, there is a lot to respond to.
Thanks for the pointers. I was not aware of this work. However, I believe this proposal is both different and can be complementary to the ones you mention. I was going to add a section on how to reproduce Qbv behavior using a stack of deadlines (the argument is a bit tricky, but straightforward). I don't necessarily think that is a good idea, but it should be there to counter claims that SRTSN only reduces the expectation but can't provide an absolute upper bound on latency (when based on EDF). I like to use the term latency, but sometimes use delay to avoid overusing it. I thought that "green wave" would be understood by those who drive cars in cities where traffic light coordination is common. I attempted to describe a data structure for EDF to be used instead of a queue, but never implied that "queueing" (meaning packets waiting to be transmitted) doesn't occur. If that were the case there would not be a need for any data structure at all. (Another thing I didn't get into was the trade-offs among the different options, from worst case complexity and difficulty to implement in hardware PoVs.) I took a quick look at US 9602420 and will study it further. However the purpose of this draft is not to mandate any specific scheduling mechanism, rather to show how such mechanisms can be integrated and hopefully more readily distributed. Incidentally I am working on a joint path+deadline optimization algorithm which only requires partial information. Proofs of absolute upper bounds on latency are nice, but generally come at the price of either 1. significantly reduced bandwidth efficiency (like TDM, or equivalently time gating as in Qbv or FlexE), 2. unscalable computation 3. relatively loose deadlines to being with (like Andrews Zhang) 4. assumptions that aren't necessarily obeyed in real life (like a lot of the network calculus proofs). I would be happy to discuss your variant to see in which class it falls. Y(J)S From: Pascal Thubert (pthubert) <pthub...@cisco.com> Sent: 25/02/2021 19:40 To: Tianran Zhou <zhoutian...@huawei.com>; Yaakov Stein <yaako...@rad.com>; det...@ietf.org; spr...@ietf.org; pce@ietf.org Subject: RE: new draft on segment routing approach to TSN CAUTION: External sender. Do not click links or open attachments unless you know the content is safe. Hi Yaakov and all: Whereever Yaakov decides to place it I'll be there supporting the work. The draft itself is incredibly well-written and information-rich. Note that there's also work in RAW that mentions SR operation DetNet related operations (draft-pthubert-raw-architecture<https://eur01.safelinks.protection.outlook.com/?url=https%3A%2F%2Ftools.ietf.org%2Fhtml%2Fdraft-pthubert-raw-architecture-05&data=04%7C01%7Cyaakov_s%40rad.com%7C5a6ae47118cf453d263d08d8d9b4776b%7Cf9047108cc2c4e4897a343fad1b3bf9d%7C1%7C0%7C637498716423474214%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C1000&sdata=ml5Lr%2FvJHvhBtJnP6KqQ2gE20rkYMihRA9NYOEhye4E%3D&reserved=0>). RAW has vested interest in intelligent forwarding decision, that would be the trademark vs. DetNet. With this draft, the forwarding is not based on Qbv schedule but the forwarder has some latitude as long as it matches the hop deadline. So RAW may be a good place. And then there's draft-chen-detnet-sr-based-bounded-latency<https://eur01.safelinks.protection.outlook.com/?url=https%3A%2F%2Ftools.ietf.org%2Fhtml%2Fdraft-chen-detnet-sr-based-bounded-latency-01&data=04%7C01%7Cyaakov_s%40rad.com%7C5a6ae47118cf453d263d08d8d9b4776b%7Cf9047108cc2c4e4897a343fad1b3bf9d%7C1%7C0%7C637498716423484210%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C1000&sdata=7DTzliy8OHRPIqZ719W7Ul2lPqgpcxcOU4oYb8VmSSM%3D&reserved=0>. Ideally all these related items would progress in the same room. Also a few notes on the draft itself: - maybe use latency instead of delay; it would be nice to maybe define delay as something else, e.g., the delay representing the time the packet spends queued in one hop vs. the latency that is end to end? - not sure the term green wave is well understood by the public here; the draft gives the impression that the TSN path is faster than the best effort and involves no queueing. For the most part that is untrue; the latency is bounded but for most flows it is longer than best effort. Best effort can be really fast with passthrough in an empty network. The problem is the long tail and possibly congestion loss. For TSN, there can be very special flows that will traverse the city with all the lights green, but usually there'll be queuing. The difference is that the queueing latency is constant and the overall latency is withing bounds. - Time triggered is not the only TSN operation. I wonder what the draft would become with asynchronous shaper in mind. We designed (and as I must announce, patented as US9602420<https://eur01.safelinks.protection.outlook.com/?url=https%3A%2F%2Fpatents.google.com%2Fpatent%2FUS9602420&data=04%7C01%7Cyaakov_s%40rad.com%7C5a6ae47118cf453d263d08d8d9b4776b%7Cf9047108cc2c4e4897a343fad1b3bf9d%7C1%7C0%7C637498716423494204%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C1000&sdata=aSHLwTc0xl9SbP%2BTLsd4R6EY542%2FOSII1bfC3Jrpueg%3D&reserved=0>) a system very similar to the one proposed in the draft, but that is designed to adapt QoS depending on whether the packet is early or late vs. its schedule, and not tagging the schedule in the since the latency is considered end to end not hop by hop. The use case is slightly different since we apply this without a global controller and a provable guarantees all flows will meet the deadline - so not really detnet-, but more like a best effort that all flows meet their deadline in a stochastic environment. If Yaakov is interested, we can contribute on that aspect. Good luck with the draft, Pascal From: detnet <detnet-boun...@ietf.org<mailto:detnet-boun...@ietf.org>> On Behalf Of Tianran Zhou Sent: jeudi 25 février 2021 9:14 To: Yaakov Stein <yaako...@rad.com<mailto:yaako...@rad.com>>; det...@ietf.org<mailto:det...@ietf.org>; spr...@ietf.org<mailto:spr...@ietf.org>; pce@ietf.org<mailto:pce@ietf.org> Subject: Re: [Detnet] new draft on segment routing approach to TSN Hi Yaakov, This is an interesting topic. After a quick review, there are several questions as follows: 1. It's clear to me to have a deadline for each packet. So that router can schedule the packet based on the urgency. But what's the motivation to split the end to end deadline to several local ones? 2. How to divide an end to end deadline into several local deadlines? Is there any example algorithm that could be used by the controller? 3. As far as I know, most devices do not support edf. I am not sure whether your proposal based on edf could really be useful. Cheers, Tianran From: Pce [mailto:pce-boun...@ietf.org] On Behalf Of Yaakov Stein Sent: Tuesday, February 23, 2021 9:14 PM To: det...@ietf.org<mailto:det...@ietf.org>; spr...@ietf.org<mailto:spr...@ietf.org>; pce@ietf.org<mailto:pce@ietf.org> Subject: [Pce] new draft on segment routing approach to TSN All, I would like to call your attention to a new ID https://www.ietf.org/archive/id/draft-stein-srtsn-00.txt<https://eur01.safelinks.protection.outlook.com/?url=https%3A%2F%2Fwww.ietf.org%2Farchive%2Fid%2Fdraft-stein-srtsn-00.txt&data=04%7C01%7Cyaakov_s%40rad.com%7C5a6ae47118cf453d263d08d8d9b4776b%7Cf9047108cc2c4e4897a343fad1b3bf9d%7C1%7C0%7C637498716423494204%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C1000&sdata=8JOBA97tVXOHG3Ao6HOcXU%2FkaqYcMyIjVXQfVRA4twU%3D&reserved=0> which describes using a stack-based approach (similar to segment routing) to time sensitive networking. It furthermore proposes combining segment routing with this approach to TSN resulting in a unified approach to forwarding and scheduling. The draft is information at this point, since it discusses the concepts and does not yet pin down the precise formats. Apologies for simultaneously sending to 3 lists, but I am not sure which WG is the most appropriate for discussions of this topic. * DetNet is most relevant since the whole point is to control end-to-end latency of a time-sensitive flow. * Spring is also directly relevant due to the use of a stack in the header and the combined approach just mentioned. * PCE is relevant to the case of a central server jointly computing an optimal path and local deadline stack. I'll let the chairs decide where discussions should be held. Y(J)S
_______________________________________________ Pce mailing list Pce@ietf.org https://www.ietf.org/mailman/listinfo/pce
