I work for a public school district. Currently we use DFS for student's userfiles (my documents). We are running into a problem with long directory parses and constantly running out of diskspace on the file servers. Quotas are not in use currently but we plan to implement them along with an overhaul of DFS. Here is our current setup.
We have 10 schools currently. Current DFS path's follow this scheme:
\\ad.domain.edu\schoolname\userfiles\a-l\studentname
\\ad.domain.edu\schoolname\userfiles\m-z\studentname
Students are currently seperated first by school, then my a-l or m-z (last name)
However, the folders are getting rather large. A-L at the high schools for instance might have 1500 - 2000 students, so just parsing the directory takes about 20 seconds.
My boss wants to move to the scheme below. What he wants to do is not sort by last name anymore, but add additional file servers to each site and set a limit to how many students (regardless of name) will rest on each file server.
Example:
\\ad.domain.edu\schoolname\userfiles\server1\studentname
\\ad.domain.edu\schoolname\userfiles\server2\studentname
etc.
Server 1 for instance might have a limit of 400 students. Once 400 students have been added to "server1" we must then begin adding students to server2 and so on. Each server would have different limits to how many students could be added to it depending on hardware.
Personally I find this approach VERY messy and I think it will add way too much administrative overhead. However, we can't seem to come up with any better solution. We want to move away from sorting by alphabet as that would only be a stop gap. For example splitting a-z into 4 folders instead of 2. We have 12,000 students and add about 1,000 per school year.
Does anyone have another approach to this. I need some out of the box thinking.
We have 10 schools currently. Current DFS path's follow this scheme:
\\ad.domain.edu\schoolname\userfiles\a-l\studentname
\\ad.domain.edu\schoolname\userfiles\m-z\studentname
Students are currently seperated first by school, then my a-l or m-z (last name)
However, the folders are getting rather large. A-L at the high schools for instance might have 1500 - 2000 students, so just parsing the directory takes about 20 seconds.
My boss wants to move to the scheme below. What he wants to do is not sort by last name anymore, but add additional file servers to each site and set a limit to how many students (regardless of name) will rest on each file server.
Example:
\\ad.domain.edu\schoolname\userfiles\server1\studentname
\\ad.domain.edu\schoolname\userfiles\server2\studentname
etc.
Server 1 for instance might have a limit of 400 students. Once 400 students have been added to "server1" we must then begin adding students to server2 and so on. Each server would have different limits to how many students could be added to it depending on hardware.
Personally I find this approach VERY messy and I think it will add way too much administrative overhead. However, we can't seem to come up with any better solution. We want to move away from sorting by alphabet as that would only be a stop gap. For example splitting a-z into 4 folders instead of 2. We have 12,000 students and add about 1,000 per school year.
Does anyone have another approach to this. I need some out of the box thinking.