Tillbaka till svenska Fidonet
English   Information   Debug  
OS2HW   0/42
OS2INET   0/37
OS2LAN   0/134
OS2PROG   0/36
OS2REXX   0/113
OS2USER-L   207
OS2   0/4786
OSDEBATE   0/18996
PASCAL   0/490
PERL   0/457
PHP   0/45
POINTS   0/405
POLITICS   0/29554
POL_INC   0/14731
PSION   103
R20_ADMIN   1123
R20_AMATORRADIO   0/2
R20_BEST_OF_FIDONET   13
R20_CHAT   0/893
R20_DEPP   0/3
R20_DEV   399
R20_ECHO2   1379
R20_ECHOPRES   0/35
R20_ESTAT   0/719
R20_FIDONETPROG...
...RAM.MYPOINT
  0/2
R20_FIDONETPROGRAM   0/22
R20_FIDONET   0/248
R20_FILEFIND   0/24
R20_FILEFOUND   0/22
R20_HIFI   0/3
R20_INFO2   3249
R20_INTERNET   0/12940
R20_INTRESSE   0/60
R20_INTR_KOM   0/99
R20_KANDIDAT.CHAT   42
R20_KANDIDAT   28
R20_KOM_DEV   112
R20_KONTROLL   0/13300
R20_KORSET   0/18
R20_LOKALTRAFIK   0/24
R20_MODERATOR   0/1852
R20_NC   76
R20_NET200   245
R20_NETWORK.OTH...
...ERNETS
  0/13
R20_OPERATIVSYS...
...TEM.LINUX
  0/44
R20_PROGRAMVAROR   0/1
R20_REC2NEC   534
R20_SFOSM   0/341
R20_SF   0/108
R20_SPRAK.ENGLISH   0/1
R20_SQUISH   107
R20_TEST   2
R20_WORST_OF_FIDONET   12
RAR   0/9
RA_MULTI   106
RA_UTIL   0/162
REGCON.EUR   0/2056
REGCON   0/13
SCIENCE   0/1206
SF   0/239
SHAREWARE_SUPPORT   0/5146
SHAREWRE   0/14
SIMPSONS   0/169
STATS_OLD1   0/2539.065
STATS_OLD2   0/2530
STATS_OLD3   0/2395.095
STATS_OLD4   0/1692.25
SURVIVOR   0/495
SYSOPS_CORNER   0/3
SYSOP   0/84
TAGLINES   0/112
TEAMOS2   0/4530
TECH   0/2617
TEST.444   0/105
TRAPDOOR   0/19
TREK   0/755
TUB   0/290
UFO   0/40
UNIX   0/1316
USA_EURLINK   0/102
USR_MODEMS   0/1
VATICAN   0/2740
VIETNAM_VETS   0/14
VIRUS   0/378
VIRUS_INFO   0/201
VISUAL_BASIC   0/473
WHITEHOUSE   0/5187
WIN2000   0/101
WIN32   0/30
WIN95   0/4289
WIN95_OLD1   0/70272
WINDOWS   0/1517
WWB_SYSOP   0/419
WWB_TECH   0/810
ZCC-PUBLIC   0/1
ZEC   4

 
4DOS   0/134
ABORTION   0/7
ALASKA_CHAT   0/506
ALLFIX_FILE   0/1313
ALLFIX_FILE_OLD1   0/7997
ALT_DOS   0/152
AMATEUR_RADIO   0/1039
AMIGASALE   0/14
AMIGA   0/331
AMIGA_INT   0/1
AMIGA_PROG   0/20
AMIGA_SYSOP   0/26
ANIME   0/15
ARGUS   0/924
ASCII_ART   0/340
ASIAN_LINK   0/651
ASTRONOMY   0/417
AUDIO   0/92
AUTOMOBILE_RACING   0/105
BABYLON5   0/17862
BAG   135
BATPOWER   0/361
BBBS.ENGLISH   0/382
BBSLAW   0/109
BBS_ADS   0/5290
BBS_INTERNET   0/507
BIBLE   0/3563
BINKD   0/1119
BINKLEY   0/215
BLUEWAVE   0/2173
CABLE_MODEMS   0/25
CBM   0/46
CDRECORD   0/66
CDROM   0/20
CLASSIC_COMPUTER   0/378
COMICS   0/15
CONSPRCY   0/899
COOKING   33421
COOKING_OLD1   0/24719
COOKING_OLD2   0/40862
COOKING_OLD3   0/37489
COOKING_OLD4   0/35496
COOKING_OLD5   9370
C_ECHO   0/189
C_PLUSPLUS   0/31
DIRTY_DOZEN   0/201
DOORGAMES   0/2065
DOS_INTERNET   0/196
duplikat   6002
ECHOLIST   0/18295
EC_SUPPORT   0/318
ELECTRONICS   0/359
ELEKTRONIK.GER   1534
ENET.LINGUISTIC   0/13
ENET.POLITICS   0/4
ENET.SOFT   0/11701
ENET.SYSOP   33945
ENET.TALKS   0/32
ENGLISH_TUTOR   0/2000
EVOLUTION   0/1335
FDECHO   0/217
FDN_ANNOUNCE   0/7068
FIDONEWS   24159
FIDONEWS_OLD1   0/49742
FIDONEWS_OLD2   0/35949
FIDONEWS_OLD3   0/30874
FIDONEWS_OLD4   0/37224
FIDO_SYSOP   12852
FIDO_UTIL   0/180
FILEFIND   0/209
FILEGATE   0/212
FILM   0/18
FNEWS_PUBLISH   4436
FN_SYSOP   41707
FN_SYSOP_OLD1   71952
FTP_FIDO   0/2
FTSC_PUBLIC   0/13613
FUNNY   0/4886
GENEALOGY.EUR   0/71
GET_INFO   105
GOLDED   0/408
HAM   0/16074
HOLYSMOKE   0/6791
HOT_SITES   0/1
HTMLEDIT   0/71
HUB203   466
HUB_100   264
HUB_400   39
HUMOR   0/29
IC   0/2851
INTERNET   0/424
INTERUSER   0/3
IP_CONNECT   719
JAMNNTPD   0/233
JAMTLAND   0/47
KATTY_KORNER   0/41
LAN   0/16
LINUX-USER   0/19
LINUXHELP   0/1155
LINUX   0/22112
LINUX_BBS   0/957
mail   18.68
mail_fore_ok   249
MENSA   0/341
MODERATOR   0/102
MONTE   0/992
MOSCOW_OKLAHOMA   0/1245
MUFFIN   0/783
MUSIC   0/321
N203_STAT   930
N203_SYSCHAT   313
NET203   321
NET204   69
NET_DEV   0/10
NORD.ADMIN   0/101
NORD.CHAT   0/2572
NORD.FIDONET   189
NORD.HARDWARE   0/28
NORD.KULTUR   0/114
NORD.PROG   0/32
NORD.SOFTWARE   0/88
NORD.TEKNIK   0/58
NORD   0/453
OCCULT_CHAT   0/93
OS2BBS   0/787
OS2DOSBBS   0/580
Möte PERL, 457 texter
 lista första sista föregående nästa
Text 48, 122 rader
Skriven 2005-02-09 10:37:24 av Maurice Kinal (1:153/401.1)
     Kommentar till text 46 av mark lewis (1:3634/12)
Ärende: does anyone really care what time it is?
================================================
Hey mark!

Feb 09 12:32 05, mark lewis wrote to Maurice Kinal:

 MK>> I need more bytes!!!  :-)

 ml> in reality, no you don't... what you need to do is to not restrict 
 ml> yourself to using the clock to generate the MSGID info... think about 
 ml> it... what happens if your clock gets set back? ;)

Right.  I have considered that which is why I use UTC on the server(s).  No
daylight savings, etc.  Also I am thinking of using a different source to set
the network time, say a gps clock for example.  That would be a relatively
inexpensive way to ensure that machines are more or less in sync.  Not a great
method but better then nothing and totally relying on individual RTC clocks
which may or may not be getting it "right", whatever that really means.

 ml> if you want something that i've been using for years, you are welcome 
 ml> to it... however, in total reality, all you need is a serial counter 
 ml> that gets incremented each time it is used... what i use seperates 
 ml> the MSGID serial number into sections for multinode operations and 
 ml> allows for each node to generate some 8000 messages per day...

Sounds very interesting.  I don't think that 8000 messages a day is going to be
a limiting factor here at Kumalockasun.

 ml> software only does 255 nodes so that gives you an idea of the 
 ml> quantity of messages able to be generated... in addition, there is a 
 ml> serial counter that is rewound each day as well as a partial 
 ml> timedate...

I've been looking at an approach simular to what you seem to be saying.  Also
it akes sense that the MSGID should be generated by the common server as
apposed to each client generating it's own.  That way nobody requires any
special software other then some way of creating new messages and reading any
messages originating outside their particular box.  I believe this is a better
approach to winning over new users to Fido as well as retaining the few we may
or may not have.

 ml> in any case, a plain jane serial counter that your software 
 ml> increments is the simplist and easiest... i never have figured out 
 ml> whay everyone wanted to (way back when and still do today) jump on 
 ml> the clock counter...

The thing is that information is already there (DateTime for instance) so why
not use it?  The limiting factor is the eight charaters in the second part of
the MSGID and keeping it both meaningful and standardized.  I am definetly not
a fan of generating a random "number" as that ups the processing time and is
not always all that random depending on too many factors.  Also having a
standardized form speeds up dupe checking so that only makes sense to have
something like the MSGID in the first place.  The real problem is that nobody
seems to have put too much real thought into the idea or went far enough with
it.  Also I don't want the generation part to rely on opening any extra
datafile or keep track of some variable for each and every user.  Once the
function has completed it's task that should be it.  Then it is up to some
other function or application as to transportation and delivery of those
messages and if the MSGID has some useable standard that could be employed in
the assistance of delivery of said messages.  This has the potential of a
better <patent pending> accounting system without any additional overhead.  No?

 PE>> There is no requirement for there to be a MSGID kludge, and can you
 PE>> honestly say that you have NEVER been at risk of violating the MSGID
 PE>> standard, ie there was no possibility that you ever generated two
 PE>> MSGID's the same within any 3 year period?  I certainly can't.

How about forever?  I think with some REAL standard the possibilty exists for
every message that isn't REALLY a dupe to be truly unique for all time.  Yes it
can and probably will screw up some{where,time} but in all probability it will
be a reduction of screwups as to the currently acceptable standard.

 ml> The identifier part of the MSGID is 8 hex digits. As a worst case,
 ml> there are 1096 days in 3 years. (assuming that there's aleap year in
 ml> there somewhere). There are 86400 seconds in a day. That gives 
 ml> 94694400
 ml> seconds. In HEX that's 5A4EC00. Note that this is *7* digits. The max
 ml> number of possible ID's is 100000000h. Doing the division gives 2Dh 
 ml> or
 ml> 45d IDs for each second. I think we can live with a system that's
 ml> limited to tossing messages at 45/second. Or that tosses faster, but
 ml> won't let itself be run again until enough time has passed. 3.9
 ml> *million* messages per day is more traffic than anybody is likely to
 ml> generate!

So if the server is pumping out X amount of messages per user a second, doesn't
that mean that there are X dupes that aren't really dupes based on the above
specs?  Unless you are incrementing the first generated MSGID or using a
DateTime generated by the client's application seeing they probably can't edit
more then one message a second.  However that increases the amount of input
required from the user and then this whole idea of them using whatever to do
Fido starts coming unravelled rather quickly.

 ml> As a *simple* method of doing this, have the program generate the
 ml> Julian Day Number (April 15, AD 1994 is JD#2449457). Then figure 
 ml> modulo
 ml> 2048 of it. That's 49. Shift it to the right an appropriate number of
 ml> bits (multiply by 20 00 00 hex). That gives us 62 00 00 00 hex. And 
 ml> we
 ml> have 20 00 00 hex or 2,097,152 decimal message numbers per day. I 
 ml> think
 ml> that can be handled easily enough. Just generate a message number
 ml> (starting at 0 for the start of the day) and add it to the modified 
 ml> jd.

You've just successfully increased processing time and added an additional
routine as opposed to using the variables you HAVE to carry in order to
generate a pkt with however many messages.  This is what I am attempting to
avoid if possible.

 ml> in pascal, i implemented the above pretty much exactly as show... 
 ml> then someone pointed out that psrt of the above could be switched 
 ml> around to be more linear in the "look"... you'll note that a serial 
 ml> counter is still used, though ;)

Bah!  Pascal is for wimps!!!  ;-)

Let's see some FORTRAN code.  Heh, heh.

Life is good,
Maurice

--- Msged/LNX 6.1.2
 * Origin: Coffin Point - Ladysmith, BC Canada (1:153/401.1)