| RE: [Issue 203] Comments on EAP-Peer state machine | <– Date –> <– Thread –> |
|
From: Joseph Salowey (jsalowey |
|
| Date: Mon, 1 Dec 2003 23:52:45 -0600 (CST) | |
Hi Nick, Comments inline below: > -----Original Message----- > From: Nick Petroni [mailto:npetroni [at] cs.umd.edu] > Sent: Wednesday, November 26, 2003 11:01 AM > To: Joseph Salowey > Cc: eap [at] frascone.com > Subject: Re: [eap] [Issue 203] Comments on EAP-Peer state machine <snip> > > > 3. Interface to method > > > > The interface to the method seems too complicated. > > > > First I don't think that intCheck should be a different process. > > Integrity checking is done as part of the method processing. Also > > methods aren't required to ingore packets, some methods with ignore > > some problems and return errors on others. I think this behavior > > should be incorporated into m.process. > [npetroni] intCheck is needed because SOMETIMES a method will > decide not to use the packet at all. in this case, intCheck > is the way the method tells the SM it will not be using that > packet. Methods with other ways of dealing with this will > just not set intCheck to be true. [Joe] Int check should be internal to the method. It should be possible for the method to signal that a packet should be ignored. I think breaking it out like this is misleading. > > > On a separate but related note it seems that the method state and > > decision is very complex. I don't really see the need for the > > independent methodState and decision variables. M.process() should > > return one of serverl possible results: IGNORE, CONTINUE, > > COND_SUCCESS, SUCCESS, FAILURE. MethodState should be able > to take on > > CONTINUE, COND_SUCCESS, SUCCESS, FAILURE. I don't think a separate > > decision variable is necessary. > [npetroni] This is meant to show that a method really has its > own state machine and that these states are separate from the > final decision. I think it provides nice way of separating > the two, but I am willing to discuss this alternative notation. > [Joe] I agree that a method has its own state machine, however I think exposing it here creates some problems. First it complicates the EAP state machine and second the internal state machine of the method will vary from method to method. I think it would be best to make the method opaque as possible and use the minimal interface between method and EAP state machines. > > > > 4. Idle timer > > > > It seems that there is a problem with the idle timer. It would be > > possible for the peer to never time out if it keeps on receiving > > packets that it discards. This is not so good. > [npetroni] hmm, that seems like a trivial DoS, no? Send > enough bad packets to the Peer and it goes away for a while? > > > 5. rxSuccess and rxFailure > > > > Shouldn't rxSuccess and rxFailure check to see if (reqId == > > lastReqID)? > [npetroni] probably so. I think this should be added. > > >
-
[Issue] Comments on EAP-Peer state machine Joseph Salowey, November 20 2003
-
Re: [Issue 203] Comments on EAP-Peer state machine Nick Petroni, November 26 2003
- RE: [Issue 203] Comments on EAP-Peer state machine Joseph Salowey, December 1 2003
- RE: [Issue 203] Comments on EAP-Peer state machine Nick Petroni, December 2 2003
- Re: [Issue 203] Comments on EAP-Peer state machine Yoshihiro Ohba, December 2 2003
- RE: [Issue 203] Comments on EAP-Peer state machine Joseph Salowey, December 2 2003
- RE: [Issue 203] Comments on EAP-Peer state machine Joseph Salowey, December 2 2003
-
Re: [Issue 203] Comments on EAP-Peer state machine Nick Petroni, November 26 2003
Results generated by Tiger Technologies using MHonArc.